2010-06-19
| 00:52 | scott_ | I noticed #() forms use fn* underneath. How does that differ from fn? |
| 00:59 | hiredman | scott_: in ways that don't matter for #() |
| 01:00 | scott_ | What are those ways? |
| 01:29 | hiredman | scott_: fn* doesn't have destructuring |
| 01:29 | scott_ | hiredman: So #() maybe uses it just for the (possibly very small) performance boost |
| 01:30 | remleduff | fn is the special form, so technically, you shouldn't be concerned with the fn* implementation detail |
| 01:38 | Blackfoot | is there a type for unsigned short? trying to use clj-native the JNA library |
| 01:40 | scottj | I don't think java has unsigned types |
| 01:41 | Blackfoot | hmm that makes sense. ok, i'll try just using short |
| 02:42 | Blackfoot | what the clojure way to define fields? I want to compare int return values. do i just (def FORMAT_MP3 3) over and over? |
| 02:47 | vIkSiT | hmm, whats the best way to serialize a clojure data structure? |
| 02:48 | vIkSiT | I've been trying to figure out some methods using print-dup, but I keep getting stuck. |
| 02:50 | Blackfoot | i think print-dup is the standard way in 1.1, in 1.2 the core Clojure data structures will all be |
| 02:50 | Blackfoot | Serializable |
| 02:50 | Blackfoot | but i don't personally have much experience with it, sorry |
| 02:52 | vIkSiT | Blackfoot, ah thanks for the info.. but do you have any pointers on where to start looking for serialization anyway? |
| 02:54 | Blackfoot | there's been a few conversations on the mailing list, so you might have some luck there. |
| 02:54 | Blackfoot | i think the answer so far for simple objects has been to bind *print-dup* to true and just use (str) |
| 02:54 | Blackfoot | http://richhickey.github.com/clojure/branch-1.1.x/clojure.core-api.html#clojure.core/*print-dup* |
| 03:00 | hoeck | Blackfoot: I'm using maps and my own macro for perf-sensitive code |
| 03:01 | Blackfoot | hoeck: hmm ok, yea maps sounds like a reasonable way to go |
| 03:02 | hoeck | and with a simple (zipmap (vals m) (keys m)), you get a reverse lookup too |
| 03:15 | vIkSiT | hmm |
| 03:15 | vIkSiT | is there a way to serialize refs? |
| 03:17 | hoeck | vIkSiT: do you really want to serialize the ref or just its content? |
| 03:17 | vIkSiT | hoeck, ah yes, just the content :) |
| 03:17 | vIkSiT | I should probably try @ damn |
| 03:18 | hoeck | vIkSiT: :) |
| 03:18 | vIkSiT | hoeck, hmm, so I've got some complex data structures though |
| 03:18 | vIkSiT | for instance, one looks likes this: #:cljsimpledb.catalog.Catalog{:c #<Ref@e28099: {}>, :cnt #<Ref@429bc5f9: 0>} |
| 03:19 | vIkSiT | ideally, I'd like to be able to read direclty back into a record of type catalog |
| 03:20 | hoeck | I see no way other than writing your own serializer/deserializer then |
| 03:21 | hoeck | or change your code so that the mutation does not happen in the Catalog record, but somewhere outside |
| 03:22 | vIkSiT | hoeck, hmm, not entirely sure what you mean by the mutation bit.. |
| 03:22 | vIkSiT | could you explain a bit more? |
| 03:24 | hoeck | instead of putting the ref inside the Catalog record, put the Catalog itself into a ref and make the :c field immutable, this way, you wont hav to serialize a ref when you serialize the Catalog record |
| 03:26 | vIkSiT | aah. hehe, at this point I've got some more refs inside the Catalog record |
| 03:27 | vIkSiT | hoeck, generally, is writing your own serializer etc recommended? |
| 03:27 | vIkSiT | (also, whats a good resource to learn about writing one?) |
| 03:28 | hoeck | from what i can see, you have no other choice than to write your own |
| 03:29 | hoeck | do you want to use java-serialization or clojure and read? |
| 03:32 | hoeck | vIkSiT: http://gist.github.com/444675 |
| 03:32 | hoeck | maybe using print-method this way will temporarily solve your problem |
| 03:32 | vIkSiT | hoeck, not sure which one would be better? |
| 03:33 | hoeck | clojure+read is way easier, java-serialization potentially faster and more space efficient (on disk) but also more complicated to use |
| 03:33 | hoeck | java serialization requires your defrecords to be AOT-compiled |
| 03:35 | hoeck | I guess it depends on wether you load som kilobytes of config data or a Gigabyte of statistical data :) |
| 03:35 | vIkSiT | hoeck, ah, I'm building a database - so ideally, the java version would be good. But to start with, the clojure+Read looks good :) |
| 03:35 | vIkSiT | hoeck, so what exactly does your function do in this case? |
| 03:36 | vIkSiT | the print-method, that is |
| 03:36 | hoeck | it defines the way the FooCatalog record should be printed |
| 03:37 | hoeck | the print representations of all clojure objects are defined this way |
| 03:37 | vIkSiT | ah I see |
| 03:37 | vIkSiT | so if I wanted to print that to a file.. |
| 03:37 | vIkSiT | how would I do it? |
| 03:37 | hoeck | and you can overwrite that with your own versions |
| 03:37 | hoeck | just (spit "filename" foo-catalog-instance) |
| 03:38 | hoeck | and load it with (read-string (slurp "filename")) |
| 03:39 | hoeck | ,spit |
| 03:39 | clojurebot | java.lang.Exception: Unable to resolve symbol: spit in this context |
| 03:40 | hoeck | spit is defined in clojure.contrib.io, at least by the clojure-contrib version I am using, slurp is in core |
| 03:42 | vIkSiT | aah |
| 03:42 | vIkSiT | let me check |
| 03:42 | hiredman | spit is also in core these days |
| 03:42 | hiredman | :/ |
| 03:42 | hiredman | but I've never seen the one in core actually work |
| 03:42 | hiredman | it just seems to break things |
| 03:42 | vIkSiT | hiredman, facing that right now! |
| 03:42 | vIkSiT | how does one use it?! |
| 03:43 | hiredman | don't |
| 03:43 | vIkSiT | (spit (File. "filename") obj) ? |
| 03:43 | hiredman | use the one from io or duck-streams |
| 03:43 | vIkSiT | er, how does one import that? my REPL seems to have messed up |
| 03:44 | hoeck | vIkSiT: (require '[clojure.contrib.io :as io]) |
| 03:44 | hiredman | (ns-unmap (create-ns 'clojure.core) 'spit) |
| 03:44 | vIkSiT | Could not locate clojure/contrib/io__init.class or clojure/contrib/io.clj .. |
| 03:44 | hoeck | and then io/spit |
| 03:44 | hiredman | (use '[clojure.contrib.io :only [spit]]) |
| 03:45 | hiredman | then you are missing contrib from your classpath |
| 03:45 | vIkSiT | ahm. |
| 03:45 | hoeck | or clean up the repl first as hiredman suggests :) |
| 03:45 | vIkSiT | I did clean up :) |
| 03:45 | vIkSiT | and i've got both contrib and core in project.clj in lein; and running lein swank |
| 03:50 | hiredman | what version of contrib? |
| 03:50 | hiredman | and what version of core? |
| 03:51 | hiredman | if you have spit in core and no io in contrib your versions are most likely out of whack |
| 03:52 | vIkSiT | hmm |
| 03:52 | vIkSiT | clojure-1.2.0-master-20100607.150309-85.jar ; clojure-contrib-1.2.0-master-SNAPSHOT.jar |
| 03:52 | vIkSiT | from lein deps |
| 03:53 | hiredman | that contrib is old |
| 03:54 | hiredman | if I recall it shouldn't even work |
| 03:54 | vIkSiT | hehe |
| 03:54 | hiredman | if you clean out your ./lib/ and ~/.m2/ lein deps will fail because those jars are not even on the server anymore |
| 03:55 | hiredman | contrib doesn't have "master" in the version anymore |
| 03:55 | vIkSiT | wow I didn't even know there was a ~.m2 |
| 03:55 | vIkSiT | So, the best way to continue is to clean out lib and |
| 03:55 | vIkSiT | ~m2*, and then do lein deps again? |
| 03:55 | clojurebot | http://github.com/technomancy/leiningen |
| 03:56 | hiredman | no |
| 03:56 | hiredman | you should just fix the version specified in the project.clj |
| 03:57 | vIkSiT | so what should those versions be? |
| 03:57 | vIkSiT | Is there a canonical name for the "latest"? |
| 03:59 | hiredman | [org.clojure/clojure-contrib "1.2.0-SNAPSHOT"] |
| 03:59 | vIkSiT | hiredman, ah so no "master" in either clojure or contrib. |
| 04:00 | TakeV | How would I evaluate a string that is clojure code? |
| 04:02 | hoeck | ,(eval (read-string "(+ 1 2 3)")) |
| 04:02 | clojurebot | DENIED |
| 04:02 | hiredman | vIkSiT: clojure still has it |
| 04:03 | vIkSiT | ah. |
| 04:04 | TakeV | hoeck: Thanks. :) |
| 04:04 | hoeck | TakeV: np :) |
| 04:10 | vIkSiT | hoeck, can the defmethod you created for FooRecord also be used with other functions than spit? |
| 04:24 | hoeck | vIkSiT: this method will be called whenever you call some kind of print on the record |
| 04:25 | vIkSiT | hoeck, ah.. looks like I'll need to figure out how to do this with buffered readers/writers.. spit is just too unreliable :) |
| 04:26 | hoeck | sorry, you have to actually call it this way: (spit filename (pr-str <that-record>)) |
| 04:26 | hoeck | str on the record only calls a generic .toStirng method |
| 04:28 | vIkSiT | ah |
| 04:28 | hoeck | vIkSiT: http://gist.github.com/444708 |
| 04:29 | hoeck | c.c.io to the rescue! |
| 04:29 | vIkSiT | aha :) thats much better |
| 04:29 | vIkSiT | just got it working with io/spit as well |
| 04:30 | vIkSiT | i wonder if I could use it with a binary file too |
| 04:30 | hoeck | but for a real database, I'm shure you will need your own serialization, writing directly to bytearrays or bytebuffers |
| 04:31 | vIkSiT | yes, I've got a pretty good idea of how to organize pages and heap files |
| 04:31 | hoeck | good :) |
| 04:31 | vIkSiT | my only bottleneck right now is - how do i take a clojure structure and convert it to a binary representation |
| 04:32 | hoeck | for defrecords, one way may be to put them in a plain hashmap, and serialize that hashmap instead |
| 04:32 | vIkSiT | hoeck, http://gist.github.com/444710 - this is what i'm trying to do right now with binary files |
| 04:32 | hoeck | or serialize the AOT-compiled defrecord directly |
| 04:32 | vIkSiT | hoeck, ah hmm. interesting |
| 04:33 | vIkSiT | I guess my problem is that the records look something like this : |
| 04:33 | hoeck | or traverse your record tree and use java serialization on all unknown types and a special serialization for records and refs |
| 04:35 | vIkSiT | https://gist.github.com/a96c9f930e808fbd3c7d |
| 04:35 | vIkSiT | hoeck, too complex to serialize? :P |
| 04:36 | vIkSiT | hrm, is there a way to pretty print a record? |
| 04:38 | hoeck | have you tried pprint? |
| 04:38 | hoeck | (use '[clojure.pprint :only [pprint]]) |
| 04:38 | hoeck | (pprint ......) |
| 04:39 | vIkSiT | woo. thats pretty |
| 04:39 | vIkSiT | :) |
| 04:40 | vIkSiT | hoeck, thats what I'm trying to serialize: https://gist.github.com/a96c9f930e808fbd3c7d |
| 04:40 | vIkSiT | I think I've got lots of refs, but I think I can get by with serializing bits and parts of it |
| 04:41 | hoeck | mmh, all those refs do not make serializing that thing easier :D |
| 04:41 | vIkSiT | hehe yeah |
| 04:41 | vIkSiT | the problem is, not hving ANY mutable semantics in there make things so much harder |
| 04:43 | hoeck | what about walking that record tree, derefing all refs, then serialize the result? |
| 04:43 | hoeck | and for deserialization, just load that tree from disk, walk it and insert the required refs, no? |
| 04:45 | vIkSiT | yep exactly |
| 04:45 | Chousuke | I'd say that's way too many refs |
| 04:45 | vIkSiT | chousuke, hmm.. |
| 04:45 | Chousuke | in general, having nested refs breaks easy snapshotting. |
| 04:47 | vIkSiT | hmm. I guess I need atleast 2 levels of refs there though - given that the list of tuples in a table needs to be mutable; and so does the schema |
| 04:47 | vIkSiT | the others I can try to get rid of |
| 04:47 | hoeck | vIkSiT: if you *really* need a mutable structure, and have the balls to deal with all the synchronization consequences, you may also use (defrecord Foo [^:volatile-mutable c]) :) |
| 04:47 | Chousuke | vIkSiT: remember update-in, it's handy for nested structures |
| 04:47 | vIkSiT | ah good point |
| 04:48 | hoeck | or ^:unsynchronized-mutable |
| 04:48 | Chousuke | hoeck: deftype though. |
| 04:48 | hoeck | Chousuke: right |
| 04:49 | vIkSiT | hoeck, btw, whats the advantage of ysing voltaile or unsynch mutable there? |
| 04:49 | vIkSiT | using* |
| 04:50 | hoeck | you don't need refs or atoms, less overhead for single threaded or unsynchronized usages |
| 04:50 | vIkSiT | interesting |
| 04:50 | Chousuke | They can be used to create data types that do mutation internally. |
| 04:50 | vIkSiT | oh that IS useful |
| 04:51 | Chousuke | it's also difficult :) |
| 04:51 | vIkSiT | so if I understand it right, I could have a "table" record that has all the mutation happen inside it, atomically? |
| 04:51 | vIkSiT | oh? :) |
| 04:51 | Chousuke | no, :unsynchronized-mutable is not atomic at all as far as I know. |
| 04:51 | hoeck | I'm using currently a ^:volatile-mutable for implementing a JDBC resultset type, the resultset interface is inherently stateful and single threaded |
| 04:52 | Chousuke | you'd still need locks and other things around it. |
| 04:52 | vIkSiT | ah I see |
| 04:52 | hoeck | vIkSiT: when using mutable or volatile, you have to take care of synchronization yourself, e.g. through thread-confinement |
| 04:52 | vIkSiT | so maybe I should go more functional, and put things inside a top level refs only |
| 04:52 | vIkSiT | ref* |
| 04:52 | Chousuke | it's like a plain old non-final java field. |
| 04:52 | vIkSiT | gotcha |
| 04:53 | Chousuke | vIkSiT: you can start with that, and add more refs if you encounter scalability problems. |
| 04:53 | vIkSiT | right. I was thinking, that if I were to implement the heap or a b-tree with purely functional attributes, its going to be really bad in terms of space complexity |
| 04:54 | vIkSiT | but maybe I can just reduce the number of levels my refs go into.. |
| 04:57 | vIkSiT | ok sleep time, laters. thanks for the insight, chousuke and hoeck |
| 06:45 | Licenser | there we go back in arms to fight for clojure |
| 06:51 | Licenser | geeez |
| 06:51 | DarthShrine | Hmm? |
| 06:52 | Licenser | the changes in the qual branch are a horror |
| 06:54 | Licenser | ,(* 10000000000000 1000000000000) |
| 06:54 | clojurebot | java.lang.ExceptionInInitializerError |
| 06:54 | Licenser | ,(* 100000000000 1000000000000) |
| 06:54 | clojurebot | java.lang.ExceptionInInitializerError |
| 06:54 | Licenser | $(* 100000000000 1000000000000) |
| 06:54 | sexpbot | java.lang.ClassNotFoundException: clojure.core$fn__4819$fn__4820 |
| 06:54 | Licenser | wow |
| 06:54 | Licenser | $(* 100000000 1000000000) |
| 06:54 | sexpbot | => 100000000000000000 |
| 06:54 | Licenser | $(* 100000000 10000000000) |
| 06:54 | sexpbot | java.lang.NoClassDefFoundError: clojure/core$fn__4819$fn__4820 |
| 06:54 | Licenser | $(* 100000000 1000000000) |
| 06:54 | sexpbot | => 100000000000000000 |
| 06:54 | Licenser | this is odd |
| 06:55 | Licenser | ,(* 100000000 1000000000) |
| 06:55 | clojurebot | 100000000000000000 |
| 06:58 | AWizzArd | Licenser: it still is beta software and will hopefully be fixed in the coming time. |
| 06:58 | Licenser | AWizzArd: I worry about that it seems to be a design decision |
| 06:59 | Licenser | decisions are not usually fixed :P |
| 07:01 | AWizzArd | Well, if it is a bug it will be fixed I guess. If this is intended, then the error message could get improved. |
| 07:01 | AWizzArd | But otherwise, if this is a compile time error then it is fine. |
| 07:01 | AWizzArd | It will mean that you will be confused during compilation, but then after the initial shock can fix it, and produce working code. |
| 07:02 | AWizzArd | And next time you know that either * is not the right fn to call, or that the args you used don't work there |
| 07:02 | AWizzArd | ,(+ "Hello " "World") |
| 07:02 | clojurebot | java.lang.ClassCastException: java.lang.String cannot be cast to java.lang.Number |
| 07:02 | AWizzArd | That is an okay error message. |
| 07:02 | AWizzArd | And it would be even nicer to catch this at compile time :) |
| 07:03 | Licenser | heh |
| 07:03 | Licenser | can't in a dynamic language |
| 07:03 | Licenser | that is the problem |
| 07:03 | Chousuke | well you can |
| 07:03 | Chousuke | since the strings are literals |
| 07:03 | Licenser | partially not entirely I think |
| 07:03 | Licenser | yes for this case but not for every case |
| 07:03 | Licenser | and unless it is for every case you in the end really can't |
| 07:03 | Chousuke | but Clojure does not do much correctness analysis at all :P |
| 07:04 | Licenser | it rather throws Java exceptions |
| 07:04 | Licenser | but that's ok, what is not OK in my eys is that you've odd behaviour now for numbers :( |
| 07:04 | Licenser | and that you tecnically have statically typed loops |
| 07:05 | Licenser | and that implictly not even explictly (which would be ugly but not as bad) |
| 07:06 | Licenser | I like type hints since they let you decide when you enforce a type but having the code decide for you 'You want to use a long here!' without you saying it, is wrong |
| 07:07 | AWizzArd | There can be a (fully) optional type system on top of every programming language. |
| 07:07 | AWizzArd | With such Clojure can be statically checked, if the developer wishes this. |
| 07:08 | AWizzArd | This is called “Gradual Typing”, and with it you can make very granular descisions of how much will be type checked or not. |
| 07:08 | Licenser | I agree and I loved that you can have typs if you want and not have them otherwise |
| 07:08 | Licenser | but that changed |
| 07:09 | Licenser | now it is like that in most places but when you use loop clojure takes this decision away from you and you will have if you want or not statical typing |
| 07:09 | AWizzArd | Could be from nothing at all over just one fn of your whole code base up to really everything, so that you end up with a totally type checked program, that does not allow dynamic changes of fns at runtime. |
| 07:09 | AWizzArd | Licenser: Rich mentioned yesterday that he plans to throw error messages in such loops. |
| 07:09 | Licenser | it still is bad |
| 07:09 | AWizzArd | with error messages? |
| 07:10 | Licenser | look at this: |
| 07:10 | Licenser | user=> (loop [n 1 r 1] (if (zero? n) r (recur (dec n) (str r r)))) |
| 07:10 | Licenser | NO_SOURCE_FILE:1 recur arg for primitive local: r is not matching primitive, had: java.lang.String, needed: long |
| 07:10 | Licenser | java.lang.ClassCastException: java.lang.String cannot be cast to java.lang.Number (NO_SOURCE_FILE:1) |
| 07:10 | Licenser | yes because it IS statically typed |
| 07:11 | AWizzArd | Well, with this error message it is fine. |
| 07:11 | Licenser | this decision goes beyond you having to worry about integer overflows it introduces static typing |
| 07:11 | Licenser | AWizzArd: but you can't write dynamically typed code there any more |
| 07:11 | Licenser | this is the problem |
| 07:11 | AWizzArd | why not? |
| 07:11 | Licenser | because it crashes |
| 07:11 | Licenser | because loop is statically typed to [long long] |
| 07:12 | Licenser | and it will never take any other objects w/o crashing |
| 07:12 | AWizzArd | Does this occur during compilation/loading of a file, or at runtime? |
| 07:12 | Licenser | the warning during loading the crash during runtime |
| 07:12 | AWizzArd | but the warning sounds great |
| 07:12 | Licenser | how you can likely have cases where one of the values of recur does not always have to same type as before |
| 07:13 | Licenser | it is still wrong |
| 07:13 | Licenser | or clojure becomes a statically typed language but then please explictly |
| 07:14 | AWizzArd | (defn foo [] (loop [x (Object.)] (recur "hi"))) |
| 07:14 | Licenser | one good thing about clojure is that it is a dynamical language that I can toss stuff around as much as I want and don#t have to worry about types since I don't tell the code what typs they are. This is gone, history, we are now in scala/java world where you have to watch out, typecast and do all this orrible things. And even worst we don't even KNOW what typs we use since clojure dictates what we want to use. |
| 07:14 | Licenser | oh yea great :P |
| 07:14 | AWizzArd | in that case recur must return any Object |
| 07:14 | Licenser | AWizzArd: welcome to java |
| 07:15 | AWizzArd | but this IS currently what *every* object was typed with |
| 07:15 | AWizzArd | In all programming languages all fns take only Object parameters and return them. |
| 07:15 | AWizzArd | in all dynamically typed ones |
| 07:15 | Licenser | AWizzArd: but you can't initialize x with a useful value instead of Object |
| 07:15 | AWizzArd | The type signature must always be correct, in them all. |
| 07:15 | Licenser | the example above won't work |
| 07:16 | AWizzArd | Anyway, why would you want to exchange the type of an object? |
| 07:16 | clojurebot | datatype is see datatypes |
| 07:16 | AWizzArd | I think this will be wrong in nearly all cases |
| 07:16 | Licenser | for example when I go in a code from a vector to a list, or to a map? |
| 07:16 | AWizzArd | I don't want to be able to do (+ "Hi" (File. "/my/file")) |
| 07:16 | AWizzArd | Licenser: then it is a collection |
| 07:17 | Licenser | yes but why do they behave differently? |
| 07:17 | Licenser | and I can see cases where you go from 1 to 1.0, many of them |
| 07:17 | AWizzArd | They are different objects. |
| 07:17 | Licenser | so we do spaceal cases for numbers since they can be nice and confusing then? |
| 07:17 | AWizzArd | Being an experieced bicycle user does not qualify me to be Formula 1 expert |
| 07:17 | Licenser | AWizzArd: that is a horrible bad example :P |
| 07:18 | AWizzArd | Not so much. Objects and interactinos with them don't work in infinite ways |
| 07:18 | Licenser | I don't mind explic static typing, we have ^static for that. but I do very much mind implect one |
| 07:18 | AWizzArd | Numbers are the real exception in computing because of limits in memory and computational speed. |
| 07:18 | AWizzArd | With an infinite amount of memory and an infinite fast system there would only be the type "number" ever |
| 07:18 | Licenser | this limits also apply for ever other kind of object, be it a string, a list a ector |
| 07:19 | AWizzArd | Well, in that sense Clojure was always statically typed. |
| 07:19 | AWizzArd | Every fn argument had to be of class Object |
| 07:19 | Licenser | AWizzArd: but isn't it more important that the program works then it is fast? For our every day program we don't care at all of + is 0.1 ms faster |
| 07:20 | Licenser | AWizzArd: that is word mangeling |
| 07:20 | AWizzArd | It is totally important that the program works correctly. |
| 07:20 | Licenser | yes and this breaks it |
| 07:20 | Licenser | it requires in deepth understanding of the special cases for numbers to be sure your program works and you can get bitten in the ass with very confusing stuff |
| 07:20 | AWizzArd | But sometimes we know that a program will work correctly and not suddenly overflow from 9 trillions to minus 9 trillions because we added 1 |
| 07:20 | Licenser | I mean why the heck is (num 1) different form 1? |
| 07:21 | Licenser | AWizzArd: you're wrong |
| 07:21 | AWizzArd | how? |
| 07:21 | clojurebot | with style and grace |
| 07:21 | Licenser | when all are numbers this won't happen |
| 07:21 | Licenser | in the new code, yes, this will happen and this is exaclty what I don't want to see happening |
| 07:21 | AWizzArd | True, but I gave this example explicitly for code which we want to run fast. |
| 07:22 | AWizzArd | And in that case it is important that there are warnings/error messages. And then it is fine. |
| 07:22 | Licenser | AWizzArd: but then we are aware of the risks, if we are forced to optimize explictly we are also forced to know where the problems will arise if there are any |
| 07:22 | AWizzArd | When the compiler tells me: man, you are using the fast stuff here, but there are type mismatches - then it is perfectly fine. I just don't want it to go unnoticed. |
| 07:23 | Licenser | Mean question: how many useful error messages have you seen in clojure? |
| 07:23 | AWizzArd | It would be bad if we could not say (num 1.5) anymore |
| 07:23 | AWizzArd | But we can still use the boxed types. With those error messages are more unlikely. |
| 07:23 | AWizzArd | They can still run into problems, if your numbers are very very big |
| 07:23 | Licenser | yes run out of memory, or end up never finishing but that are other kinds of problems |
| 07:24 | AWizzArd | But typically we have enough ram, so there will be no runtime erros. |
| 07:24 | Licenser | with modern computers speed, performance should take second pace over correctness |
| 07:24 | Licenser | that is why premature optimisation is so much hated by so many people |
| 07:24 | AWizzArd | But the warnings tell you that your code is not correct. |
| 07:24 | Licenser | but now we create a language that forces you to do that |
| 07:25 | AWizzArd | Not when the compiler warns/errors us |
| 07:25 | Licenser | AWizzArd: no the code is correct clojure made it incorrect that is the problem |
| 07:25 | AWizzArd | It is not correct that you switched the types. |
| 07:25 | AWizzArd | You don't have a gas pedal on your bicycle |
| 07:25 | Licenser | yes it is since we do have a number stack for that |
| 07:25 | Licenser | on some I do actually yes |
| 07:26 | AWizzArd | hehe :) |
| 07:26 | AWizzArd | Well, can you test your above code with r (num 1) please? |
| 07:26 | Licenser | I can do (* 1 0.5) and it works |
| 07:26 | Licenser | but I can't do it in a loop |
| 07:26 | Licenser | it will work |
| 07:26 | AWizzArd | so, where is the problem then? |
| 07:27 | Licenser | that I do have to write (num) and know what it does to get the most intuitive behaviour |
| 07:27 | Licenser | and to work around stupid static typing |
| 07:27 | AWizzArd | The intuitive behaviour is just a thing we can get used to. |
| 07:27 | Licenser | AWizzArd: it is not a problem for you or me since we have disucssed this and understand the workings |
| 07:27 | AWizzArd | After a few rounds we will understand that such things need to get constructed specifically. |
| 07:28 | AWizzArd | I also don't mind having to write (File. "/my/path") |
| 07:28 | Licenser | but seriousely how will you sell this to your collegues: Oh clojure is dynamically typed, but if you use a loop you've to be very careful to use the right types, nono you can't give them explictly the compiler tells you what you want to do isn't that great? |
| 07:28 | AWizzArd | vs f"/my/path" |
| 07:28 | Licenser | the problem is the special behavior of loop that it acts differently then other things |
| 07:28 | AWizzArd | Being dynamically typed means that there is not edit->compile->run cycle anymore, and that you have an administrative system |
| 07:29 | AWizzArd | Dynamically typing is not about being able to say x=15 ... x="Hi" |
| 07:29 | Licenser | dynamic typing has to do with typing not with build cycle |
| 07:29 | Licenser | a language being dynamic has to be with the build cycle |
| 07:29 | AWizzArd | Being able to change the type of the object a variable refers to is *possible* in dynamic typing, but this is a bad side effect and should never occur in production code |
| 07:29 | AWizzArd | only in some cases for let it is useful |
| 07:30 | AWizzArd | to increase readability |
| 07:30 | AWizzArd | A dynamic typed language is more like a OS that you can administer |
| 07:30 | AWizzArd | You don't need to decide which programs you want to run, in which order, before your start your computer |
| 07:30 | Licenser | dynamically typed functions means that you can write (inc 1) and (inc 1.0) without having to write a gazillion of inc methods |
| 07:30 | AWizzArd | while it is running you can change the system, install new programs, create files, and such |
| 07:30 | AWizzArd | no |
| 07:31 | Licenser | yes |
| 07:31 | AWizzArd | Nope sorry, this is not an enforced feature. |
| 07:31 | Licenser | http://de.wikipedia.org/wiki/Dynamic_typing |
| 07:31 | AWizzArd | Dynamically typed is being able to say: (defn foo [] (println "Helo")) and then a minute later (defn foo [] (println "Hello")) |
| 07:32 | AWizzArd | Being able to say (defn foo...) in the first place is already dynamic typing |
| 07:32 | Licenser | no that is dynamic not dynamic typed |
| 07:32 | AWizzArd | In a statically typed program I can't because I write the program before I run it. |
| 07:32 | Licenser | and you can do that in C too you know? |
| 07:32 | AWizzArd | In Clojure I first run my program, then write it. |
| 07:32 | Licenser | that has nothing to do with dynamic typing |
| 07:32 | AWizzArd | In C I can do it when I engage a dynamic typing style of programming |
| 07:33 | Licenser | AWizzArd: please look at the link |
| 07:33 | AWizzArd | No need, i know pretty well what i am talking about. |
| 07:34 | Licenser | no :P |
| 07:34 | AWizzArd | correct calculations of numbers is typically a feature in dynamically typed languages. It is not required that I don't need to construct them specifically. |
| 07:34 | AWizzArd | Licenser: I can edit that website to state whatever I want. |
| 07:34 | AWizzArd | In Clojure I have to construct File objects to work with them correctly. |
| 07:35 | AWizzArd | And I have to construct generic numbers explicitly from now on. |
| 07:35 | AWizzArd | No big deal, it is only a few keystrokes away and only in rare cases needed. |
| 07:36 | AWizzArd | As long the compiler warns me about this everything is fine. |
| 07:36 | AWizzArd | If Clojure were statically typed it would mean that I can not change foo at runtime anymore |
| 07:36 | Licenser | AWizzArd: it makes the language more complex and confusing it goes away from the elegant and simple things |
| 07:36 | AWizzArd | This could be the case. |
| 07:36 | AWizzArd | I don't want to argue against such statement. |
| 07:37 | AWizzArd | We will have to see how much production code is affected by this. |
| 07:37 | AWizzArd | I will recompile my sources and check how many warnings get generated. |
| 07:37 | Licenser | AWizzArd: but agian to typing C is statically typed but I can very well change the value later in the code |
| 07:38 | AWizzArd | I don't know if most C compilers are really statically type checking the code. |
| 07:38 | AWizzArd | But right now I don't see how you can typically start the C repl, then write a program (a function) and run it. |
| 07:38 | AWizzArd | There can be a C repl of course, I just don't know if this is the way how C programs get written in practice |
| 07:39 | clojurebot | clojure euler is http://clojure-euler.wikispaces.com/ |
| 07:39 | Licenser | well in c.c you get 3 warnings |
| 07:39 | AWizzArd | I see. |
| 07:40 | AWizzArd | Can they get fixed? |
| 07:41 | djpowell | i have no real interest in bigints, but I agree with Licenser that this is static typing of the loop var, and I don't like it |
| 07:41 | Licenser | djpowell: neither do I have a real interest in bigints, but I think the default should be Number since we have it and it is nice as it just works |
| 07:42 | djpowell | I'm not too worried, this is just an experiment, not the downfall of clojure |
| 07:42 | AWizzArd | That's a whole different issue. Personal preferrence over having to type in 5 more chars in rare cases or not is different from the compiler helping you to write correct code. |
| 07:43 | Licenser | AWizzArd: http://gist.github.com/444827 |
| 07:43 | Licenser | this is one of the things |
| 07:43 | AWizzArd | I guess Rich just sees how much faster code is that uses longs or doubles instead of Numbers, and that typically calculations don't go out of the limits of -9 trillion to 9 trillion |
| 07:43 | Licenser | AWizzArd: we're all going to die!!! |
| 07:43 | AWizzArd | let me see |
| 07:44 | AWizzArd | What is the problem with that code? |
| 07:44 | Licenser | I love longs and doubles but I'd like to have to tell the compiler when I need this speed improvement |
| 07:44 | AWizzArd | Does it produce no warnings and at the same times produces incorrect results? |
| 07:44 | Licenser | math.clj:112 recur arg for primitive local: y is not matching primitive, had: java.lang.Number, needed: long |
| 07:44 | Licenser | you could write y (num 1) |
| 07:44 | Licenser | but that'd be silly |
| 07:44 | AWizzArd | Two conditions must be true at the same time for this new feature to suck: it must compile code without warnings *and* run incorrectly |
| 07:45 | AWizzArd | If one of two conditions is not met it is fine. |
| 07:45 | AWizzArd | (num 1) won't kill us |
| 07:45 | djpowell | i'm not sure how I feel about +' and friends, they don't look too bad. the issue is though, that the loop variable cannot be promoted by them, because the compiler has already *incorrectly* inferred that it should be an int, just because the init value hapenned to fit in an int. |
| 07:45 | AWizzArd | this is just one little function |
| 07:45 | AWizzArd | It is mostly a psychological issue, not a technical one I guess. |
| 07:46 | Licenser | I find +' being for primitives good +' for num's not so good |
| 07:46 | AWizzArd | In the end I really don't care much if both are available. |
| 07:46 | Licenser | AWizzArd: of cause it is but psychological issues are very important. The first impression is most impotant and telling someone who does the euler procject for example oh you need to use +' and *' and (num 1) will be a instant turn off |
| 07:47 | Licenser | I tell you, if that had been the case when I started clojure I'd not be here today |
| 07:47 | AWizzArd | Yes, they are important. The reason why I use Clojure is mostly psychological of course. |
| 07:47 | djpowell | Licenser: if what was the case? |
| 07:47 | AWizzArd | If I were not human and evolved to be a really good programmer, then I can just write assembler code. |
| 07:47 | Licenser | because my impression would have been 'what a bunch of whiredos that force you to jump through hoops for simple code' |
| 07:47 | Licenser | that I'd need to know about +' *' and (num 1) to do the project euler stuff |
| 07:48 | djpowell | Licenser: the inference of the type of the loop variable? Or the more general changes with non-promoting arithmetic |
| 07:48 | AWizzArd | Well, adding (num) at 3 places of a 6k LOC program is not really bad, especially when the compiler tells us the exact line numbers (: |
| 07:48 | Licenser | AWizzArd: no BUT if it is amongst the first things you see about a language it is a very bad thing |
| 07:48 | AWizzArd | The Euler code is not representative for typical production code. |
| 07:48 | djpowell | it is the sort of incidental complexity that clojure mostly strives to avoid |
| 07:49 | Licenser | adding (long 3) in 10 places where you know speed is ain issue in 6k LOC isn't a problem either |
| 07:49 | Licenser | AWizzArd: but it is what people see first |
| 07:49 | AWizzArd | May be true. I can only see that I personally don't care about this. I care about productivity, and this is not an issue here. |
| 07:49 | Licenser | For my projects I really don't care for this I care for clojure in general and a first impression |
| 07:49 | Licenser | AWizzArd: in the long run it is |
| 07:50 | djpowell | I think though, if we had something like loop variables defaulting to holding nums, and a ^int type hint to declare them to hold primitives, then that would be better |
| 07:50 | AWizzArd | If Clojure were to remove the GC or the repl, then *that* would piss me off. |
| 07:50 | Licenser | since the only way to find clojure programmers is to get them interested, and it might be nice that you can do your production code but if you don't find other codes to work with you, you'll have to drop clojure and start writing java |
| 07:50 | Licenser | djpowell: yap exactly that would be great |
| 07:51 | Licenser | I love if you could do all the stuff in the equal branch but would not HAVE to |
| 07:51 | AWizzArd | djpowell: it may that way, defaulting to more correct code and specifying that we want it faster |
| 07:51 | djpowell | literals could still squeeze into primitives if they wanted to, but they would be automatically wrapped in loop initialisers unless you asked for them to not be |
| 07:51 | AWizzArd | That would be okay for me personally, as well as defaulting to fast code *plus* compile-time warnings |
| 07:52 | Licenser | AWizzArd: there isn't nessesarily a hard destinction between compile time and run time |
| 07:52 | AWizzArd | Licenser: does 1n already work in your branch? |
| 07:52 | Licenser | 1n yes gibes me a big int |
| 07:52 | AWizzArd | and (num 1)? |
| 07:52 | Licenser | but again it is added complexity |
| 07:52 | Licenser | yes that too |
| 07:52 | AWizzArd | k |
| 07:52 | Licenser | simple problems should be solved with simple code |
| 07:53 | AWizzArd | I agree that it increases the complexity. |
| 07:53 | AWizzArd | And I think we all agree that it increases efficiency too. |
| 07:53 | Licenser | yes it does |
| 07:54 | Licenser | not efficiency but performance actually |
| 07:54 | Licenser | it decreasees efficiency in my eyes |
| 07:55 | AWizzArd | Well, I was implying: efficiency = run time performance |
| 07:56 | Licenser | okay I would see efficiency as how effecticient you can write code |
| 07:56 | mmarczyk | ah, just sent another reply to the ggroup thread... |
| 07:56 | AWizzArd | That I call productivity |
| 07:57 | mmarczyk | I have to say I'm pretty happy with the equal as it stands, but I'd prefer autobox-or-hint |
| 07:57 | Licenser | the other is called performance :P but again we're bickering about words, we know what we mean, yes it increases performance but decreases productivity |
| 07:57 | AWizzArd | I don't say it decreases productivity |
| 07:57 | AWizzArd | because I don't measure productivity in mere seconds |
| 07:58 | AWizzArd | But in increases the complexity. |
| 07:58 | Licenser | as I do, and this increases complexity |
| 07:58 | AWizzArd | Productivity comes through more important features, not because I have to type (File. "path") instead of f"path" |
| 07:58 | AWizzArd | That is no productivity win |
| 07:58 | AWizzArd | But having a GC is |
| 07:58 | AWizzArd | being able to write functional code is |
| 07:58 | Licenser | AWizzArd: it is not about having to call some method bot about intuition |
| 07:58 | AWizzArd | having fully persistent datastructures is |
| 07:59 | Licenser | File. is perfectly explaind and intuitive by the very basic of clojures concept |
| 07:59 | mmarczyk | AWizzArd: sure you're not going to claim that (File. "path") vs. f"path" is comparable to being required or not required to know the representations of your numbers? |
| 07:59 | Licenser | the behaviour of loo not |
| 07:59 | mmarczyk | ^surely. |
| 08:00 | AWizzArd | I don't know if humans have intuition in respect to programming. I don't see how we evolved being programmers. In fact, humans totally suck at programming. |
| 08:00 | Licenser | I don't ;P |
| 08:00 | AWizzArd | We have some training, and from that perspective plus my years of CL background it is indeed against my personal "intuition" |
| 08:00 | mmarczyk | :-) |
| 08:00 | AWizzArd | Where "intuition" means "my personal training" |
| 08:01 | AWizzArd | If I were taught that it is normal to work that way in programming I would be surprised how unintuitive Python programs are |
| 08:01 | silveen | Try writing software in english, if your native language was lojban, perhaps programming would be more natural |
| 08:01 | Licenser | AWizzArd: no it does not, the most intuitive thing is that the simplest possbile code is the correct one |
| 08:01 | mmarczyk | in order to expect that 1243590283469103468 + 132478619034851734208671 equals something big you need, what, grade school training? |
| 08:01 | mmarczyk | whereas to expect wraparound you need something rather more involved which is likely never going to win over your initial intuitions, as it well should not |
| 08:02 | mmarczyk | ah, actually no danger of wraparound here... but same goes for exceptions |
| 08:02 | AWizzArd | I am now an experienced professional, and this whole issue really does not affect me. |
| 08:02 | Licenser | AWizzArd: again it does in the long run |
| 08:02 | AWizzArd | I see how it affects newbies, and egoistic as I am, I don't care about them ;-) |
| 08:02 | Licenser | AWizzArd: you should because they might be your feature employees or employers |
| 08:02 | AWizzArd | People are only the shortest amount of time in the state of being a newbie in their programmieng carrier. |
| 08:03 | Licenser | the one thing for a language to stand on the market is to have many people using it or we end up as CL :P |
| 08:03 | mmarczyk | and that's precisely when they make some of the most important choices |
| 08:03 | mmarczyk | most of which they cannot possibly make in an educated way at that stage |
| 08:03 | AWizzArd | Licenser: as colleagues I would try to hire pros such as you, not newbies. |
| 08:03 | Licenser | AWizzArd: but this might be one of the most important ones |
| 08:03 | Licenser | AWizzArd: but I was a newbe too, and I'd not have started clojure if I had to know about the inner workings of number to write some of the euler projects |
| 08:04 | Licenser | meaning there might not be a next Licenser |
| 08:04 | AWizzArd | we all were newbies |
| 08:04 | Licenser | of cause there won't be ever another Licenser but that is a different matter :P |
| 08:04 | AWizzArd | We will have to see and wait. |
| 08:04 | AWizzArd | hehe! |
| 08:04 | AWizzArd | yup |
| 08:04 | Licenser | but we can either work into this direction or work towards the direction of having many new happy Licenser's |
| 08:04 | Licenser | that is a decision we can and have to make |
| 08:04 | AWizzArd | Especially one wit this crazy-professor kind of hairstyle :p |
| 08:05 | Licenser | :P |
| 08:05 | Licenser | sadly current changes indicate that we work towards having not many new happy Licensers but poor unhappy Licenser that are 'stuck' with Ruby since they actually do what you expect most of the time |
| 08:05 | AWizzArd | I care more about having a language that is oriented on programming experts, not newbies |
| 08:06 | AWizzArd | The featuresets are often mutually exclusive |
| 08:06 | Licenser | AWizzArd: but this isn't the problem we're facing |
| 08:06 | Licenser | keeping the default case 'newbie friendly' won't change anything for the experts |
| 08:06 | AWizzArd | ok, I can agree with that |
| 08:06 | Licenser | we still can have our speed, and performance if we need it and since we ARE experts we know when we need it and when not |
| 08:07 | Licenser | and we understand how the Number stack and primitives work, and how to apply ugly tricks to squeeze the last few mili secionds out of a loop |
| 08:07 | AWizzArd | See, for me it is fine having the behaviour that is still the official one, namely correctness first. But having efficiency first plus compile warnings is as well as okay for me. |
| 08:08 | AWizzArd | Well, the nicest thing would be: have the correct code first but also an intelligent compiler which will rewrite our code to the fast one if that would be still correct |
| 08:08 | Licenser | I actually don't see the downside of having correctness first since when you want (or need) efficiency just writing code without thinking aobut is won't be enough anyway |
| 08:09 | Licenser | AWizzArd: yes that'd be my dream |
| 08:09 | AWizzArd | The compiler could interview us and ask questions about how this code is being used, it could read the design specs and talk to the customers. |
| 08:09 | Licenser | heh |
| 08:09 | AWizzArd | But this is still 10-20 years in the future. |
| 08:09 | Licenser | that'd be annoying kind of trust me I wrote a proram that did kind of that |
| 08:09 | AWizzArd | Well, at that point there will be not many programmers anymore. |
| 08:09 | Licenser | not for compiling code but compiling configurations but it turned out to be very annoying |
| 08:09 | AWizzArd | It's a dying profession :) |
| 08:09 | Licenser | AWizzArd: nonsense |
| 08:10 | Licenser | genius never die out :P |
| 08:10 | Licenser | no computer will ever have my brilliant ideas :P |
| 08:10 | OForero | Hello |
| 08:10 | AWizzArd | I see |
| 08:10 | AWizzArd | Hey OForero |
| 08:10 | OForero | I am stuck at something |
| 08:10 | AWizzArd | Wie geht es dir? ;) |
| 08:10 | OForero | http://paste.pocoo.org/show/227239/ |
| 08:10 | Licenser | :P |
| 08:10 | OForero | sehr gut danke |
| 08:10 | OForero | und selber? |
| 08:11 | OForero | obwohl Clojure macht mich gerade fertig ... :-( |
| 08:11 | AWizzArd | I am fine too, thanks |
| 08:11 | AWizzArd | Better let's switch back to english. But there is also a #Clojure.de |
| 08:12 | OForero | my written german is not fluent :-( |
| 08:12 | OForero | I think I hit the limits of the simulation ... or something |
| 08:15 | AWizzArd | OForero: your use of (get x 0) and (get x 1) is confusing |
| 08:15 | AWizzArd | better would be to say (key x) and (val x) |
| 08:16 | AWizzArd | or at least (first x) and (second x) |
| 08:16 | AWizzArd | your prepare fn could also use destructuring |
| 08:16 | AWizzArd | (defn prepare [[name value]] ...) |
| 08:17 | AWizzArd | (defn prepare [[name value]] `(def ~name ~value)) |
| 08:17 | AWizzArd | something like that would be easier to read |
| 08:18 | Licenser | *nods* |
| 08:22 | djpowell | I think I'd be ok with the branch, except: + would be promoting; +' would be non-promoting; loop initialisers would auto-box unless they were given primitive type hints |
| 08:28 | rbarraud | ; |
| 08:29 | AWizzArd | wb Lice |
| 08:29 | Licenser | thanks |
| 08:35 | mmarczyk | djpowell: didn't you mean that the promoting ops should be *non*-primed...? |
| 08:35 | mmarczyk | (that's re: the ggroup post) |
| 08:35 | djpowell | oh yeah that |
| 08:35 | mmarczyk | right, agreed in that case |
| 08:35 | mmarczyk | though mostly I think you should need the primes only if you need the hints |
| 08:36 | mmarczyk | (surely if you hint you also know where to prime? ;-)) |
| 08:37 | djpowell | well not necessarily |
| 08:37 | djpowell | primed ops are polymorphic |
| 08:37 | djpowell | hinted ones aren't |
| 08:37 | djpowell | er, i think... |
| 08:40 | djpowell | i'm not entirely sure anyway to be honest |
| 08:41 | mmarczyk | not sure if you're referring to the current state of affairs or to the desired state of affairs? |
| 08:41 | mmarczyk | my point is that whatever should be the default should not be primed |
| 08:41 | djpowell | what do you mean by default? |
| 08:42 | mmarczyk | "use that unless you actually know you need the other one" |
| 08:43 | OForero | AWizzArd: thanks for the tips |
| 08:44 | OForero | I will use those |
| 08:44 | OForero | but the problem is that the record type is lost in the binding when using the function |
| 08:44 | AWizzArd | And that I find surprising too. |
| 08:45 | OForero | the macro work, but I am not able to use it in a map operation |
| 08:45 | OForero | I think I will mail it to the list |
| 08:46 | Licenser | I'm not sure if you can use macros in maps |
| 08:46 | AWizzArd | OForero: (first (map prepare data)) ==> (def rec #:user.Record{:a 1, :b 2, :c 3}) |
| 08:47 | AWizzArd | (nth *1 2) ==> #:user.Record{:a 1, :b 2, :c 3} |
| 08:47 | AWizzArd | (eval *1) ==> {:a 1, :b 2, :c 3} |
| 08:48 | AWizzArd | (eval (Record. 10 20 30)) ==> {:a 10, :b 20, :c 30} |
| 08:48 | AWizzArd | and not #:user.Record{:a 10, :b 20, :c 30} |
| 08:48 | AWizzArd | Records don't eval to themselves, they eval to maps |
| 08:48 | AWizzArd | That is the issue here. |
| 08:49 | OForero | ok |
| 08:49 | OForero | that will explain why the macro works |
| 08:49 | AWizzArd | yes |
| 08:49 | OForero | because it does not eval the parameters at input |
| 08:50 | OForero | I kind of think records shouldn't forget their recordness |
| 08:50 | mmarczyk | ooh, that's a cool bit of knowledge on records |
| 08:50 | OForero | I will post it to the group and see what reactions are there |
| 08:51 | AWizzArd | k |
| 08:52 | AWizzArd | There we have this intuition thing again :) |
| 08:55 | AWizzArd | Good morning rhickey. |
| 08:56 | OForero | I am bias ... because I still like types |
| 08:56 | Licenser | rhickey my favourte victom for code suggestions, how are you today? |
| 08:56 | OForero | and kind of think that loosing type information is bad |
| 08:56 | OForero | (that is why I do not like erasure) |
| 08:58 | AWizzArd | It is strange how records eval to maps when evaled 'twice' |
| 08:59 | mmarczyk | twice? |
| 08:59 | OForero | I have to go and hunt |
| 08:59 | OForero | I'll check later about this again ... |
| 08:59 | OForero | AWizzArd: thanks for finding the reason |
| 09:00 | Licenser | (eval #:user.Record{:a 1, :b 2, :c 3}) |
| 09:00 | Licenser | ,(eval #:user.Record{:a 1, :b 2, :c 3}) |
| 09:00 | clojurebot | No dispatch macro for: : |
| 09:00 | OForero | one more lesson .... |
| 09:00 | Licenser | ,(eval '#:user.Record{:a 1, :b 2, :c 3}) |
| 09:00 | clojurebot | No dispatch macro for: : |
| 09:01 | mmarczyk | Licenser: records are not readable... |
| 09:01 | mmarczyk | also, I think clojurebot uses 1.1 |
| 09:01 | hiredman | ,*clojure-version* |
| 09:01 | clojurebot | {:interim true, :major 1, :minor 2, :incremental 0, :qualifier "master"} |
| 09:01 | mmarczyk | oh, forgive me, clojurebot |
| 09:02 | mmarczyk | I didn't quite realise how new & shiny your circuits were :-) |
| 09:02 | Licenser | mmarczyk: was just trying something out :) |
| 09:03 | AWizzArd | mmarczyk: sorry, forget this twice thing, I was wrong |
| 09:03 | mmarczyk | OForero: well actually |
| 09:03 | mmarczyk | OForero: the reason your code doesn't work is that prepare-2 sees % |
| 09:04 | mmarczyk | OForero: the symbol, I mean... |
| 09:04 | AWizzArd | ,'% |
| 09:04 | clojurebot | % |
| 09:05 | mmarczyk | so if you put a (print x) before the syntax-quoted form in the definition of prepare-2, it will print out the gensym for you when you try to use it like that |
| 09:05 | mmarczyk | before breaking |
| 09:05 | mmarczyk | making it apparent what's going on. |
| 09:07 | OForero | ok ... I will try that |
| 09:09 | AWizzArd | you can also call macroexpand-x on your macro call to test them |
| 09:10 | mmarczyk | effectively you'd like the macro to receive the argument *evaluated* -- which is contrary to the point of macros -- just use a function instead |
| 09:10 | OForero | macro expand does not work here |
| 09:10 | AWizzArd | ,(macroexpand-x '(when 1 2)) |
| 09:10 | clojurebot | java.lang.Exception: Unable to resolve symbol: macroexpand-x in this context |
| 09:10 | OForero | because the macro works |
| 09:10 | OForero | it fails when used in the collection |
| 09:10 | mmarczyk | it doesn't fail when used "in the collection" |
| 09:10 | AWizzArd | uhm, 1, not x |
| 09:10 | AWizzArd | ,(macroexpand-1 '(when 1 2)) |
| 09:10 | clojurebot | (if 1 (do 2)) |
| 09:10 | mmarczyk | it fails because you use it as (prepare-2 %) |
| 09:11 | mmarczyk | the % gets turned into a gensym -- a one-off symbol -- by the #(...) syntax |
| 09:11 | mmarczyk | so effectively it gets a symbol |
| 09:11 | mmarczyk | but that symbol names a local, namely the sole parameter to the anonymous function |
| 09:11 | mmarczyk | and you can't eval that |
| 09:11 | OForero | mmarczyk: I was using a function ... but it has the amnesia problem |
| 09:12 | mmarczyk | Licenser: hey, let Rich answer the previous batch of e-mails! :-) |
| 09:12 | Licenser | mmarczyk: :P psst I just had a new idea let me toss it in° |
| 09:13 | mmarczyk | Licenser: but more importantly, I'm afraid the suggestion was that that's not easy... dunno myself though |
| 09:13 | Licenser | if this is possible it would be a actuall good compromise |
| 09:13 | Licenser | well I admit I'm not sure how loop is implemented |
| 09:13 | mmarczyk | OForero: amnesia? |
| 09:13 | OForero | if you check the pastie |
| 09:13 | mmarczyk | I have |
| 09:14 | OForero | the first thing I attempted was with a function |
| 09:14 | mmarczyk | right |
| 09:14 | OForero | but because Records evaluate to maps |
| 09:14 | OForero | then the type is lost |
| 09:14 | mmarczyk | I think you might need to do (import example.Record) |
| 09:14 | OForero | and I need the type because if not I can not call the protocol on it |
| 09:14 | mmarczyk | which I promise I only thought about now |
| 09:15 | mmarczyk | give it a go maybe? :-) |
| 09:15 | OForero | ok ... I will try that |
| 09:15 | mmarczyk | yup, works for me |
| 09:15 | mmarczyk | some JVM leaking through the Clojure abstraction, I'm afraid |
| 09:15 | OForero | nop |
| 09:16 | OForero | really? |
| 09:16 | OForero | mmh |
| 09:16 | OForero | I reload the file then |
| 09:16 | mmarczyk | yeah, try a fresh repl... I will too |
| 09:17 | mmarczyk | oh, I see, hm |
| 09:19 | OForero | nope |
| 09:19 | OForero | the record lost its type ... also after the import |
| 09:19 | mmarczyk | and what would you like to happen? for rec to hold your record? |
| 09:19 | OForero | yes ... |
| 09:20 | OForero | I am working in a sort of dsl |
| 09:20 | AWizzArd | Maybe you need to AOT it? |
| 09:20 | OForero | and I pass a map with records and functions |
| 09:20 | mmarczyk | use intern maybe |
| 09:20 | OForero | but there are some functions that I declared in protocols |
| 09:20 | OForero | and those require the type to work |
| 09:21 | AWizzArd | Well, I would also expect that class instances evaluate to themselves |
| 09:21 | OForero | AOT? |
| 09:21 | clojurebot | AOT genclass is http://paste.lisp.org/display/70665 and http://clojure-log.n01se.net/date/2008-11-18.html#14:19 |
| 09:21 | AWizzArd | I would be surprised if (eval (File. "")) would not result in .. a file |
| 09:21 | mmarczyk | ,(doc intern) |
| 09:21 | clojurebot | DENIED |
| 09:21 | mmarczyk | ah, well |
| 09:21 | mmarczyk | OForero: you can use intern instead of def |
| 09:21 | AWizzArd | OForero: you call (compile-file 'on-your-namespace) |
| 09:21 | mmarczyk | it's a function which will create your Var for you |
| 09:21 | mmarczyk | then you don't have to use macros at all |
| 09:21 | mmarczyk | but, on a related note, your multimethod doesn't work for me |
| 09:22 | OForero | intern? ... |
| 09:22 | OForero | what is the problem? |
| 09:22 | mmarczyk | ahh, sorry, it does work, my bad :-P |
| 09:22 | OForero | (prepare-2 (first data)) works |
| 09:22 | mmarczyk | well |
| 09:22 | mmarczyk | you can write binder as |
| 09:23 | mmarczyk | (defn binder [x] (intern *ns* (toSymbol-2 (get x 0)) (get x 1))) |
| 09:23 | mmarczyk | then it's a function and you can map it over a collection |
| 09:23 | mmarczyk | and if I understand you correctly, it does what you want |
| 09:23 | OForero | ok ... that will replace the prepare |
| 09:23 | OForero | yes |
| 09:23 | OForero | let me try that |
| 09:24 | mmarczyk | (binder (first data)) |
| 09:25 | OForero | yep |
| 09:25 | OForero | that work in the example |
| 09:26 | OForero | I have to plug it into my code and see if that works ... |
| 09:26 | mmarczyk | (defn binder [xs] (doseq [x xs] (intern *ns* (toSymbol-2 (get x 0)) (get x 1)))) |
| 09:26 | OForero | thanks for the training session |
| 09:27 | mmarczyk | :-) |
| 09:27 | OForero | you think doseq is more idiomatic because of the side effects? |
| 09:27 | mmarczyk | doseq *works* with side effects :-) |
| 09:27 | mmarczyk | map would have to be forced with dorun, say |
| 09:27 | OForero | I know ... the question was if the creation of the vars is a side effect |
| 09:28 | OForero | because it works with map |
| 09:28 | mmarczyk | well, yes, it is |
| 09:28 | mmarczyk | it might work at the repl |
| 09:28 | OForero | fine |
| 09:28 | mmarczyk | but depending on where you put it in your code |
| 09:28 | OForero | your are right .... I have to remember that |
| 09:28 | mmarczyk | right |
| 09:29 | OForero | in the absence of a type system ... it is very good to have a helpful community |
| 09:29 | OForero | :-) |
| 09:30 | mmarczyk | :-) |
| 09:31 | mmarczyk | eval-on-a-record remains funky |
| 09:32 | mmarczyk | rhickey: do records evaluate to maps by design? |
| 09:34 | rhickey | mmarczyk: what does 'evaluate to maps' mean? |
| 09:34 | mmarczyk | (class (eval some-record)) |
| 09:35 | mmarczyk | gives me clojure.lang.PersistentArrayMap for some record I'm using |
| 09:35 | AWizzArd | rhickey: (defrecord Foo [a b]) ... (eval (Foo. 10 20)) ==> {:a 10, :b 20} |
| 09:37 | rhickey | ah, no, could you please make a ticket for that? |
| 09:38 | mmarczyk | AWizzArd: your discovery :-) |
| 09:39 | AWizzArd | k |
| 09:39 | mmarczyk | alright, going off for now... bbl |
| 09:40 | OForero | thanks guys |
| 09:41 | OForero | AWizzArd: can you ping me the ticket number? |
| 09:41 | OForero | I will put it in my document ... and of course reference you |
| 09:41 | OForero | mmarczyk: thanks ... it does works in my main code |
| 09:42 | OForero | and it is shorter |
| 09:46 | AWizzArd | OForero: http://bit.ly/bAq5DX |
| 10:12 | AWizzArd | What is the best way to find out if a given object is an instance of some record? |
| 10:23 | djpowell | AWizzArd: will (instance? MyRecord x) do? |
| 10:24 | djpowell | tho, if you're doing instance tests, then perhaps you should be using some sort of polymorphism instead? |
| 10:24 | AWizzArd | djpowell: I want to write a serializer |
| 10:25 | AWizzArd | but non-AOT'ed records can not be serialized by using the jvm mechanism |
| 10:25 | AWizzArd | so I need to identify those, them all |
| 10:25 | AWizzArd | not just a specific one |
| 10:25 | AWizzArd | (record? foo) I need |
| 10:25 | AWizzArd | and/or (deftype? foo) |
| 10:26 | djpowell | I don't think there is a way at the moment |
| 10:27 | AWizzArd | Yesterday hoeck suggested something about having a look at the classloader |
| 10:29 | djpowell | don't do this :) - (.startsWith (pr-str p) "#:") |
| 10:29 | AWizzArd | would be cool though if all deftypes and records implemented one (possibly empty) interface that allows me to identify them |
| 10:30 | AWizzArd | djpowell: great, this seems to be the best solution :p |
| 10:30 | djpowell | I imagine that records will get a readable representation soon enough |
| 10:32 | AWizzArd | too slow |
| 10:32 | AWizzArd | That does not scale |
| 10:57 | rustemsuniev | is there any better way to find an element in map? (filter #(and (= (get % :x) 1) (= (get % :y) 3) ) [{:x 1 :y 1} {:x 1 :y 2} {:x 1 :y 3}]) |
| 11:02 | AWizzArd | rustemsuniev: that is basically okay, but you could use destructuring (fn [{:keys [x y]}] (and (= x 1) (= y 3))) |
| 11:02 | Leafw | question: if clojure.parallel is deprecated, what replaces it? |
| 11:02 | rustemsuniev | AWizzArd: Thanks! |
| 11:03 | dnolen | ,(some #(when (= (map % [:x :y]) [1 3]) %) [{:x 1 :y 1} {:x 1 :y 2} {:x 1 :y 3}]) |
| 11:03 | clojurebot | {:x 1, :y 3} |
| 11:08 | rustemsuniev | dnolen: Cheers! :) |
| 11:11 | Leafw | sorry, I'd appreciate help understanding if there is a new clojure.parallel package, since the old one has been marked as deprecated. |
| 11:25 | OForero | AWizzArd: thanks ... I'll go back to my shores ... |
| 11:29 | djpowell | Leafw: the old clojure.par required the ParallelArray classes from a version of jsr166y which isn't going into Java 7 |
| 11:30 | djpowell | (or is that clojure.parallel) |
| 11:31 | djpowell | anyway, there is a 'par' branch which relies only on the lower level jsr166y classes, which will go into Java 7, and rather than having to convert your code to work with par classes, in that branch Clojure's vectors implement the necessary stuff, so it is all very easy and faster |
| 11:31 | djpowell | but, that requires at least Java 6, whereas clojure currently only requires Java 5, so I think that branch has been shelved for a bit until a decision is made to make clojure require Java 6 |
| 11:32 | djpowell | there is still pmap in core, if you just need a parallel map... |
| 11:32 | djpowell | the par branch hasn't been updated in a while tho |
| 11:34 | djpowell | I don't think there would be a problem using the deprecated parallel stuff in the meantime |
| 11:55 | Leafw | ,(def a 6) |
| 11:55 | clojurebot | DENIED |
| 11:56 | Leafw | ,(let [a 6 a2 (with-meta a {:test #(if (< % 10) (throw (Exception. "< 10!")))}] (test a)) |
| 11:56 | clojurebot | Unmatched delimiter: ] |
| 11:57 | Leafw | ,(let [a 6 a2 (with-meta a {:test #(if (< % 10) (throw (Exception. "< 10!")))})] (test a)) |
| 11:57 | clojurebot | java.lang.ClassCastException: java.lang.Integer cannot be cast to clojure.lang.IObj |
| 11:57 | Leafw | hum anybody could explain what is wrong with that with-meta declaration? |
| 11:59 | Leafw | djpowell: thanks for the par explanations. So it's all in the par branch. |
| 12:05 | Leafw | ,(clojure.set/intersection (keys {2 "two" 4 "four"}) #{2 3}) |
| 12:05 | clojurebot | java.lang.ClassCastException: clojure.lang.APersistentMap$KeySeq cannot be cast to clojure.lang.IPersistentSet |
| 12:05 | Leafw | that I don't understand either |
| 12:06 | Leafw | how come KeySeq doesn't implement IPersistentSet ? |
| 12:06 | ubolonton | In the let form a is not a var |
| 12:07 | ubolonton | It is literally 6 there |
| 12:07 | ubolonton | So it's (with-meta 6 ...) |
| 12:07 | Leafw | ubolonton: ok, but with (def a 6) and (def a (with-meta ....)) same problem, ubolonton |
| 12:12 | hoeck | Leafw: numbers cannot have metadata |
| 12:14 | Leafw | (def a 6), a is a var, not a number |
| 12:14 | Leafw | it evaluates to a number, but that is different. |
| 12:14 | hoeck | but a resolves to a number |
| 12:14 | ubolonton | Yes it is evaluated before be passed to with-meta |
| 12:14 | Leafw | so how can one give the var a its meta data ? |
| 12:14 | ubolonton | with-meta is a function not a macro |
| 12:14 | ubolonton | (with-meta 'a ...) |
| 12:14 | Leafw | I see. So one needs (with-meta (var a) {}) ... |
| 12:15 | Leafw | oh. ok. |
| 12:15 | Leafw | unevaluated a ... gets its meta map. thanks |
| 12:16 | Leafw | and then, how can the var a be read from within the test function? The test function is given no arguments, and direct use of 'a' in it fails with Symbol can't be cast to number. How can the test function get the value of the variable it tests for? |
| 12:16 | hoeck | Leafw: but metadata on vars is not settable |
| 12:17 | Leafw | hoeck: yes I know, its (def a (with-meta ... |
| 12:17 | hoeck | no, with-meta doesn't work on vars |
| 12:18 | hoeck | just found that out :P |
| 12:18 | Leafw | hoeck: I am not sure I understaht what you mean. with-meta returns a var, doesn't it? |
| 12:19 | hoeck | with-meta returns a new object with the attached metadata |
| 12:19 | Leafw | sure. That 'object' is a var |
| 12:19 | hoeck | but only if that object implements the IObj interface, and a var doesn't |
| 12:19 | Leafw | hum, no, it returns a Symbol, sorry |
| 12:19 | Leafw | buf |
| 12:20 | Leafw | dud, I am confused. What is the proper usage of with-meta and :test and (test ...) ? |
| 12:21 | hoeck | you specify the :test function in the defn |
| 12:22 | hoeck | and to alter a vars metadata, you use alter-meta |
| 12:22 | Leafw | defn? I see. One cannot test a var then? What is the use of testing a function? |
| 12:22 | hoeck | or def of course :) |
| 12:22 | hoeck | ,(doc def) |
| 12:22 | clojurebot | DENIED |
| 12:23 | Leafw | alter-meta doesn't exist, hoeck |
| 12:23 | hoeck | sorry, its alter-meta! |
| 12:24 | hoeck | ,(doc alter-meta!) |
| 12:24 | clojurebot | "([iref f & args]); Atomically sets the metadata for a namespace/var/ref/agent/atom to be: (apply f its-current-meta args) f must be free of side-effects" |
| 12:25 | Leafw | I see, ! |
| 12:25 | hoeck | because it mutates sth. |
| 12:25 | Leafw | right |
| 12:26 | hoeck | now I understand what you're trying to do, using test to check the contents of a var |
| 12:26 | Leafw | yes :) |
| 12:28 | hoeck | (def #^{:test (fn [] 1)} foo 1) |
| 12:29 | hoeck | note that the new metadata syntax uses ^ instead of #^ |
| 12:29 | hoeck | and then invoke the test with (test #'foo) |
| 12:30 | Leafw | but the test function is now aware of the value of foo |
| 12:30 | Leafw | so of what use is it? |
| 12:30 | hoeck | that was just an example test function |
| 12:30 | Leafw | yes I understand :) |
| 12:30 | Leafw | but I tried giving the test fn an arg, and then that fails |
| 12:31 | Leafw | (test #'foo) would return :no-test |
| 12:31 | Leafw | it's (test foo), I think |
| 12:31 | hoeck | (declare a) (def #^{:test fn-using-a} a 1) |
| 12:32 | Leafw | I can get that o work, but I don't see the point of a test function for a var that is not aware of the value of the var. |
| 12:32 | hoeck | as its a var, you can just use it in the test function like any other vars |
| 12:33 | hoeck | though you have to declare that var first, because the test-function will be evaled before the def |
| 12:35 | Leafw | hoeck: that actually fails |
| 12:35 | Leafw | (def a 6) |
| 12:35 | Leafw | (def a (with-meta 'a {:test #(if (< a 10) (throw (Exception. "Value under 10!")))})) |
| 12:35 | Leafw | (test a) |
| 12:35 | Leafw | java.lang.ClassCastException: clojure.lang.Symbol cannot be cast to java.lang.Number |
| 12:35 | Leafw | so "a" is not visible, or is read in a way that I don't udnerstand. |
| 12:37 | hoeck | http://gist.github.com/445036 |
| 12:38 | Leafw | so declare works but def doesn't :) |
| 12:38 | Leafw | now that is yet another source of confusion |
| 12:39 | hoeck | no, you're defining the var "a" to be the symbol "a" with the attached :test metadata |
| 12:40 | kiras | hi |
| 12:40 | hoeck | and then you are calling (test a), which uses the metadata on the symbol a to test the value of the variable a, which is the symbol a, which is not a number ! :P |
| 12:40 | hoeck | Leafw: (test a) basically uses ((:test (meta a))) |
| 12:41 | kiras | i have a question that is turning into a book... how many lines should i post at once? |
| 12:41 | Leafw | I must say this is not as clear as I think it is. |
| 12:41 | Leafw | kiras: post a gist at github |
| 12:41 | kiras | Leafw: ok, ty |
| 12:41 | Leafw | hoeck: but thanks for the explnation. I am reading it like a 12 times |
| 12:41 | hoeck | the key point is understanding vars |
| 12:42 | hoeck | whenever you do (def a 1), you define a var |
| 12:42 | hoeck | when you evaluate `a' on the repl, you get the contents of that var |
| 12:43 | Leafw | yes, so much I get it |
| 12:43 | hoeck | so (meta a) gets the metadata of the object _inside_ the var |
| 12:44 | Leafw | so the var contains a symbol and a value, is that right |
| 12:44 | Leafw | and the var itself has a meta map. |
| 12:44 | hoeck | no, the var only contains that value |
| 12:44 | Leafw | so what links the symbol and the value? |
| 12:45 | hoeck | the mapping of names to var-objects is done by the clojure runtime, I guess |
| 12:45 | Leafw | so a symbol has a meta map then? Or is it the var, which contains the symbol, that has the meta map? |
| 12:46 | Leafw | sorry, that second part is clearly wrong: I meant Or is it the var, which contains the symbol, that has the meta map? |
| 12:46 | Leafw | xD |
| 12:46 | Leafw | s/symbol/value |
| 12:46 | hoeck | the var has a meta-map |
| 12:47 | Leafw | ok |
| 12:47 | Leafw | and also the value object. |
| 12:47 | hoeck | and the value can have metamap too, if its a symbol |
| 12:47 | hoeck | right |
| 12:47 | Leafw | sure, rabitt hole all the way deep |
| 12:47 | hoeck | but not if the value object is a number, because numbers do not implement metadata |
| 12:47 | Leafw | makes sense |
| 12:47 | Leafw | by the way |
| 12:47 | hoeck | or keywords do also not implement metadata |
| 12:48 | hoeck | right, and back to your initial problem |
| 12:49 | hoeck | (def #^{:a 1} foo 1) adds {:a 1} as metadata to the to-be-created var `foo' |
| 12:50 | Leafw | the (test #'a) then gets the meta map for the 'a itself. Otherwise, (test a) would test for the meta map of the value of a, which is 6, which doesn't have any. |
| 12:50 | hoeck | exactly |
| 12:50 | Leafw | I think I am getting it. Thanks hoeck |
| 12:50 | hoeck | np :) |
| 12:51 | Leafw | I knew about #^{} in def. You mentioned though that now it is being changed to ^ alone, without # ? |
| 12:52 | Leafw | and by the way, isn;'t it a huge overhead that all vars have a meta map? Or is that map nil except when explicitly defined? |
| 12:53 | hoeck | well, its just a plain pointer in the vap object, and gets out of the way pretty easily |
| 12:53 | hoeck | but it offers great capabilities, each var object for instance as :line and :file metadata |
| 12:55 | Leafw | indeed most values in clojure end up not in vars but in a let or as members of a collection. |
| 12:55 | hoeck | and with the upcoming ^:static flag, there is enough room to improve performance where needed |
| 13:00 | Leafw | hoeck: what does the ^:static do? |
| 13:00 | hoeck | Leafw: on recent clojure snapshots, ^ is used as a reader-macro for metadata, its less visually disturbing than #^, I beleive #^ will be marked deprecated |
| 13:00 | Leafw | I see, both #^ and ^ work, currently. |
| 13:01 | hoeck | of course, they will work both for a while |
| 13:01 | Leafw | ^ used to mean something else thoguh |
| 13:01 | Leafw | but I forgot what it was. |
| 13:01 | hoeck | it was for accessing metadata? |
| 13:01 | hoeck | ^:static indicates, that a function can be compiled as a method |
| 13:02 | hoeck | it will then loose its closure-property, but can take primitive args and will be less dynamic |
| 13:03 | hoeck | code using ^:static functions has to be reevaluted to call new versions of the static functions |
| 13:03 | Leafw | I see. So it throws one back to the java world. |
| 13:03 | Leafw | both for the good and the bad :) |
| 13:04 | Leafw | I can see a use for numerical operations with clojure, adding the ^:static once all works fine. |
| 13:04 | rhickey | Leafw: not really, you can do this while in the repl, with all your other code and data loaded, vs, quit, recompile, restart of Java |
| 13:05 | Leafw | rhickey: true. The "bad" is much less so. |
| 13:05 | rhickey | Leafw: it's more like the macro experience |
| 13:05 | Leafw | macros aren't closures either, is that what you mean? |
| 13:06 | rhickey | Leafw: seeing a change to a macro requires re-evaluation of client code |
| 13:06 | Leafw | every advice out there suggest not using macros, and I have found it the hardest to teach others. |
| 13:06 | Leafw | rhickey: I understand. The macro got compiled and is aware only of what was declared when it was compiled. |
| 13:07 | Leafw | rhickey: clojure.parallel is marked as deprecated in clojure.org. What will clojure 1.2 come with? |
| 13:07 | rhickey | no, the caller of a macro embeds its current definition, and won't use a new definition until it (the caller) is recompiled |
| 13:08 | Leafw | re-reading that ... I think I understood. Thanks. |
| 13:09 | Leafw | by the way rhickey , clojure code made it into a J Neuroscience paper. Made my life easier and works great. |
| 13:09 | rhickey | Leafw: cool! - got a pointer? |
| 13:10 | serp_ | (using emacs and swank): how do I compile a buffer the second time without getting errors about stuff already existing? |
| 13:11 | Leafw | http://www.jneurosci.org/cgi/content/full/30/22/7538 (see pdf here: http://www.ini.uzh.ch/~acardona/papers/Cardona_2010_lineage_identification.pdf ) and some of the clojure code, mostly as a data storage in a map of maps, here: http://www.ini.uzh.ch/~acardona/nit/ |
| 13:12 | kiras | some questions i have: http://gist.github.com/445066 |
| 13:13 | Leafw | rhickey: in the materials ad methods I acknowledge clojure as the language used. |
| 13:15 | Leafw | the other major clojure fiel used is here: http://repo.or.cz/w/trakem2.git/blob/HEAD:/lineage/identify.clj |
| 13:23 | hoeck | kiras: the dash-underscore is because in idiomatic lisp, one uses dashes instead of underscores or camelcase, but java doesn't allow dashes in classnames |
| 13:23 | hoeck | kiras: but im no lein expert, not shure how lein handles that |
| 13:23 | hoeck | clojure of course allows dashes or underscores, its just not good style to create a my_name_space |
| 13:23 | kiras | hoeck: thanks. i knew that in lisp dashes were used instead, but i am confused by the way lein is doing this. |
| 13:24 | kiras | hoeck: it almost seems like if you do lein new test_project or lein new test-project, it should create the files with underscores, but use hyphens in (defproject) and (ns), doesn't it? i may be totally missing something though. |
| 13:24 | hoeck | in clojure, if you declare a dashed-name.space-test , its files must reside in the classpath at dashed_name/space_test.clj |
| 13:25 | kiras | right |
| 13:25 | kiras | i'm just saying, it would be bad to use lein new test-project as it currently works |
| 13:25 | kiras | because all the files/directories will be named with dashes |
| 13:25 | kiras | using lein new test_project will name the files/directories correctly |
| 13:26 | hoeck | kiras: lein is pretty young though, so it may have its rough edges |
| 13:26 | kiras | but then in the actual code, you get (defproject test_project) and (ns test_project.core) |
| 13:26 | hoeck | then simply use the lein test_project and replace the underscores in the generated files |
| 13:26 | kiras | hoeck: ok, i was trying to figure out if that was the right way to do things or not |
| 13:27 | hoeck | no, lein should definitively care about that |
| 13:27 | kiras | hoeck: i worked through the programming clojure book, but i haven't done any real clojure projects yet, just playing around at the repl |
| 13:27 | hoeck | but I'm not an active lein user anyways, have you used the latest version? |
| 13:27 | kiras | hoeck: so i was a little bit unsure of whether i was right or not |
| 13:28 | kiras | hoeck: i believe this is the latest, i can check |
| 13:28 | kiras | heh |
| 13:30 | kiras | hoeck: if this is the latest version and it's behaving this way, then it's wrong, right? it should work like i was saying, where whether lein new test-project or lein new test_project is used, it should name files with underscores and use hyphens in the code? if this is the latest version, should i submit a bug report to someone? |
| 13:32 | hoeck | kiras: of course, I guess its best to post sth on the mailinglist |
| 13:32 | kiras | hoeck: the clojure mailing list? |
| 13:33 | hoeck | kiras: http://github.com/technomancy/leiningen |
| 13:33 | hoeck | in the readme under "hacking" are some links to the mailing list and the issues section |
| 13:34 | hoeck | but I haven't found a dash/underscore issue there |
| 13:34 | kiras | ah, thanks |
| 13:34 | kiras | well, it seems that i'm using 1.1.0 and there is a 1.2.0-RC1 available |
| 13:35 | kiras | maybe i should try that |
| 13:35 | hoeck | of course! :) |
| 13:35 | kiras | heh |
| 13:36 | kiras | thanks for the help. i'm going to see if that works better. |
| 13:44 | dnolen | rhickey: with the latest changes should I be seeing a per regression around amap/areduce? |
| 13:44 | dnolen | s/per/perf |
| 13:45 | rhickey | dnolen: no, got a gist? |
| 13:49 | dnolen | rhickey: not yet, was testing a bigger program, I was seeing 22ms per iteration with the intro of +', now I'm back to 100ms, I'll need to come up something smaller/specific |
| 13:49 | rhickey | dnolen: if you are on the latest, you shouldn't be using +' |
| 13:49 | dnolen | rhickey: heh, things are moving quickly, missed that. |
| 13:50 | rhickey | dnolen: do a (doc +) |
| 13:51 | rhickey | dnolen: also refresh: https://www.assembla.com/wiki/show/b4-TTcvBSr3RAZeJe5aVNr/Enhanced_Primitive_Support |
| 13:52 | rhickey | dnolen: did you miss: http://groups.google.com/group/clojure/msg/9d13452a01048646 |
| 13:54 | dnolen | rhickey: thx |
| 13:56 | dnolen | rhickey: wow, am i correct in seeing that gives map like an order of magnitude speedup? |
| 13:56 | dnolen | rhickey: sorry i mean reduce I think, or is that because internal reduce got re-enabled? |
| 13:58 | rhickey | dnolen: dunno what you are comparing |
| 14:08 | mmarczyk | ah, cl-format in contrib breaks down with current equal :-( |
| 14:09 | mmarczyk | "had: Object, needed: long" |
| 14:09 | mmarczyk | (grep for last_pos) |
| 14:10 | dnolen | rhickey: alternate universe is interesting. Thought it seems like the auto-promoting BigInt group in the Clojure community is either bigger or more vocal :) I'm still ok +', etc for fast-math. |
| 14:11 | Blackfoot | if i am writing a macro that takes multiple forms, assigning each form to generated symbol, how can i get the string representation of that form? |
| 14:13 | rhickey | mmarczyk: get latest contrib |
| 14:13 | mmarczyk | rhickey: oh... ok, pulling now, thanks |
| 14:23 | Chousuke | Blackfoot: (str form) :P |
| 14:23 | Chousuke | Blackfoot: or pr-str |
| 14:24 | Blackfoot | http://gist.github.com/445120 here's a simplified version, and i'ld like (printforms (inc 1) (inc 2)) to print (inc 1) (inc 2) |
| 14:26 | edbond | spend 30min looking how to write 1.2.0 version in leiningen, help please |
| 14:26 | Blackfoot | oh i think i see why that's not working, the forms are being run in the binding |
| 14:27 | edbond | org.clojure/clojure "1.2.0-SNAPSHOT" ? |
| 14:27 | serp_ | org.clojure/clojure "1.2.0-master-SNAPSHOT"] |
| 14:28 | edbond | serp_: thanks |
| 14:30 | rustemsuniev | Is there any way to clean a *board* after test is executed? (defn boards-fixture [f] (binding [board (load-board 2 2)] (f))) |
| 14:34 | mmarczyk | Blackfoot: why not just ~forms instead of (list ~@forms) ? |
| 14:35 | mmarczyk | actually ~(map (fn [f] `'~f) forms), I guess |
| 14:35 | Blackfoot | mmarczyk: that had an error in an earlier iteration iteration. ok, trying that now |
| 14:36 | mmarczyk | Blackfoot: (defmacro pf [& fs] `(doseq [f# '~(map (fn [f] `'~f) fs)] (println f#))) |
| 14:37 | mmarczyk | note the extra quote before ~(map ... too |
| 14:38 | mmarczyk | Blackfoot: actually (defmacro pf [& fs] `(doseq [f# '~fs] (println f#))) matches your spec |
| 14:38 | mmarczyk | the other one prints (quote (inc 1)), this one prints (inc 1) |
| 14:39 | mmarczyk | mixed things up in the first approach, my bad :-) |
| 14:40 | Blackfoot | no problem, less mixed up than me :) yea, sounds like i should not have spliced them |
| 14:42 | mmarczyk | I'm off for now, bbl |
| 14:45 | Blackfoot | thanks mmarczyk. next step is to actually show the result of running the form |
| 15:29 | qbg | rhickey: With respect to loop/recur, would it be possible to have the the compiler upgrade primitive bindings to boxed binding (and emit a note, perhaps) when one tries to recur with a non-matching type? |
| 15:50 | qbg | dnolen: Now as in the equal branch or now as in the master branch? |
| 15:50 | dnolen | qdg: loop/recur hasn't changed, it's a special form |
| 15:52 | qbg | But assuming 1 is a primitive causes strange behaviour to those who are used to the master branch |
| 15:52 | dnolen | the only issue is initializing with a literal. if you want a boxed accumulator ask for it. |
| 15:52 | dnolen | they want loop/recur to participate as fns |
| 15:52 | dnolen | I think this is a bad idea, it isn't an fn |
| 15:55 | qbg | (loop [i 1] (recur (foo i))) won't compile if foo is a regular function currently; some don't like that |
| 15:57 | qbg | OTOH, one could argue that if you are using loop/recur in normal code, you are doing it wrong. |
| 16:01 | dnolen | qbg: exactly, loop/recur converts directly to a low-level iteration. I see no reason to embed smarts into it. |
| 16:02 | dnolen | i also image putting any checks in loop/recur for autopromotion will diminish perf, the whole point of using loop/recur in the first place |
| 16:04 | qbg | My previously presented idea would work at compile time, so there shouldn't be a performance difference |
| 16:10 | Kjellski | Hi there, could someone give me a hint on how to tell the leining repl that i want to (use '[clojure-csv]) or something? Thought the classpath would be set automatically? |
| 16:10 | dnolen | qbg: of course that hides the mistake of someone who wants primitives |
| 16:11 | raek | Kjellski: have you done "lein deps"? |
| 16:11 | Kjellski | yes, the jar is already present in lib/ |
| 16:11 | qbg | dnolen: The compiler could emit a note if something like *warn-on-reflection* is set. |
| 16:11 | raek | ah, now I see it |
| 16:11 | raek | (use 'clojure-csv) |
| 16:12 | raek | otherwise you get the empty prefix list |
| 16:12 | Kjellski | tells me the same: java.io.FileNotFoundException: Could not locate clojure_csv__init.class or clojure_csv.clj on classpath: (NO_SOURCE_FILE:0) |
| 16:12 | raek | shouldn't it be clojure-csv.core? |
| 16:13 | raek | that was what I found on http://github.com/davidsantiago/clojure-csv |
| 16:13 | raek | maybe that have been changed recently |
| 16:13 | Kjellski | raek: damned, thanks man! that did the job! |
| 16:15 | dnolen | qbg: except that as rhickey points out anyone using loop/recur now will probably emit warning. loop/recur is primitive get over it, is my feeling. |
| 16:20 | tomoj | so either (loop [x (num 1)] ..) or (loop [x 1] ... (+' x ...)) is what to do when you want auto-promotion? |
| 16:20 | tomoj | using unprime in the first loop |
| 16:22 | qbg | Right now you need to use +' to get auto-promotion |
| 16:22 | qbg | And the second loop won't compile because +' won't return a primitive |
| 16:26 | tomoj | so you're saying you need (loop [x (num 1)] ... (+' x ...)) ? |
| 16:26 | qbg | Yes |
| 16:27 | tomoj | ok, I see |
| 16:27 | tomoj | (loop [x (num 1)] ... (+ x ...)) will use boxed longs but will throw an error on overflow? |
| 16:28 | qbg | Looks like it |
| 16:29 | qbg | (I'm assuming you are recuring with the result of math) |
| 16:59 | TakeV | Use ^ instead of #^ for type hints, right? |
| 16:59 | qbg | Yes |
| 16:59 | TakeV | Cool. |
| 17:13 | silveen | huh? ^ instead of #^? since when? and why? |
| 17:14 | raek | since 1.2 (#^ still works). no idea. |
| 17:14 | qbg | It has been like that for a while on the master branch. |
| 17:15 | silveen | wierd, but ok |
| 17:21 | Kjellski | I've got a question about lein. I've tried lein jar and lein uberjar, but the main class is not found when I try java -jar test.jar or java -jar test-standalone.jar ... |
| 17:22 | qbg | What do you have for :main in your project.clj? |
| 17:23 | Kjellski | qbg: Yes, and it points to the right file... *stupidasiseeit* do I need the (:gen-class) option for the target namespace? |
| 17:24 | qbg | That would help... |
| 17:25 | Kjellski | qbg: It's in and not helping after "lein clean" "lein compile" "lein jar" "java -jar test.jar" |
| 17:26 | qbg | for :main you have namespace and not its file, correct? |
| 17:28 | Kjellski | qbg: it's ":main test.core" and in that file it's "(ns test.core ..." something wrong with that? |
| 17:28 | qbg | If you replace :main with clojure.main, can you launch test.jar and get the clojure REPL? |
| 17:30 | Kjellski | qbg: the file is unter "src/test/core.clj" and I tried the clojure.main with clean compile jar and it leads to a no main class exception too... |
| 17:30 | qbg | Does it work when you create an uberjar? |
| 17:30 | MrHus | Kjellski: do you have a -main function? |
| 17:32 | Kjellski | qbg: yeah, then it works when i try to java -jar test-standalone.jar |
| 17:32 | Kjellski | MrHus: Yap, I have... |
| 17:32 | qbg | You are going to need to have clojure on the classpath when you launch test.jar |
| 17:34 | Kjellski | qbg: okay, thanks! Could I just use the one in lib/ from that project? |
| 17:34 | qbg | Yes |
| 17:59 | arohner | is there a function like repeatedly, where the seq ends when f returns nil? |
| 18:00 | arohner | I guess I can (take-while identity (repeatedly f)) |
| 18:00 | qbg | (take-while #(not (nil? %)) (repeatedly f)) |
| 18:22 | Kjellski | is there any way to make "lein repl" load the :main and it's namespace? |
| 18:57 | rbarraud | \ |
| 20:33 | defn | lancepantz: ever get your code up for the rails + clojure? |
| 21:09 | defn | anyone know what the docstring was for lazy-cons? |
| 21:09 | defn | im trying to turn some lazy-cons laden code into lazy-seq code |
| 21:34 | trptcolin | defn: for some definition of "was" (pulled out of the "20081217" branch of the git repo), here it is: http://gist.github.com/445462 |