Sean Corfield s...@corfield.org writes:
On 8/18/15, 3:04 PM, Phillip Lord clojure@googlegroups.com on behalf of
phillip.l...@russet.org.uk wrote:
There *is*, however, an issue with use of many parts of the Clojure
Ecosystem.
Even if the Clojure/core definition extended to Contrib
Hi,
I have transformed JSON response into the equivalent data structure using
Cheshire library.
The result is a huge nested data structure , mostly vectors and maps. It is
actually a tree.
How to find a property that is nested deep inside the tree ? For example
I'm search for the node that
JFYI, it’s looking good in plain text.
On 19 Aug 2015, at 16:22, Richard Möhn richard.mo...@posteo.de wrote:
Apologies to those reading this as plain text. I had forgotten how horrible
Google Groups' rendering is.
--
You received this message because you are subscribed to the Google
I designed a indentation-based syntax for my toy language and used it to
generate JavaScript. It's named Cirru.
You can find more about that at:
http://cirru.org/
http://repo.cirru.org/parser/
Comparing to JavaScript, I really love Clojure better. Or I may mean
ClojureScript.
As I started
Hi Dan,
Could you share your email on which we could send our details. I assume any
replies on this thread are posted to the full community.
Thanks,
Murtaza
On Friday, July 31, 2015 at 1:16:24 AM UTC+5:30, Dan McLaughlin wrote:
Wanted to check in to see if it was OK to post any Clojure job
If you want more specific answers, you'll need to describe the
structure of your tree. In particular, what is the relationship
between your conceptual nodes and your data structures (vectors and
maps)?
On 19 August 2015 at 17:26, Andy- andre.r...@gmail.com wrote:
I have yet to evaluate it myself
Hi Hussein,
A combination of filter and tree-seq might do what you need.
Marc
On 19 August 2015 at 15:18, Hussein B. hubaghd...@gmail.com wrote:
Hi,
I have transformed JSON response into the equivalent data structure using
Cheshire library.
The result is a huge nested data structure ,
Each node is represented as map:
{prop1 prop2 prop3 children}
children is a vector of nested nodes
[
prop1
prop2
children
[
{prop1 prop2 children []}
{prop1 prop2 children [{new-node} {new-node} ... {another-node}]
]
[
{prop1 prop2 children []}
{prop1 prop2 children [{new-node}
I have yet to evaluate it myself but this might do help you:
https://github.com/nathanmarz/specter
On Wednesday, August 19, 2015 at 10:18:06 AM UTC-4, Hussein B. wrote:
Hi,
I have transformed JSON response into the equivalent data structure using
Cheshire library.
The result is a huge
Here is more concrete example
(def s [{n {id a} d 2 children [{n {id c} d 4 children
nil}]} {n {id b} d 3 children nil}])
I want to find the map that has value c for id. If found, I need to
return the map {n {id c} d 4 children nil}
On Wednesday, August 19, 2015 at 5:36:42 PM UTC+2, Gary
On Wednesday, August 19, 2015 at 9:33:13 AM UTC-4, Phillip Lord wrote:
It would be interesting to do a survey of license use. I am sure EPL is
common, partly because Clojure uses it, and partly because leiningen
puts it in as the default (bad leiningen!).
Interesting aside, I see that
As a relative Clojure novice I'm finding Lisp's s-expressions provide a
simplified debugging experience, Java stacktraces aside, unparallelled
in any other language I've come across. I was recently having trouble
with this function:
(defn shared-aspects [my-id your-id]
(for [[{left :l right
I'm happy announce the release of version 2.0.0 of
https://github.com/expez/superstring, a string manipulation library.
The most notable change in 2.0.0 is the addition of clojurescript support.
To read about the other changes check out:
I've found that using core.async in one of my projects results in the
entire DOM getting replaced with an empty iframe when I view the site in
Firefox. I'm using
[org.clojure/clojure 1.7.0]
[org.clojure/clojurescript 1.7.48]
[org.clojure/core.async0.1.346.0-17112a-alpha]
I've tried
I know this has been asked before, but Google is interpreting
HttpInputOverHTTP as Http Input Over HTTP which renders it useless for
finding conversations that are specific to the HttpInputOverHTTP class.
(off topic: I wish there was a good search engine for software terms).
I've a simple web
No idea what HttpInputOverHTTP is but I'd guess that it is an InputStream
implementation.
Try (slurp (:body request))
HTH,
/thomas
On Wednesday, August 19, 2015 at 9:57:57 PM UTC+2, Lawrence Krubner wrote:
I know this has been asked before, but Google is interpreting
HttpInputOverHTTP as
If I were you, I would reach into my toolbox for
https://github.com/ztellman/byte-streams - worth a try
On Wednesday, 19 August 2015 20:57:57 UTC+1, Lawrence Krubner wrote:
I know this has been asked before, but Google is interpreting
HttpInputOverHTTP as Http Input Over HTTP which renders
Would you mind pasting the rest of your dependencies? This is the most
curious of puzzles and I'd love to know the answer - but I'm really stumped
so please provide the next clue!
On Wednesday, 19 August 2015 19:32:22 UTC+1, Daniel Higginbotham wrote:
I've found that using core.async in one
On 19 Aug 2015, at 18:08, Hussein B. hubaghd...@gmail.com wrote:
Here is more concrete example
(def s [{n {id a} d 2 children [{n {id c} d 4 children
nil}]} {n {id b} d 3 children nil}])
I want to find the map that has value c for id. If found, I need to
return the map {n {id c} d 4
core.async has nothing to do with the DOM, so I don't know how this could
happen.
On Wed, Aug 19, 2015 at 3:00 PM, Malcolm Sparks malc...@juxt.pro wrote:
Would you mind pasting the rest of your dependencies? This is the most
curious of puzzles and I'd love to know the answer - but I'm really
Hi,
I needed a function that partitions (coll a) = (coll (coll a)), starting a new
subcoll whenever a given pred is true. Use case: I have a sequence of rows;
these rows form groups; I want to group them. A group is started by a header;
so I want a new coll whenever my is-header? pred returns
Off subject. Just going to throw it out there that HttpInputOverHTTP looks like
a CamelCase naming convention gone wrong. Id like to hear why it was named that
way. :)
--
You received this message because you are subscribed to the Google
Groups Clojure group.
To post to this group, send email
Here you go!
[[org.clojure/clojure 1.7.0]
[org.clojure/clojurescript 1.7.48]
[org.clojure/core.async0.1.346.0-17112a-alpha]
[adzerk/bootlaces 0.1.11 :scope test]
[adzerk/boot-reload0.3.1 :scope test]
[pandeiro/boot-http0.6.3
Apologies to those reading this as plain text. I had forgotten how horrible
Google Groups' rendering is.
--
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
This project was announced three months ago as a ‘Common Clojure Source
Metadata Model’. You might also have read about it
http://us4.campaign-archive1.com/?u=a33b5228d1b5bf2e0c68a83f4id=52f3bba560
in the Clojure Gazette. It is now called Grenada
https://github.com/clj-grenada/grenada-spec and
Laurens,
I don't think I've encountered an identical function I can point you to,
but here's an alternative implementation:
(defn partition-when [pred coll]
(lazy-seq
(when-let [[h t] (seq coll)]
(let [[run remains] (split-with (complement pred) t)]
(cons (cons h run)
26 matches
Mail list logo
