How can I parameterize stuff in Leiningen's project.clj? For example,
I don't want to put my AWS credentials inside the project file:
...
:aws {:access-key "XX"
:secret-key "Y"}
but instead use some kind of property names that refer to environ
Brilliant. Two good solutions. Thanks.
On 24 Maj, 00:44, Phil Hagelberg wrote:
> On May 23, 6:19 am, Rasmus Svensson wrote:
>
> > (defproject foo 1.0.0
> > ...the usual stuff...
> > :aws {:access-key ~access-key
> > :secret-key ~secret-key}
>
> This is good advice,
There's a survey about future features and focus of Java and the JVM:
http://www.infoq.com/research/priorities-java-jvm
http://www.infoq.com/news/2012/08/priorities-java
As far as I know, from a Clojure perspective, we would like to see
"tail-call optimization" and "tagged numbers" in the JVM. P
The blog http://dev.vaadin.com/wiki/Articles/ClojureScripting
describes how to write a simple Vaadin app in Clojure, using lein-war,
a web.xml with lots of init params, and a custom servlet written in
Java. I realized that it must be possible to get rid of the Java
servlet class that the blogger su
I have the same problem, using an unmodified clojurescript checkout
(08db38f) with nodejs 0.4.10 on MacOSX 10.6.8.
$ cat nodehello.cljs
(ns nodehello)
(defn -main [& args]
(println (apply str (map [\ "world" "hello"] [2 0 1]
(set! *main-cli-fn* -main)
$ bin/cljsc nodehello.cljs
'{:optimiza
OK, good. Now, say you're sorry if you offended him. -"I'm sorry if I
offended you." And you, say you're sorry if you over-reacted. "I'm
sorry if I over-reacted." Very good. Now, shake hands. Good. I love
you both. You should love each other too. You'll need each other
later.
--
Father of three bo
I have data that I would like to represent as a non-binary tree, or perhaps
a graph, but I'm not sure how to do that. The sample data looks like this:
A->B
B->C,D
C->E
D->E
Here the number of subnodes from B are just two, but they may be any number,
which is the source of my confusion. Binary tre
Thanks. That looks very interesting.
> ;; adjacency list
> {:a [:b] :b [:c :d] :c [:e] :d [:e]}
For some reason, I have trouble constructing this recursively. I seem
to always end up with something like this:
user> (build-tree :a :e)
(:a (:b (:c (:e)) (:d
(:e
(defn build-tree [from to]
(c
from to)
> (map #(build-tree adj % to) (adj from)))})
>
> (build-tree adj :a :e)
>
> Here each node is a map with keys :name and :children. Leaves are nodes with
> empty/nil :children. This doesn't handle cycles, of course.
>
> Justin
>
>
>
>
And get-edges?
On 19 Aug, 20:52, Justin Kramer wrote:
> Here's another way, which constructs a sequence of edges using candidates,
> which are then fed into reduce to build an adjacency list.
>
> (defn candidates->edges [candidates from to]
> (when-let [kids (seq (candidates from to))]
> (c
It works great. Thanks a lot. I had a feeling concat and reduce were
needed; I just couldn't figure out how.
On 19 Aug, 22:10, Justin Kramer wrote:
> Oops, renamed the function: get-edges = candidates->edges.
>
> Justin
>
>
>
>
>
>
>
> On Friday, August
This works fine as well. More to digest. Thanks.
On 19 Aug, 20:06, Benny Tsai wrote:
> This is one way to do it functionally, though it's a bit more verbose.
>
> "get-nodes" performs a BFS walk of the tree between two nodes, returning the
> set of visited nodes:
>
> (defn get-nodes [from to]
>
There's a little toy rabbit called Karotz (karotz.com). It's the
successor of the now discontinued Nabaztag, and it's actively being
developed. Karotz has some cool features such as text-to-speach, voice
recognition, camera, and media player. It can also change color and
move its ears. Lots of fun,
On Tuesday, 10 April 2012 00:15:36 UTC+2, David Nolen wrote:
>
>
> Very neat! Sounds like you just barely made the 64K limit :)
>
It wasn't that bad. The basic "move ears and say something in Spanish"
takes up 33K, so with the fundamentals all set, I hope theres still plenty
of room for some i
14 matches
Mail list logo