#clojure log - Apr 23 2009

The Joy of Clojure
Main Clojure site
Google Group
IRC
List of all logged dates

0:48 lisppaste8: cark annotated #79053 "this one is working" at http://paste.lisp.org/display/79053#4

0:50 replaca: you're parsing binary data into maps?

0:50 Cark: yes

0:51 that's gnuvince's project

1:03 replaca: cool

1:03 that's a useful idea

1:03 Cark: i'm not sure clojrue is the best tool for that, but yes

1:04 and performance isn't too bad

1:04 43 seconds to parse 150Mb of data

1:04 replaca: well, yeah, but finding very flexible ways to manage serialized data is interesting

1:05 I have nothing to compare that to, so it seems good to me :-)

1:05 Cark: i don't know, i always use sexprs for that =P

1:05 replaca: great if you've got lisp at the other end

1:05 Cark: well it's easy to parse anyways !

1:06 replaca: less great if you have, say, images or video streams in the mix

1:06 Cark: sure

1:06 replaca: in my day job, we have distributed systems that often run over severely bandwidth restricted networks

1:06 so every bit counts

1:07 Cark: well then you can compress your stream

1:07 replaca: if you get it compressed better, you can send more and deliver a better user eexperience

1:07 yeah, we do that too

1:07 Cark: (not talking about video of course)

1:07 do you get better results by compressing binary data ?

1:08 replaca: yeah, cause even binary data isn't fully compressed

1:08 i'm sorry-> evenly distrubyted

1:08 *distributed

1:08 cause a bunch of it ends up being text

1:09 Cark: ah i see

1:09 replaca: (not the video, but other stuff

1:09 and when it's not text, it's biased low (1s and 2s far outweigh 254s and 255s) even after we do minimum byte int compression

1:10 so basically, we do every trick in the book :-)

1:10 Cark: heh must be interesting

1:10 replaca: and we're adding more (adaptive video encoding, etc.)

1:11 yeah, it's fun. I mostly do architecture and management at work, so I don't get to code too much

1:11 though I have done most of the compression and bandwidth management/allocation stuff

1:12 (but Clojure ends up being my coding outlet :-))

1:13 Cark: it's a nice lisp

1:13 but the java stuff is sometimes killing me

1:13 hiredman: ~clojure

1:13 clojurebot: clojure is the best way to learn java

1:13 hiredman: ~botsnack

1:13 clojurebot: thanks; that was delicious. (nom nom nom)

1:14 Cark: clojuebot is very wise

1:14 replaca: java is both a blessing and a curse, no doubt

1:14 hiredman: one out of eleven shot that factiod would come up

1:14 ~literal [?] clojure

1:14 clojurebot: 11

1:20 Cark: ~def sort

1:28 i wonder why there's not a version of reduce with more than one calletionc, is the same fashion as map

1:28 is/in

1:50 replaca: the idea behind reduce is that you're "squishing" down a collection, whereas map is coollecting function results. That said, I don't why it wouldn't work.

1:52 Cark: there are many cases where i need to do ugly destructuring because of this

1:52 hiredman: map+reduce+apply

1:53 (reduce (partial apply somefunction) (map list some collections here))

1:53 clojurebot: map is *LAZY*

1:53 hiredman: clojurebot: I KNOW

1:53 clojurebot: Huh?

1:53 Cark: mhh

1:55 there still is structuring/destructuring under the hood

1:55 hiredman: for where?

1:55 Cark: the map form strutures into a list

1:56 and the apply destructures the list

1:56 but you're right it's not as ugly

1:56 i wonder about performances though

1:57 hiredman: I doubt it would perform worse then clojure's built in destructuring

1:58 ,(doc destructure)

1:58 clojurebot: "([bindings]); "

1:58 hiredman: ...

1:58 Cark: ~def destructure

