thunk

How do I thunk an arbitrary function with an arbitrary (fixed) number of arguments, on x86 and x64? (I don't need floating-point, SSE, or the like. The arguments are all integers or pointers.) Here's my generic implementation. I initially made it with AsmJit , then modified it by hand to remove the dependency. It works for both x86 and x64! It works for both cdecl and stdcall! It should also work for "thiscall", both on VC++ and GCC, but I haven't tested it. (VC++ would probably not touch the 'this' pointer, whereas GCC would treat it as the first argument.) It can bind an arbitrary number of

I'm porting some Python code that relies heavily on delayed evaluation. This is accomplished by via thunks . More specifically, any Python expression <expr> for which delayed evaluation is desired gets enclosed within a Python "lambda expression", i.e. lambda:<expr> . AFAIK, the closest JavaScript equivalent of this is function(){return <expr>} . Since the code I'm working with is absolutely awash in such thunks, I'd like to make the code for them more succinct, if at all possible. The reason for this is not only to save characters (a non-negligible consideration when it comes to JS), but also

I've seen it used in programming (specifically in the C++ domain) and have no idea what it is. Presumably it is a design pattern, but I could be wrong. Can anyone give a good example of a thunk? Chris Dodd A thunk usually refers to a small piece of code that is called as a function, does some small thing, and then JUMP s to another location (usually a function) instead of returning to its caller. Assuming the JUMP target is a normal function, when it returns, it will return to the thunk's caller. Thunks can be used to implement lots of useful things efficiently protocol translation -- when

I am wondering why :sprint reports xs = _ in this case: Prelude> xs = map (+1) [1..10] Prelude> length xs 10 Prelude> :sprint xs xs = _ but not in this case: Prelude> xs = map (+1) [1..10] :: [Int] Prelude> length xs 10 Prelude> :sprint xs xs = [_,_,_,_,_,_,_,_,_,_] Note: I am running ghci with -XNoMonomorphismRestriction . Does it have to do with the fact that the type of xs is polymorphic in the first case but not in the second? I'd like to know what's going on internally. jozefg The gist is that the with the polymorphic xs it has a type of the form xs :: Num a => [a] typeclasses under the