k mastering a LISP truly is.
So keep your chin up. Write code, constantly practice. Ask
questions. We're all learning things all of the time here. Who
knows, given enough time you might just write one of those radically
different forms yourself.
Happy Hacking,
Sean
On Dec 12, 11:44
Rich,
For those of us in the US, what are the tax implications? Is there a
non-profit set up at this time?
Sean
On Dec 14, 9:33 am, Rich Hickey wrote:
> Funding Clojure 2010
>
> Background
> --
>
> It is important when using open source software that you consider who
Could you add support for stdev as well, or better yet a helper macro
to return a vector of run times?
I don't want Zed to find out...
Read at your own risk:
http://www.zedshaw.com/essays/programmer_stats.html
Sean
On Dec 13, 11:48 pm, Shawn Hoover wrote:
> I see usages of the time ma
Is this a 1.1 or 1.2 fix?
On Dec 14, 3:05 pm, Rich Hickey wrote:
> On Mon, Dec 14, 2009 at 4:11 AM, Meikel Brandmeyer wrote:
> > Hi,
>
> > Am 14.12.2009 um 01:07 schrieb Mark Triggs:
>
> >> (defn line-seq
> >> "Returns the lines of text from rdr as a lazy sequence of strings.
> >> rdr mus
Actually, I was serious about a helper macro to return a vector of run
times, and leave the stats up to the end consumer. I would find that
very, very useful.
On Dec 14, 4:59 pm, Shawn Hoover wrote:
> On Mon, Dec 14, 2009 at 3:18 PM, Sean Devlin wrote:
>
> > Could you add support
Isn't the whole point of a struct that it guarantees that certain keys
are present? I think the current behavior is correct.
On Dec 15, 5:21 am, Garth Sheldon-Coulson wrote:
> I wonder if the fact that this currently doesn't work the way you want it to
> is a necessary consequence of structural
Could you re-write this w/ comp, and repost?
On Dec 15, 2:00 pm, samppi wrote:
> I'm trying to rewrite a loop to use higher-level functions instead.
> For pure functions f1, f2, f3, f4, f5, f6?, and f7, and a Clojure
> object a0, how can one rewrite the following loop to use map, reduce,
> etc.?
On Dec 15, 4:05 pm, Laurent PETIT wrote:
> Hello,
>
> it seems to me that your example is unnecessary complicated.
> Let's refactor it a bit before trying to obtain your goal.
>
> First,
>
> your example can be, for the purpose of your goal, simplified as :
>
> (loop [a a0]
> (if (predicate-fn a
is lazy, so this will return quickly if it is not equal. I
would recommend making set1 smaller than set2
Hope this helps,
Sean
On Dec 16, 8:53 am, Dragan Djuric wrote:
> Hi,
>
> Here's the example of what I meant in the topic title:
>
> Let's say we have a set s1 tha
the board. I would tread cautiously.
Sean
On Dec 16, 9:58 am, Meikel Brandmeyer wrote:
> Hi,
>
> On Dec 16, 3:45 pm, Sean Devlin wrote:
>
> > Set equality requires the complete traversal of the set, and will
> > always be O(n).
>
> I think, what Dragan was refering
1. I'd call it map-vals (as opposed to map-keys)
2. Slight change in the body
(defn map-vals [f coll]
(into {} (map (juxt key (comp f val)) coll))
There is talk of getting something like this into contrib. Stay
tuned :)
Sean
On Dec 17, 9:37 am, "C. Florian Ebeling"
wrot
Konrad,
I am working on a different proposal on the dev list:
http://groups.google.com/group/clojure-dev/browse_thread/thread/9a518c853bfbba8b#
This is a more in depth version of these functions for maps. I'd love
to have you contribute to the discussion here.
Sean
On Dec 17, 12:16 pm, K
Depends if you need a closure. There are times I do 2D mappings, and
I have to write something like
(map (partail map #(do-work %)) coll).
Or I have to compose my mapping operations.
for is awesome when you need some of the other built-ins, like :while
Sean
On Dec 17, 12:39 pm, Erik Price
Hey everyone,
I just noticed that replicate's functionality is now duplicated by
repeat. Should this function be deprecated?
Sean
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clojure@google
It's new in 1.1. Go here:
http://clojure.org/special_forms#toc7
And read the "Since 1.1" section.
On Dec 17, 11:58 pm, Eric Lavigne wrote:
> > Given that list of languages, I'd suggest taking a look at Eiffel.
> > ...
> > It's the source of the function pre/post condition facilities that Cloju
r :category) sales-coll)
And finally, what happens when you need to break it down by all for
variables simultaneously?
user=>(group-by (juxt :year :category :sold-by :category) sales-coll)
There are tons of other uses for juxt, and I would encourage you to
experiment and find out some of thes
Laurent,
1. You are correct. juxt returns a vector. This is based on some
old articles I wrote, and I must of missed those references.
2. Guilty :) The partial is (deliberate) overkill.
Sean
On Dec 18, 4:17 am, Laurent PETIT wrote:
> Hello,
>
> 2009/12/18 Sean Devlin
>
>
is to take your generic functor application idea and put it
on steroids. I'm going to be writing about this a lot more once 1.1
is out the door. A whole lot.
Sean
On Dec 18, 3:50 am, Konrad Hinsen wrote:
> On 17 Dec 2009, at 20:26, Sean Devlin wrote:
>
> > Konrad,
>
0947617906/6bc50fb45ca56e7d
Sean
On Dec 18, 7:35 am, Patrick Kristiansen
wrote:
> Hi
>
> We're two students that have been working with concurrent programming
> languages (Erlang and Clojure), and while both languages are very
> interesting, we would like to work on something relat
What you're looking for is called "Python".
The parens are your friend. Learn to love them. They are there to
remind you that you're building a data structure, not just writing
code.
Sean
On Dec 18, 2:07 pm, Martin Coxall wrote:
> I had this thought at work, when I s
This came up on the group recently. There was a lot of discussion
here:
http://groups.google.com/group/clojure/browse_thread/thread/c30e313ca2b0ee29#
On Dec 18, 11:55 am, IslandRick wrote:
> Up until a month ago, my total Lisp experience consisted of hacking
> my .emacs file to bend it to my wi
hat is the intended audience.
Sean
On Dec 18, 7:59 pm, Martin Coxall wrote:
> On 19 Dec 2009, at 00:53, Sean Devlin wrote:
>
> > What you're looking for is called "Python".
>
> > The parens are your friend. Learn to love them. They are there to
> > r
Look, your IDE won't be a good clojure environment, because it will
encourage sloppy thinking. Write some more macros, and learn to
appreciate that you are building data structures. Really.
G
On Dec 18, 9:37 pm, Anniepoo wrote:
> I read this and think of Roedy Green's essay on source
orted-set 1 2 3 4))
java.lang.ClassCastException: clojure.lang.PersistentTreeSet cannot be
cast to clojure.lang.IEditableCollection (NO_SOURCE_FILE:0)
Is this desired behavior?
Sean
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To pos
Steve,
I've been checking out the Java, and it looks the same to me. I think
this raises a couple issues:
1. Should sorted versions get transient support in 1.1?
2. The docs should be updated to reflect the 1.1 status of
transients.
Sean
On Dec 19, 10:23 am, "Stephen C. Gilar
gh at the hands of
languages "designed for other poeple". This is Clojure, and I want to
keep it a language "designed for myself".
Sean
On Dec 19, 9:18 am, Martin Coxall wrote:
> > It is proudly a Lisp for people that want to get things done. Any
> > Java/.NET/Python
Well, good thing you repented of your evil ways
On Dec 19, 3:37 pm, Stuart Sierra wrote:
> On Dec 18, 9:28 pm, Sean Devlin wrote:
>
> > It is proudly a Lisp for people that want to get things done. Any
> > Java/.NET/Python/Brainfuck/Ruby/Basic/C/C++ (No Perlmonge
Occasionally I have to write a custom def macro, and this would make
life easier. I would have to use it to provide specific feedback, but
it seems like an idea worth pursuing.
On Dec 19, 3:58 pm, Stuart Halloway wrote:
> In Clojure it is idiomatic to have optional args at the front of the
>
Ah, :else is an unfortunate choice. The cond macro keeps testing
clauses until it finds one that is true. :else was chose because it
is simply not nil, and therefor always true.
I would re-write your fn like so:
(defn sign [x] (cond (> x 0) "Positive" (< x 0) "Negative&quo
Give it a shot. Hack up a prototype. Let's see what happens.
On Dec 20, 12:07 am, "Alex Osborne" wrote:
> Phil Hagelberg writes:
> > "Alex Osborne" writes:
> >> But this is the same "great idea" that everyone who's ever used a lisp
> >> since the dawn of programming has come up with and despi
Alex,
I just thought of something. I think we're all forgetting the amount
of hacking done at the REPL.
;This is easy to type
user=>(from (too (many (parens
;Uh-oh
user=>to
too
many
nesting
levels?
This might be an area where the parens are a win.
Sean
On
Could we also include some words explicitly stating that the sorted
versions are not supported in 1.1.0?
Sean
On Dec 20, 11:56 am, "Stephen C. Gilardi" wrote:
> On Dec 19, 2009, at 7:50 PM, Chouser wrote:
>
> > I've updatedhttp://clojure.org/transientsto reflect vecto
e are:
A community at least 1/10th as awesome as this one. Seriously.
Libs in Lisp - I want to see if there are ideas worth stealing.
Available documentation - I have to be able to read about it, and
teach myself online.
Thanks,
Sean
--
You received this message because you are subscribed to t
g for isn't possible in native Clojure.
Sean
On Dec 20, 4:55 pm, David Cabana wrote:
> Suppose we define a function called sq:
>
> (defn sq [x]
> (do (println "sq")
> (* x x)))
>
> I wanted sq to print it's own name when run; to make it do so I
&g
I try to avoid using reading macros in macro definitions. Maybe you
could wrap the desired data in a quote form instead?
On Dec 23, 6:13 am, Andreas Fredriksson
wrote:
> Hi,
> I'm prototyping a source translation framework in Clojure and I've run
> across a problem. I have a bunch of files with
+1 ataggart, Chouser
On Dec 23, 3:02 pm, ataggart wrote:
> I'd appreciate any added detail, since I had a similar reaction to
> Chouser, thus wasn't really grokking the monad (wikipedia's
> description is no more helpful).
>
> On Dec 22, 2:10 pm, jim wrote:
>
>
>
> > Chouser,
>
> > You're right
It would be nice if the exception string stated if it was a pre or
post condition failure at the very least.
On Dec 23, 5:03 pm, Mark Derricutt wrote:
> 'lo,
>
> I was readinghttp://blog.fogus.me/2009/12/21/clojures-pre-and-post/
> on the new pre and post conditions and seeing that they throw
> j
We could define a fn called take-until
(defn take-until
[pred coll]
(take-while (complement pred) coll))
And get the last entry of that
user=>(last (take-until odd? [2 4 6 8 9 10 11]))
8
It's based on take-while, so it's lazy.
Sean
On Dec 24, 1:34 pm, Chouser wrote:
>
I *think* it's a special reader for evaluating Constructor special
forms, i.e.
(MyClass. "foo");creates an instance of MyClass
Pretty sure, but not 100%
Sean
On Dec 27, 3:29 pm, Liam wrote:
> In the clojure source, on the JVM side, under "lang/LispReader.java"
>
Oh, and you'll want to link to github, not google code. That's where
the official repo is
http://github.com/richhickey/clojure
On Dec 27, 3:29 pm, Liam wrote:
> In the clojure source, on the JVM side, under "lang/LispReader.java"
> line 873, link below.
>
> What is this CtorReader? Why isn't it
There's a user.clj file that can be customized for this purpose. Make
sure it's in your classpath.
On Dec 28, 6:16 pm, Mike K wrote:
> Is it possible to load a library such as foo.clj (with (ns foo ...) at
> the top of the file) into the repl automatically at startup, rather
> than having to (us
This search might help:
http://groups.google.com/groups/search?safe=off&q=data+types+protocols+group:clojure&sa=X&oi=spell&spell=1
Sean
On Dec 28, 5:44 pm, Raoul Duke wrote:
> hi,
>
> i'm trying to catch up on D&P, where are the best online succi
Search the mailing list for swear words. That should be a start :)
On Dec 28, 7:04 pm, Jules wrote:
> > the issues faced by Clojure users.
>
> Is there a list somewhere?
>
> Jules
>
> On Dec 28, 8:07 pm, Rich Hickey wrote:
>
>
>
> > On Tue, Dec 15, 2009 at 11:32 PM, ashishwave wrote:
> > > Req
What if we used c.c.seq-utils/group-by with class? This would create
hash map with the appropriate values options in it. From there it's a
simple matter of processing a map. I think that the aritiy overloaded
version of defn is easy enough to detect to. Would that do the trick?
Sean
On D
me other stuff, too. Send me a note if you need more than
this.
Sean
On Dec 30, 5:37 pm, Rob Lachlan wrote:
> About a year and a half ago, there was some discussion about having a
> function that would enable some kind of bounded search on a sorted
> map:
>
> http://groups.google.co
ready in an ordered collection.
>
> On Dec 30, 3:04 pm, Sean Devlin wrote:
>
>
>
> > Use a combination of take-while & key
>
> > (take-while (comp your-pred key) sorted-map)
>
> > You could also use drop while as needed.
>
> > I'
Stefan,
I run OSX, so I use command-click to bring the item to my REPL. I
imagine a right click would do the job in other platforms.
Sean
On Dec 31, 6:15 am, Stefan Tilkov wrote:
> Two quick Emacs/Clojure questions I can't seem to find the answer to:
>
> - In his screencasts, Sea
;ve described is a lot of work, but it's what is involved
with creating a really well polished library. I think in the end this
will be library we're all proud of. Thanks for bringing the idea
up :)
Sean
On Jan 1, 6:27 am, Stefan Kamphausen wrote:
> Hi,
>
> On Jan 1, 3:58 a
On Jan 1, 4:34 pm, Phil Hagelberg wrote:
> Sean Devlin writes:
> > 1. I'd recommend adding support for general unix file utilities.
> > I've written some of them myself, and you can review/borrow/steal code
> > from here:
>
> >http://github.com/francoisd
You vec approach is the current solution. I'm 95% sure you'll have to
pay the O(n) once, but you'll be good to go after that.
Sean
On Jan 1, 7:19 pm, Gabi wrote:
> What is the preferred way getting a vector back from sequence, after a
> sequence producing operation (like s
l)
3
...
user=>(nil+ 0 0 0 0 0 0 nil)
6
;This example exceeds the provided # of nil values
user=>(nil+ 0 0 0 0 0 0 0 nil)
NPE
You get the idea. Also, Rich's style matches the signature of partial
better, which I personally prefer.
Just my $.02
Sean
On Jan 1, 6:45 pm, Timothy
jure-utils/blob/master/src/lib/sfd/seq_utils.clj
Simple predicate fns (Sorry, docs are thin right now)
http://github.com/francoisdevlin/devlinsf-clojure-utils/blob/master/src/lib/sfd/patterns.clj
Sean
On Jan 3, 4:17 pm, Tom Hicks wrote:
> A couple weeks ago Sean Devlin posted a blog entry asking
Would you be comfortable recording & publishing the talk?
On Jan 4, 7:12 pm, Mark McGranaghan wrote:
> Hi All,
>
> I'm happy to announce the alpha release of 'FleetDB', a schema-free
> database implemented in Clojure and optimized for agile development.
>
> From the homepage athttp://fleetdb.org:
There is a release candidate for contribs 1.0.0 and 1.1.0
http://groups.google.com/group/clojure/browse_thread/thread/6570c2969d8b956
It'll be out soon.
Sean
On Jan 5, 8:29 pm, Jarkko Oranen wrote:
> On Jan 6, 2:21 am, Mark Derricutt wrote:
>
> > Is there likely to be a R
Use clojure.contrib.prxml to output the data.
Hope this helps,
Sean
On Jan 7, 11:33 am, Tzach wrote:
> Hello
> I have a simple task of reading an XML structure, manipulate part of
> it and writing it back to XML.
> For example, adding 1$ for each book with a year element after 2005 in
> t
Take a look at pmap
On Jan 8, 11:13 am, Conrad wrote:
> Looping variables in a clojure "for" loop are iterated in a serial,
> cartesian fashion:
>
> > (for [a (range 5) b (range 10 15)]
>
> (+ a b))
> (10 11 12 13 14 11 12 13 14 15 12 13 14 15 16 13 14 15 16 17 14 15 16
> 17 18)
>
> I was
do the job nicely.
Sean
On Jan 8, 11:56 am, Chouser wrote:
> On Fri, Jan 8, 2010 at 11:34 AM, Sean Devlin wrote:
> > Take a look at pmap
>
> I don't think that's the kind of "parallel" being asked about.
>
>
>
> > On Jan 8, 11:13 am, Conra
Conrad,
What's your use case that requires for and not map? I haven't seen
something like this yet, and you've got my curious.
Sean
On Jan 8, 4:41 pm, Conrad wrote:
> Thanks again Sean/Chouser- Sounds like there isn't any easy way to do
> in-step iteration using
and I manually test that each one calls the expected
routine.
Manual testing seems to be required. I would use the opportunity to
review the workflow of your application, to see that it does what you
want.
Sean
On Jan 12, 9:39 am, Eric Thorsen wrote:
> Anyone have any recommendation/experience fo
~ is platform specific, and doesn't play well with WORA
On Jan 13, 1:46 am, David Nolen wrote:
> Erg. Turns out I was bitten by the Java classpath again. The path must be
> absolute, no ~ allowed.
>
> Thanks all.
>
> On Tue, Jan 12, 2010 at 9:58 PM, aria42 wrote:
> > I was seeing this error too
Hey everyone,
I was working with seq today, and I was wondering why I got a certain
result.
user=> (seq [])
nil
Why is nil returned, instead of an empty sequence?
Sean
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to thi
Did you try wrapping everything w/ a call to lazy-seq?
On Jan 15, 3:21 pm, Nicolas Buduroi wrote:
> Hi, I'm still not familiar with laziness and I'm trying to make a
> function recursively walk arbitrary data structures to perform some
> action on all strings. The non-lazy version is quite easy t
I'm confused. Shouldn't the inner loop have the proper conditionals
to break out of itself properly instead?
On Jan 18, 8:48 am, Alex Ott wrote:
> Re
>
> Konrad Hinsen at "Mon, 18 Jan 2010 12:23:58 +0100" wrote:
> KH> On 18.01.2010, at 12:03, Alex Ott wrote:
>
> >> I have a question to Rich -
Did you watch Rich's video "Clojure for Lispers"? That might help
(The only one I can answer for sure is that Clojure's let is CL's
let*)
http://blip.tv/file/1313398
On Jan 18, 10:49 pm, Conrad Taylor wrote:
> Hi, I'm starting to convert some code over from Lisp to Clojure.
> Thus, I was wonde
It's unorthodox, but...
(apply concat
(map (fn [coll f] (f coll))
(partition 4 (range 1 17))
(iterate (partial comp list) identity)))
Sean
On Jan 19, 11:58 am, Scott wrote:
> gotta love well thought out libraries
>
> Thanks Laurent
>
> one more question, what i
If you add the jar as a Netbeans lib, Enclojure should do the work for
you. Make sure to start a project REPL.
On Jan 19, 2:37 pm, Boštjan Jerko wrote:
> On 19.1.2010, at 19:53, Richard Newman wrote:
>
>
>
> > Make sure you explicitly include clojure-twitter.jar on your classpath. The
> > conta
This should be fast as long as you're only updating. If you're
inserting/deleting, you might be able to get away with using a
collection of 1D trees.
Sean
On Jan 20, 9:18 am, Gabi wrote:
> These vectors represent trees which need to updated very frequently.
> So If there was an
How about a sorted set w/ a custom comparator? Of course, this rules
out transients, but maybe the flatness will make up for it?
On Jan 20, 10:15 am, Gabi wrote:
> I need to add/delete much more frequently than just updating
> actually.
>
> On Jan 20, 4:59 pm, Sean Devlin wrote
Tom,
Thanks for providing this great tool. I was able to install it last
night, it just plain works.
Keep hacking!
Sean
On Jan 20, 12:51 pm, Tom Faulhaber wrote:
> Now your project can have the same documentation as Clojure, clojure-
> contrib, and Incanter!
>
> The standalone aut
poll-sensor is concerned. The promise
forces the press to wait unit it's safe to activate.
There are all sort of other conditions where this makes sense when
dealing with mechanics. This is just one.
HTH,
Sean
On Jan 21, 6:40 am, Laurent PETIT wrote:
> In a nutshell, those are the
I'm not quite sure what you're getting at. Maybe split-with will do
what you want?
http://richhickey.github.com/clojure/clojure.core-api.html#clojure.core/split-with
On Jan 21, 2:47 pm, nwalex wrote:
> I'm very new to Clojure, and to functional programming in general. Can
> anyone tell me the i
pply % args) preds)))
They're very handy, though. Makes it easy to create a complex
predicate from simple ones.
Sean
On Jan 21, 3:40 pm, Perry Trolard wrote:
> I think it's easier to think about combining predicates separately
> from your file-filtering code. I'd use a
Not as a macro I hope. You lose apply.
On Jan 21, 3:49 pm, Richard Newman wrote:
> > I think it's easier to think about combining predicates separately
> > from your file-filtering code. I'd use a higher-order function like
> > the following
>
> > (defn combine-preds
> > [& preds]
> > (fn
Your second "\\a" should probably be "\"a".
On Jan 21, 5:40 pm, CuppoJava wrote:
> Hi,
> I'm trying to write a simple function to replace every " inside the
> string with \", but am having an extremely difficult time.
>
> Can someone enlighten me as to why the following is returning true?
>
> (=
o force a dependency on an
unreleased version of Clojure, because it's a moving target. Granted,
there should be a mechanism for version 1.1.x, or 1.x so that
libraries are forward compatible to a certain version.
Just my $.02
Sean
--
You received this message because you are subscribed to the Go
pply a default-map instead of a hash-map"
[m default-map [k & ks] v]
(if ks
(assoc m k (assoc-in-as (get m k default-map) default-map ks v))
(assoc m k v)))
Also, is there room for a sister fn update-in-with?
Thoughts?
Sean
--
You received this message because you are subscrib
What coast are you thinking? That will probably affect a lot of
answers.
Sean
On Jan 22, 12:36 pm, dysinger wrote:
> We will be organizing a conference in the next month for 2010
> (probably in the fall). One question I would like to ask is, given
> the conference is probably going
Only if you know a good bar :)
On Jan 22, 1:15 pm, Chouser wrote:
> On Fri, Jan 22, 2010 at 1:07 PM, Sean Devlin wrote:
> > What coast are you thinking? That will probably affect a lot of
> > answers.
>
> Why not compromise and have it in Indianapolis?
>
&
Does anyone know what Debian does? That might be a good starting
point.
On Jan 22, 1:28 pm, Richard Newman wrote:
> >> Apparently everyone is jumping on the Leiningen bandwagon and
> >> deleting
> >> their build.xml files. I guess that means I'm moving, too.
>
> > Deleting build.xml files is g
Okay, we've all seen this thread:
http://groups.google.com/group/clojure/browse_thread/thread/182f171afc49473b
It just hit me that we're all going about this the wrong way. Our
libraries shouldn't specify specific versions. Each dependency should
be a Clojure predicate. Then, the lein deps cou
Yeah, but this still *should* be doable. Not necessarily directly,
but doable.
On Jan 22, 2:38 pm, James Reeves wrote:
> Doesn't Lein currently rely on Maven for dependency management?
>
> - James
>
> On Jan 22, 6:53 pm, Sean Devlin wrote:
>
> > Okay, we'
Clearly you haven't taken into account that Philadelphia is more
central wrt the big cities :)
On Jan 22, 3:32 pm, Fogus wrote:
> Since Clojure is clearly an East-Coast language, I suggest DC as the
> most logical locale. (hopes someone buys this line of reasoning)
>
> -m
--
You received this
I recently found a scheme problem that I think would be a good
exercise for a new Clojure developer. I've written about it here:
http://fulldisclojure.blogspot.com/2010/01/code-kata-data-sifter.html
Have fun.
Sean
--
You received this message because you are subscribed to the Google
G
nteresting enough, I'll try to do an episode on
it. There are no bad suggestions.
Thanks in advance,
Sean
--
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 pos
Rock,
Could you please proved a link to Alan Bawden's paper?
Thanks,
Sean
On Jan 25, 9:06 am, Rock wrote:
> I think I have a good topic.
>
> How about the intricacies of syntax-quotes and in particular, nested
> syntax-quotes?
>
> When I was first learning Lisp (Common L
w how Clojure makes your
life simple.
Sean
On Jan 25, 10:29 am, Laurent PETIT wrote:
> Hello,
>
> So far, i've encountered the term of "kata" applied to software in a
> somewhat similar sense as in the martial arts: very detailed
> step-by-step explanation of how o
Laurent,
Which thread are you referring to?
Sean
On Jan 25, 11:45 am, Laurent PETIT wrote:
> Not a precise subject, but something along the lines : "here is how
> one would do stuff X in a classical mainstream OO language, and now
> here is how one would do same thing in lisp&q
(inc java-one-alignment)
On Jan 28, 10:46 am, liebke wrote:
> > Oracle just announced Java One in San Francisco from September 19-23,
> > 2010
>
> Despite my preference for an east coast conference (and my limited
> interest in JavaOne), I think it makes a lot of sense to have the
> ClojureConj s
Check the apply-macro namespace in contrib
Sean
On Jan 28, 4:54 pm, Raoul Duke wrote:
> hi,
>
> if "and" were a function then i could do (apply and [true false]) and
> get false, i think. is there some shorthand for doing that given that
> apply doesn't work wit
I'd do one thing differently than Tim. (partial = something) is a
clojure smell. It's more idiomatic to use a set
(if (some #{"foo"} ["foo" "bar"]) "yay" "humbug")
Sean
On Jan 28, 4:39 pm, Timothy Pratley wrote:
> 2010/1/29 Rao
The following doesn't currently work:
user=> (assoc [] 1 :a)
#
So I say this should be map only. Granted, assoc-in already has this
issue.
Also, what do you mean by your question "Where would the default go"?
I don't understand what you're getting at yet.
Sea
Rich,
Your example didn't support a variadic signature. Is that the long
term plan?
Sean
On Jan 29, 8:48 am, Rich Hickey wrote:
> On Dec 30 2009, 6:18 am, Timothy Pratley
> wrote:
>
> > On Dec 13, 1:24 am, Rich Hickey wrote:
>
> > > fnil seems to me to have g
Using seq-utils...
1. Assume " " is NOT empty
2. Use partition-by to split
3. Use remove to clean up
4. Map!
user=>(map (partial apply str)
(remove (comp empty? first)
(partition-by empty? ["a" "" "b" "c"])))
("a" "bc&
That's a great point. A contains? should be used in that case.
On Jan 29, 2:14 pm, Meikel Brandmeyer wrote:
> Hi,
>
> Am 29.01.2010 um 03:49 schrieb Sean Devlin:
>
> > I'd do one thing differently than Tim. (partial = something) is a
> > clojure smell.
If you can live with an O(n) operation, take/drop-with will do the
job.
Sean
On Jan 30, 6:59 pm, Rowdy Rednose wrote:
> How would I do something like these 3 TreeMap operations with
> clojure's sorted-map?
>
> The goal is to narrow down a map to include only keys with a given
&
Hmmm... to the best of my knowledge this has to be handled by the end
developer.
Could you post what you find out?
Sean
On Feb 1, 9:22 am, Jim Van Donsel wrote:
> The simple:
>
> (file-seq (java.io.File. "."))
>
> will loop forever if it hits a directory structu
tly)
Does someone know of an alternate place to find Javadocs?
Sean
--
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 pati
A good front end for Clojars would be a better long term solution.
Sean
On Feb 2, 3:44 pm, "John \"Z-Bo\" Zabroski"
wrote:
> http://clojure.org/librariesis out of date
>
> Gorilla was merged with VimClojure, and I think I saw other
> problems...
>
> Also,
t's better as a map...).
I DO see a great use case for update-in-with working on vectors, so
maybe assoc-in-with working on vectors should be implemented simply
for symmetry.
I dunno. That's all I've got right now.
On Feb 3, 11:03 am, Rich Hickey wrote:
> On Fri, Jan 29, 2010 at
Do we have a concise way of doing this? Is it actually useful?
http://www.artima.com/weblogs/viewpost.jsp?thread=281160
Sean
--
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
301 - 400 of 2689 matches
Mail list logo
