Is `sublist` suprisingly slow? Related: might NetLogo consider adding a fast `partition` primitive, providing the basic functionality of Mathematica's `Partition`? (I.e., given #lst and #n, return a list of sublists of length #n.) It would alternatively be find to behave more like haskell's `chunkOf` (where the last chunk might be shorter), but I think that's less intuitive.
-- You received this message because you are subscribed to the Google Groups "netlogo-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
