I thought some folks on this list might be interested in a mention
graph I put up. It shows the # mentions of "clojure" across several
sources (twitter, blogs, etc).
http://twitpic.com/5nm8ve
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post t
ArrayMap?
http://clojure.org/data_structures#toc21
James
On Sat, Jun 25, 2011 at 1:55 PM, Alex Baranosky
wrote:
> What are some options for having a map that guarantees ordering of its keys
> in Clojure? (note: sorted-map won't do!) My first try was to use
> LinkedHashMap, but am running into
Per the doc, last is linear time, and the source doesn't check for reversible.
user=> (source last)
(def
^{:arglists '([coll])
:doc "Return the last item in coll, in linear time"
:added "1.0"}
last (fn last [s]
(if (next s)
(recur (next s))
(first s
unless
I'm fairly new too, but I'll take a stab. I think the koan's for
19-21 are trying to make you do exactly what you are doing: consider
the performance characteristics for various operations on a vector vs
a list or sequence.
Problem 19, for example, is highlighting that
1 - Last is slow for a vec
You could also try
(find-doc "libname")
On Thu, Jun 2, 2011 at 11:15 AM, Alex Robbins
wrote:
> (ns-publics 'namespace) will show all the publicly defined things in a
> namespace.
>
> On Thu, Jun 2, 2011 at 11:51 AM, Avram wrote:
>>
>> Apologies for a silly question, there must be a simple way to