1:58 hiredman: ,(destructure '[[a b] [c d]])

1:58 clojurebot: [vec__2292 [c d] a (clojure.core/nth vec__2292 0 nil) b (clojure.core/nth vec__2292 1 nil)]

2:00 Cark: uses nth with lists too =/

2:01 anyways ...good night !

2:02 replaca: goodnight!

4:04 liwp: how do I get the length of a sequence? I can't seem to find a length function in the core API...

4:09 cgrand: liwp: count

4:09 liwp: ahh, didn't think of that name. I tried to look for length and size. Thanks

4:10 How does one create a Java byte array in clojure?

4:10 I tried (into-array Byte/TYPE ...) but that didn't work

4:12 I'm trying to use the Java 2d API from clojure and dealing with primitive type arrays is turning out to be painful

4:15 For example, the pixels in this case are represented by signed bytes, but the values are really between 0 and 255. Java code deals with this by using ints to manipulate the pixels and then getting the byte value with byte b = i & 0xFF.

4:40 hoeck: liwp: try (into-array Byte/TYPE (map byte [1 2 3 4]))

5:10 liwp: hoeck: excellent, that works!

5:12 it seems that using (byte) I'm also able to force a 128-255 value into a signed byte, which is exactly what I wanted: (byte 255) -> -1

5:12 thansk

6:32 jdz: count

6:32 (make-array Byte/TYPE 4096)

6:32 ,(make-array Byte/TYPE 4096)

6:32 clojurebot: are you there?

6:32 clojurebot: #<byte[] [B@bed64>

6:32 jdz: silence...

6:32 clojurebot: excusez-moi

7:04 cemerick: This comment by GvR on side effects really shocked me: http://neopythonic.blogspot.com/2009/04/tail-recursion-elimination.html?showComment=1240451280000#c1726520516547497765

7:07 Sure, he's the python guy, so avoiding side effects isn't going to be a priority for him. But I expected at least an acknowledgement that doing so is really, really good (necessary?) in a *lot* of domains (if not all of them in a pervasively multicore world).

7:14 eevar2: +1 to gvr for correcting the lisp-worlds use of "persistent"

7:16 cemerick: I'll take Okasaki over GvR w.r.t. data structure terminology.

7:17 and I presume it was originally an ML term, given his usage of it....

7:20 eevar2: okies, "fp-world" then

8:23 gnuvince: Good morning

8:35 cgrand: gnuvince: hello

8:37 gnuvince: Quiet today

8:58 cgrand: ~seen dnolen

8:58 clojurebot: dnolen was last seen quiting IRC, 376 minutes ago

10:27 cgrand: dnolen: I think it's better to rename the conflicting CSS predicates

10:27 (CSS not is enlive/but)

10:28 dnolen: cool! I wasn't sure if that was a compromise you were willing to make

10:29 cgrand: are you tracking the master branch now?

10:29 dnolen: yes

10:29 cgrand: fine. I already renamed empty to void and put complement into another ns

10:30 dnolen: great

10:31 cgrand: enlive is moving along at light speed, a tutorial and everything ;)

10:32 Chousuke: it's really neat though.

10:33 cgrand: thanks again to Adrian (are you here?) for the tutorial

13:15 noidi: is there a way to import all the statics from a java class?

13:16 I'm trying to get rid of the extra gl's in the moronic JOGL API :P

13:16 (let [gl (.getGL drawable)] (.glHint gl GL/GL_PERSPECTIVE_CORRECTION_HINT GL/GL_NICEST))

13:16 seriously, who comes up with an API like that >

13:16 :D

13:16 leafw: noidi: clojure discourages namespace pollution with imports you don't need. That said, there may be a way :)

13:17 kotarak: there was a contrib.import-static...

13:18 noidi: kotarak, yeah, I thought I remembered something like that mentioned here

13:18 thanks :)

13:19 hmm, it still requires all the statics to be named explicitly

13:20 I guess I'll just write a few macros, so I can do (gl Hint (GL PERSPECTIVE_CORRECTION_HINT) (GL NICEST)) instead of the monstrosity above

13:20 it's possible to rewrite symbols in a macro, right?

13:21 leafw: noidi: still reads quite verbose, and you lose the ability of any java programmer to understand the code

13:22 noidi: but it's closer to the original API, in which the command would be glHint(GL_PERSPECTIVE_CORRECTION_HINT, GL_NICEST);

13:24 technomancy: maybe it was written by a python programmer who was used to self.repeating self.self all the self.time. =)

13:26 rsynnott: a lot of C libraries do that sort of thing, as an attempt to be vaguely OO

13:27 noidi: opengl's not really OO, that's just making up for the lack of namespaces in C

13:34 danlarkin: yeah it has nothing to do with OO

13:44 pjstadig: ~def keys

14:18 durka42: auto-documentation?

14:19 hiredman: replaca write something to auto generate docs in the google code wiki

14:19 wrote

14:20 http://code.google.com/p/clojure-contrib/wiki/OverviewOfContrib

14:21 durka42: oh, that's cool

14:21 makes contrib a lot more discoverable

14:21 jwinter_: that is cool, e.g. http://code.google.com/p/clojure-contrib/wiki/ZipFilterApiDoc

14:22 cads: clojure clojure clo jure bannana fanna fo fojure.... I've got a clojure environment using rlwrap to provide tab completion on symbols, but is there a function that gives me the symbols that are mapped in a namespace, allong with their doc strings, perhaps formatted the same way (doc aSymbol) does it?

14:23 durka42: there is ns-publics

14:23 hiredman: cads: clojure.org/namespaces

14:23 durka42: also perhaps find-doc

14:23 kotarak: cads: the repl of vimclojure does that, but it's only interesting if you are a vim user...

14:23 replaca: glad to help! please ignore spurious checkin messages - developing with the google wiki isn't so great

14:23 but it's almost all there

