reify

I am trying to implement a huge Java interface with numerous (~50) getter and setter methods (some with irregular names). I thought it would be nice to use a macro to reduce the amount of code. So instead of (def data (atom {:x nil})) (reify HugeInterface (getX [this] (:x @data)) (setX [this v] (swap! data assoc :x v))) I want to be able to write (def data (atom {:x nil})) (reify HugeInterface (set-and-get getX setX :x)) Is this set-and-get macro (or something similar) possible? I haven't been able to make it work. (Updated with a second approach -- see below the second horizontal rule -- as

Here is a quicksort algorithm for numbers written in Clojure. It is basically the quicksort algorithm found in "The Joy of Clojure" , 2nd edition, page 133. I modified it slightly for (hopefully) better readability, because the original felt a bit too compact: (defn qsort-inner [work] (lazy-seq (loop [loopwork work] (let [[ part & partz ] loopwork ] (if-let [[pivot & valuez] (seq part)] (let [ smaller? #(< % pivot) smz (filter smaller? valuez) lgz (remove smaller? valuez) nxxt (list* smz pivot lgz partz) ] (recur nxxt)) (if-let [[oldpivot & rightpartz] partz] (cons oldpivot (qsort-inner

Say I have the following: data Rec = Rec { alpha :: Int, beta :: Double, phi :: Float } sample = Rec 1 2.3 4.5 I understand Template Haskell & the reify function can get me the record's field names. That is: print $(f sample) --> ["alpha", "beta", "phi"] There is also a claim that this can be done without Template Haskell. Can someone provide an example implementation for this can be accomplished? It can be done with a Data (most GHC versions) or Generic (7.2.x and up) instance, which GHC can derive for you. Here's an example of how to dump record fields with the Data typeclass: {-# LANGUAGE