2010-11-14
| 00:20 | pppaul | $fortune |
| 00:20 | sexpbot | You will yawn in 5 seconds. |
| 00:20 | pppaul | $fortune |
| 00:20 | sexpbot | You will yawn in 5 seconds. |
| 00:20 | pppaul | $8ball is $fortune broke? |
| 00:20 | sexpbot | pppaul: Concentrate and ask again. |
| 00:21 | johndeo | $fortune |
| 00:21 | sexpbot | one day sexpbot will have a large fortune database |
| 00:22 | pppaul | i gave it some cookies |
| 00:22 | pppaul | what gives |
| 00:23 | pppaul | $fortunecookie |
| 00:23 | pppaul | $fortune cookie |
| 00:23 | sexpbot | You will yawn in 5 seconds. |
| 00:23 | pppaul | hmph |
| 00:23 | johndeo | $fortune |
| 00:23 | sexpbot | You will yawn in 5 seconds. |
| 00:48 | johndeo | ##(assoc-in nil [:a :b :c] 1) |
| 00:48 | sexpbot | ⟹ {:a {:b {:c 1}}} |
| 00:49 | johndeo | ##(assoc-in nil [:a :b :c] :foo) |
| 00:49 | sexpbot | ⟹ {:a {:b {:c :foo}}} |
| 00:49 | johndeo | Can anyone tell me how to read the :foo out of there? |
| 00:51 | johndeo | ({:a {:b {:c :foo}}} :b) |
| 00:51 | johndeo | ##({:a {:b {:c :foo}}} :b) |
| 00:51 | sexpbot | ⟹ nil |
| 00:53 | johndeo | ##({:a {:b {:c :foo}}} :a) |
| 00:53 | sexpbot | ⟹ {:b {:c :foo}} |
| 00:56 | amalloy | johndeo: ##(get-in {:a {:b {:c :foo}}} [:a :b :c]) |
| 00:56 | sexpbot | ⟹ :foo |
| 00:57 | sproust | Anybody know what happened to with-out-writer? |
| 00:58 | sproust | (Porting some code to the bleeding edge, lots of stuff moved.) |
| 01:01 | johndeo | ##(def deephash (assoc-in nil [:a :b :c :d] '(:a :b :c :d))) |
| 01:01 | sexpbot | java.lang.SecurityException: You tripped the alarm! def is bad!1 |
| 01:01 | johndeo | oops |
| 01:02 | johndeo | amalloy: Oh! Thanks. |
| 01:03 | replaca | sproust: you have to use (with-open [w (writer "xxx")] (binding [*out* w] ...)), I think |
| 01:04 | replaca | sproust: with-out-writer was considered to do too many things at once to migrate to core |
| 01:04 | sproust | replaca: thanks. |
| 01:05 | sproust | I'll redo the macro in my code-- it's very useful. |
| 01:05 | sproust | What you wrote above is long enough for me to create an abstraction. |
| 01:08 | sproust | replaca: I now get "Evaluation aborted" on evaluating (ns) directives instead of errors. Is there a fix? |
| 01:09 | LauJensen | Morning all ya'll |
| 01:09 | replaca | sproust: I don't know. I haven't seen that prob. |
| 01:10 | replaca | Morning Lau. Congrats on all the CQL progress |
| 01:11 | replaca | Lau: for the record, I vote for select, et al. rather than shadowing core stuff |
| 01:11 | LauJensen | replaca: thanks, and thanks for your input |
| 01:11 | LauJensen | Reading the official Wiki on library design, it occured to me that shadowing core was encouraged when there are parallel semantics |
| 01:12 | LauJensen | Why would you prefer I didnt do it ? |
| 01:14 | replaca | LauJensen: to me it only works if the semantics are *really* identical. And the I'd rather get all the way to implementing the same underlying protocol. Plus, the semantic model of SQL is already very familiar, so hiding it seems like obfuscation |
| 01:15 | pppaul | show me some CQL |
| 01:15 | LauJensen | @(conj! users {:name "Jack"}) |
| 01:15 | LauJensen | >>> ({:id 1 :name "Lau"} {:id 2 :name "Christophe"} {:id 3 :name "Frank"} {:id 4 :name "Jack"}) |
| 01:15 | LauJensen | |
| 01:15 | LauJensen | (-> (table {} :users) |
| 01:15 | LauJensen | (select (where (= :admin true))) |
| 01:15 | LauJensen | (aggregate [:count/* :country])) |
| 01:15 | LauJensen | >>> "SELECT users.country,count(users.*) FROM users WHERE (admin = true) GROUP BY country" |
| 01:15 | LauJensen | |
| 01:15 | LauJensen | @(join users visitors :id) ; USING(id) |
| 01:15 | LauJensen | >>> ({:id 1 :name "Lau" :guest "false"} {:id 3 :name "Frank" :guest "true"}) |
| 01:15 | LauJensen | |
| 01:16 | LauJensen | pppaul: the rest is here https://github.com/LauJensen/clojureql on the front-page, scroll down |
| 01:16 | replaca | LauJensen: but it's important to note that my vote doesn't come from any direct experience with CQL itself |
| 01:16 | LauJensen | replaca: The official way, is not to shadow when the semantics are identical, but parallel. In this case, clojure.set is an implementation of relational algebra and so is CQL. Main difference is CQL puts the results in a database |
| 01:16 | LauJensen | This is more of a library design issue than a SQL issue |
| 01:17 | sproust | That's very cool! Not so much as a replacement for SQL's syntax, but as a way to generate queries programmatically! |
| 01:17 | LauJensen | However - The semantics are very parallel, the primitives are identical. So I figured a familiar interface like conj/disj/sort/take etc would be great - no learning curve |
| 01:17 | pppaul | so, sometimes CQL wraps SQL, and sometimes you have to use SQL as text? |
| 01:17 | LauJensen | sproust: exactly |
| 01:17 | replaca | LauJensen: yeah, I get that. You asked for my preference :). I would always be looking through to the generated code :) |
| 01:18 | LauJensen | pppaul: CQL always wraps SQL, but if you want, I let you escape our syntax with strings so tht you can write raw sql. shouldnt be necessary |
| 01:18 | pppaul | it looks cool... how many public symbols are there? |
| 01:19 | LauJensen | pppaul: https://github.com/LauJensen/clojureql/blob/master/src/clojureql/core.clj#L21 those listed in the protocol definition, + a contructor, table? and where |
| 01:21 | pppaul | ^_^ |
| 01:22 | sproust | Hmmm... bleeding-edge SLIME w/ bleeding-edge swank w/ Bleeding-edge Clojure = broken. Errors don't trickle back up to Emacs. |
| 01:22 | sproust | "error in process filter" |
| 01:23 | sproust | G'night folks! |
| 01:24 | amalloy | aww. missed my chance to tell him there's a reason they call it bleeding-edge |
| 01:24 | pppaul | too much bleeding |
| 01:32 | quizme | how do you do a deep merge of two maps with conj ? |
| 01:38 | quizme | http://www.pastie.org/1296480 |
| 01:49 | LauJensen | Can anybody think of a good name for the CQL equivalent of with-results ? |
| 01:50 | quizme | nm, i found it: clojure.contrib.map-utils/deep-merge-with |
| 01:52 | tonyl | i was looking for it in contrib figure there might be something |
| 01:52 | tonyl | cool |
| 01:55 | tonyl | with-records ? maybe |
| 01:58 | tonyl | how does this work ##(let [{a :a, b :b, c :c, :as m :or {a [2 3] b [3 4]}} {:a [5 6] :c [6 7]}] [a b c m]) |
| 01:58 | sexpbot | ⟹ [[5 6] [3 4] [6 7] {:a [5 6], :c [6 7]}] |
| 01:59 | tonyl | i know it is destructuring |
| 01:59 | tonyl | but one map has the keys as symbols and are not even quoted |
| 02:07 | pppaul | :as / |
| 02:07 | pppaul | :as ???? |
| 02:08 | pppaul | barf @ tonyl's code |
| 02:08 | tonyl | :as it is a special key |
| 02:08 | tonyl | in destructuring it returns the entire map of the binding |
| 02:08 | tonyl | yeah, i don't get it either |
| 02:09 | tonyl | this is where my understanding of destructuring stops |
| 02:09 | pppaul | i don't know :as or :or |
| 02:09 | pppaul | lots of things to learn... |
| 02:09 | tonyl | &(let [[a b :as m] [1 2 3 4 5 6 ]] [a b m]) |
| 02:09 | sexpbot | ⟹ [1 2 [1 2 3 4 5 6]] |
| 02:11 | tonyl | check this out http://blog.jayfields.com/2010/07/clojure-destructuring.html |
| 02:12 | pppaul | hot stuff |
| 02:12 | tonyl | it's like a mini language |
| 02:17 | amalloy | do you still have a question, tonyl? ("how does this work" is insufficiently specific) |
| 02:19 | tonyl | i dont understand this map {a :a, b :b ... } used in destructuring, why are the keys symbols |
| 02:20 | pppaul | &(doseq [[k v] {:a 1, :b 2, :c 3}] |
| 02:20 | sexpbot | java.lang.Exception: EOF while reading |
| 02:20 | pppaul | (println k "=" v)) |
| 02:20 | pppaul | (doseq [[k v] {:a 1, :b 2, :c 3}](println k "=" v)) |
| 02:20 | pppaul | &(doseq [[k v] {:a 1, :b 2, :c 3}](println k "=" v)) |
| 02:20 | sexpbot | ⟹ :a = 1 :b = 2 :c = 3 nil |
| 02:21 | pppaul | how does that work? |
| 02:21 | pppaul | the [k v ] part |
| 02:21 | amalloy | tonyl: the keys in map bindings are the locals (or more complicated binding forms) you want assigned to the value of the corresponding keys in the map |
| 02:22 | amalloy | &(let [{[a b :as c] :val} {:val [1 2 3]}] [a b c]) |
| 02:22 | sexpbot | ⟹ [1 2 [1 2 3]] |
| 02:22 | tonyl | &(let [{val :k} {:k "tee"}] [val]) |
| 02:22 | sexpbot | ⟹ ["tee"] |
| 02:22 | tonyl | I guess the switch threw me off |
| 02:23 | amalloy | it's surprising the first time you see it, but there's a reason |
| 02:23 | tonyl | yeah, the example I saw was big. I needed it to break it down smaller |
| 02:24 | amalloy | tonyl: does mine make sense to you now? |
| 02:24 | tonyl | yeah |
| 02:24 | tonyl | thanks |
| 02:24 | amalloy | welcome |
| 02:24 | amalloy | there's a shorthand for the complicated one you posted first |
| 02:24 | tonyl | what is the shorthand? |
| 02:25 | amalloy | &(let [{:keys [a b c] :as m} {:a [5 6] :c [6 7]}] [a b c m]) |
| 02:25 | sexpbot | ⟹ [[5 6] nil [6 7] {:a [5 6], :c [6 7]}] |
| 02:25 | tonyl | ooh :keys right |
| 02:26 | tonyl | pppaul the map entry which is passed as a vector destructures vector to the key en value |
| 02:27 | amalloy | pppaul: ##(seq {:a 1, :b 2, :c 3}) |
| 02:27 | sexpbot | ⟹ ([:a 1] [:b 2] [:c 3]) |
| 02:28 | amalloy | after that it's just destructuring a plain old list-of-lists, with no map funkiness to worry about |
| 02:28 | replaca | tonyl: I think the answer to your question is that in a macro (and destructuring is effectively done in a macro) the map has been read but not evaled |
| 02:28 | pppaul | amalloy, how would i do that in a let? |
| 02:29 | amalloy | do what? |
| 02:29 | pppaul | [k v] {:a 1 :b 2 :c 3} |
| 02:29 | replaca | tonyl: therefore, the symbols are not yet evaled and can be torn out to use as locals |
| 02:29 | pppaul | oh |
| 02:29 | pppaul | i see |
| 02:29 | pppaul | nm |
| 02:29 | pppaul | i missed your reply |
| 02:31 | replaca | &(read-string "{a :a b :b}") |
| 02:31 | sexpbot | ⟹ {a :a, b :b} |
| 02:57 | Mimisbrunnr | Hi all, I cannot for thel if of me, seem to get clojure-contrib working |
| 02:57 | Mimisbrunnr | *the life |
| 02:57 | Mimisbrunnr | the path to the jar is in my CLASSPATH but java doesn't seem to find it |
| 02:58 | Mimisbrunnr | (I'm on OSX 10.5.x) ideas? |
| 02:58 | tonyl | does it load clojure? |
| 02:59 | Mimisbrunnr | yes, clojure loads fine, though I'm using -cp for that, if I use -cp for both of them, it doesn't load |
| 02:59 | amalloy | Mimisbrunnr: you can't give two -cp entries |
| 02:59 | amalloy | you need -cp /path/1:/path/2 |
| 02:59 | tonyl | are you using the right path separator |
| 02:59 | Mimisbrunnr | amalloy: I did that, and tonyl yes I'm using : and / |
| 03:00 | Mimisbrunnr | (: for differnt paths / for folders ) |
| 03:00 | tonyl | are you using direct paths or relative ones? |
| 03:03 | Mimisbrunnr | direct |
| 03:03 | tonyl | now that is weird |
| 03:03 | Mimisbrunnr | tonyl: hence my being here =P |
| 03:03 | tonyl | can you show us the full command you are using |
| 03:04 | Mimisbrunnr | sure, let me try it again, I'll pastebin the error as well |
| 03:04 | tonyl | ok, another thing might be permissions to the jar file |
| 03:05 | Mimisbrunnr | ... |
| 03:05 | Mimisbrunnr | well, slap my ass and call me charlie |
| 03:05 | Mimisbrunnr | it works |
| 03:05 | Mimisbrunnr | sorry to waste your time |
| 03:05 | Raynes | *SPANK* CHARLIE! |
| 03:05 | tonyl | charlie |
| 03:05 | tonyl | np |
| 03:06 | Mimisbrunnr | haha danke =P |
| 03:06 | Mimisbrunnr | well, now it works, I can go to bed, or keep coding.. |
| 03:06 | tonyl | or both |
| 03:07 | Mimisbrunnr | I find, while I do my best napping while driving, I do my worst coding while alseep |
| 03:07 | tonyl | hahaha now your limits, wise |
| 04:11 | bmh | How can I use a function defined later on in my source in one earlier in the source? |
| 04:12 | amalloy | bmh: (declare later-fn) |
| 04:12 | amalloy | or, my preference, reorder things |
| 04:13 | bmh | amalloy: thanks. Neither of those solutions are particularly pleasant |
| 04:33 | aslam | how do I get a list of currently running thread from clojure? |
| 04:34 | aslam | Java's Thread has an enumerate function, but it takes an array of Thread and copies references to the array. |
| 04:36 | Raynes | aslam: Is there a particular reason you wish to do that via code? If you use jconsole and attach to the JVM, you can see how many threads are running and such like thatr. |
| 04:36 | Raynes | In any case, this code should be easy enough to adapt: http://stackoverflow.com/questions/1323408/get-a-list-of-all-threads-currently-running-in-java |
| 04:37 | aslam | @raynes thanks |
| 04:38 | amalloy | aslam: (let [a (make-array Thread (Thread/activeCount))] (Thread/enumerate a) (seq a)) |
| 04:38 | Raynes | There ya go. |
| 04:38 | Raynes | amalloy is the much less lazy version of myself. |
| 04:39 | amalloy | well, it takes Raynes ten minutes to download http://download.oracle.com/javase/1.5.0/docs/api/java/lang/Thread.html |
| 04:39 | amalloy | so i do the heavy lifting for him |
| 04:39 | Raynes | 9.4 seconds |
| 04:40 | aslam | you guys are awesome :) |
| 04:40 | amalloy | Raynes: is that timing wget/curl, or firefox with firebug? |
| 04:41 | Raynes | amalloy: It's clicking your link and counting while chrome loads the page. |
| 04:41 | Raynes | I can't be off by more than 3 seconds on either side. |
| 04:42 | amalloy | fwiw firebug says it takes me 3.5s |
| 04:42 | Raynes | &(let [a (make-array Thread (Thread/activeCount))] (Thread/enumerate a) (seq a)) |
| 04:42 | sexpbot | ⟹ (#< Thread[ObjectId-TimeFixer,5,main]> #<PoolThread Thread[27282470@qtp0-0,5,main]> #<PoolThread Thread[21680790@qtp0-1 - Acceptor0 SocketConnector@0.0.0.0:8881,5,main]> #<Thread Thread[Thread-4,5,main]> #<Thread Thread[pool-2-thread-1,5,main]> #<Thread Thread[Thread... http://gist.github.com/676047 |
| 04:42 | Raynes | Neat, it actually works. |
| 04:42 | amalloy | 1s if i don't bypass the cache |
| 04:42 | amalloy | Raynes: i would have tried it here, but i assumed you weren't allowing thread operations |
| 04:43 | amalloy | oh, i see. but we're not calling any methods on threads, just on Thread |
| 04:43 | Raynes | &(.stop (Thread. (fn []))) |
| 04:43 | sexpbot | java.security.AccessControlException: access denied (java.lang.RuntimePermission stopThread) |
| 04:44 | amalloy | okay, i'm going to bed. have to be out of the house in like 7 hours |
| 04:45 | amalloy | night all; Raynes |
| 04:45 | Raynes | Aww. |
| 04:45 | Raynes | Night |
| 04:45 | Raynes | Now I'm all alone. |
| 04:46 | aslam | Raynes: I see 224 users |
| 04:47 | Raynes | But none of them are amalloy_ ;( |
| 04:49 | aslam | Raynes: ah. can't do anything about that |
| 05:12 | aslam | user> (mod 10 3) |
| 05:12 | aslam | 1 |
| 05:12 | aslam | user> (mod -10 3) |
| 05:12 | aslam | 2 |
| 05:12 | aslam | user> (mod 10 -3) |
| 05:12 | aslam | -2 |
| 05:12 | aslam | user> (mod -10 -3) |
| 05:12 | aslam | -1 |
| 05:12 | aslam | user> (rem 10 3) |
| 05:12 | aslam | 1 |
| 05:12 | aslam | user> (rem -10 3) |
| 05:12 | aslam | -1 |
| 05:12 | aslam | user> (rem 10 -3) |
| 05:12 | aslam | 1 |
| 05:12 | aslam | user> (rem -10 -3) |
| 05:12 | aslam | -1 |
| 05:12 | aslam | I understand that mod takes the sign of divisor and rem takes the sign of divident |
| 05:12 | aslam | but why is mod showing 2 when signs are opposite? |
| 05:14 | aslam | ah got it |
| 05:24 | pppaul | (inc aslam) |
| 05:24 | sexpbot | ⟹ 1 |
| 05:25 | pppaul | what would be a good way to do a 2d array in clojure? |
| 05:26 | pppaul | is a list of lists reasonable? |
| 05:35 | morphling | pppaul: vector of vectors is closer to a 2d array |
| 05:35 | morphling | since lists have O(n) access to the nth element |
| 05:37 | pppaul | for my purpose execution time is not a problem |
| 05:37 | pppaul | i guess the syntax and everything would be the same with a list or vector |
| 05:40 | aslam | what is the difference between rest and next? |
| 05:43 | Nikelandjelo | How to draw parametric functions using incanter.charts? For example I have functions for circle: x(t) = cos(t) y(t) = sin(t) . I can generate points for t from 0 to 2*PI, but I don't know how to draw them using charts. xy-plot and add-lines don't work. They seem to sort these points by x and then display. Is there some other function for it? |
| 05:50 | pppaul | aslam, look on clojure.org |
| 05:50 | pppaul | next is for pure lazy seqs |
| 05:55 | fliebel | morning |
| 05:56 | aslam | next |
| 05:56 | aslam | function |
| 05:56 | aslam | Usage: (next coll) |
| 05:56 | aslam | Returns a seq of the items after the first. Calls seq on its |
| 05:56 | aslam | argument. If there are no more items, returns nil. |
| 05:56 | aslam | rest |
| 05:56 | aslam | function |
| 05:56 | aslam | Usage: (rest coll) |
| 05:56 | aslam | Returns a possibly empty seq of the items after the first. Calls seq on its |
| 05:56 | aslam | argument. |
| 05:57 | aslam | the only difference seems to be the ending where next returns nil and rest returns an empty sequence |
| 05:59 | aslam | and since '() is true in boolean context, rest could potentially cause some infinite loops I think |
| 06:05 | jarpiain | aslam: (next (cons 1 (lazy-seq ...))) has to force the lazy seq to see if it should return nil |
| 06:09 | aslam | jarpiain: I c. thanks |
| 06:18 | aslam | jarpiain: that is not the case it seems |
| 06:18 | aslam | (def tmp (next (cons 1 (iterate #(do (println (str %1)) (flush) (inc %1)) 1)))) |
| 06:18 | aslam | user> (first tmp) |
| 06:18 | aslam | 1 |
| 06:18 | aslam | user> (first (next tmp)) |
| 06:18 | aslam | 1 |
| 06:18 | aslam | 2 |
| 06:19 | aslam | (first tmp) didn't cause the println to print 1 |
| 06:25 | zmyrgel | hmm, how can I check if list of records contain specific record? |
| 06:25 | zmyrgel | my quick attempt with 'some' didn't work |
| 06:30 | jarpiain | aslam: (iterate f x) returns (cons x (lazy-seq (iterate f (f x))), i.e., the the first cons cell is not lazy and doesn't require calling f |
| 06:31 | zmyrgel | yep, totally wrong predicate for some, got it fixed |
| 06:32 | jarpiain | ,(let [x (iterate #(do (print "test") (inc %1)) 1)] (next x) (first x)) |
| 06:32 | clojurebot | test |
| 06:32 | clojurebot | 1 |
| 06:32 | jarpiain | ,(let [x (iterate #(do (print "test") (inc %1)) 1)] (rest x) (first x)) |
| 06:32 | clojurebot | 1 |
| 06:32 | raek | first does not force the rest of the list |
| 06:33 | raek | ah. misread it. |
| 06:34 | raek | also: https://gist.github.com/480608 |
| 06:35 | aslam | ah, i c. thats interesting :) thanks |
| 09:34 | zmyrgel | hi, I need a bit of help writing function to create a game board |
| 09:35 | zmyrgel | I need to make an empty game-board and then update it with by giving it 2 parameters, string of game pieces and a row number where to put pieces |
| 09:36 | zmyrgel | it sounds like a job for reduce but I've only used it for simple stuff |
| 09:36 | tomoj | "update it"? |
| 09:36 | tomoj | like, assoc? |
| 09:37 | tomoj | how do you represent the game-board? |
| 09:38 | tomoj | vector of vectors? |
| 09:38 | zmyrgel | its a vector |
| 09:39 | zmyrgel | http://pastebin.com/DiVSvMNM |
| 09:39 | zmyrgel | here's my current progress |
| 09:40 | tomoj | I see |
| 09:40 | tomoj | so.. |
| 09:40 | zmyrgel | I mean to have empty game board, and then apply function which would add pieces for single row to it |
| 09:40 | tomoj | each row of the game-board is placed in its own part of the vector? |
| 09:41 | zmyrgel | each row starts at 0x0, 0x10 coordinate on the vector |
| 09:41 | tomoj | cool |
| 09:42 | tomoj | I don't really understand your code yet |
| 09:42 | tomoj | but.. |
| 09:42 | tomoj | the (for [fen ...] (reduce apply-fen... looks problematic |
| 09:42 | tomoj | I can only guess based on the variable/fn names |
| 09:42 | zmyrgel | lemme give more expanded example |
| 09:42 | tomoj | but, if you build up a sequence and want to reduce over it |
| 09:42 | tomoj | you don't reduce in for |
| 09:43 | tomoj | oh |
| 09:43 | zmyrgel | I have working function which does it already but I'm rewriting it |
| 09:43 | tomoj | was it smelly? |
| 09:44 | tomoj | what does splitting on /+ leave you with? |
| 09:44 | mrBliss | What's the Common Lisp equivalent of (take n coll)? |
| 09:44 | zmyrgel | http://pastebin.com/FcEZm169 |
| 09:45 | zmyrgel | it leaves a list of strings |
| 09:45 | zmyrgel | the existing function seems quite iterative |
| 09:45 | tomoj | and you have one string in the list for each row? |
| 09:46 | zmyrgel | yes, each string in the list has all the chess pieces on that row |
| 09:47 | tomoj | "4P3"? |
| 09:47 | zmyrgel | It means 4 empty squares and pawn piece followed by 3 empty squares |
| 09:48 | tomoj | aha |
| 09:49 | tomoj | so |
| 09:49 | zmyrgel | I replaced my previous board->fen function with more functional approuch and it got much simpler |
| 09:49 | tomoj | I think it would be helpful to avoid for |
| 09:49 | zmyrgel | so I wanted to see if I could do the same for this part too |
| 09:50 | zmyrgel | ok |
| 09:50 | tomoj | at least for me to figure out what you really want |
| 09:50 | tomoj | maybe for will be useful in the end |
| 09:51 | zmyrgel | I planned to have one function which would take a [board fen row] arguments and return new board with pieces from fen applied to row |
| 09:51 | tomoj | where is map-indexed? |
| 09:51 | tomoj | oh, right there in core |
| 09:51 | tomoj | wow |
| 09:52 | tomoj | so you have this list of row descriptions |
| 09:52 | tomoj | you can map-indexed over it |
| 09:53 | tomoj | then your reduce will have access to both the row fen string and the row number |
| 09:53 | tomoj | ... I think |
| 09:54 | zmyrgel | hmm |
| 09:54 | tomoj | but what would be in the map function? |
| 09:54 | tomoj | you want to do all the real work in the reduce function, I guess? |
| 09:55 | zmyrgel | yeah |
| 09:55 | tomoj | so the reduce fn will take a game-board (initialized to empty), and a row |
| 09:55 | zmyrgel | and the fen string |
| 09:55 | tomoj | and it does all the linearization math to get the proper place to stick the pieces in the game-board array? |
| 09:57 | tomoj | does your scheme for mapping all the rows into a 1d array make it so that the array is just all the pieces in row-major order? |
| 09:57 | zmyrgel | yes, for example, with "3p4" fen and 0x30 coord it would assign empty squares to board coordinates 0x30, 0x31 and 0x31 and so forth |
| 09:57 | tomoj | or is there gaps? |
| 09:58 | zmyrgel | there are 'gaps', its like two chess boards side by side and the others empty |
| 09:58 | tomoj | oh, hmm |
| 09:58 | tomoj | (just curious, why? because the 0x30 coord for row 4 (?) is pretty?) |
| 09:59 | zmyrgel | so board indexes 0x20 to 0x27 are on the board and 0x28 to 0x2f are outside |
| 09:59 | zmyrgel | It helps when checking piece movements and if the index is on the board |
| 09:59 | tomoj | ok |
| 09:59 | zmyrgel | http://chessprogramming.wikispaces.com/0x88 |
| 10:00 | tomoj | awesome |
| 10:00 | tomoj | do you have great chess-fu |
| 10:00 | zmyrgel | nope :) |
| 10:00 | zmyrgel | I haven't played chess in over 10 years and this is my first functional programming work |
| 10:01 | tomoj | those who can, do. those who can't, build software. |
| 10:01 | zmyrgel | Doing my bachelor's thesis on this |
| 10:01 | tomoj | unfortunately I didn't get to hear the lambda tones actually play anything real |
| 10:02 | tomoj | but I wonder, how many of the tool pioneers are also great at whatever the tool is for? |
| 10:02 | zmyrgel | yeah |
| 10:02 | tomoj | anyway |
| 10:02 | zmyrgel | well, this is still the easy stuff |
| 10:03 | zmyrgel | once I get to the AI stuff |
| 10:03 | tomoj | :D |
| 10:03 | tomoj | what model? |
| 10:03 | zmyrgel | model? |
| 10:03 | tomoj | you can get the array coords for a piece by adding its index in the row to the row coord, right? |
| 10:04 | zmyrgel | yes |
| 10:04 | tomoj | I mean, give me some buzzwords that appear often in your readings |
| 10:04 | zmyrgel | alphabeta pruning |
| 10:04 | zmyrgel | though I would be happy with working minimax |
| 10:05 | tomoj | but how do you do position evaluation? |
| 10:06 | zmyrgel | so far it only calculates material balance and some simple board location checks |
| 10:06 | zmyrgel | Once I get my pieces to move correctly I plan to move to AI stuff |
| 10:06 | zmyrgel | now my rook can jump over pieces etc :) |
| 10:07 | tomoj | well, I think what you were planning was to reduce over the pieces in each row, maybe? |
| 10:07 | tomoj | then the reduce assoc's into the game-board vector according to the row coord + index in row? |
| 10:07 | zmyrgel | yeah, that was my plan |
| 10:08 | zmyrgel | I have no idea how the reduce's function arguments should be presented to it |
| 10:09 | tomoj | well |
| 10:10 | tomoj | you can always reduce (map vector coll (range)) |
| 10:10 | tomoj | oh |
| 10:10 | tomoj | no |
| 10:11 | tomoj | (map-indexed vector coll) |
| 10:11 | zmyrgel | ok |
| 10:11 | tomoj | this will give you the index in the row, to which you can add the row coord which should (I think) be closed over |
| 10:12 | tomoj | so your reduce function will look like (fn [game-board [index piece]]) I think |
| 10:14 | tomoj | assuming you can generate all the pieces into a coll/seq for a row |
| 10:14 | zmyrgel | yeah |
| 10:17 | tomoj | and then each time through the reduce, you assoc (+ row-coord index) in the game-board? |
| 10:18 | tomoj | and then you reduce over the rows... :( |
| 10:19 | zmyrgel | hmm, my brain starts to get pretty twisted already |
| 10:23 | tomoj | (reduce (fn [game-board [row-coord row]]) ...) |
| 10:25 | tomoj | the coll there should be [[0x00 pieces-for-row-0] [0x10 pieces-for-row-1] ...] |
| 10:25 | tomoj | which you can get by doing a map-indexed over the processed row strings with a map function that looks up the index to get a coord |
| 10:26 | tomoj | then, in the reduce fn, you reduce again over the (pieces in the) row |
| 10:27 | tomoj | doing a map-indexed again to get the assoc index for each piece by adding to the row-coord, which is closed over here |
| 10:28 | tomoj | make any sense? |
| 10:28 | zmyrgel | some, but I think it takes some repl fooling and doc reading to really sink in |
| 10:31 | tomoj | I may be full of shit since I don't think I fully understand what you're doing |
| 10:33 | mtyaka | hi all, i'm trying to come up with a nice way of turning a vector of strings like this: ["-a" "b" "-c" "d" "e" "f" "-g" "-h" "i"] |
| 10:33 | mtyaka | into this: ["-ab" "-cdef" "-g" "-hi"] |
| 10:34 | mtyaka | This is what I've got so far: https://gist.github.com/676245 |
| 10:34 | mtyaka | Is there a cleaner way? |
| 10:37 | zmyrgel | yeap, but at least it has given me some pointers where to focus |
| 10:38 | opqdonut | mtyaka: try using split-with |
| 10:39 | tomoj | will the very first character always be \-? |
| 10:39 | mtyaka | yes |
| 10:40 | mtyaka | opqdonut: thanks for the pointer, will try it out |
| 10:45 | opqdonut | or if you like to keep it simple, try something like |
| 10:45 | opqdonut | (clojure.contrib.str-utils/re-split #"-" (str ["-a" "b" "c" "-d" "e" "-f" "g"])) |
| 10:45 | opqdonut | err, apply str |
| 10:45 | opqdonut | I couldn't get re-split to work in clojurebot so I can't demonstrate :) |
| 10:47 | LauJensen | &(clojure.string/re-split #"-" (str ["-a" "b" "c" "-d" "e" "-f" "g"])) |
| 10:47 | sexpbot | java.lang.Exception: No such var: clojure.string/re-split |
| 10:47 | raek | &(require 'clojure.string) |
| 10:47 | sexpbot | ⟹ nil |
| 10:47 | raek | &(clojure.string/re-split #"-" (str ["-a" "b" "c" "-d" "e" "-f" "g"])) |
| 10:47 | sexpbot | java.lang.Exception: No such var: clojure.string/re-split |
| 10:47 | MayDaniel | &(clojure.string/split #"-" (str ["-a" "b" "c" "-d" "e" "-f" "g"]) #"-") |
| 10:47 | sexpbot | java.lang.ClassCastException: java.lang.String cannot be cast to java.util.regex.Pattern |
| 10:47 | LauJensen | &(clojure.string/re-split #"-" (str ["-a" "b" "c" "-d" "e" "-f" "g"])) |
| 10:47 | sexpbot | java.lang.Exception: No such var: clojure.string/re-split |
| 10:47 | MayDaniel | &(clojure.string/split (str ["-a" "b" "c" "-d" "e" "-f" "g"]) #"-") |
| 10:47 | sexpbot | ⟹ ["[\"" "a\" \"b\" \"c\" \"" "d\" \"e\" \"" "f\" \"g\"]"] |
| 10:48 | LauJensen | &(use 'clojure.contrib.str-utils) |
| 10:48 | sexpbot | ⟹ nil |
| 10:48 | LauJensen | &(clojure.string/re-split #"-" (str ["-a" "b" "c" "-d" "e" "-f" "g"])) |
| 10:48 | sexpbot | java.lang.Exception: No such var: clojure.string/re-split |
| 10:48 | MayDaniel | &(clojure.string/split (apply str ["-a" "b" "c" "-d" "e" "-f" "g"]) #"-") |
| 10:48 | sexpbot | ⟹ ["" "abc" "de" "fg"] |
| 10:48 | LauJensen | &(clojure.contrib.str-utils/re-split #"-" (str ["-a" "b" "c" "-d" "e" "-f" "g"])) |
| 10:48 | sexpbot | ⟹ ("[\"" "a\" \"b\" \"c\" \"" "d\" \"e\" \"" "f\" \"g\"]") |
| 10:50 | mtyaka | very nice :) |
| 10:52 | Raynes | &(.split (str ["-a" "b" "c" "-d" "e" "-f" "g"]) "-") |
| 10:52 | sexpbot | ⟹ #<String[] [Ljava.lang.String;@3351c1> |
| 11:00 | jweiss_ | is there a direct way to parse xml from a string, or do you have to create an InputStream to pass to clojure.xml/parse? |
| 11:04 | tomoj | well.. |
| 11:05 | tomoj | the input-stream function (not sure where the latest version lives now... clojure.contrib.io? clojure.java.io?) can take a byte array |
| 11:05 | tomoj | so you could pass the .getBytes of the string to input-stream |
| 11:06 | tomoj | &(with-open [xml-in (clojure.java.io/input-stream (.getBytes "<foo><bar/></foo>"))] (clojure.xml/parse xml-in)) |
| 11:06 | sexpbot | ⟹ {:tag :foo, :attrs nil, :content [{:tag :bar, :attrs nil, :content nil}]} |
| 11:06 | clojurebot | ,(let [testar (fn [x y] (cond (= (reduce + (filter odd? (range 0 x))) y) (str y " is a")) )] (testar 11 25)) |
| 11:19 | fliebel | Is there some magic to attach headers to this input stream when doing an url? I have some more java trickery set up for that currently. |
| 11:20 | raek | to avoid encoding issues, it would be better to make a Reader rather than an InputStream |
| 11:21 | fliebel | raek: Well, my connection has getInputStream, but I don't know about getReader. |
| 11:21 | raek | oh sorry. was refering to tomoj's suggestion |
| 11:21 | fliebel | oh, okay |
| 11:22 | raek | &(clojure.xml/parse (java.io.StringReader. "<foo><bar/></foo>")) |
| 11:22 | sexpbot | java.lang.IllegalArgumentException: No matching method found: parse for class com.sun.org.apache.xerces.internal.jaxp.SAXParserImpl |
| 11:23 | raek | hrm |
| 11:24 | raek | &(with-open [xml-in (clojure.java.io/input-stream (.getBytes "<foo><bar/></foo>" "UTF-8"))] (clojure.xml/parse xml-in)) |
| 11:24 | sexpbot | ⟹ {:tag :foo, :attrs nil, :content [{:tag :bar, :attrs nil, :content nil}]} |
| 11:24 | clojurebot | ⟹ "Returns the metadata of obj, returns nil if there is no metadata." |
| 11:24 | raek | (the pedantic way...) |
| 11:24 | raek | the default encoding of XML is UTF-8 |
| 11:24 | raek | if you don't specify the encoding for .getBytes, the JVM rolls a dice for you |
| 11:24 | raek | :) |
| 11:25 | fliebel | raek: Like the xkcd one? I think they rolled the dice at the implementation and chose… forgot it, read it just yesterday. |
| 11:26 | raek | fliebel: this one? http://xkcd.com/221/ :-) |
| 11:27 | fliebel | yes sir |
| 11:27 | raek | fliebel: were you previous question about web dev? |
| 11:28 | fliebel | raek: Well, web related at least. It's just a terminal app for now. But it does web stuff. |
| 11:28 | raek | what do you mean by "attach headers to the input stream"? |
| 11:29 | fliebel | well, the url needs basic auth. |
| 11:29 | raek | are you using ring? |
| 11:29 | fliebel | now, pure java. |
| 11:30 | raek | are you implementing an HTTP server? |
| 11:31 | fliebel | no, just accessing twitter streams. |
| 11:32 | fliebel | (inc raek) |
| 11:32 | sexpbot | ⟹ 1 |
| 11:32 | raek | do you open a stream using url.openStream() (or something like that) and want to add headers to the HTTP request? |
| 11:33 | fliebel | raek: meh, I'm doing some funky java stuff with urls and connections, which works just fine, but I saw someone use clojure.java.io/input-stream, so I was just wondering if there was a shorter way to do it. |
| 11:34 | fliebel | But yes, adding headers I am. |
| 11:36 | raek | I found this http://download.oracle.com/javase/6/docs/technotes/guides/net/http-auth.html |
| 11:37 | fliebel | raek: extending classes is not going to be any shorter than what I have. |
| 11:37 | tomoj | twitter streams? |
| 11:37 | tomoj | considered and rejected aleph? |
| 11:38 | fliebel | tomoj: http://stream.twitter.com/1/statuses/sample.json |
| 11:38 | raek | looks like org.apache.commons.httpclient.HttpClient is more configurable |
| 11:39 | raek | http://www.java-tips.org/other-api-tips/httpclient/how-to-use-basic-authentication.html |
| 11:39 | fliebel | tomoj: Replace that with ignored and you get the picture. |
| 11:39 | tomoj | heh |
| 11:39 | tomoj | https://github.com/ztellman/aleph/wiki/Consuming-and-broadcasting-a-Twitter-stream |
| 11:40 | raek | looks like java's UrlConnection does not have basic auth built in |
| 11:40 | tomoj | oh |
| 11:40 | tomoj | dunno if it does basic auth |
| 11:40 | fliebel | tomoj: But once I get to the point where I need a datastore I might as well use a library like Aleph. |
| 11:40 | tomoj | oh, yes it does |
| 11:41 | fbru02 | hey guys why and what's the usual cure when making a defrecord I get : Don't know how to create ISeq from: clojure.lang.Symbol ? |
| 11:43 | raek | fbru02: looks like you have an error in the way you're calling defrecord |
| 11:43 | fbru02 | raek isn't defrecord classname, followed by the protocol? |
| 11:43 | raek | like calling (defrecord Foo ProtoA (method [] ...)) instead of (defrecord Foo [field] ProtoA (method [] ...)) |
| 11:44 | raek | fbru02: defrecord classname vector-of-fields protocol |
| 11:44 | fliebel | tomoj: Okay, that example looks terse enough to consider, together with ClojureQL or some other database. |
| 11:45 | Nevena | Can anyone tell me in which lib/ns is 'thrown?' function? |
| 11:45 | fbru02 | raek: nice , now i get it , sometimes i was doing like that, sometimes id wasn't and i didn't understand the root cause thanks ! |
| 11:49 | fliebel | How can I tell if a reader is still open? |
| 11:52 | raek | if you have a BufferedReader (the fns in clojure.java.io will return one of those), readLine will return null |
| 11:52 | raek | .read will return -1 |
| 11:53 | raek | doesn't look like there is any .isClosed method or anything similar |
| 11:53 | vic_nyc | hi, was wondering if anyone has experience using date/times with mongodb (particularly congomongo) with clojure |
| 11:53 | fliebel | raek: But readers are not really concurrent, so if it is still open, I screw up the other tread that's reading from it. |
| 11:53 | fliebel | But it looks like it's still running now. |
| 11:54 | raek | I guess you have to lock it before doing anything with it |
| 11:54 | raek | I'm really happy that those things are dead simple in clojure |
| 11:54 | fliebel | 3000 urls and counting… :) With http://www.peopleschoice.com/pca/votenow.jsp being the top one... |
| 11:55 | raek | scanning tweets for urls? |
| 11:55 | fliebel | yea :) |
| 11:55 | fliebel | Making my private crows sourced news source :) |
| 11:56 | vic_nyc | I guess not.. |
| 11:57 | fliebel | vic_nyc: I stored a timestamp in congomongo once, but nothing beyond that. |
| 11:59 | vic_nyc | thx fliebel, will keep looking for ways. |
| 11:59 | fliebel | vic_nyc: But try asking a more concrete question, like "if i store a java.date.time.whatever in a mongodb, what will I get back?" |
| 12:00 | vic_nyc | was wondering what the best way would be to store dates. I found some documentation that says that transforming dates into numbers would be best (most efficient) |
| 12:00 | vic_nyc | (alternatively, using mongodb's datetime library would be terrible in terms of performance) |
| 12:00 | fliebel | yea, that is what I said about the timestamp |
| 12:03 | vic_nyc | I guess I was looking for a function that would map some kind of date object into a number representation, in a way that would still allow efficient queries |
| 12:03 | vic_nyc | e.g. give me all records between these dates (where the datetimes have been mapped into numbers) |
| 12:04 | fliebel | What data representation are you thinking of? With a timestamp these are just simple larger-than and smaller-than queries. |
| 12:04 | fliebel | *date |
| 12:05 | vic_nyc | a timestamp would be good. however the one in congomongo relies on objectid and in my particular project I'm not using Mongo's ObjectIds |
| 12:06 | fliebel | *puzzled look* |
| 12:07 | fliebel | vic_nyc: http://download.oracle.com/javase/1.4.2/docs/api/java/util/Date.html#getTime() |
| 12:14 | vic_nyc | thx fliebel I think that may work quite well for what I need |
| 13:01 | silveen | Anyone here who uses vim+slimv.vim for developement? |
| 13:23 | Bronsa | seangrove: i used to |
| 13:23 | Bronsa | but it's terrible |
| 13:30 | TobiasRaeder | hey :) |
| 13:30 | TobiasRaeder | is there an idiomatic way to conver the (keyword) keys of a map to their string values? |
| 13:31 | technomancy | TobiasRaeder: (zipmap (map name (keys m)) (vals m)) |
| 13:32 | Vinzent | How can I get value from structmap inside macros? |
| 13:32 | fliebel | technomancy: What is this going to do to the order of the keys and value? |
| 13:33 | TobiasRaeder | @technomancy thx a ton |
| 13:33 | technomancy | fliebel: keys and vals is guaranteed to always be consistently ordered when called on the same map |
| 13:33 | fliebel | cool |
| 13:33 | technomancy | it's just that if you assoc more stuff onto the map the order may change |
| 13:34 | fliebel | I got into deep trouble with python in this way once. I admit I did something to them on the way though. |
| 13:36 | raek | Vinzent: like you would with a map |
| 13:36 | Vinzent | https://gist.github.com/676400 |
| 13:36 | Vinzent | raek, I got nil |
| 13:37 | raek | Vinzent: you could use an ordinary function in that case |
| 13:38 | raek | what happens now is that this is evaled: ['(struct q 1) (:a '(struct q 1))] |
| 13:40 | raek | remember that what the macro gets as its parameter is the unevaluated code |
| 13:41 | Vinzent | raek, ok probably I should reorganize code, thank you |
| 14:35 | bobo_ | anyone used appengine magic? change the number of fields in an entity and it doesnt work to store it with swank anymore, using dev_appserver works :-/ |
| 17:49 | mattmitchell | I'm trying to call an instance method on a java object but having no luck |
| 17:49 | mattmitchell | for one of the methods, I get "java.lang.ClassCastException (NO_SOURCE_FILE:0)" |
| 17:49 | mattmitchell | and for another I get: "java.lang.IllegalArgumentException: No matching field found: toSolrParams for class org.apache.solr.client.solrj.SolrQuery (NO_SOURCE_FILE:0)" |
| 17:50 | mattmitchell | but I know the methods exist, and the object I'm working with is an instance of the class |
| 17:50 | mattmitchell | here's the code I have now: |
| 17:50 | mattmitchell | (def sp (org.apache.solr.client.solrj.SolrQuery.)) |
| 17:50 | mattmitchell | (.toSolrParams sp) |
| 17:50 | mattmitchell | (.add sp "one" "two") |
| 17:51 | mattmitchell | anyone have any ideas? |
| 17:54 | raek | mattmitchell: from the javadocs it seems that the toSolrParams method is static |
| 17:55 | raek | mattmitchell: (import 'org.apache.solr.client.solrj.SolrQuery) (SolrQuery/toSolrParams sp) |
| 17:55 | raek | if sp is an instance of NamedList |
| 17:56 | pppaul | to map over a 2D vector i'm doing a map of a map... is there a better way other than flattening/partitioning? |
| 17:56 | raek | also, add seems to take an instance of SolrParams, rather than two arguments |
| 17:59 | raek | mattmitchell: the syntaxes for method calls are as follows: (.instanceMethod object arg1 arg2 ...) (Class/classMethod arg1 arg2 ...) |
| 18:15 | mattmitchell | raek: there is also an add that takes 2 strings: http://lucene.apache.org/solr/api/org/apache/solr/common/params/ModifiableSolrParams.html#add%28java.lang.String,%20java.lang.String...%29 |
| 18:16 | mattmitchell | raek: does it make sense that I'd be able to just call that on the instance? |
| 18:17 | mattmitchell | raek: you'right about the toSolrParams, my bad! |
| 18:17 | raek | hrm, I think variadic methods are special |
| 18:18 | raek | you could try looking at the signature with clojure.contrib.repl-utils/show |
| 18:18 | raek | I vagely recall that the "..." args are passes as an array or something |
| 18:19 | mattmitchell | raek: ok cool, i'll have a look. thanks for your help! |
| 18:22 | raek | usage example: (use '[clojure.contrib.repl-utils :only (show)]) (show java.lang.String #"toString") |
| 18:22 | KirinDave | So didn't chouser... I think it was chouser, have some thing about not using :only? |
| 18:22 | KirinDave | I never quite understood |
| 18:24 | raek | well, I think it's safer to use :only than bare use. if someone adds a new var to the namespace, you will not get any unexpected collisions |
| 18:24 | raek | require is even safer |
| 18:24 | raek | since it covers the case when things are added to clojure.core |
| 18:25 | KirinDave | I agree. |
| 18:32 | miltondsilva | Hi, the spit function in clojure core is very interesting but, is there some way to spit bytes on a clojure seq.. or on a byte-array? |
| 18:39 | miltondsilva | ohh.. wait.. java already does that.. sorry |
| 18:53 | lrenn | anyone have a clojure 1.1 repl handy? |
| 19:02 | kumarshantanu | hi, can anybody tell how to configure log level using c.c.logging? |
| 19:02 | kumarshantanu | I want it to be DEBUG |
| 19:27 | wooby | kumarshantanu: there's a 'debug' in logging you can use |
| 20:26 | kumarshantanu | wooby: debug log is not visible somehow |
| 20:26 | kumarshantanu | only INFO is visible |
| 20:27 | kumarshantanu | need to change some default setting? |
| 20:29 | pppaul | $8ball 8balls? |
| 20:29 | sexpbot | pppaul: Very doubtful. |
| 20:43 | stuartsierra | kumarshantanu: It's configured in the logging implementation you use. |
| 20:54 | pppaul | can someone point me to a tutorial / examples of using types and records? the clojure.org site just explains them, but doesn't give examples (that i can see) |
| 20:55 | pppaul | &(#(% %) #(% %)) |
| 20:55 | sexpbot | java.lang.StackOverflowError |
| 20:58 | dnolen | pppaul: http://freegeek.in/blog/2010/05/clojure-protocols-datatypes-a-sneak-peek/ |
| 20:58 | pppaul | thanks |
| 20:58 | pppaul | these work as of 1.2 right? |
| 20:58 | dnolen | pppaul: yup |
| 20:58 | pppaul | what is special about 1.3? |
| 20:59 | dnolen | pppaul: changes to binding, primitive math support the biggest things |
| 20:59 | pppaul | interesting |
| 21:00 | pppaul | so, as clojure.org tells me, i should not be using genclass? |
| 21:00 | pppaul | $8ball should i use genclass? |
| 21:00 | sexpbot | pppaul: Ask again later. |
| 21:01 | stuartsierra | pppaul: genclass is still necessary for some kinds of Java interop |
| 21:01 | pppaul | such as? |
| 21:01 | stuartsierra | subclassing a concrete class |
| 21:01 | pppaul | ~_^ |
| 21:01 | clojurebot | everyday is Rich Hickey Appreciation Day |
| 21:02 | pppaul | i'm glad that i'm rich hickey appreciation day |
| 21:02 | pppaul | oh |
| 21:02 | pppaul | everyday |
| 21:02 | pppaul | why did clojurebot say that? |
| 21:02 | pppaul | making clojure seem like a cult |
| 21:03 | pppaul | i just happen to love cults |
| 21:11 | mattmitchell | is there something special i have to do when calling a java method that is defined with varargs? |
| 21:12 | _ato | mattmitchell: pass it an array of the variable arguments |
| 21:12 | _ato | Java's "..." stuff is just syntax sugar for passing an array as the last argument |
| 21:12 | mattmitchell | _ato: i see. so, i tried doing: (.method obj (to-array "arg1")) -- is that correct? |
| 21:13 | _ato | (to-array ["arg1"]) |
| 21:13 | _ato | otherwise you'll get an array of characters |
| 21:14 | mattmitchell | _ato: ahh ok |
| 21:14 | _ato | you might also want into-array instead of to-array, unless the variable argument is of type "Object" |
| 21:14 | mattmitchell | _ato: awesome, into-array did the trick. thank you! |
| 21:15 | _ato | :) |
| 21:48 | cemerick | stuartsierra: ping |
| 21:48 | cemerick | bleh |
| 22:07 | stuartsierra | talios? |
| 22:11 | talios | stuartsierra: Are you able to run 1.6 on the server, then use maven-toolchains-plugin ? http://maven.apache.org/guides/mini/guide-using-toolchains.html |
| 22:11 | stuartsierra | yeah, we'll try that |
| 22:12 | stuartsierra | Can that be configured but still permit anyone else to build on any supported JDK? |
| 22:12 | cemerick | hrm, hopefully hudson can autogenerate that toolchains.xml file… |
| 22:12 | stuartsierra | i.e. don't force users to have 1.5 intsalled |
| 22:12 | talios | You could enable that in a profile |
| 22:12 | stuartsierra | if they want to build locally |
| 22:13 | stuartsierra | yeah |
| 22:13 | cemerick | talios: good afternoon (or whatever) :-) |
| 22:13 | stuartsierra | just would rather not complicate the POM any further |
| 22:13 | talios | afternoon :) 4:16pm |
| 22:13 | talios | a profile in ~/.m2/settings.xml should work fine. |
| 22:14 | stuartsierra | that's a thought |
| 22:14 | cemerick | (inc talios) |
| 22:14 | sexpbot | ⟹ 1 |
| 22:14 | stuartsierra | (inc talios) |
| 22:14 | sexpbot | ⟹ 2 |
| 22:15 | talios | :) |
| 22:17 | talios | cemerick: see my reply about that maven-find-plugin ? ( re source dirs of deps ) I think that'll be too messy tho, I think anything that resolves source dirs from dependencies should be separate from the pom.xml, |
| 22:18 | cemerick | talios: saw the email, haven't looked at the link yet |
| 22:18 | cemerick | AFAICT, this would not be in the pom |
| 22:18 | cemerick | i.e. it shouldn't affect proper builds |
| 22:18 | talios | *nod* |
| 22:19 | cemerick | totally a local-environment thing; so, just a property (perhaps falling back on a env var lookup for shell types that like to set such things) would be ideal |
| 22:19 | cemerick | It all seems creepy to me, but I'm trying to keep the hurdles low |
| 22:20 | talios | however it works, I was thinking "walk our poms dependencies, for each GAV - *resolve a source dir somehow* - replace the classpath entry with that |
| 22:26 | stuartsierra | ok, too sleepy to write any more XML right now |
| 22:31 | stuartsierra | If it's possible to get the plugin to target 1.5, it will be very helpful to the Clojure core release process! |