On Sun, Sep 20, 2009 at 1:52 PM, Hugh Aguilar <[email protected]> wrote: > I like the call( word. This is way cool, as it is self-documenting. In Forth > I would pass a cfa as I described, but I would have to put a comment > somewhere nearby that described the stack effect of the anonymous word. This > was never very clear. With your call(, the stack effect is documented right > where I need it, and the compiler checks that everything corresponds. I'm > starting to find some aspects of Factor that I like.
Glad you like it. Note that you can still use the old 'call', but only in inline combinators where the quotation parameter itself is literal. This is less flexible but generates much more efficient code than storing the quotation in a dynamic variable (because it gets inlined at the call site). Once you're comfortable with how the stack checker works, read up on this features at http://docs.factorcode.org/content/article-inference-combinators.html Also note that the useless 'compiler warnings' when you load your code are gone. Slava ------------------------------------------------------------------------------ Come build with us! The BlackBerry® Developer Conference in SF, CA is the only developer event you need to attend this year. Jumpstart your developing skills, take BlackBerry mobile applications to market and stay ahead of the curve. Join us from November 9-12, 2009. Register now! http://p.sf.net/sfu/devconf _______________________________________________ Factor-talk mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/factor-talk