14:24 cads: (doc 'clojure.org/namespace) doesn't work? why not?

14:24 clojurebot: Excuse me?

14:25 hiredman: cads: website

14:25 http://clojure.org/namespaces

14:36 te: technomancy: i just saw your bludgeon repo

14:36 brilliant, sir

14:37 technomancy: i have another idea for bludgeon -- could you crush a human skull with the total weight of floppy disks the library occupies

14:38 or perhaps -- could a sock full of floppy disks representative of the library size, be used to beat someone to death?

14:39 cemerick: what's the deal with twibes? Way offtopic, but I just saw cgrand join up, so...

14:39 technomancy: te: floppy disks... interesting

14:40 te: technomancy: im not sure how big rspec's library is, but i mean, i think a good 10 or so floppies in a sock could effectively be used to kill someone

14:40 20, certainly

14:40 10 could at least provide a serious beating

14:43 technomancy: te: the main problem I had with that library was integration testing. let's just say there were some serious side-effects that I wanted to avoid at test-time. =)

14:44 cads: does clojure have a standard that defines it, in terms of a formal grammar definition?

14:45 one thing I'll be willing to wager on, if such a thing does not exist yet, it should be easier to produce that in a language such as ruby

14:45 hiredman: well, it's a lisp

14:46 cads: true, we can find personal axioms to understand it by :D

14:46 hiredman: lisp grammars are easy

14:46 cads: they are, I've made my own notes :)

14:48 who would make a standards document, if it came to that?

15:10 Chouser: it's likely the clojure reader will eventually be re-written in clojure.

15:11 at that point, if done carefully, the code could act as a spec

15:12 hiredman: or you could use fnparse

15:27 replaca: I've been thinking about a modified reader myself, so that we could pretty print files of coode

15:27 *code

15:27 but it hasn't gotten past the idea stage

15:27 cause the regular reader loses comments and metadata annotations

15:40 Lau_of_DK: Java guys - I have questions!

15:40 1) Which classes will best solve this: I need to download a website, just get the raw bytes, and the reponse code.

15:44 Cark: i beleive the url class can give you a stream

15:44 Lau_of_DK: Ok, I'll look into it

15:44 kotarak: aren't duck-streams also handling URL?

15:44 Cark: but i don't know about the response code

15:44 Lau_of_DK: Hmm

15:44 leafw: yes, it can: URL getStream

15:45 Lau_of_DK: Actually - I remember seeing a http client in contrib way back when

15:47 replaca: Lau_of_DK: doesn't seem to be there now

15:47 Lau_of_DK: Thats true

15:50 Anybody else here had some performance problems with jetty servlets ?

15:50 rsynnott: a http client, as opposed to a wrapper for the java one, is probably not something that you'd actually want to write

15:50 all the nasty stuff is already done for you, after all :)

15:51 Lau_of_DK: Or rather - My second question of the night - Is there a neat way to schedule a load test? Lets say I want 1000 hits per hour, and I want these even distributed - how would I most elegantly set that up ?

16:01 replaca: rsynnott, Cark: yeah, I'd just use the java stuff for that and wrap it in a clj function that does just what you want.

16:09 gnuvince: Cark: I ran more tests in my VMWare machine with an "heated up" JVM, but the results are largely the same. Like I said, I figure that the speed of IO in VMWare is the cause of the bottleneck.

16:11 Cark: gnuvince : allright ... i managed to knock off another second off ...but that's meaningless

16:13 gnuvince: I get home at around 7:30-8:00 (math homeworks :(, I'll check it out then.

16:14 Cark: i'llo give you the latest code

16:14 just let me know you're back

16:53 eevar_: Lau_of_DK: httperf?

16:53 with --rate

16:59 Lau_of_DK: I tried http_load with -rate, but it doesnt support less than 1 second, which I need

16:59 eevar_: 500 = 500 request per second -- or something like that

17:01 or, well.. doesn't seem to be that, but higher number = more load

17:01 --period gives more control

17:06 danlarkin: Lau! I have a sortof-http client library if you want it

17:07 that was an oddly placed "sortof"... it is not sortof-http, it is http

17:07 rsynnott: sort-of library, then? ;)

17:09 danlarkin: correct :)

17:10 I will post it to the mailing list as a submission for contrib once I work out the api more fully

17:17 Lau_of_DK: danlarkin: Send me an email on it? I'd really appreciate it

17:17 I was fiddling with apache's, but since we done have import org.apache. * - it was just a mess

17:17 danlarkin: http://gist.github.com/98612

17:18 Lau_of_DK: Sanks

17:25 hiredman: clojurebot: what is the most terrible thing?

17:25 clojurebot: In Ordnung

17:25 hiredman: clojurebot: the most terrible thing?

17:25 clojurebot: excusez-moi

17:25 hiredman: clojurebot: the most horrible thing?

17:25 clojurebot: most horrible thing is http://tinyurl.com/b65o8e

19:18 Drakeson: Do you know a powerful plot library that is not too hard to use from clojure?

19:20 something similar to matplotlib for python

19:23 eee: hello

19:23 dliebke: jfreechart is an excellent java library, I've wrapped parts of it for my Incanter project. Here's some samples: http://wiki.github.com/liebke/incanter/sample-plots-in-incanter

19:23 eee: is there an easy way to get access to the whole contrib namespace?

19:24 Drakeson: eee: me too :)

19:25 eee: i'm using clojure-dev, and finding the namespace browser awesome

19:25 Drakeson: dliebke: thanks a lot. that's what I was looking for

19:25 eee: but it only shows what's in your namespace now

19:25 dliebke: good luck

19:26 eee: but specifically I'm looking for the fastest merge, meld, union type implementations

19:26 maybe seq-utils

19:30 i also forgot how you use some new namespace

19:30 require I guess

19:39 now i remember. it's (use)

19:51 Drakeson: how can I build and use clojure using maven? Do I start by "mvn install" ?

19:53 man mvn is not informative

19:55 * Raynes uses ant to build clojure.

19:56 Drakeson: I did too, but it seems I miss a lot if I don't use mvn (on the java side)

19:57 eee: are you forking clojure?

19:57 Drakeson: god! no!

19:58 eee: nice reaction :)

