c# - Is there a fully managed (.NET) Lua interpreter? -



c# - Is there a fully managed (.NET) Lua interpreter? -

does know if there managed (.net) lua interpreter? regular source can compiled managed extensions desktop .net, can't embedded in silverlight application.

there project called lua.net

check aluminum lua, written in c#.

c# silverlight lua aluminumlua

Comments

Post a Comment

Popular posts from this blog

.net - Transaction locking an Insert statement -

.net - Transaction locking an Insert statement - i have outer distributed transaction locking (hanging) insert statement table. don't have command on outer transaction. how avoid blocking @ granular level. tried set transaction suppress around insert @ .net level. didn't work. please @ image detailed information. any solution kind of issue helpful. appreciate support. that expected if there strong crossover between 2 operations looking at, , aren't in same transaction. outer transaction has presumably taken key-range lock causing block (at guess outer transaction "serializable" isolation-level). there nil can here, except: enlist/operate in same transaction, rather operate outside it lower isolation level of outer operation, no key-range lock generated if outer operation query (a select, not insert/update/delete), utilize nolock or similar avoid locking it) if can't of things, can't insert without breaking integrity - won't a...
Read more

clojure - Best way to lazily collapse multiple contiguous items of a sequence into a single item -

clojure - Best way to lazily collapse multiple contiguous items of a sequence into a single item - [note: title , text heavily edited create more clear i'm not particularly after strings, after general sequences, , lazy processing of same] using character sequences / strings example, want turn string like "\t a\r      s\td \t \r \n          f \r\n" into " s d f " in more general terms, want turn contiguous whitespace (or other arbitray set of items) in sequence single item, , lazily. i've come next partition-by/mapcat combo, wonder if there easier or otherwise improve ways (readability, performance, anything) accomplish same thing. (defn is-wsp? [c] (if (#{\space \tab \newline \return} c) true)) (defn collapse-wsp [coll] (mapcat (fn [[first-elem :as s]] (if (is-wsp? first-elem) [\space] s)) (partition-by is-wsp? coll))) in action: => (apply str (collapse-wsp...
Read more

remove Repeat values from a list in haskell -

remove Repeat values from a list in haskell - i need accomplish few tasks in haskell: find maximum of list, along number of times occurs: maxcount [2,4,7,2,3] --> [7,1] remove repeated values list delrep [1,3,2,1,4] --> [3,2,4] delete instances of element list: delete [1,3,4,1] 1 --> [3,4] question 1. maxandreps l = allow m = maximum l reps = length $ filter (== m) l in [m,reps] this solution has bad asymptotic performance because list traversed twice. ideally, solution find maximum , count repetitions in 1 pass. if write maximum , filter , , length in terms of fold, should see how combine them single pass. also, more natural homecoming tuple instead of list. question 2. @ using data.set.set . also, output list need in same order? if not, there's particularly easy solution. question 3. above reply question 1 covers this. function removes non-maximum values list, problem. figure out how ...
Read more