blog.darevay.com
Along Came Betty » clojure
http://blog.darevay.com/category/clojure
You know, software and some other stuff like maybe guitar or something. Archive for the ‘clojure’ Category. Clawk = Awk cut with Clojure. March 3rd, 2013. I know Clojure pretty well. I don’t know Awk. Quite as well and don’t need it quite enough to ever learn it deeply. I don’t want Perl either. I’d rather just write Clojure code for simple text processing. So, lately I’ve been using Clawk. It works for me. Bad idea, or worst idea? Echo -e "1 n2 n3 n" clawk -r '(* $ $)' 1 4 9. March 20th, 2012. Notes and...
clj-me.blogspot.com
Clojure and me: February 2009
http://clj-me.blogspot.com/2009_02_01_archive.html
When the pupil is ready to learn, a teacher will appear. Monday, February 23, 2009. This post has moved, go to its new location. Now that fully lazy sequences are in the trunk,. User= (def s (map #(do (println %) %) (range 10) ). User= (def d (drop 1 s). User= (def r (rest s). As one can see. Needs to realize the first element of s while. Doesn't. The corollary is that. Holds on the whole seq (including the nth first elements) while. Computes the first element and then discards it. Follow me on Twitter!
clj-me.blogspot.com
Clojure and me: June 2009
http://clj-me.blogspot.com/2009_06_01_archive.html
When the pupil is ready to learn, a teacher will appear. Monday, June 8, 2009. Linear Interpolation and sorted-map. This post has moved, go to its new location. Can help when working with a partition of disjoint intervals, eg when you need to interpolate. Takes a coll of 2D points (vectors) and returns. Their linear interpolation function.". Let [m (into (sorted-map) points)]. Let [ [x1 y1] (rsubseq m. X2 y2] (subseq m x)]. Y1 (* (- x x1) (/ (- y2 y1) (- x2 x1) ). 0 1/2 1 5/4 3/2 7/4 2 5/2 3).
clj-me.blogspot.com
Clojure and me: May 2009
http://clj-me.blogspot.com/2009_05_01_archive.html
When the pupil is ready to learn, a teacher will appear. Sunday, May 17, 2009. The Need for More Lack of Understanding. This post has moved, go to its new location. By Gilad Bracha echoed with my experience designing two small internal DSL in Clojure ( Moustache. It's not the same kind of non-understanding which I have in mind. I'm talking about a macro/DSL being able to not understand what is passed to it. 8212; thanks to MB's comment. That's why in Enlive you can easily add your own selectors step.
clj-me.blogspot.com
Clojure and me: July 2009
http://clj-me.blogspot.com/2009_07_01_archive.html
When the pupil is ready to learn, a teacher will appear. Thursday, July 30, 2009. Everybody loves the Sieve of Eratosthenes. This post has moved, go to its new location. If I judge by traffic logs for this blog, many newcomers want to compute prime numbers in Clojure. A recent thread on the mailing list. Prompted me to test an idea I had for a while: to use a map to implement the Sieve of Eratosthenes. The first implementation was this one:. Let [enqueue (fn [sieve n factor]. Let [m ( n factor)]. N p (wh...
clj-me.blogspot.com
Clojure and me: August 2008
http://clj-me.blogspot.com/2008_08_01_archive.html
When the pupil is ready to learn, a teacher will appear. Wednesday, August 20, 2008. This post has moved, go to its new location. Six weeks since last post. Relocating to my hometown. And a trip to Corsica caused me to stay offline for too long. I'll be back online soon (as soon as I get a working DSL link and a nearly empty inbox). BTW, I'm available for contract work from September on. Posted by Christophe Grand. Subscribe to: Posts (Atom). Fr) (contact info at the bottom). View my complete profile.
clj-me.blogspot.com
Clojure and me: October 2008
http://clj-me.blogspot.com/2008_10_01_archive.html
When the pupil is ready to learn, a teacher will appear. Wednesday, October 29, 2008. This post has moved, go to its new location. Lazy-cat [0 1] (map fib-seq (rest fib-seq) ). Posted by Christophe Grand. Wednesday, October 22, 2008. Clojure Golf: subsets-by-card (2). This post has moved, go to its new location. I wasn't happy with the last one. At least this one is lazier and in increasing cardinality order. Reduce (fn [ssbc x]. Map (fn [a b] (concat a (map #(conj % x) b) ). Reduce (fn [ssbc x]. Follow ...
old.n01se.net
Chouser
http://old.n01se.net/chouser
Has put on this page. Things I'm doing these days. The Joy of Clojure. A book I helped write. Things I keep meaning to get back to. Finger trees in Clojure. C context for Vim. A couple talks I've given.
clj-me.blogspot.com
Clojure and me: Linear Interpolation and sorted-map
http://clj-me.blogspot.com/2009/06/linear-interpolation-and-sorted-map.html
When the pupil is ready to learn, a teacher will appear. Monday, June 8, 2009. Linear Interpolation and sorted-map. This post has moved, go to its new location. Can help when working with a partition of disjoint intervals, eg when you need to interpolate. Takes a coll of 2D points (vectors) and returns. Their linear interpolation function.". Let [m (into (sorted-map) points)]. Let [ [x1 y1] (rsubseq m. X2 y2] (subseq m x)]. Y1 (* (- x x1) (/ (- y2 y1) (- x2 x1) ). 0 1/2 1 5/4 3/2 7/4 2 5/2 3). I'm a free...
