On Fri, Jun 29, 2012 at 7:51 AM, Warren Lynn <wrn.l...@gmail.com> wrote: > 1. Put good documentations on the functions, and the programmer needs to > have some idea what data structure is fast/slow for what use.
At the risk of continuing what is quickly becoming a rather fruitless thread, I figured I'd quote the docstrings from last and peek: last: Return the last item in coll, in linear time peek: For a list or queue, same as first, for a vector, same as, but much more efficient than, last. If the collection is empty, returns nil. That seems like pretty good documentation to me. (last my-vector) is documented to be a linear operation. (peek my-vector) is documented to be "much more efficient". last is not dependent on the type of its argument, peek is. -- Sean A Corfield -- (904) 302-SEAN An Architect's View -- http://corfield.org/ World Singles, LLC. -- http://worldsingles.com/ "Perfection is the enemy of the good." -- Gustave Flaubert, French realist novelist (1821-1880) -- 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 this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