19:58 Drakeson: is using/trying to use mvn imply that?

19:59 s/is/does

20:00 * Raynes wonders what you could possibly miss, just compiling and building something.

20:01 Drakeson: I said on the java side. downloading .jar files manually in no fun.

20:02 eee: not the maven part. I'm just trying to learn what the usefulness is. Either you had to make a change to try something out, or you want to fork, or you want the latest snapshot that isn't built (and so why don't the distributors have a continuous build system upon checkin) or you want it on some little phone device . . . or I am just nosey :)

20:03 Drakeson: oh, I just don't know how maven works. I am still new to java.

20:04 eee: why do you need to build clojure?

20:04 why does one

20:04 clojurebot: why not?

20:04 eee: etc

20:04 Drakeson: I want the latest clojure.

20:05 eee: and they don't have automated build

20:05 Drakeson: can I get it without building?

20:05 eee: i wonder

20:05 Cark: buildin is just type "ant <enter>"

20:06 eee: making me think about a git-hub or google repos-like thing that always builds whenever someone does a checkin

20:06 Drakeson: Carl: then you have to worry about where the .jar goes.

20:06 eee: if they don't, that's an opportunity

20:06 java-only of course

20:08 i have a question to ask anyone who is following the google groups discussions for clojure

20:09 arohner: eee: shoot

20:09 eee: is that anyone here right now?

20:09 cool

20:09 arohner: a lot of us here are also on the groups

20:09 eee: i'm posting results about this heap

20:09 is it annoying?

20:09 or passively interesting

20:09 arohner: which post is that?

20:10 oh, priority queue: some results

20:10 eee: latest is this: best way to compete against meld?

20:10 yes

20:10 i just got another result

20:10 best of all

20:10 and thinking of posting

20:11 is it ok?

20:11 felzix: Is there a way to eval def's first argument?

20:11 arohner: eee: yeah, keep posting

20:11 eee: cool

20:11 arohner: I know it's discouraging to not get any responses

20:11 it's happened to me several times

20:11 eee: i just merges two sorted sets

20:12 and then two heaps

20:12 check this out

20:12 performing union of two sorted sets "Elapsed time: 18881.81 msecs" making another heap performing meld of two heaps "Elapsed time: 0.146 msecs"

20:12 arohner: nice

20:12 eee: ahhhhh

20:12 feedback

20:12 :)

20:12 arohner: one piece of advice is that it's slightly hard to follow the topic when you have several different threads

20:12 eee: oh

20:12 arohner: reply to yourself in one thread just to keep the context around

20:12 eee: ok

20:13 i'll add to the last results email then

20:13 felzix: like using set instead of setq in CL

20:13 eee: no

20:13 set means a uniquified list like thing

20:13 noun

20:14 not verb

20:14 arohner: felzix: I don't know enough CL to know what you're asking

20:14 eee: setq

20:14 means def

20:14 arohner: the first argument to def is the symbol name you want to point at the new var

20:14 eee: or something like that

20:14 yeah

20:14 so he thinks of "set" the verb

20:14 to set

20:15 arohner: so I don't understand what you mean by eval'ing it

20:15 eee: we mean the datastructure

20:15 who said eval?

20:15 felzix: say, (let [a 'b] (def a 9)) resulting in b == 9

20:16 eee: oh I missed it

20:16 arohner: ah, ok

20:16 eee: i see

20:16 arohner: you could do that with a macro pretty easily

20:17 actually, you might not even need the defmacro, just the backticks

20:17 though, why do you want to def inside of a let? that creates a new global

20:17 unlink: How do I serialize my Clojure objects efficiently?

20:17 Raynes: ``

20:18 felzix: arohner: Ah, you're right, extremely easy to make.

20:18 unlink: Like protobuf, cPickle, or memcpying structs in C.

20:19 arohner: felzix: though be careful with that. It's generally frowned upon to change the value of a var using def in running code

20:19 unlink: Did I just answer my own question? protobuf supports Java.

20:19 arohner: really the only reason you're allowed to re-def a var is for development purposes

20:20 felzix: arohner: I'm using it in a define-class macro to make boilerplate functions.

20:21 arohner: felzix: that sounds appropriate then

20:21 felzix: cool. Thanks for the help!

20:22 eee: k, made my new post

20:22 thanks for the encouragement

20:23 gnuvince_: Doe all aset functions go through the reflection framework?

20:24 eee: i don't know what aset is

20:24 so I can't help

20:24 rhickey_: eee: I don't think sorted collections negate the value of heaps in any way, heaps serve some unique purposes

20:25 eee: thanks rich

20:25 gnuvince_: eee: setting values to an array

20:25 eee: did you see the last result?

20:25 awesome

20:26 i just need to figure out decreaseKey()

20:26 in functional setting

20:26 unlink: gnuvince_: http://code.google.com/p/clojure/source/browse/trunk/src/jvm/clojure/lang/RT.java

20:26 eee: without backpointers

20:27 oh yeah gnu

20:27 I forgot about aset

20:28 rhickey_: eee: I'm sorry I haven't had time to look at your stuff yet. One word of advice I'd have, is that you'll find papers on purely functional implementations, but you are not limited to that in making a functional persistent data structure for Clojure. Mutation of temporaries, or one-time setup during insertion is a critical component to the speed of Clojure's maps/set/vectors.

20:29 eee: ok

20:29 I was thinking about that

20:29 rhickey_: no backpointers though :)

20:29 eee: yeah

20:29 rhickey_: and no mutation after init

20:29 eee: ok

20:30 can you explain that with one more sentence. the init meaning what happens at 'new' time, right?

20:30 when the type is established

20:30 rhickey_: but if you look at PeristentHashMap et al you'll see that new arrays are created and mucked with on inserts/deletes

20:31 eee: creating any new version, you can create some *new* component of the data structure, mutate it, then weave it into the result, but once returned never to change again

20:31 eee: yeah

20:31 i do that a lot

20:31 well

20:31 minimum needed

20:32 that I can tell

20:32 so I think I'm following the rules

20:32 will look at PHashMap though

20:33 thanks for the pointers

20:33 no pun intended

20:33 :)

