Do you like the experimental feature at the right?
Conversation
Replying to
sweet! how about some clojure?: (for [[k v] (partition 2 [:a [:b :c] :d [:e :f]])] {[k "foo"] (f "bar" v)})
2
1
(or at least the other kind of nesting, like [{"" (["", [], {}])}])
1
Replying to
[:a [:b :c] :d [:e :f]] got split in half, and `partition` does not get recognized as a single form anymore, tho it is
1
Replying to
(partition 2 [a [b c] d [e f]]) is a function call partition(2, list), where list=[a [b c] d [e f]]
3
Replying to
it is ~symmetrical: 1) amount of open = amount of closed 2) open in any order 3) always can open, even after closing
Replying to
4) close in the reverse order of currently open ones (if you close - you close the last one open)
Replying to
invalid: remove any opening/closing [[[]], or switch order, e.g. [()] -> [(]), or mismatch [{)]
1
Replying to
thank you very much for this clear explanation! I hope to find the solution at this enigma…
1
Show replies