[JOB] Senior backend software engineer -- Tokyo or Beijing

# Who we are? A new cryptocurrency derivative trading platform # Techs - Kafka - PostgreSQL - Clojure, Java, Go mixed code # Requirements 1. At least good at one of them Clojure, Java, Go 2. Know CSP

[JOB] Senior backend software engineer -- Tokyo or Beijing

# Who we are? A new cryptocurrency derivative trading platform # Techs - Kafka - PostgreSQL - Clojure, Java, Go mixed code # Requirements 1. At least good at one of them Clojure, Java, Go 2. Know CSP

Re: Why does the `def-` not exist?

That' because you don't know the zen of Clojure core team? the zen it would be more convenient if has 'foo' function in core lib, ok, let's add it. If you and I (not the member of core team) want to give some advice, we will be ignored. On Monday, February 26, 2018 at 4:58:43 PM UTC+8, Pro

Re: [ANN] Git Deps for Clojure!

can `clj` AOT automatically, and then cache it (save to some directory). some dependencies need very long time for `require` On Saturday, January 6, 2018 at 2:49:15 AM UTC+8, Alex Miller wrote: > > Pleased to announce some new functionality for clj and tools.deps! > > https://clojure.org/news/2018

Re: [ANN] Clojure 1.9.0 is now available!

I think is better to add AOT cache to speed up startup time. eg. https://gist.github.com/gfZeng/c4e54ec0381892f78c60f03e7d957a34#file-run-clj-L50 On Saturday, December 9, 2017 at 3:35:39 AM UTC+8, Alex Miller wrote: > > Clojure 1.9 is now available! > > > Clojure 1.9 introduces two major new fea

Re: [ANN] Clojure 1.9.0 is now available!

I think is better to add AOT cache to speed up startup time. eg. https://gist.github.com/sound2gd/dc4dd1e2345949182e258182689c2b2e#file-run-clj-L50 On Saturday, December 9, 2017 at 3:35:39 AM UTC+8, Alex Miller wrote: > > Clojure 1.9 is now available! > > > Clojure 1.9 introduces two major new f

Re: (resolve (symbol f)) works at the REPL but not in an uberjar