20:38 the PeristentHashMap looks somewhat like what I had one or two versions ago with all the static functions in the implementation file. But I shaved of a little time consolidating. maybe I should put it back since it was negligable, hmmmmm

20:38 unlink: gnuvince_: here is the implementation of evens I was trying to accomplish yesterday: http://gist.github.com/100253

20:38 evens2

20:40 eee: unlink: intersting

20:40 Drakeson: I am getting: Could not find clojure.lang.Compile. is that gone?

20:41 dnolen: nope, Drakeson are you trying to compile clojure-contrib?

20:41 unlink: exercise for the reader: use recur

20:41 Drakeson: no, incanter

20:41 eee: unlink: would look almost the same, right?

20:42 dnolen: perhaps you need to explicitly pass the path to clojure.jar to ant? you have to do this contrib.

20:43 unlink: eee: well, evens2 is not in tail position

20:43 Drakeson: like -Dclojure.jar=... ?

20:43 eee: does this help with compiling? http://www.lithinos.net/Compiling-Clojure-applications-using-Ant.html

20:44 dnolen: ant -Dclojure.jar ../clojure/clojure.jar

20:44 with whatever your path is tho.

20:46 gnuvince_: unlink:

20:46 user=> (take 3 (evens2 (iterate inc 1)))

20:46 ()

20:48 unlink: oh looks like I wasn't actually testing the function.

20:49 eee: rhickey_: I actually wondered if there could be a drastic speedup as multi-core computers come on line. The way there's a separate thread for GC, maybe there should be a separate thread for object pools. so the *new's* could be predicted and created in advance in another thread.

20:49 clojurebot: for is not a loop

20:49 eee: gnuvince_: I think it's even items in the list

20:50 oh

20:50 you cakked his evens2

20:50 i didn't see you define it

20:50 i thought you used clojurebot

20:51 cads: do you guys think I could embed the semantics for simple PIC microcontroller C code (simple loops, even gotos (eww), very shallow recursion, lookup tables), into a clojure DSL, for a simple code generation framework using CLJ syntax?

20:52 eee: i wonder if that relates to something I saw, cads. I'll remember in a sec

20:52 unlink: gnuvince_: you have to do (apply evens2 (take 3 (iterate inc 1)))

20:52 eee: nestedvm

20:53 http://nestedvm.ibex.org/

20:53 gnuvince_: unlink: you got a stack overflow too

20:54 unlink: gnuvince_: if you try to apply iterate you will

20:54 arohner: cads: why not?

20:55 I was looking at the mini-VM from the ICFP from a previous year, and it didn't seem that bad to do it in clojure

20:56 lisppaste8: gnuvince pasted "Lazy evens" at http://paste.lisp.org/display/79106

20:58 arohner: unlink: it's a neat trick, but what is the point?

21:01 unlink: arohner: I find it to be the most natural way of expressing it

21:01 like haskell/sml's pattern matching

21:01 gnuvince_: Except Clojure has no pattern matching, so it's kind of futile to try and replicate that style.

21:02 unlink: It has arity overloading, so no, it isn't.

21:02 arohner: oh that reminds me, why isn't there a function for the sequence of ints?

21:02 doing (iterate inc 0) all over the place bugs me

21:03 dnolen: well not totally true, between multimethods, multiple arity, and destructuring bind you have quite a few good ideas from pattern matching.

21:03 gnuvince_: unlink: but you need to use apply to call the function instead of the normal form.

21:03 arohner: not that I know of.

21:03 arohner: gnuvince_: I know there isn't a function for that. That's the problem :-)

21:04 gnuvince_: arohner: define a natural functioN?

21:05 dreish: ,(map first (partition 2 [0 1 2 3 4 5 6 7 8]))

21:05 clojurebot: (0 2 4 6)

21:06 gnuvince_: ,(take-nth 2 (rest [0 1 2 3 4 5 6 7 8]))

21:06 clojurebot: (1 3 5 7)

21:06 eee: wait, is this a function to find the even valued things? or even position things?

21:06 dreish: Positioned

21:07 gnuvince_: It's a function to extract the even-indexed elements in a 1-indexed collection.

21:08 eee: ,(map first (partition 2 [1 0 3 4 2 5 6 7 9 11 13]))

21:08 clojurebot: (1 3 2 6 9)

21:08 eee: nice

21:08 how's it work

21:08 dreish: partition 1 2 avoids dropping the last one if there are an odd number. Or you could just use take-nth

