2010-06-16
| 00:23 | Licenser | a wonderful good morning my lispy friends |
| 00:52 | unfo- | what would be the best place for me to read about ^:static (in reference to : http://gist.github.com/440102 ) |
| 00:53 | tomoj | perhaps http://clj-me.cgrand.net/2010/06/10/primitive-types-support-for-fns-coming-to-a-clojure-branch-near-you/ |
| 00:55 | vIkSiT | hello all |
| 00:55 | vIkSiT | is there a way to convert a string to a keyword? |
| 00:55 | unfo- | tomoj, did you just google that for me?-) |
| 00:55 | unfo- | tomoj, well any way, thank you, good sir! |
| 00:55 | tomoj | I remembered that cgrand had blogged it |
| 00:56 | vIkSiT | for instance, i'm retrieving a string value from a map - and wuld like to use it as a key to access another map. so "field" should become :field |
| 00:56 | tomoj | ,(keyword "field") |
| 00:56 | clojurebot | :field |
| 00:56 | rbxbx | (doc keyword) |
| 00:56 | clojurebot | "([name] [ns name]); Returns a Keyword with the given namespace and name. Do not use : in the keyword strings, it will be added automatically." |
| 00:56 | vIkSiT | argh :) |
| 00:56 | vIkSiT | didn't think it would be that simple |
| 00:56 | vIkSiT | thanks guys |
| 00:56 | rbxbx | np. |
| 01:06 | tomoj | wow. the slow (fib 38) is 15x slower on my computer than rich's |
| 01:06 | vIkSiT | hmm, is there a way to clear a variable definition from the REPL? |
| 01:07 | vIkSiT | as in, if its defined in a particular namespace - can it be "removed" from that namespace? |
| 01:07 | rbxbx | ns-unmap |
| 01:07 | rbxbx | (ns-unmap symbol) |
| 01:08 | dnolen | nice 1.2 num branch can do 1 billion math ops in < 700ms, no type hints on my laptop. |
| 01:10 | tomoj | american "billion" or otherwise? |
| 01:12 | dnolen | tomoj: 10^9 |
| 01:12 | tomoj | a math op in less than a nanosecond.. crazy |
| 01:13 | unfo- | woot? |
| 01:14 | dnolen | unfo-: yes, woot :D |
| 01:38 | aria42 | k |
| 01:40 | rbxbx | vIkSiT: (ns-unmap *ns* 'symbol) rather. |
| 01:40 | vIkSiT | rbxbx, ah thanks! |
| 01:40 | rbxbx | np, pardon the initial error ;) |
| 02:22 | TheBusby | tomoj: is there an English speaking country that still uses the long scale for billion? (just curious) |
| 02:25 | tomoj | apparently not |
| 03:23 | vIkSiT | hmm is there a way to empty a map? |
| 03:23 | tomoj | ,{} |
| 03:23 | clojurebot | {} |
| 03:23 | tomoj | :) |
| 03:24 | vIkSiT | haha |
| 03:24 | vIkSiT | I've been poring over methods using reset!, alter and dissoc |
| 03:24 | vIkSiT | gah |
| 03:25 | tomoj | you have an atom? |
| 03:26 | tomoj | reset! should be fine |
| 03:26 | vIkSiT | no, a ref. |
| 03:26 | vIkSiT | (dosync (alter mymap {})) |
| 03:26 | tomoj | oh, refs don't have anything like reset! afaik |
| 03:26 | vIkSiT | yeah, not that I could find |
| 03:26 | tomoj | so you need (alter mymap (fn [_] {})) |
| 03:27 | vIkSiT | I thought {} was a function in this case.. |
| 03:27 | vIkSiT | its a persistent array map.. which should act as a fn anyway |
| 03:27 | tomoj | oh, wait |
| 03:27 | tomoj | (doc ref-set) |
| 03:27 | clojurebot | "([ref val]); Must be called in a transaction. Sets the value of ref. Returns val." |
| 03:28 | vIkSiT | ah |
| 03:28 | tomoj | "(alter mymap {})" would just set the ref to nil |
| 03:28 | G0SUB | vIkSiT |
| 03:28 | vIkSiT | right |
| 03:28 | vIkSiT | G0SUB |
| 03:28 | G0SUB | Need some help with Enlive... |
| 03:29 | G0SUB | amazing library, but quite complex too :) |
| 03:29 | G0SUB | the selector syntax is quite difficult to master |
| 03:29 | Chousuke | isn't it mostly just CSS selectors with : in front? |
| 03:30 | G0SUB | I have a bunch of tr nodes, and I want to extract the content of every td node in those tr nodes. |
| 03:30 | G0SUB | Chousuke, what's the best way to do the above? |
| 03:31 | vIkSiT | wwmorgan, test? |
| 03:31 | Chousuke | G0SUB: [:tr :td]? or something |
| 03:32 | vIkSiT | ,(empty {:a 1 :b 2}) |
| 03:32 | clojurebot | {} |
| 03:32 | tomoj | oh, or that :) |
| 03:32 | vIkSiT | :) |
| 03:32 | Chousuke | that should select all td elements that are children of tr elements |
| 03:32 | vIkSiT | thanks to wwmorgan who for some reason is speechless :P |
| 03:33 | G0SUB | Chousuke, hehe :) I want it like this ((row1td1 row1td2 row1td3) (row2td1 row2td2 row2td3)) |
| 03:33 | G0SUB | Chousuke, I need the TDs to be grouped by their TRs |
| 03:33 | Chousuke | G0SUB: I suppose you'll need to select all trs first then and map a selector over those? |
| 03:33 | G0SUB | Chousuke, right. I am doing that now. |
| 03:34 | G0SUB | Chousuke, I am getting the TD nodes, but I need to extract the contents too. |
| 03:37 | Chousuke | G0SUB: the elements should be just maps with :content but I suppose there is a selector for that too |
| 03:38 | G0SUB | Chousuke, I am looking for a way to avoid multiple map operations |
| 03:39 | wwmorgan | vikSiT: test. Everything works now :-) |
| 03:39 | vIkSiT | wwmorgan, aha :) what was the problem? |
| 03:39 | bsteuber | is it possible to extend a protocol to a single instance? |
| 03:39 | Chousuke | G0SUB: why? map is lazy. |
| 03:39 | Chousuke | bsteuber: no. |
| 03:39 | G0SUB | Chousuke, I agree. Just looking for a more a compact syntax |
| 03:39 | wwmorgan | needed to register with NickServ |
| 03:39 | bsteuber | Chousuke: thx, I thought so |
| 03:40 | Chousuke | G0SUB: maybe you can use comp :P |
| 03:40 | G0SUB | Chousuke, hehe |
| 03:41 | vIkSiT | wwmorgan, aah |
| 03:42 | vIkSiT | hmm, so whats the best method to serialize a clojure data structure for disk-storage? |
| 03:42 | vIkSiT | (lets say I have a protocol/record combo that needs to be read) |
| 03:44 | Chousuke | the best method depends on what your actual needs are. You can use a real database if you have a lot of data and need speed, or you can just convert the data to a map and print it out if that's enough. |
| 03:44 | Chousuke | you're going to need custom logic for reading/printing in any case |
| 03:47 | vIkSiT | Chousuke, well, I'm actually _building_ a database :) so I have to use file storage of some form. For instance, I have a tree representation that I'd like to serialize for a table into a file.. |
| 03:47 | Chousuke | well, hm |
| 03:48 | Chousuke | records are not serialisable or readable so you'll have to convert them to something |
| 03:48 | vIkSiT | right |
| 03:48 | Chousuke | a map might be enough, but of course it's not very efficient. |
| 03:49 | Chousuke | for a speedy database, you'd have to come up with your own binary encoding. |
| 03:49 | vIkSiT | btw, when you mean "readable - you mean something like binding *print-dup*? |
| 03:49 | Chousuke | I mean you can't use read to read the output of pr on a record. |
| 03:49 | Chousuke | though that limitation might go away eventually |
| 03:50 | vIkSiT | ah I see |
| 03:51 | vIkSiT | so in order to convert a data structure to a binary format - what would you recommend reading? |
| 03:51 | vIkSiT | (as in, what clojure functionality could I use best?) |
| 03:51 | Chousuke | I'd recommend using some library but hm :P |
| 03:52 | Chousuke | I suppose that kind of stuff goes to java land; you'll need to use the IO facilities. |
| 03:52 | vIkSiT | hehe yeah I guess I'd better use that |
| 03:52 | Chousuke | if you're using 1.2 don't forget clojure.java.io |
| 03:54 | vIkSiT | ooh good point |
| 04:00 | TheBusby | cd |
| 04:01 | TheBusby | whoops, sorry, wrong winow |
| 04:01 | TheBusby | window |
| 04:29 | LauJensen | Morning team |
| 04:30 | TheBusby | morning |
| 04:31 | fyuryu | aloha |
| 04:48 | naeu | good morning :-) |
| 05:08 | tomoj | I can't get overtone working :/ |
| 05:09 | naeu | tomoj: join #overtone and I'll see if I can help you... |
| 05:19 | G0SUB | Can Clojure get a CL-ish conditions/restarts facility in the future? |
| 05:21 | hoeck | G0SUB: there is something similar already in contrib, I believe |
| 05:22 | G0SUB | hoeck, error-kit? It doesn't (and can't) have restarts, unfortunately |
| 05:22 | hoeck | right, error-kit |
| 05:24 | Chousuke | G0SUB: I suspect such features would depend on JVM support |
| 05:24 | hoeck | G0SUB: the other one was clojure.contrib.condition |
| 05:25 | Chousuke | G0SUB: unless you want to emulate them with exceptions and other trickery |
| 05:25 | G0SUB | Chousuke, I agree. I was wondering if C in C might help. |
| 05:26 | hoeck | couldn't you emulate restarts with dynamic variables, which are bound down the stack and called immediately when a function raises an exception? |
| 05:26 | hoeck | instead of actually throwing that exception? |
| 05:26 | G0SUB | hoeck, In theory, yes :) |
| 05:27 | hoeck | and in practice, is that to slow? I thought this is done by either c.c.error-kit or c.c.condition |
| 05:27 | hoeck | *too slow |
| 05:27 | Chousuke | JVM exceptions can be pretty fast if they're preallocated |
| 05:29 | Chousuke | IIRC John Rose mentioned in his blog that the most time is spent creating the stacktrace when an exception is allocated |
| 05:29 | Chousuke | and if an exception is preallocated the JVM can in some cases compile a throw into a simple goto |
| 05:30 | G0SUB | Chousuke, the problem is that with restarts, you can't unwind the stack. |
| 05:33 | Chousuke | I suppose technically the JVM could support continuations and restarts, they just don't- |
| 05:35 | G0SUB | Chousuke, may be some day :) |
| 05:38 | Chousuke | http://blogs.sun.com/jrose/entry/continuations_in_the_vm |
| 05:39 | Chousuke | It seems unlikely to happen though. |
| 06:52 | defn | the idea of tries, applied to all other sorts of disciplines like evolutionary psychology has far reaching consequences for the validity of their sciences |
| 06:53 | silveen | when ordering the Joy of Clojure book with MEAP, the ebook is drm free I hope? |
| 06:53 | defn | namely, that it enhances it. it seems a systematic methodology for subdividing groupings of events |
| 06:54 | defn | silveen: it is i believe -- it may have your name on it |
| 06:54 | defn | like "This PDF Generated for: silveen" |
| 06:54 | defn | but that's it |
| 06:54 | silveen | okey defn |
| 06:55 | silveen | I just cba with alot of "do view this, please visit this website, follow 300 steps, download, fail, call customer support, pay $100 in phone fees, follow 50 more instructions, reinstall OS, do everything again, read once and then "thanks for shopping at yahoo" |
| 06:55 | clojurebot | :negative/num-1 + :positive/num-1 = :zero/zero |
| 07:36 | bartj | hi, compiling clojure-contrib fails because of a test failure in the clojure.contrib.test-jmx |
| 07:43 | hugod | a |
| 07:43 | clojurebot | a is b |
| 07:44 | serp_ | b |
| 07:45 | rhickey | so, has anyone tried the num branch? |
| 07:45 | rhickey | http://github.com/richhickey/clojure/commit/6ab3e4cd672092823a04c944210a23c29142785d |
| 08:06 | dnolen | rhickey: did you see my comment about areduce and amap in the num branch? |
| 08:06 | rhickey | dnolen: no |
| 08:06 | dnolen | rhickey: they still use unchecked-inc |
| 08:06 | rhickey | dnolen: ah |
| 08:06 | rhickey | so much for test coverage :( |
| 08:13 | rhickey | dnolen: fixed, thanks |
| 08:13 | serp_ | context: server for computer game. problem: I have store a bunch of info about a game character in a ref. I use add-watch to catch when a modification is done to a character, and then check compare the old and new value of every attribute of the character to see what changed and sends messages to all client about the update. this feels very clumsy as there are a lot of compares. might it be a better design choice to have each attribute as a ref? |
| 08:15 | AWizzArd | serp_: can't you signal something at the place where you change the specific field? |
| 08:16 | AWizzArd | Some code currently is handling the attribut update... |
| 08:16 | AWizzArd | +e |
| 08:17 | serp_ | I don't want to require the behaviour code to understand how the network updates work |
| 08:17 | dnolen | rhickey: num branch is impressive! |
| 08:17 | dnolen | rhickey: does aset need fixing as well? |
| 08:17 | serp_ | I want (set-pos player1 14 15) to both update the server state AND, as a side effect, send this update to all clients |
| 08:18 | AWizzArd | serp_: the behaviour code could trigger an action... :strength-updated |
| 08:18 | tomoj | ref proliferation seems dangerous to me |
| 08:18 | rhickey | dnolen: how so? |
| 08:20 | dnolen | rhickey: lemme check, putting together an example of what I'm seeing |
| 08:24 | dnolen | rhickey: sorry. no everything seems to be working. was calling rand-int and missing a cast to long when inserting with aset. |
| 08:24 | rhickey | why did you need cast? |
| 08:26 | dnolen | rhickey: aset for an array of longs |
| 08:27 | rhickey | dnolen: still, why, what was happening? couldn't resolve? there should be little need for casts in num |
| 08:27 | dnolen | rhickey: http://gist.github.com/440593 |
| 08:28 | rhickey | what exception |
| 08:29 | dnolen | rhickey: no matching method foudn |
| 08:30 | dnolen | gist updated |
| 08:40 | dnolen | rhickey: hmm, it seems like I'm seeing perf regression again on (doall (map inc (range 1000000))) in num branch. |
| 08:42 | serp_ | AWizzArd: I guess... but that would be the same as having a bunch of refs and add-watches, only not automagical |
| 08:43 | rhickey | dnolen: not here, make sure you do: (dotimes [_ 10] (time (count (doall (map inc (range 1000000)))))) |
| 08:46 | dnolen | rhickey: you're right, issue seems to be around the use of into? http://gist.github.com/440617 |
| 08:46 | AWizzArd | rhickey: I sometimes do the same, using count to enforce map to fully traverse its input list. But why do you use doall here? Count should be enough, shouldn't it? |
| 08:47 | rhickey | AWizzArd: I just wrapped what dnolen already had |
| 08:49 | dnolen | rhickey: erg, disregard last gist, that's the same perf as pre-num, sorry. |
| 08:49 | rhickey | dnolen: and your vector one times doing it 10x, not once |
| 08:50 | rhickey | dnolen: should be: (dotimes [_ 10] (time (count (doall (map inc bigv))))) for apples to apples vs the range |
| 08:54 | dnolen | rhickey: yup |
| 09:12 | AWizzArd | ,(clojure.lang.MapEntry/create [1 2]) |
| 09:12 | clojurebot | java.lang.IllegalArgumentException: No matching method: create |
| 09:12 | AWizzArd | Is that already fixed in recent versions? |
| 09:13 | AWizzArd | ,(binding [*print-dup* true] (println (first {1 2}))) |
| 09:13 | clojurebot | #=(clojure.lang.MapEntry/create [1 2]) |
| 09:33 | rhickey | nice: http://www.infoq.com/news/2010/06/azul_ori |
| 09:35 | silveen | Does anyone know if Mannings ebook server being down is a known issue or if it just hates me? |
| 09:39 | fogus | silveen: I was just able to download the latest copy of the award-wining MEAP, "The Joy of Clojure" |
| 09:40 | Chousuke | :P |
| 09:40 | Raynes | fogus: No vested interests there. ;) |
| 09:40 | silveen | yeah I bought that a few hours ago |
| 09:40 | silveen | (more money to you) |
| 09:40 | silveen | but I can't download it, server dw.mannings.com blah blah doesn't respond |
| 09:41 | fogus | hmmm. did you follow the link in the email? |
| 09:41 | silveen | no I just took a random url from thin air |
| 09:41 | silveen | ofc I follows the instructions in the email |
| 09:41 | silveen | followed* |
| 09:42 | Raynes | Well, no need to be mean. :\ |
| 09:43 | fogus | ok then |
| 09:43 | silveen | sorry if it was taken as an offensive statement :( |
| 09:43 | Raynes | It's not his fault Manning borked their URL. :p |
| 09:44 | fogus | the MEAP update that I downloaded came from a different source than dw.mannings.com. So perhaps that server is indeed down. |
| 09:44 | fogus | support@manning.com |
| 09:44 | silveen | dw.manningpublications.com even |
| 09:45 | silveen | yeah I guess I'll throw them a mail |
| 09:46 | AWizzArd | rhickey: indeed, interesting link, thx |
| 09:46 | rhickey | so, who's ready for (= 1/2 0.5) => false, (== 1/2 0.5) => true |
| 09:47 | AWizzArd | why not the other way around? |
| 09:48 | chouser | whew. I don't think that would cause problems with any real code I have. |
| 09:48 | AWizzArd | Until now = was similar to equalp, and now you want it to be more like eql? |
| 09:48 | rhickey | = becomes type aware, == is equivalent values, = would be used in collection logic as well |
| 09:48 | chouser | whew. I don't think that would cause problems with any real code I have. |
| 09:48 | rhickey | AWizzArd: I don't want to draw connections to the CL stuff |
| 09:48 | AWizzArd | So, == will be the new equalp while = will be the new eql, and identical? stays eq |
| 09:49 | rhickey | AWizzArd: contrast with CL will not help with this |
| 09:49 | AWizzArd | Anyway, it is a semantic change. |
| 09:49 | rhickey | AWizzArd: yes, num branch has semantic changes |
| 09:49 | AWizzArd | I also don't think that my code specifically would have problems with that thought. |
| 09:50 | chouser | == is currently just for numbers. does that change? |
| 09:50 | rhickey | chouser: nope, still for numbers |
| 09:50 | AWizzArd | I would vote for == taking all objects, and do a deep comparison of those. |
| 09:51 | rhickey | AWizzArd: having a variety of equality logic really complicates things. |
| 09:51 | G0SUB | rhickey, Is a CL-like conditions/restarts system possible in Clojure in the future? |
| 09:51 | AWizzArd | So, (= [0.5] [1/2]) ==> true or false? |
| 09:51 | rhickey | G0SUB: no |
| 09:51 | rhickey | AWizzArd: false |
| 09:51 | AWizzArd | And (== [0.5] [1/2]) ==> IllegalArgumentException? |
| 09:52 | rhickey | AWizzArd: who is really doing things like that? I only find it in test code |
| 09:52 | rhickey | AWizzArd: exception, yes |
| 09:52 | AWizzArd | Don't know, I only speculate that it may sneek in somehow *shrugs* |
| 09:52 | chouser | no, == is for numbers, you wouldn't use it on collections like that. |
| 09:53 | rhickey | chouser: but people may ask for it if = no longer did numeric equivalence |
| 09:54 | chouser | it feels to me like in num the number types are more separated. less automatic conversion between types, etc. |
| 09:54 | rhickey | chouser: not really, there are in fact many more automatic conversions |
| 09:54 | chouser | oh. |
| 09:55 | rhickey | ints now match long params, and vice versa (with check) |
| 09:55 | rhickey | float match doubles |
| 09:55 | chouser | ah, I see. |
| 09:55 | rhickey | all numeric inits of locals are coerced to wither long or double |
| 09:55 | rhickey | either |
| 09:55 | chouser | I should keep my mouth shut until I read the commits more carefully. |
| 09:56 | rhickey | It is quite a substantial change, and yet compatible with contrib and argos, with the exception of one long-integer test in Incanter |
| 10:08 | AWizzArd | chouser: are your 2-3 Fingertrees mostly completed? |
| 10:11 | chouser | they work, but I have performance and api changes that need to be made before they're generally useful. |
| 10:12 | chouser | and I need to compare/contrast with the Functional Java version of finger trees as well. |
| 10:17 | AWizzArd | chouser: are the FJ Fingertrees fully persistent? |
| 10:17 | AWizzArd | Or only partially? |
| 10:18 | chouser | I assume so. the paper that defines the term 2-3 finger tree presents a fully persistent implementation |
| 10:19 | mcav | do any of you know where to find (and disable) the setting that turns "fn" into "ƒ" in emacs? |
| 10:20 | Chousuke | mcav: that's not a default, so check your init scripts? |
| 10:20 | mcav | ok, will do |
| 10:23 | mcav | ah, found it. It was in the "emacs starter kit" default settings. thanks. |
| 10:43 | AWizzArd | cgrand: ping |
| 10:44 | cemerick | G0SUB: check out error-kit in clojure.contrib |
| 10:44 | cemerick | (= 1/2 0.5) => is going to flip some people out |
| 10:45 | cemerick | especially around map lookups |
| 10:46 | chouser | I think that's where this will make more sense. |
| 10:46 | chouser | map lookups currently use equality that is neither = nor == |
| 10:46 | AWizzArd | ,(get {1/2 0} 0.5) |
| 10:46 | clojurebot | nil |
| 10:46 | AWizzArd | ,(get {0.5M 0} 0.5) |
| 10:46 | clojurebot | nil |
| 10:47 | AWizzArd | ,(= 0.5 1/2 0.5M) |
| 10:47 | clojurebot | false |
| 10:47 | AWizzArd | uh |
| 10:47 | AWizzArd | that last one surprises me |
| 10:47 | AWizzArd | ,(= 0.5M 0.5 1/2) |
| 10:47 | chouser | ,(= 1/2 0.5) |
| 10:47 | clojurebot | true |
| 10:47 | clojurebot | true |
| 10:47 | chouser | ,(= 0.5 1/2) |
| 10:47 | clojurebot | true |
| 10:47 | chouser | heh |
| 10:47 | AWizzArd | ,[(= 0.5M 0.5 1/2) (= 0.5 1/2 0.5M)] |
| 10:47 | clojurebot | [true false] |
| 10:48 | chouser | whee! |
| 10:48 | AWizzArd | I must be blind, I don't see where I have the typo... |
| 10:49 | cemerick | AWizzArd: no typo -- semantics of = depend on the callee |
| 10:49 | chouser | ,(= 0.5 1/2) |
| 10:49 | clojurebot | true |
| 10:49 | chouser | ,(= 0.5 1/2 0.5M) |
| 10:49 | clojurebot | false |
| 10:49 | cemerick | or, I should say, semantics of .equals depends on the callee, and = uses .equals |
| 10:50 | AWizzArd | ,[(= 0.5 0.5M) (= 0.5M 0.5) (= 1/2 0.5) (= 0.5 1/2) (= 1/2 0.5M) (= 0.5M 1/2)] |
| 10:50 | clojurebot | [true true true true false false] |
| 10:51 | serp_ | what is M suffix? |
| 10:51 | chouser | ,(type 0.5M) |
| 10:51 | clojurebot | java.math.BigDecimal |
| 10:52 | AWizzArd | ,5.3278569832756932875623985638562357 |
| 10:52 | clojurebot | 5.3278569832756935 |
| 10:52 | AWizzArd | ,5.3278569832756932875623985638562357M |
| 10:52 | clojurebot | 5.3278569832756932875623985638562357M |
| 10:52 | serp_ | ,(type (0.5M + 4)) |
| 10:52 | clojurebot | java.lang.ClassCastException: java.math.BigDecimal cannot be cast to clojure.lang.IFn |
| 10:52 | serp_ | ,(type (+ 0.5M 4)) |
| 10:52 | clojurebot | java.math.BigDecimal |
| 11:03 | tridd3ll | Does anyone have a current MEAP discount code for Clojure in Action? I can't find one in any email from Manning that I still have. |
| 11:06 | fogus | infoq35 was working as of a few days ago |
| 11:07 | vu3rdd | ,quit |
| 11:07 | clojurebot | java.lang.Exception: Unable to resolve symbol: quit in this context |
| 11:07 | vu3rdd | oops.. too much of swank usage. :-( |
| 11:09 | tridd3ll | fogus: thanks, I already bought your book and I'm just trying to fill out my library... I'll try that code |
| 11:12 | tridd3ll | fogus: still works, thanks! |
| 11:12 | fogus | yay |
| 11:17 | arkh | unlike agents sending off agents, is there anything blocking futures from firing off other futures? |
| 11:17 | arkh | (outside of something trying to realize a future's value) |
| 11:18 | AWizzArd | wb rhickey |
| 11:18 | rhickey | sorry, I lost the internets here |
| 11:18 | AWizzArd | yes |
| 11:18 | AWizzArd | something interesting about = |
| 11:18 | AWizzArd | ,[(= 0.5M 0.5 1/2) (= 0.5 1/2 0.5M)] |
| 11:18 | clojurebot | [true false] |
| 11:18 | AWizzArd | ,[(= 0.5 0.5M) (= 0.5M 0.5), (= 1/2 0.5) (= 0.5 1/2), (= 1/2 0.5M) (= 0.5M 1/2)] |
| 11:18 | clojurebot | [true true true true false false] |
| 11:19 | AWizzArd | In NUM I guess they all eval to false. |
| 11:36 | rsh | can you specify many to many relationships with clj-record? |
| 11:43 | AWizzArd | (goto 30) |
| 11:51 | danlarkin | cemerick: tisk tisk tisk |
| 11:52 | cemerick | heh, that's just the way it goes sometimes :-) |
| 11:52 | cemerick | at least it's locked away neatly in a macro |
| 11:53 | danlarkin | I "had" to do it once |
| 11:54 | danlarkin | I had to refactor a whole bunch of code to not need it anymore |
| 11:54 | danlarkin | but I was happier |
| 11:54 | chouser | check the return value of the try to see if the recur must be done? |
| 11:55 | cemerick | chouser: yup, with an (Object.) sentinel to request a recur. |
| 11:56 | cemerick | danlarkin: in this case, I want to rapidly beat a long series of attachment PUTs into a couchdb document, without restarting three levels out. |
| 12:02 | danlarkin | dang |
| 12:03 | danlarkin | tricky |
| 12:03 | cgrand | AWizzArd: pong |
| 12:12 | AWizzArd | cgrand: Hi. Do you remember how transients work? |
| 12:12 | AWizzArd | internally I mean |
| 12:25 | jkkramer | rhickey: (time (dotimes [_ 1e5])) takes over second on the num branch. modifying dotimes to cast its second arg as long fixes it, though i don't know if that's the proper fix |
| 12:27 | jkkramer | oh, he's not here |
| 12:29 | cgrand | AWizzArd: yeah, sure why? |
| 12:30 | AWizzArd | cgrand: while (find {:a 1, :b 20, :c 300} :b) ==> [:b 20] |
| 12:30 | AWizzArd | with transients I get: (find (transient {:a 1, :b 20, :c 300}) :b) ==> clojure.lang.PersistentArrayMap$TransientArrayMap cannot be cast to java.util.Map |
| 12:31 | AWizzArd | Is there a good reason why find should not work on transients? |
| 12:34 | cgrand | AWizzArd: no good reason, and in the same vein transient vectors don't support peek |
| 12:39 | chouser | are the map entries in transient themselves mutable? |
| 12:45 | cgrand | chouser: entries are created on the fly |
| 12:48 | claj | I try to lein deps in a fresh compojure project according to compojure.orgs getting started, but it says it can't download compojure-0.40-RC3.pom, what to do? |
| 12:51 | claj | or, why can't lein reach any of the repositories? |
| 12:54 | charliekilo | claj: just to make sure, my lein project references [compojure "0.4.0-RC3"]. i.e. any chance you forgot the '.'? |
| 13:02 | nickik | hallo |
| 14:14 | yacin | if i have a function defined later on in a file, is there anyway to use it before it's defined? |
| 14:14 | yacin | i have some globals that require the use of a function |
| 14:14 | yacin | and it makes more sense for the global to be at the beginning of the file |
| 14:14 | yacin | rather than at the end where the function is defined |
| 14:15 | chouser | (doc declare) |
| 14:15 | clojurebot | "([& names]); defs the supplied var names with no bindings, useful for making forward declarations." |
| 14:15 | yacin | thanks! |
| 15:50 | chouser | cemerick: your twitter link failed for me |
| 15:50 | cemerick | really? |
| 15:51 | cemerick | chouser: you mean http://bit.ly/cj89uz ? |
| 15:51 | chouser | http://muckandbrass.com/web/display/~cemerick/2010/06/16/The+beauty+of+letterpress+and+craft+and+old+arts+faithfully+renewed reports The proxy server could not handle the request Apache/2.2.12 (Ubuntu) Server at muckandbrass.com Port 80 |
| 15:51 | cemerick | hrm -- keeps loading OK here :-/ |
| 15:53 | chouser | nice post though. works fine at http://muckandbrass.com/ |
| 15:54 | cemerick | thanks -- I'm bouncing the sorry thing |
| 15:57 | cemerick | OK, it shouldn't have problems until, oh, 20 minutes from now. |
| 15:57 | serp_ | I want to write a tcp server for many (> 10) simultaneous long session clients. Any tips for a noob on how to manage the sockets in a way fit for clojure? |
| 15:58 | chouser | serp_: I've read recently that one thread per socket is not a bad way to go. Depending on your application it is often the simplest implementation too. |
| 15:58 | chouser | or perhaps two threads -- one for reading and one for writing? |
| 15:59 | serp_ | nDuff: what are conventional techniques for handling sockets in clojure? |
| 16:01 | nDuff | serp_, clojure.contrib.server-socket's create-server is probably conventional enough -- one thread per socket |
| 16:02 | serp_ | I'll have a look. thanks! |
| 16:05 | sclv | anybody got a minute to help walk me through a basic setup of a dev environment (using swank-clojure)? |
| 16:11 | alpheus | I just learned it myself, so I'll be glad to help if I can. |
| 16:11 | tridd3ll | sclv: no time now, but I documented my last setup here: http://riddell.us/ClojureSwankLeiningenWithEmacsOnArch.html |
| 16:12 | tridd3ll | sclv: might only be relevant for linux though |
| 16:14 | sclv | thanks -- that link looks sufficient to get me going |
| 16:36 | briancarper | It looks like numbers behave more sanely as hash keys in the num branch. This is good. |
| 16:38 | briancarper | ,{(int 1) :int (long 1) :long (bigint 1) :bigint} |
| 16:38 | clojurebot | {1 :int, 1 :long, 1 :bigint} |
| 16:38 | briancarper | No more of that to worry about. |
| 16:45 | qbg | Hmm, on the num branch (bit-shift-left 1 333) returns 8192 |
| 16:46 | qbg | Since math now throws on overflow, shouldn't that also throw? |
| 17:15 | arohner | has anyone had success using eclipse + CCW to debug a clojure project? |
| 17:15 | arohner | I can remote attach, pause and see a stacktrace, but it seems to be ignoring my breakpoints set in clojure code |
| 17:38 | serp_ | I'd like to allocate an array of 5 bytes. how do I do this? (let [buffer (new ??? |
| 17:38 | qbg | ,(make-array Byte/TYPE 5) |
| 17:38 | clojurebot | #<byte[] [B@1333295> |
| 17:38 | serp_ | what is /TYPE about? |
| 17:39 | qbg | To get the class object of the primitive type byte |
| 17:39 | serp_ | ah |
| 17:40 | serp_ | does / retrieve static members? |
| 17:40 | qbg | Yes |
| 17:40 | serp_ | ok. thanks |
| 17:48 | mmarczyk | morning (ugt) |
| 17:49 | serp_ | what could be the reason that makes my clj find clojure.contrib.server-socket but not clojure.contrib.json ? |
| 17:50 | qbg | How new is the contribs version you are using? |
| 17:50 | mmarczyk | serp_: what do you mean by "find"? |
| 17:50 | nDuff | serp_, what version of clojure-contrib are you running? |
| 17:51 | serp_ | mmarczyk: Exception in thread "main" java.io.FileNotFoundException: Could not locate clojure/contrib/json__init.class or clojure/contrib/json.clj on classpath <- |
| 17:51 | serp_ | I'll check what version, sec |
| 17:51 | serp_ | I use 1.1.0 clojure + clojure-contrib |
| 17:52 | mmarczyk | ah, I think there were two json-related namespaces back then, let me check... |
| 17:52 | mmarczyk | yup, json.read & json.write |
| 17:52 | mmarczyk | no json namespace |
| 17:53 | serp_ | hm you're right |
| 17:53 | serp_ | aha there is a separate api reference for 1.1.x |
| 17:53 | mmarczyk | right :-) |
| 19:17 | eslick_ | Anyone here familiar with clockwise? |
| 19:18 | eslick_ | And dealing with the conflation of eclipse java and lein-based clojure projects? |
| 19:20 | eslick | I should say counterclockwise... |
| 23:56 | technomancy | did we ever get a way to AOT-compile a single namespace without having the namespaces it requires get AOT'd? |