18 Aug 2006 ingvar   » (Master)

A bit futher:

0 > list
10 for i=1 to 3
20 for j=1 to 3
30 print "i is "+i
40 print "j is "+j
50 next j
60 next i

NIL > run "i is "1 "j is "1 "i is "1 "j is "2 "i is "1 "j is "3 "i is "2 "j is "1 "i is "2 "j is "2 "i is "2 "j is "3 "i is "3 "j is "1 "i is "3 "j is "2 "i is "3 "j is "3

0 > 50 next i

NIL > 60 next j

NIL > list 10 for i=1 to 3 20 for j=1 to 3 30 print "i is "+i 40 print "j is "+j 50 next i 60 next j

NIL > run "i is "1 "j is "1 "i is "2 "j is "1 "i is "3 "j is "1 "i is "4 "j is "2 "i is "4 "j is "3

0 >

So, for/next loops in place. Naturally without any sort of checking for proper nesting. Improper nesting is seldom useful, but when it is, it's exceedingly useful. Careful application of improper nesting and cmputed come-froms should, hopefully, cause code to look superficially simple but still cause a head-ache. I am beginning to believe I dare package this up now.

Latest blog entries     Older blog entries

New Advogato Features

New HTML Parser: The long-awaited libxml2 based HTML parser code is live. It needs further work but already handles most markup better than the original parser.

Keep up with the latest Advogato features by reading the Advogato status blog.

If you're a C programmer with some spare time, take a look at the mod_virgule project page and help us with one of the tasks on the ToDo list!