21:09 ,(partition 2 (range 10))

21:09 clojurebot: ((0 1) (2 3) (4 5) (6 7) (8 9))

21:10 eee: handy function

21:11 dreish: ,(partition 3 1 (range 10))

21:11 clojurebot: ((0 1 2) (1 2 3) (2 3 4) (3 4 5) (4 5 6) (5 6 7) (6 7 8) (7 8 9))

21:12 eee: cool

21:13 ,(partition 3 3 (range 10))

21:13 ,(partition 3 3 (range 10))

21:13 clojurebot: ((0 1 2) (3 4 5) (6 7 8))

21:13 eee: that's power

21:20 i think I found the decreaseKey() answer!

21:20 i'd forgotten about it

21:20 Eurika

21:21 Jedi_Stannis: what was the question?

21:22 eee: making a heap/priority queue ... functional

21:22 in java

21:23 meld, insert, findMin, deleteMin ... ok

21:23 but

21:23 can't do things like Branch and bound, A-Star, shortest path, Prim's alg . . .without decreaseKey

21:24 end of soliloquy

21:25 Jedi_Stannis: I see

21:26 code online anywhere?

21:26 eee: yeah

21:26 one sec

21:26 http://code.google.com/p/jc-pheap/

21:26 http://code.google.com/p/jc-pheap/source/browse/#svn/trunk/jc-pheap/src

21:28 well now I see a problem with what I was just thinking. false Eurika

21:29 Jedi_Stannis: so is the idea to be able to use this data structure from within clojure?

21:29 eee: yup

21:29 there;s a clojure test in there

21:29 Jedi_Stannis: any reason you wrote in java instead of directly in clojure?

21:29 eee: haven't tried that yed

21:29 yet

21:29 but i have a paper somewhere on treaps

21:30 that maybe will work like that

21:30 figured it would be faster

21:30 and Rich suggested it, too

21:30 be back in a few

21:33 back

21:36 i think the trick is

21:36 that somehow you leave the old value where it was

21:36 and clone the object inserting it anew

21:37 when the deleteMin gets to the old one

21:37 it skips it

21:37 but . . .one problem is that that sounds amortized

21:37 and another problem is that the clone messes with "identity"

21:38 so at the very lease you gotta do a secret mutable swap

21:38 but no

21:38 depends on if two clients can have a handle to the same node

21:38 but they can't so maybe it will work.

21:38 end of soliloquiy 2

21:39 :)

21:47 Jedi_Stannis: interesting

21:47 I don't think I know enough about priority queues to fully appreciate all of this

21:47 eee: the brodal paper is in the code repos

21:48 WAY easier than his imperative version

21:48 i had all that straight at one time

21:48 i like data structures a lot

21:49 Jedi_Stannis: yeah, I haven't explored data structures too deeply

21:49 eee: know what a splay tree is? That's awesome. so is disjoint set

21:49 Jedi_Stannis: nope

21:50 main advantage of these is their running time for certain operations?

21:50 eee: in some shops, for what they are doing, machines are fast enough just to use vectors everywhere, sadly

21:50 Jedi_Stannis: yeah

21:50 eee: run time and organization

21:51 disjoint set is an easy example to appreciate

21:51 if you are interested I could try

21:51 Jedi_Stannis: if you had functional versions of other collections that have different trade offs that could all be used in clojure, that would be pretty cool

21:51 eee: be back in a sec

21:52 back

21:53 so with disjoint set. you may start with 300 sets each with one element

21:53 at some point, you may decide that two such elements should be in the same set

21:54 but only if they aren't already in the same set

21:54 or you just might want to ask if two elements are in the same set

21:55 or what set is an element in and have some sort of VALUE that distinguishes that set

21:55 if you try to do that with linked lists

21:55 your done

21:55 you'll spend so many cycles updating links

21:56 under lots of join operations, the identities of two sets have to meld into one

21:56 Tarjan solved it

21:56 disjoint sets

21:56 good stuff

21:56 smallest algorithm/data structure ever, too

21:56 Jedi_Stannis: sounds interesting

21:57 Drakeson: is there a mechanism to unpack jars and "install" them in a local or system-wide (/usr/lib/...) place (plus updating some index) and have a classloader that uses the extracted jars and the index?

21:58 eee: you mean in java?

21:58 jar -xvf some.jar

21:58 gnuvince_: ~seen Cark

21:58 clojurebot: Cark was last seen in #clojure, 113 minutes ago saying: buildin is just type "ant <enter>"

21:59 eee: but it won't make stuff know about them like libs . . . unless you have a CLASSPATH environment variable set

21:59 and in that case, no need to unpack them

22:00 Drakeson: I don't understand why java unpacks jars everytime it wants to use them.

22:00 Jedi_Stannis: is there a list of all the clojurebot commands somewhere?

22:01 durka42: there is his source code :)

22:01 Jedi_Stannis: where's that at?

22:01 Drakeson: Jedi_Stannis: look at http://github.com/hiredman/clojurebot

22:01 eee: oh I didn't know the source was bundled, cool

22:02 oh

22:02 i missunderstood again

22:02 :)

22:04 the other reason to do data structures in java I just realized is to give them to non-clojure people, too

22:04 like scala, I guess

22:04 durka42: clojurebot: where do you live?

