Or even shorter, but maybe not as fast because it flattens the given
list, then pairs it up again. Thus it also assumes the resulting list
should consist ENTIRELY of pairs and singletons, not just the last or
penultimate element:
(fn [l x] (partition-all 2 (concat (flatten l) [x])))
On Jun 24, 2
I discovered partition-all and came up with this function:
(fn [l x] (concat (butlast l) (partition-all 2 (concat (last l)
[x]
user> ((fn [l x] (concat (butlast l) (partition-all 2 (concat (last l)
[x]
'()
10)
((10))
user> ((fn [l x] (concat (butlast l) (partition-all 2 (con
I know, but this is list :-)
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clojure@googlegroups.com
Note that posts from new members are moderated - please be patient with your
first post.
To unsubscribe from th
Yeah, this becomes much more straightforward using vectors.
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clojure@googlegroups.com
Note that posts from new members are moderated - please be patient with your
fir
I guess you should use vectors, since you can't effectively add an element
to the end of list.
понедельник, 25 июня 2012 г., 0:46:24 UTC+6 пользователь Andy C написал:
>
> Hi,
>
> I am looking for two seemingly simple operations which require adding
> to the list:
>
> (( 1 2 ) ( 20 30) (40))
Hi,
I am looking for two seemingly simple operations which require adding
to the list:
(( 1 2 ) ( 20 30) (40)) 50 => (( 1 2 ) ( 20 30) (40 50))
and
(( 1 2 ) ( 20 30) (40 50)) 60 => (( 1 2 ) ( 20 30) (40 50) (60))
Basically it is appending an element as a list to the list
