I need UUIDs in my CLJS code…
cljs.core does include a UUID type, but no generator.
I found a couple of efforts and example code at
https://github.com/davesann/cljs-uuid and
http://catamorphic.wordpress.com/2012/03/02/generating-a-random-uuid-in-clojurescript,
but they didn't work with cljs.cor
ok. I've had some time to look into this now and have figured out a few
things.
1. This is not due to calling the DGrid constructor from clojurescript. It
occurs even when I call the DGrid constructor from straight javascript
code. So it doesn't have to do with the clojurescript code calling th
Thanks for the response. Although ClojureScript/One uses google closure but
the framework only uses it to access browser features and not for how the
application components are organized.
What I don't like about javascript frameworks is that they all have an OO
twist to them that make things more
... so the main problem seems to be chunked vs. unchunked sequences in
corecursion.
I read a bit into "chunked sequences" and so far it seems that a sequence
is either chunked with size 32 or unchunked. So a "rechunk" of variable
size seems of no use. Instead I found an "unchunk" at stackoverfl
Well since Clojurescript, and by extension Clojurescript One was built on
top of Google Closure, I guess you could use that. I know the history
features from Clojurescript One use are a thin layer over the existing
history features in Google Closure. The problem with Google Closure is
that it
Am 28.11.12 23:10, schrieb Vladimir Tsichevski:
Is it possible?
See exposes-methods in documentation for gen-class.
http://clojure.github.com/clojure/clojure.core-api.html#clojure.core/gen-class
Kind regards
Meikel
--
You received this message because you are subscribed to the Google
Groups "
Is it possible?
--
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, sen
Hi Clojure Users,
while reading through http://natureofcode.com/book i tried to implemented
some of the samples in clojure. One of them implements a sample
ParticleSystem and uses Polymorphism to model state an behavior of
different ParticleTypes. I have come up with this two solutions
Solut
And now I have a Christmas gift for my father in law. Cool product ( and
keep using Clojure! ).
On Wed, Nov 28, 2012 at 11:06 AM, Wyatt Niehaus wrote:
> New York based artist Bradley Pitts is looking to hire a programmer to
> continue the development of the Yearlight Calendar (
> www.yearlightc
New York based artist Bradley Pitts is looking to hire a programmer to
continue the development of the Yearlight Calendar (
www.yearlightcalendar.com), a custom, made-to-order calendar that registers
the duration of daylight, twilight, and moonlight for every day of the year
for a given locat
Am Mittwoch, 28. November 2012 16:42:32 UTC+1 schrieb Christophe Grand:
>
> Hi Ulrich,
>
> Wow, you got me scratching my head because your code should not even work.
> The problem I see with it is that your recursion has no base case. You
> have to know that 2 is prime to boot the algorithm. Eg
A more succinct test case:
user=> (def escher-seq (lazy-seq (lazy-seq (if (seq escher-seq) nil (list
42)
#'user/escher-seq
user=> escher-seq
(42)
thus escher-seq is not empty because it is empty :-)
On Wed, Nov 28, 2012 at 4:42 PM, Christophe Grand wrote:
> Hi Ulrich,
>
> Wow, you got me sc
A JMX client with a file system style. You use ls to check all the mbeans,
use cd to go down one level, and use cat to check the attribute value of a
mbean's attribute.
In jmx-repl the following jmx bean:
java.lang:type=MemoryPool,name=CMS Old Gen
translates to the following path:
/java.lan
Hi Ulrich,
Wow, you got me scratching my head because your code should not even work.
The problem I see with it is that your recursion has no base case. You have
to know that 2 is prime to boot the algorithm. Eg
(def primes
(cons 2
(filter
(fn isprime[n]
(every?
#(po
Hello,
I tried to define the sequence of primes via corecursion,
with trial divisions by primes p with p*p<=n,
finally arriving at following code.
(def primes
(filter
(fn isprime[n]
(every?
#(pos? (mod n %))
(take-while #(<=(*%%)n) primes)
)
)
(iterat
I wrote a wrapper for the Apache Cordova (Phonegap) API recently, so that
it could be used with ClojureScript. I got Hello World, etc up and running
without much fuss. There are however two issues:
1. Also a slow start-up time, since Phonegap already has resources to load,
and then a large JavaScr
2012/11/27 John Gabriele
> Hm. I need to read up on what the dex is, and why one would want to dex
> it. :)
Dex is the utility transforming java byte code to dalvik executable
bytecode, that can run on android. It's written in java so can be applied
to itself.
I remember a blog article some tim
17 matches
Mail list logo