22:04 clojurebot: Titim gan �ir� ort.

22:05 durka42: clojurebot: where are you?

22:05 clojurebot: http://github.com/hiredman/clojurebot/tree/master

22:05 Jedi_Stannis: lol

22:05 eee: clojurebot: hello

22:05 clojurebot: BUENOS DING DONG DIDDLY DIOS, fRaUline eee

22:05 Jedi_Stannis: wow

22:05 eee: lol

22:18 i'm confusing myself

22:18 in a purely functional world

22:19 what would it mean to decrease the value of something, anyway?

22:19 chessguy: return the successor of it

22:19 err, predecessor

22:19 decrease 2 == 1

22:19 eee: but, like from java it would be a new object, right?

22:20 since Integers are immutable

22:20 chessguy: if you want immutability, yes

22:20 eee: you'd just get a new Integer

22:20 that you would think of as the old integer

22:20 so

22:20 chessguy: well no

22:20 you'd probably call it something else

22:20 eee: well, in a priority queue

22:21 you stick something in

22:21 and later

22:21 you decide

22:21 no, I got the value wrong

22:21 I want to udate it

22:21 let it bubble up the queue

22:21 but "it"

22:21 is fuzzy

22:21 chessguy: you would return a new queue then

22:21 eee: yes

22:21 Jedi_Stannis: ,(-> {} (assoc :a 10) (assoc :a 1))

22:21 clojurebot: {:a 1}

22:21 eee: but the user needs a handle to their object

22:22 so they can mess with the value

22:22 besides a handle to te queue

22:22 the idea of a handle is fuzzy

22:22 chessguy: well if they can only mess with the value, and it changes in the queue, then you're breaking referential transparency

22:22 eee: in an immutable world

22:23 anyone else seing queue, I realize still needs the old queue

22:23 but the notion of a position where the value this guy is tracking needs to be there some how

22:23 in his new view

22:23 chessguy: perhaps what you want is a zipper?

22:24 eee: hmmm

22:26 when you stick something in the heap, you need the new heap and some sort of way to refer to your inserted item

22:26 chessguy: a zipper would do that

22:27 Jedi_Stannis: is it possible to have the same value in the heap multiple times?

22:27 eee: if you stick 5 2's in . . . only one of those 5's is yours, but I wonder if it even matters which one you decrease. I think it does matter if you have other data hanging off it that isn't part of the comparison

22:28 yes

22:28 chessguy: are you only ever going to be updating the one you last put in?

22:29 eee: if I figure it out. by the way, this code is in java . . .for clojure use

22:29 Jedi_Stannis: can you specify the old priority also?

22:30 eee: good question

22:30 i guess in an immutable world, you could have both handles

22:30 which means that you should have the version of the queue that goes with it

22:30 Jedi_Stannis: then even if there were multiple values, as long as you change the one with the right priorirty your good

22:30 eee: sounds reasonable

22:31 the "as long as you" part is the worrysome part tho

22:31 you've got your item and you've got a snapshot of the queue

22:31 you do decreaseKey and get a new item and a new queue?

22:32 so you need a unique handle/key to the item as a receipt

22:32 and maybe that key is only valid in one snapshot of the queue

22:33 i shouldn't say key

22:33 Jedi_Stannis: I don't think you need a unique key

22:33 eee: that's the comparator . . i mean ID

22:33 Jedi_Stannis: think of it in terms of the current clojure data items

22:33 eee: you need a unique ID only if you have objects

22:33 those objects could have many fields

22:34 besides your comparison field

22:34 you don't want to decrease the wrong object

22:34 just because the comparison field matches right?

22:34 Jedi_Stannis: hmm

22:34 way not just use clojures data type semantics

22:34 the value is the identity

22:34 eee: i see

22:34 Jedi_Stannis: the entire value is the "comparison field"

22:34 don't use identity anywhere

22:34 only use value

22:35 if the value is the same, they are equal

22:35 eee: Rich has an essay on that

22:35 Jedi_Stannis: cache hashes to make comparisons fast

22:35 eee: well

22:35 equal and less than are two different things

22:35 Jedi_Stannis: do priorities have to be intergers?

22:35 eee: ill-defined situation one thing could be not less than and not greater than . . . and STILL not equal either

22:36 Jedi_Stannis: or priorities can be any object?

22:36 eee: no, anything with an order

22:36 has to have less than defined

22:36 it's not a priority . . .it's a heap . . or a priority queue

22:37 Jedi_Stannis: so the collection has values in it, which each have a priority associated with them

22:37 eee: right

22:37 Jedi_Stannis: or the priority is inherit to the value itself?

22:37 eee: first thing

22:37 Jedi_Stannis: ok

22:37 eee: they implement java comparable

22:38 compareTo() is implemented

22:38 Jedi_Stannis: on the value or on the priority?

22:38 eee: i think your questions are good tho . . .making me think

22:38 Jedi_Stannis: I think you need to decouple the priority and the value

22:38 let me give an example

22:39 say your using this for a scheduler

22:39 and you have 3 processes

22:39 eee: a heap/priorityQueue has THINGS in it, that can be compared to each other in an order

22:39 ok

22:39 Jedi_Stannis: process a,b,c

22:39 rlb: eee: wouldn't an immutable priorty queue just be like any other clojure data structure, i.e. it only makes sense to talk about the "state" that's currently bound to an identity?

