Overview
Artifact ID: | 8737ac12889bb031ee6cc1b29671875aa3702e24 |
---|---|
Ticket: | 0d2bcd9544735adea2d2c3aabd5f0d1e222cb4fc
"lgroup" to regroup a list |
User & Date: | dkf 2014-01-12 21:56:37 |
Changes
- assignee changed to: "dkf"
- comment changed to:
~ Prototype lgroup listIn lengthOfSublist ?stepForward? stepForward defaults to $lengthOfSublist ~ Example set l {a b c d e f g h} lgroup $l 4 # {a b c d} {e f g h} lgroup $l 3 # {a b c} {d e f} {g h} lgroup $l 1 # a b c d e f g h lgroup $l 0 # {a b c d e f g h} lgroup $l -1 # error lgroup $l 3 2 # {a b c} {c d e} {e f g} {g h} lgroup $l 2 3 # {a b} {d e} {g h} ~ Usefulness This can be used to rearrange results returned by SQLite3. ~ Incomplete implementation Since I just use it to process what SQLite3 returns, I have ignored the "stepForward". I think rewrite it in C will speed it up. I didn't check whether $lengthOfSublist is a negative number or zero. proc lgroup {listIn lengthOfSublist} { set i 0 foreach it $listIn { lappend tmp $it if {[llength $tmp] == $lengthOfSublist} { lappend result $tmp set tmp {} } incr i } if {[llength $listIn] % $lengthOfSublist} { lappend result $tmp } return $result }
- icomment:
Don't worry about getting performance or the C implementation. Worry about <i>why</i> and <i>what</i> (i.e., a clear justification for this command and an exact specification of the behaviour).
- login: "dkf"
- mimetype: "text/html"
- username: "dkf"