foreache

what is you're opinion on foreache loops?

i don't like em cuz they ache in the fore

>>153

when ``list'' means ``linked list''

Indeed - that's precisely what I'm not doing. If I wanted to say linked list I would say linked list. Actually, I like the way Wikipedia puts it in the first definition: A list is a finite sequence {a₁, a₂, ... a_n}, where n is finite. For an infinite sequence, or something which is not exactly a sequence, a different term is needed. There is no need to specify everything in terms of linked lists - other things may be ``what they are'' as well.

To return to the original point, assuming that O(n) access and length times are required for [linked] lists, I still find Sglib disgusting - two reasons came up in the back and forth. First: that the algorithms are problematic. Equating lists and linked lists makes circular lists a completely valid case, instead of a condition that may be ignored as an error. The mapping macro completely fails to deal with this. Second: the refusal to specify structure, only algorithms, means that the algorithms are only effective for structures so trivial that they might as well have been written anyway, but are not.