22:40 Jedi_Stannis: and we stick them all in the priority queue with different priorities

22:40 <(a,1), (b,2), (c,3)>

22:40 now we want to downgrade a's priority

22:40 rlb: s/wouldn't/couldn't/

22:41 eee: the state of the queue is no problem to understand rlb

22:41 Jedi_Stannis: (decreaseKey 'a 1 4 *1) --> <(a,4),(b,2),(c,3)>

22:41 eee: the queue is defined by what's in it

22:42 Jedi_Stannis: you can't have the objects in the prioirty queue have the priority be part of their value

22:42 because they can't be mutable

22:42 eee: ok

22:42 that's fine

22:42 but that's all blowing my mind how hard that is

22:42 I almost need a map and a queue

22:43 s/all/almost

22:43 Jedi

22:43 so

22:44 in java terms, I'd have an object with two fields

22:44 in clojure I'd have two objects

22:44 the thing, and it's priority?

22:44 Jedi_Stannis: yeah

22:44 eee: but

22:44 what TYPE could that be?

22:45 Jedi_Stannis: the thing can be anything

22:45 no restrictions

22:45 the priority needs to be comparable

22:45 eee: um

22:45 then it could be an object like in java

22:45 with two fields

22:45 recursive argument

22:45 Jedi_Stannis: would you want that for a reason?

22:46 eee: you mean just define that the priority part is considered equal whenever it is not less and not greater

22:46 hey, I've enjoyed this , . . . but I gotta go at least for a bit

22:47 Jedi_Stannis: ok no problem

22:47 eee: i'm at eviertel@gmail.com for more cool ideas

22:47 thanks

22:47 Jedi_Stannis: hopefully that helps you at

22:47 out*

22:47 eee: yup

22:47 thanks

23:10 yo

23:22 rlb: eee: FWIW, I think Jedi_Stannis said something like what I was thinking...

23:24 eee: i think I get it

23:24 still an odd conflict to me

23:24 because most structures

23:24 are for search

23:24 like a map

23:24 or set

23:25 so you can 'find' your element

23:25 by matching on value

23:25 and define identity that wat

23:25 way

23:25 but, classically

23:25 in a heap

23:25 you don't search

23:25 you stick your element in

23:25 it's yours

23:25 you still know where 'it' is

23:26 it's yours because it's yours . . .not because the value matches

23:26 you never lose it. you always have your finger on it

23:26 but that's really suited for imperative environment

23:26 rlb: eee: you mean if you keep the pointer to it? Otherwise, you still have to find it again.

23:27 eee: exactly

23:27 so the return from insert right now is a new heap

23:28 but it perhaps needs to be a new heap and a little box for your object

23:28 now's the tough part

23:28 no backpointers up the tree

23:28 change the value in the box

23:28 means you need a new heap

23:28 clojurebot: new Class(x) is (Class. x)

23:29 eee: that has that value in the right place. so you need a new heap and a new box

23:29 but same value?

23:29 or new value

23:29 rlb: I suppose it depends on how often you really need to keep track of the pointer. You don't in cases where all you really want the queue for is to hand you the next item when you ask for it.

23:29 eee: well, that alone is pretty cool

23:30 lazy sort

23:30 but

23:30 decreaseKey is the real story

23:30 so many nice algorithms get fast with that

23:30 like Djikstra's shortest path

23:30 depends on updating the value

23:32 i think java's priority queue as I'm seeing has notion of equality

23:32 like clojure

23:32 so

23:32 i'll start with that idea

23:32 rlb: eee: does it have to, or rather, for clojure, I would think you might want a special queue (like the existing collections) that makes altered copies cheap.

23:32 eee: that you can get any value that matches yours . . .decrese the first one that 'equals' yours

23:32 rlb: though how hard that might be to do right for a priority queue, I don't know offhand -- haven't really thought about it.

23:33 eee: i have it working where altered copies are cheap

23:33 for everything but decreaseKey

23:33 thinkingn out loud about that one

23:34 thinking I need a map and a heap

23:34 a persistentMap from clojure's java code

23:34 rlb: to make decreaseKey efficient?

23:34 eee: to find an equal element

23:34 without traversing

23:34 a hashmap

23:35 that points to it

23:35 hashmap that points to a linked list that points to all the equal elements

23:35 that solves the easy part :)

23:35 of having a handle

23:36 next, you insert a new element

23:36 representing the lesser value

23:36 and in that clients copy

23:36 you remove the entry from the list

23:36 now, if that client ever bubbles up the dead node

23:37 that need to be able to tell that it's not in their version of the map

23:37 s/that/they

23:39 make sense?

23:42 rlb: eee: I'm not sure -- do you need handles (again haven't thought about it much)?

23:42 eee: looks like someone did it in haskell withought, too

23:42 without

23:43 they mess with values that match a predicate

23:43 that's kinda cool

23:43 wonder if it's O(1) though

23:43 that's what I was going for

23:43 decreaseKey() in O(1)

23:48 i think i found another paper

23:55 they did something just like I said. auxilliary data structure

23:55 runtime dominated by that structure and by cleanup of dead nodes

23:55 I think this may be an open problem in computer science

23:56 functional decreaseKey in O(1) time

Logging service provided by n01se.net