That because you REPL had set `*ns*`, when Clojure bootstrap from clojure.main, the *ns* bound to clojure.core On Friday, October 13, 2017 at 9:27:06 AM UTC+8, lawrence...@gmail.com wrote: > > At the REPL, this works perfectly: > > > (defn get-users [] [:susan :kwan]) > > > > (defn what-is-t

[ANN] A lightweight time lib for Clojure(Script)

time.clj is a lightweight lib. 1. extends Date(java.util.Date or js/Date) support `timezone` & 'first-day-of-week` 2. date format supports both Clojure & ClojureScript 3. a lightweight scheduler system, depends on core.async

Re: can clojure java.jdbc function 'result-set-seq' add option tosupportcustom 'result-set-read-column' ?

That good suggestion @ Xiangtao Zhou I think we also can define customized reader/writer in `(create-table-ddl table spec)` ```clojure (create-table-ddl :user [[:name "VARCHAR(32)" {:read identity :wirte identity}]]) ``` On Monday, August 8, 2016 at 6:15:24 AM UTC+8, Sean Corfield wrote: > > Tha

Re: [ANN] Clojure 1.9.0-alpha4

That really cool On Wednesday, June 1, 2016 at 10:17:14 PM UTC+8, Rich Hickey wrote: > > To give people an idea of the update-in and seq destructuring > improvements: > > (let [d3 {:a {:b {:c 2}}}] > (dotimes [_ 10] > (time (dotimes [_ 1000] > (update-in d3 [:a :b :c] in

Treat macro as function at compile time

(defmacro foo [] `(list (defmacro ~'bar [] "nice") (defn ~'bar-fn [] (~'bar (foo) ;; => (#'defcrud.core/bar #'defcrud.core/bar-fn) (bar-fn) ArityException Wrong number of args (0) passed to: core/eval8800/bar--8801 clojure.lang.AFn.throwArity (AFn.java:429) but this working (def

Re: [ANN] CIDER 0.9

leiningen use org.clojure/tools.nrepl 0.2.6 cider-nrepl throw warning On Tuesday, June 16, 2015 at 10:33:48 PM UTC+8, Bozhidar Batsov wrote: > > Hey everyone, > > CIDER 0.9 is finally out! You can read more about the release here > http://batsov.com/articles/2015/06/16/cider-0-dot-9/ > > Enjoy (r

Re: Where should 'if-let-all' macro go?

this if-let-all do not support destructure, I writed a improved https://gist.github.com/gfZeng/8e8e18f148d5742b064c On Tuesday, June 9, 2015 at 8:00:53 PM UTC+8, crocket wrote: > > It evaluates true-case only if every local binding evaluates to true values. > false-case has no access to local bi

Re: any?

some On Sunday, April 26, 2015 at 9:32:09 AM UTC+8, Colin Taylor wrote: > > Any reason why we don't have `any?`. Googled without much luck. > Trivially done as `comp boolean some` not doubt, but I know I use it more > than not-any at least. > It's particularly useful as a composable `or`. > > >

[job] Write Clojure/ClojureScript with us in Boston

jure/ClojureScript is not a requirement, but some sort FP experience is a big plus. Here's our company page <http://www.zensight.co/company/> with our team on it and a more complete description of the job. For some more context, here's an interview <http://nextviewventures.co

Re: Passing a list of unevaluated partial functions

o you know about closures? So something like: >> >> (defn foo [arg1 arg2] >> (fn [state] (do-something-with state arg1 arg2))) >> >> - James >> >> On 25 November 2014 at 18:55, Isaac Karth wrote: >> >>> I'm trying to build a string

Passing a list of unevaluated partial functions

I'm trying to build a string output system with functions that later have a state passed to it, so that I can write something like (output "The result of this example is: " (get :result)) and have it passed to a parsing function that takes a state and calls the functions in the list, something

Re: Deterministic Randomness in Functional Clojure

Thanks for all of the feedback so far, it's been helpful. Mars0i, keeping an RNG for each thing that needs to have an independent random state seems like a good idea for a fallback, and the suggestion of using a different RNG is a good one. It's also helpful to know other people have dealt with

Re: Deterministic Randomness in Functional Clojure

at least that keeps the processing within each cycle deterministic and independent of each others states. I'm definitely open to suggestions on other ways to approach this entire issue. - Isaac [1] Though now that I think about it, I recall that NetHack's codebase is highly procedu

Deterministic Randomness in Functional Clojure

I've been working on some projects (roguelikes, story-generators) that often have a reason to have a random outcome for things like procedurally generating a map. Ideally, they would be deterministically psuduorandom, so that I can generate the same results from the same seed. The part I'm havi

Re: Macro that modifies the body of a function

;;; there is a simple, but not a good way ;;; (deftry foo [x] x) ;;; (:arglists (meta #'foo)) => ([& args__5399__auto__]) (defmacro deftry [name & fdecl] `(defn ~name [& args#] (try (apply (fn ~@fdecl) args#) (catch Error e# (println "err caught" e#) ;;; this is

T-shirts?

front and I would love to buy them in a way that supports Clojure. Isaac -- -- 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

Re: Clojure Performance For Expensive Algorithms

On Wednesday, February 27, 2013 2:46:25 PM UTC-8, Ben Mabey wrote: > > On 2/27/13 9:59 AM, Isaac Gouy wrote: > > (defn blank? [s] (every? #(Character/isWhitespace %) s)) >> >> Have you ever wondered about its performance? >> > > No. Why would I wonder

Re: Clojure Performance For Expensive Algorithms

On Wednesday, February 27, 2013 9:48:15 AM UTC-8, Marko Topolnik wrote: > However, if someone comes along with *(let [m (HashMap.)] (loop > []...(recur (.put m ...)))* claiming that is in fact idomatic, he's just > being unreasonable---by everyone's agreement. > You don't think there are fas

Re: Clojure Performance For Expensive Algorithms

On Wednesday, February 27, 2013 1:13:10 AM UTC-8, Marko Topolnik wrote: > > On Wednesday, February 27, 2013 5:19:20 AM UTC+1, Isaac Gouy wrote: > >> >> If idiomatic Clojure was used... >>> >> >> The problem, of course, is that: the code one-person con

Re: Clojure Performance For Expensive Algorithms

On Tuesday, February 26, 2013 12:50:17 PM UTC-8, Marko Topolnik wrote: > > Again, only the fastest entries are shown. > True, except for the special-case included to show that programs can be made slower (and sometimes more concise) -- the shortest C++ programs. If idiomatic Clojure was used

Re: Clojure Performance For Expensive Algorithms

On Sunday, February 24, 2013 1:45:33 PM UTC-8, Ben Mabey wrote: > > Yeah, I wish the Benchmarks allowed for idiomatic submissions and finely > tuned submissions. > So you wish the benchmarks game website would show, for example, both pi-digits programs that use BigInteger and pi-digits progra

Re: Clojure Performance For Expensive Algorithms

On Sunday, February 24, 2013 9:33:52 AM UTC-8, Marko Topolnik wrote: > > For example, Scala beats Java by a wide margin on some benchmarks. Turns > out it's because it uses JNI to solve the problem with the C bignum > library. > Turns out the benchmarks game website shows both Scala program

Re: A Performance Comparison of SBCL & Clojure

ssembler. > Use profiling tools to find those spots, rather than guessing where you > think they might be. Hand-coded assembler can beat optimized C by a factor > of 2 or more in many cases, but who wants to program in assembler? For > that matter, who wants to write large programs in

HTML documentation

Hi! I know I can type (odoc definst) and get the docs for definst. Is there an HTML version of the documentation for all of the functions and macros in the overtone framework? I can't find any. Thanks! -- You received this message because you are subscribed to the Google Groups "Clojure" grou

Re: [ANN] lein-exec 0.2.0 – Scripting in Clojure

Sean, Ah, you need to call the (-main) function in the script when running it via Jark. We can discuss this issue further on IRC (#jark) or mailing list (https://groups.google.com/group/clojure-jark) - isaac On Tue, Apr 24, 2012 at 9:27 AM, Sean Neilan wrote: > The persistent JVM is what ma

Re: [ANN] lein-exec 0.2.0 – Scripting in Clojure

and compiled to native) and has very minimum runtime dependencies. lein-exec on the other hand spawns a new JVM upon each invocation of the script. lein-exec integrates well with the lein2 ecosystem. - isaac On Tue, Apr 24, 2012 at 6:35 AM, Daniel wrote: > I'm curious.  How does this dif

[ANN] jark 0.4.0

Happy Hacking. Go ahead and give it a try! -- isaac -- 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

What changed 1.2/1.3 to cause this program slowdown?

thread-ring Clojure 1.2 N=50 1.8 secs N=500 7.1 secs N=5000 58.3 secs thread-ring Clojure 1.3 N=50 2.8 secs N=500 25.3 secs N=5000 >1800 secs http://shootout.alioth.debian.org/u64q/program.php?test=threadring&lang=clojure&id=1 chameneos-redux Clojure 1.2 N=50 2.7 sec

Re: Reactions to google dart?

On Oct 11, 7:43 am, Timothy Washington wrote: > I believe this is google's official blog to discuss > and track issues around Dart ... H - "Dart Inside The Unofficial Google Dart Blog" "Dart Inside is an online service from Trifork A/S,

Re: Clojure 1.3 Released

On Sep 23, 2:44 pm, Christopher Redinger wrote: > We are pleased to announce today the release of Clojure 1.3: The chameneos-redux program that now timeout after 30 minutes, previously completely after 100 seconds with Clojure 1.2 The thread-ring programs that now timeout after 30 minutes, pre

Re: Language shoutout clojure code does not have types

On Sep 19, 5:56 am, Ken Wesson wrote: > On Sun, Sep 18, 2011 at 11:20 AM, Andy Fingerhut > > wrote: > > One more detail. The Scala program, and I think all of the fastest programs > > for that problem, use the GNU GMP library for big integer arithmetic. > > If that's true, then it indicates that

Re: Clojure 1.3 Beta 2

On Aug 31, 10:07 pm, Andy Fingerhut wrote: > Isaac, all of the programs that fail with Clojure 1.3 now can be made to > compile and run on both 1.2 and 1.3 by changing a relatively small part of > the programs. > > I have them on my computer (and probably checked into the github

Re: Clojure 1.3 Beta 2

Not surprisingly, some of the benchmarks game programs written for Clojure 1.2 have problems with 1.3 Beta 2. My guess is that small changes to the programs will be required to catch up with the new version, but occasionally program failures have indicated a bug in new versions of other languages.

Re: Clojure Speed performance test

On Aug 18, 7:34 am, Michael Jaaka wrote: > For list reduction it is said to remove every third solder but just > with 1 step they remove 1 soldier. There is something wrong Scully. The author knows, and says that "variant" seemed more interesting. (It should be easy enough to factor out the d

Re: Clojure Speed performance test

On Aug 18, 6:50 am, David Nolen wrote: > The Clojure code posted there is pretty awful and shows a gross, gross > misunderstanding of Clojure data types. I submitted one improved version > already, but didn't spend the time to make it really, really fast. > > For this particular kind of pointles

Clojure Dev: How you can help! (Hint: Alioth Benchmarks)

1) When I saw this posting on Clojure Dev a month ago http://groups.google.com/group/clojure-dev/browse_thread/thread/2abe6d79087af4fc/9030a0b0c15f26a2?hl=en&ie=UTF-8&q=alioth+shootout+clojure&pli=1 I recognised the desire to have some quick and dirty performance regression testing, the Scala dev

Re: nrepl example/tutorial

You can try jark: http://icylisper.in/jark/ Jark provides an nrepl-server and client. The client has a REPL too. - isaac -- 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

Re: [ANN] emacs-clojure-vagrant: a sane development virtual environment

Justin, Sorry about the missing link. Github upload had some issues with Chrome and hence took a while for me to update the latest jark-0.3 binary. It is up now: https://github.com/downloads/icylisper/jark/jark-0.3 -- isaac http://icylisper.in -- You received this message because you are

Re: [clojure-jark-dev] Re: ANN: Jark 0.3 (using the nrepl protocol)

quot; in the same instance of the JVM. It should be integrated in the coming releases. I am not sure of the limitations yet. From the looks of it, classlojure looks usable. Ooops, somehow missed reading your mail in the thread, earlier. -- isaac -- You received this message because you are subsc

Re: ANN: Jark 0.3 (using the nrepl protocol)

> tied to nrepl-server, should ? Couldn't they live in their own library > ? > Laurent, The jark utilities and nREPL server are separate. They just are packaged together for ease of install and use. - isaac -- You received this message because you are subscribed to the Google Groups &q

Re: ANN: Jark 0.3 (using the nrepl protocol)

> Yes, that would explain that.  In any case, all contributors to jark will > need to have CA's lodged before it (or parts of it) can be brought into > Clojure contrib. > http://clojure.org/contributing > - Chas Thanks Chas. Ambrose and myself will send the CA across.

Re: ANN: Jark 0.3 (using the nrepl protocol)

Sure. We need very powerful clojure development and deployment tools. My request for subscription to clojure-dev got declined :( Maybe we can discuss this on clojure-jark google groups: https://groups.google.com/group/clojure-jark -- isaac http://icylisper.in -- You received this message bec

Re: ANN: Jark 0.3 (using the nrepl protocol)

> b) a set of extensible utilities to manage classpaths, namespaces, JVM  both > on Oops. I meant : A set of extensible utilities to manage classpaths, namespaces, JVM etc , remotely. -- isaac -- You received this message because you are subscribed to the Google Groups "Clojure

Re: ANN: Jark 0.3 (using the nrepl protocol)

un on most platforms. It would be nice to have a jark/nREPL plus SLIME/Vim stack. -- isaac http://icylisper.in -- 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

Re: ANN: Jark 0.3 (using the nrepl protocol)

Chas, Thanks for nREPL. It is a very useful tool. -- isaac http://icylisper.in -- 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 -

ANN: Jark 0.3 (using the nrepl protocol)

for valuable ideas and fixes Thats all folks! Hope you find it useful. Screencasts and demos are on the way ... -- isaac http://icylisper.in -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@go

Re: Adding jar to classpath in REPL

aces on a persistent JVM. It gives you a clojure repl as well: jark ns repl NAMESPACE (or simple jark repl [NAMESPACE]) -- isaac http://icylisper.in -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googleg

Re: RabbitMQ

his is a message")) where conn is a connection map. -- isaac http://icylisper.in -- 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 moderate

Re: Anyone want to take a crack at making the fasta shootout program faster?

On Feb 12, 9:51 pm, Michael Gardner wrote: -snip- > Those are all good, but ... Before I pointed out that code size was already shown, you thought just including such a measure would possibly "do the trick" but now that seems not to be good enough for you. > how many people actually look at an

Re: Anyone want to take a crack at making the fasta shootout program faster?

On Feb 12, 1:28 pm, Michael Gardner wrote: > On Feb 12, 2011, at 3:12 PM, Isaac Gouy wrote: > > > Yeah but it's not too hard to see why the Lisp programmer Juho > > Snellman opined on HN "the [sic program] implementations seem to have > > totally di

Re: Anyone want to take a crack at making the fasta shootout program faster?

On Feb 10, 1:41 pm, Bill James wrote: -snip- > The C++ program was evidently deprecated because it did not go through > the process of generating a random character for each character that > it output. The author realized that the pseudo-random-number-generator > had a cycle-length less than 200

Re: Anyone want to take a crack at making the fasta shootout program faster?

Yeah but it's not too hard to see why the Lisp programmer Juho Snellman opined on HN "the [sic program] implementations seem to have totally dived off the deep end of complexity". On Feb 11, 2:28 pm, Andy Fingerhut wrote: > fasta.java-3.java calls the method next(), implementing the linear   > co

Re: Anyone want to take a crack at making the fasta shootout program faster?

for their alternative status would be   > enlightening. > > Thanks, > Andy > > On Feb 10, 2011, at 12:47 PM, Isaac Gouy wrote: > > > On Feb 10, 1:17 am, Bill James wrote: > >>http://shootout.alioth.debian.org/u32/benchmark.php?test=fasta〈=all > > >> The

Re: Anyone want to take a crack at making the fasta shootout program faster?

On Feb 10, 1:17 am, Bill James wrote: > http://shootout.alioth.debian.org/u32/benchmark.php?test=fasta〈=all > > The fastest program shown here is in Java and runs in 1.72 seconds. > However, at the bottom of the page (under "interesting alternative" > programs) there is a C++ program that runs in

Re: only 3 benchmarks game tasks still have no Clojure programs

On Jan 10, 6:27 am, Stuart Halloway wrote: > I notice that the fastest Java version of pidigits uses a native library > named "jpargmp". Is there documentation somewhere that spells out how and > when you are allowed to use native libraries and still claim to be written in > language X? As

Re: only 3 benchmarks game tasks still have no Clojure programs

On Jan 10, 6:27 am, Stuart Halloway wrote: > I notice that the fastest Java version of pidigits uses a native library > named "jpargmp". Is there documentation somewhere that spells out how and > when you are allowed to use native libraries and still claim to be written in > language X? As

Re: only 3 benchmarks game tasks still have no Clojure programs

On Jan 10, 6:27 am, Stuart Halloway wrote: > I notice that the fastest Java version of pidigits uses a native library > named "jpargmp". Is there documentation somewhere that spells out how and > when you are allowed to use native libraries and still claim to be written in > language X? If

only 3 benchmarks game tasks still have no Clojure programs

Only 3 tasks on the computer language benchmarks game still have no Clojure programs - 1) meteor-contest http://shootout.alioth.debian.org/u32q/benchmark.php?test=meteor 2) chameneos-redux http://shootout.alioth.debian.org/u32q/benchmark.php?test=chameneosredux 3) pidigits http://shootout.

Re: benchmarking tipps and tricks

On Nov 21, 3:15 pm, nickik wrote: -snip- > - What are the best tools to benchmark on the jvm (and optimize your > tests) JavaStats http://shootout.alioth.debian.org/help.php#languagex -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to thi

Re: Clojure vs F# performance

On Nov 22, 12:54 pm, Ralph wrote: > That is almost certainly true, since the Microsoft have probably done > extensive optimization on the CLR. > > On Nov 22, 1:18 pm, Mark Engelberg wrote: > > > I doubt that F# Mono benchmarks are representative of F#'s performance on > > Windows. If Microsof

Re: Clojure vs F# performance

On Nov 22, 10:18 am, Mark Engelberg wrote: > I doubt that F# Mono benchmarks are representative of F#'s performance on > Windows. Perhaps they are representative of F#'s performance on Mono on Windows :-) But I wouldn't take a bet on that - performance measurements can be very brittle. -- Y

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Sep 10, 2:22 pm, gary ng wrote: -snip- > My initial comment was all about 'it seems that Haskell submission is > not the typical elegant form' and to me because of the specific you > want to measure, there is no acceptable elegant Haskell form. So what are we to do when there's a problem tha

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Sep 10, 11:54 am, gary ng wrote: > On Fri, Sep 10, 2010 at 11:13 AM, Isaac Gouy wrote: > > Clearly, they did choose "to write all that code" "in order to get a > > much faster program" - I can't tell you if Andy had noticed the > > benchmar

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Sep 10, 10:35 am, gary ng wrote: > On Fri, Sep 10, 2010 at 8:49 AM, Isaac Gouy wrote: > >> Huh ? point ? it was just a casual comment, no point was intended. And > >> I have read some comments by Don that what is in the shoutout is way > >> faster than Data.Has

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Sep 9, 10:15 pm, gary ng wrote: > On Thu, Sep 9, 2010 at 10:04 PM, Isaac Gouy wrote: > > Is there any point speculating about this as outsiders? > > > It was available - Data.HashTable seems to be copyright 2003. > > >http://ogi.altocumulus.org/~hallgren/Prog

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Sep 9, 7:19 pm, gary ng wrote: > On Thu, Sep 9, 2010 at 7:02 PM, Isaac Gouy wrote: > > iirc the Haskell programs, and the Clean programs, and the Pascal > > programs, and ... use translations of the simple hash table used by > > the C programs. > > > If I eve

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Sep 9, 6:06 pm, gary ng wrote: > On Thu, Sep 2, 2010 at 6:07 PM, John Fingerhut > wrote: > > Some of the Haskell submissions are quite long for what they do.  The > > k-nucleotide one, for example, implements a mutable hash table using > > features in Haskell that I had never seen before lo

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Sep 2, 4:51 pm, Isaac Gouy wrote: > On Sep 1, 9:46 pm, John Fingerhut wrote: > > > Thanks to many people on this list in Aug 2009 who helped improve my code, > > to Johannes Friestad for writing a nice fast Clojure program using deftype > > for the n-body problem, t

Re: Shootout "fannkuch"

On Sep 3, 4:24 pm, Miki wrote: > > Fannkuch has required the permutations to be generated in a particular > > order for years because too many programmers contributed programs that > > did not generate some of the permutations or used faster algorithms to > > generate the permutations. > > I've

Re: Shootout "fannkuch"

On Sep 3, 4:24 pm, Miki wrote: > > Fannkuch has required the permutations to be generated in a particular > > order for years because too many programmers contributed programs that > > did not generate some of the permutations or used faster algorithms to > > generate the permutations. > > I've

Re: Shootout "fannkuch"

On Sep 2, 11:01 pm, Miki wrote: > Hello, > > I've tried writing a a solution to shootout "fannkuch" (http:// > shootout.alioth.debian.org/u32/performance.php?test=fannkuchredux), > however I seem to have a bug in the checksum. Is it just the order of > permutations or am I missing something? I

Re: Shootout "fannkuch"

On Sep 2, 11:45 pm, John Fingerhut wrote: > Most likely.  That one I found somewhat annoying in that the checksum > computation does depend upon the permutations being generated in a > particular order. Fannkuch has required the permutations to be generated in a particular order for years becau

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Sep 2, 5:28 pm, Sean Corfield wrote: > On Wed, Sep 1, 2010 at 9:46 PM, John Fingerhut > wrote: > > You can see a brief summary of results comparing > > run time, memory, and code size against "Java 6 -server" here: > >http://shootout.alioth.debian.org/u32/benchmark.php?test=all〈=clo... > >

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Sep 1, 9:46 pm, John Fingerhut wrote: > Thanks to many people on this list in Aug 2009 who helped improve my code, > to Johannes Friestad for writing a nice fast Clojure program using deftype > for the n-body problem, to Isaac Gouy for setting up the shootout web site > to ac

Re: Clojure 1.2 and the Computer Language Benchmarks Game

exdna&lang=clojure&id=2 http://shootout.alioth.debian.org/u32q/program.php?test=knucleotide&lang=clojure&id=1 > > Andy > > On Thu, Aug 26, 2010 at 12:26 AM, Meikel Brandmeyer wrote: > > Hi, > > > On 26 Aug., 07:58, Isaac Gouy wrote: > > > >

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Aug 26, 12:26 am, Meikel Brandmeyer wrote: > Hi, > > On 26 Aug., 07:58, Isaac Gouy wrote: > > > Have you actually measured the time difference? If you have measured the time difference with/without AOT compilation then apparently you don't wish to share thos

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Aug 25, 10:31 pm, Meikel Brandmeyer wrote: > Hi, > > On 26 Aug., 05:37, Isaac Gouy wrote: > > > 1) The command line requested for these first programs doesn't AOT > > compile so the measured time includes compiling the program. > > Which makes the comparis

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Aug 25, 6:17 am, John Fingerhut wrote: > I will try submitting one or a few of my benchmark programs created 1 year > ago. > > For anyone that wants to look at some timing results and/or my source code > used to achieve them before then, they are available on github here: > > http://github.co

Re: Clojure 1.2 and the Computer Language Benchmarks Game

g a particular design goal. After so many people have contributed programs for binary-trees in so many languages, I had been assuming it was kind-of easy. > Time to move on to something productive. > > On Aug 24, 11:17 am, Isaac Gouy wrote:> On Aug 24, > 9:50 am, ataggart wrote

Re: Clojure 1.2 and the Computer Language Benchmarks Game

r addition and one integer subtraction per node take a significant amount of time? > > On Aug 24, 5:55 am, Isaac Gouy wrote: > > > On Aug 23, 7:07 pm, ataggart wrote: > > > > It's never been clear to me exactly what the code is supposed to be > > > do.

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Aug 24, 9:58 am, Nicolas Oury wrote: > On Tue, Aug 24, 2010 at 5:33 PM, Isaac Gouy wrote: > > > Well when Clojure 1.3 is released... > > > The phrase "idiomatic code" often seems to be used to mean - code > > written in a natural way for that langu

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Aug 24, 8:48 am, Stuart Halloway wrote: > > On Aug 24, 6:44 am, Stuart Halloway wrote: > >> Clojure 1.3's performance improvements will significantly impact perf on > >> some of the benchmarks. If you are trying these out, please try them on > >> both 1.2 and 1.3. > > > Has Clojure 1.3 bee

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Aug 24, 6:44 am, Stuart Halloway wrote: > Clojure 1.3's performance improvements will significantly impact perf on some > of the benchmarks. If you are trying these out, please try them on both 1.2 > and 1.3. Has Clojure 1.3 been released? > Also: the benchmarks are totally a numbers ga

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Aug 23, 7:35 pm, Robert McIntyre wrote: > I hear you --- I got excited about this too, and implemented the fannuchredux > algorithm, only to be thwarted by an undocumented "checksum" each > program is also > supposed to calculate.  This checksum depends heavily on the exact > order in which >

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Aug 23, 7:07 pm, ataggart wrote: > It's never been clear to me exactly what the code is supposed to be > do. For example, the "spec" for the binary-tree test is so wholly > lacking in any details that I'm left to infer that one is supposed to > copy an implementation used previously, though w

Clojure 1.2 and the Computer Language Benchmarks Game

Now Clojure 1.2 has been released, Clojure programs will be included in the Computer Language Benchmarks Game. If you'd like to contribute Clojure programs, please follow the step- by-step http://shootout.alioth.debian.org/help.php#contribute -- You received this message because you are subscri

Re: AOT compilation newbie mistakes

On Aug 22, 4:28 pm, Robert McIntyre wrote: > oh yes -- please don't do it manually for anything "production" > > But, it's good to know what's actually going on behind the scenes, > especially when things stop working :) For my simple needs - java -cp .:clojure.jar -Dclojure.compile.path=

Re: AOT compilation newbie mistakes

On Aug 22, 3:06 pm, Robert McIntyre wrote: > I feel like a lot of people have trouble with this (I certainly do!) > so I made this tutorial with working examples to follow. Thanks $ /usr/local/src/jdk1.6.0_18/bin/java -cp .:clojure.jar - Dclojure.compile.path=. clojure.main Clojure 1.2.0 user

Re: AOT compilation newbie mistakes

On Aug 22, 3:06 pm, Robert McIntyre wrote: > I feel like a lot of people have trouble with this (I certainly do!) > so I made this tutorial with working examples to follow. > this is by default the $PROJECT-DIR/classes folder Is there a way to set that default to something else? Maybe using

AOT compilation newbie mistakes

$ /usr/local/src/jdk1.6.0_18/bin/java -cp .:clojure.jar clojure.main Clojure 1.2.0 user=> (compile 'clojure.examples.hello) java.io.IOException: No such file or directory (hello.clj:1) $ ls clojure/examples hello.clj $ cat clojure/examples/hello.clj (ns clojure.examples.hello (:gen-class))

Re: Response

pection (to me) exactly what a convolution is. > > -Fred > > -- > Science answers questions; philosophy questions answers. > > On Jul 17, 2010, at 3:43 PM, Isaac Hodes wrote: > > > > > double convolve(double *xs, double *is, double *ys){ > >  int i,j; > &

Response

Thanks everyone for the input! I've also got some nice replies on Stack Overflow – there's some sort of a discussion there as well. I thought I'd add my voice to the crowd. First off, purely imperative C is fairly elegant itself. I've made it a simple function (along with the Python version on the

Re: A functional, efficient, convolution function. Is imperitive-style the answer?

On Jul 16, 11:26 pm, Frederick Polgardy wrote: > Where's the link? :) > > -Fred Whew. Here it is; my bad! http://stackoverflow.com/questions/3259825/trouble-with-lazy-convolution-fn-in-clojure -- You received this message because you are subscribed to the Google Groups "Clojure" group. To p

A functional, efficient, convolution function. Is imperitive-style the answer?

I posted this on StackOverflow yesterday, but to no avail: I don't think many people looked at it, or least I didn't get much feedback. I am trying to create a lazy/functional/efficient/Clojuresque function to carry out convolution on two lists/vectors of (ideally BigDecimals but that may be ineff

  1   2   >