impenetrable for builtin curried functions and . operator as comp?? i
dont think so, haskell can be hard to read but not for those reasons
F. e. filter when the sum of elements are even:
Prelude> filter (even.sum) [[2,3],[3,3]]
[[3,3]]
i think is pretty readable ;-)
On Nov 16, 2:19 am, Cyrus Har
On Tue, Nov 16, 2010 at 3:23 AM, atreyu wrote:
> impenetrable for builtin curried functions and . operator as comp?? i
> dont think so, haskell can be hard to read but not for those reasons
> F. e. filter when the sum of elements are even:
>
> Prelude> filter (even.sum) [[2,3],[3,3]]
> [[3,3]]
>
>
2010/11/16 Meikel Brandmeyer
> Hi,
>
> On 16 Nov., 02:31, Ken Wesson wrote:
>
> > Eh. I'd heard first and rest had replaced next. No?
>
> No. This was a misinformation. To elaborate a bit more on the
> differences pointed out by Sean:
>
> next returns nil if there are no more items in the sequen
You can implement your own, prettu easily with deftype.
However it can be tedious to track every methods, so we need a repl helper
function to scaffold the code for us.
(defn scaffold [iface]
(doseq [[iface methods] (->> iface .getMethods
(map #(vector (.getName (.get
Salut Laurent,
On 16 Nov., 09:51, Laurent PETIT wrote:
> Agreed with the explanation, but ... 12% of what, exactly ?
6,502692ms / 7,393586ms ~ 0,88 => 12% improvement, no?
But maybe this whole microbenchmarking story is paper waste. As I
said: quick'n'dirty.
Will now drop out of perfomance di
clojure is nice too for the example but if you'd add functions and
they have arity more than 1 haskell gets better (imo of course):
user> (def concat2 (partial apply concat))
#'user/concat2
user> ((comp (partial map (partial + 5)) concat2) (filter (comp even?
sum) [[2 3] [3 3] [6 6]]))
(8 8 11 11)
Hi,
On 16 Nov., 11:06, atreyu wrote:
> clojure is nice too for the example but if you'd add functions and
> they have arity more than 1 haskell gets better (imo of course):
And less than 3 if one is honest. Haskell is spicked with rather
unmotivated "`foo` x"s which simply means #(foo % x) in a
Yep, you have to use flip and it is not so elegant
Prelude> let f x y z=(x+z)*y
Prelude> map (flip (f 1) 2) [3,4,5]
[9,12,15]
OTOH in clojure we have, you guess..., macros!!!
user> (->> [[2 3][3 3][6 6]] (filter (comp even? sum)) concat2 (map
#(+ 5 %)))
(8 8 11 11)
i promise i'll not comment ab
Hi,
I need to implement an algorithm to generate large random d-regular
graphs. A d-regular graph is a graph in which all vertices have degree
d. Specifically I need to generate large (1000+ vertices) 4-regular
graphs. The algorithm I need to use is as follows:
let V be a set of n vertices with d
Hi Paul,
Thanks for sharing this. It seems like the best compromise between the
desire to keep my code brief (at least to my eyes) without wanting to
introduce my own custom function names for global functions.
If you don't mind I'd like to add this to my fork of the Emacs Starter
Kit (will cred
atreyu writes:
> Yep, you have to use flip and it is not so elegant
>
> Prelude> let f x y z=(x+z)*y
> Prelude> map (flip (f 1) 2) [3,4,5]
> [9,12,15]
>
> OTOH in clojure we have, you guess..., macros!!!
>
> user> (->> [[2 3][3 3][6 6]] (filter (comp even? sum)) concat2 (map
> #(+ 5 %)))
> (8 8 1
That makes sense... thanks, Meikel.
Maybe my example of + wasn't the best, given its mathematical nature.
Here's my situation: I'm writing some software to analyze some protein
datasets, part of which entails generating a Venn diagram of their
intersections. Each dataset has a unique name, and m
Hi,
On Tue, Nov 16, 2010 at 5:21 PM, Chris Maier wrote:
> That makes sense... thanks, Meikel.
>
> Maybe my example of + wasn't the best, given its mathematical nature.
>
> Here's my situation: I'm writing some software to analyze some protein
> datasets, part of which entails generating a Venn di
On Fri, Nov 12, 2010 at 1:54 PM, wrote:
> Which natural language processing tools have you used that worked well with
> clojure?
I've had good luck with clojure-opennlp -
http://github.com/dakrone/clojure-opennlp
However, I may be a bit biased since I wrote it :)
- Lee
--
You received this m
On Tue, Nov 16, 2010 at 9:34 AM, Lee Hinman wrote:
> On Fri, Nov 12, 2010 at 1:54 PM, wrote:
>> Which natural language processing tools have you used that worked well with
>> clojure?
>
> I've had good luck with clojure-opennlp -
> http://github.com/dakrone/clojure-opennlp
>
> However, I may be
Ah, laziness... thanks Christophe. For my particular application
laziness doesn't matter (so that hadn't occurred to me) but that's a
good general principle to keep in mind.
Thanks,
Chris
On Tue, Nov 16, 2010 at 11:31 AM, Christophe Grand
wrote:
> Hi,
>
> On Tue, Nov 16, 2010 at 5:21 PM, Chris
I took a stab at it:
(defn make-verts [n]
(zipmap (range n) (repeat [])))
(defn free-legs? [m i d]
(< (count (m i)) d))
(defn free-leg-indices [m n d]
(filter #(free-legs? m % d) (range n)))
(defn first-free-leg [m n d]
(first (free-leg-indices m n d)))
(defn random-free-leg [m n d]
Just to follow up, I'm now using the following to pretty up Clojure code
in Emacs
#+begin_src emacs-lisp
;; symbols for some overlong function names
(eval-after-load 'clojure-mode
'(font-lock-add-keywords
'clojure-mode
(mapcar
(lambda (pair)
`(,(car pair)
Ask on #clojure about this. Someone (hiredman, I think?) has a macro
that rewrites code using some funky unicode characters. I can't find
it at the moment, but it might be what you're looking for.
On Nov 16, 9:51 am, "Eric Schulte" wrote:
> Just to follow up, I'm now using the following to pretty
On Nov 15, 8:52 am, Chris wrote:
> If you have a function that needs to treat multiple arguments as a
> group, what forces drive you to represent this as a single sequence
> argument vs. an "&" argument? To give a concrete example, why does
> "+" work like
>
> (+ 1 2 3 4)
>
> instead of
>
> (+ [1
I think the simplest and most efficient way to simulate the random
connection process in a functional manner is to start by generating a
shuffled list of d copies of each vertices (this represents the d legs for
each vertex), and then pair them up using partition. At this point you have
a list of
Hi Eric,
Looks good; nice job with complement too. Of course you can add it to the
Emacs Starter Kit ;-)
--
Paul Hobbs
On Tue, Nov 16, 2010 at 9:51 AM, Eric Schulte wrote:
> Just to follow up, I'm now using the following to pretty up Clojure code
> in Emacs
>
> #+begin_src emacs-lisp
> ;; sym
That is really nice thank you. I'd have to take a real hard look at
it, to see whether or not it's the exact algorithm I need, but
nonetheless, you pointed me in the right direction. The code I
produced was a mess of mutable state and loops. Thank you very much!
On Nov 16, 6:29 pm, Ken Wesson wro
This is also a nice idea. I will take a look at both implementations.
On Nov 16, 8:16 pm, Mark Engelberg wrote:
> I think the simplest and most efficient way to simulate the random
> connection process in a functional manner is to start by generating a
> shuffled list of d copies of each vertices
Found it. See
https://github.com/hiredman/odds-and-ends/blob/8a84e6ddbad9d71f714ba16c3e1239633228a7eb/functional.clj#L94
On Nov 16, 10:06 am, Alan wrote:
> Ask on #clojure about this. Someone (hiredman, I think?) has a macro
> that rewrites code using some funky unicode characters. I can't find
Huh. Isn't a unicode composition symbol harder to type than comp? If it's
for readability, I'd rather go with the emacs hacks.
On Tue, Nov 16, 2010 at 11:54 AM, Alan wrote:
> Found it. See
> https://github.com/hiredman/odds-and-ends/blob/8a84e6ddbad9d71f714ba16c3e1239633228a7eb/functional.clj#
Well, it would be harder for *me* to type. I imagine Hiredman has
these symbols bound to some short but little-used key sequences. If
you're not using your C-c bindings for anything else, you can
pick four of them and use them for this.
On Nov 16, 12:13 pm, Paul Hobbs wrote:
> Huh. Isn't a unic
I spoke to the guys on reddit. They said it is tongue-in-cheek. They have no
knowledge of functional programming but strongly feel it isn't suited to
their field.
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clo
Daniel Gagnon wrote ..
> I spoke to the guys on reddit. They said it is tongue-in-cheek.
> They have no knowledge of functional programming
???
> but strongly feel it isn't suited to their field.
???
Isn't this a bit contradictory ? It's ok to follow your own gut feeling but
it needs
I ran into this while working on making functions durable. Here's a
contrived example:
=> (defn a
([x] x)
([x y] (+ (a x) (a y
#'user/a
=> (a 1 2)
3
=> (def b a)
#'user/b
=> (b 1 2)
3
=> (defn a [x]
(- x))
#'user/a
=> (b 1 2)
-3
Is this what people expect? I would think
On Nov 16, 2010, at 5:26 PM, Alyssa Kwan wrote:
>
> Is this what people expect? I would think that the original
> definition of a, which is self-referencing, should point to itself no
> matter what it's named, not get resolved at invoke-time to see what
> the var is currently resolving to.
I'
But that would destroy one of the most useful features Lisp has to offer,
interactive coding.
Live coding would be impossible w/o this behavior as you would need to find
and update all callers. Yuk.
David
On Tue, Nov 16, 2010 at 5:26 PM, Alyssa Kwan wrote:
> I ran into this while working on mak
This seems like such an obvious question, but I can't seem to find the
answer anywhere. I don't understand why this would not be included in
the java_interop section of the clojure documentation.
Is it possible to pass a clojure vector to a java function that
requires a java vector as an argument?
On Nov 16, 2010, at 5:26 PM, Alyssa Kwan wrote:
> I ran into this while working on making functions durable. Here's a
> contrived example:
>
> => (defn a
> ([x] x)
> ([x y] (+ (a x) (a y
> #'user/a
>
> => (a 1 2)
> 3
>
> => (def b a)
> #'user/b
>
> => (b 1 2)
> 3
>
> => (defn a
This is because java vectors are disgusting and not part of the
Collections framework. Clojure vectors do implement Collection, and
indeed List, but that is different from Vector. However, Vector was
hacked up a bit after Collections were released to make it a little
more "forward compatible":
(ja
On Nov 16, 2010, at 5:49 PM, unst...@gmail.com wrote:
> This seems like such an obvious question, but I can't seem to find the
> answer anywhere. I don't understand why this would not be included in
> the java_interop section of the clojure documentation.
>
> Is it possible to pass a clojure vec
What is the fastest way to remove nils from a sequence?
I usually use the filter function, but I see there are other functions
like remove that should also do the trick.
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send emai
user=> (time (filter identity [ nil 1 2 nil 4]))
"Elapsed time: 0.053219 msecs"
(1 2 4)
user=> (time (remove nil? [ nil 1 2 nil 4]))
"Elapsed time: 0.065092 msecs"
(1 2 4)
Choose the flavor your prefer...
Luc P.
Glen Rubin wrote ..
> What is the fastest way to remove nils from a sequence?
>
>
user=> (time (remove nil? (repeat 100 nil)))
"Elapsed time: 0.079312 msecs"
()
user=> (time (filter identity (repeat 100 nil)))
"Elapsed time: 0.070249 msecs"
()
Seems like filter is a bit faster, however YMMV
On Nov 16, 4:48 pm, Glen Rubin wrote:
> What is the fastest way to remove nils
On 17 November 2010 12:37, wrote:
> user=> (time (filter identity [ nil 1 2 nil 4]))
> "Elapsed time: 0.053219 msecs"
> (1 2 4)
>
> user=> (time (remove nil? [ nil 1 2 nil 4]))
> "Elapsed time: 0.065092 msecs"
> (1 2 4)
>
> Choose the flavor your prefer...
>
> Luc P.
>
Those aren't exactly equiv
(keep identity l) is preferable to (filter identity l)
--
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 po
Thanks Christopher Grand. I really like your scaffold .. would be extremely
handy .. Like david suggested .. it would be a perfect candidate for
inclusion in the clojure.repl
Regarding your bimap implementation, in terms of complexity, I feel, it will
be linear in the number of elements, when acce
Oups.. :)
Stuart Campbell wrote ..
> On 17 November 2010 12:37, wrote:
>
> > user=> (time (filter identity [ nil 1 2 nil 4]))
> > "Elapsed time: 0.053219 msecs"
> > (1 2 4)
> >
> > user=> (time (remove nil? [ nil 1 2 nil 4]))
> > "Elapsed time: 0.065092 msecs"
> > (1 2 4)
> >
> > Choose the fla
Re-oups, Clojure 1.0 to 1.2 upgrade glitch :)
Mark Engelberg wrote ..
> (keep identity l) is preferable to (filter identity l)
>
> --
> 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
>
On Tue, Nov 16, 2010 at 7:18 PM, Sunil S Nandihalli <
sunil.nandiha...@gmail.com> wrote:
> Thanks Christopher Grand. I really like your scaffold .. would be extremely
> handy .. Like david suggested .. it would be a perfect candidate for
> inclusion in the clojure.repl
>
> Regarding your bimap imp
Notice that when I redefined a, I only included one arity. If b were
updated with the fn that a was redefined to, then (b 1 2) should have
thrown an exception. Instead, it used the old definition of a but
within that definition pointed to the new definition of a. This is
internally inconsistent.
On Tue, Nov 16, 2010 at 10:18 PM, Sunil S Nandihalli
wrote:
> Thanks Christopher Grand. I really like your scaffold .. would be extremely
> handy .. Like david suggested .. it would be a perfect candidate for
> inclusion in the clojure.repl
> Regarding your bimap implementation, in terms of comple
ns-unmap isn't typically used. But for durability, we can think of
JVM shutdown/startup as unmapping everything and starting fresh.
Therefore, expected behavior for ns-unmap should be the same as
behavior for deserializing and loading an object after a new JVM
startup. Here's another issue I ran
On Tue, Nov 16, 2010 at 10:52 PM, Alyssa Kwan wrote:
>
> In any case, I am using Github master and I thought I was using 1.2.
> 1.2 has self-references lexically bound, as David Sletten points out,
> which I agree is the correct behavior. But something has happened on
> 1.3 alpha that has changed
Ok, now I get it. The results you included weren't a hypothetical example, you
were simply using a different version of Clojure. So in your 1.3 version, the
second (b 1 2) does return -3?
Are the macro expansions of 'defn' different?
Have all good days,
David Sletten
On Nov 16, 2010, at 10:52
So I get an instance of AbstractComponent (
http://www.igniterealtime.org/builds/tinder/docs/latest/javadoc/org/xmpp/component/AbstractComponent.html)
with the function below, overriding the necessary methods:
(defn get-component
"returns a new component instance with the specified values
na
Would this help?
http://clojure.github.com/clojure/clojure.core-api.html#clojure.core/update-proxy
--
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 mode
More information from Rich himself about "update-proxy" when he first
introduced it. Could not find examples for you except from the Joy of
Clojure book on page 273, but it is very trivial... just like the doc
string sounds.
http://groups.google.com/group/clojure/browse_thread/thread/ed1652132dfa6
On Wednesday, November 17, 2010, Sunil S Nandihalli
wrote:
> Regarding your bimap implementation, in terms of complexity, I feel, it will
> be linear in the number of elements, when accessing the pair via the value ..
> Is that true?
No I use two maps and rmap is O(1) so rmap+get is O(log32 n)
54 matches
Mail list logo
