2010-11-25
| 00:02 | Raynes | That doesn't look good. |
| 00:17 | quizme | is there a way to do vector addition succinctly ? |
| 00:17 | quizme | (+ [0 1] [3 4]) ; => [3 5] |
| 00:17 | amalloy | quizme: ##(map + [1 2 3] [4 5 6])? |
| 00:17 | sexpbot | ⟹ (5 7 9) |
| 00:17 | quizme | oh cool thanks |
| 00:18 | LauJensen | quizme: note, the return is not a vector |
| 00:18 | quizme | yikes |
| 00:18 | quizme | amalloy, LauJensen so call vec on that to keep it as a vector ?? |
| 00:19 | quizme | i'm ok with that i guess |
| 00:19 | amalloy | quizme: that won't "keep" it as a vector. lazy seqs and vectors have different performance characteristics and storage needs, so that will involve copying back into a vector |
| 00:19 | LauJensen | quizme: Well. There are performance implications |
| 00:19 | amalloy | why do you need a vector at all? |
| 00:20 | quizme | hehe |
| 00:20 | quizme | we had this discussion a while back. |
| 00:20 | amalloy | if it's performance reasons, you might be stuck writing this as loop/recur, or maybe a clever reduce |
| 00:20 | technomancy | ,(reduce (fn [sum [x y]] (+ sum x y)) 0 (zipmap [0 1 2] [3 4 5])) |
| 00:20 | clojurebot | 15 |
| 00:20 | technomancy | ^ if you want to keep it as a vector all the way through |
| 00:20 | quizme | i'm dealing with cartesian coords |
| 00:21 | quizme | it just seems natural to work with vectors |
| 00:21 | quizme | technomancy thnx |
| 00:21 | technomancy | you can replace the fn with (partial apply +) |
| 00:22 | amalloy | quizme: my advice is to just work with seqs. who cares if those seqs came from vectors or from lazy seqs? |
| 00:22 | amalloy | technomancy: doesn't that do...something different from what he wanted? |
| 00:23 | technomancy | amalloy: oh... reading comprehension fail. |
| 00:24 | quizme | i dunno |
| 00:24 | quizme | i just think it's a bit odd that everything sinks into a seq blackhole |
| 00:24 | quizme | why not preserve types ? |
| 00:25 | amalloy | quizme: not feasible. you can't add to the front of a vector efficiently |
| 00:27 | amalloy | and vectors aren't (and can't be) lazy, so a map over a vector would have to realize the whole thing all at once in order to return a vector |
| 00:28 | amalloy | &(nth (range 1e1000) 10) |
| 00:28 | sexpbot | ⟹ 10 |
| 00:28 | amalloy | &(nth (vec (range 1e1000)) 10) |
| 00:28 | sexpbot | Execution Timed Out! |
| 00:29 | trptcolin_ | technomancy: reading your import-indent rule (http://p.hagelb.org/import-indent.html) - makes a lot of sense |
| 00:29 | technomancy | to think... we've been doing it wrong for years =) |
| 00:29 | technomancy | actually it was danlarkin who pointed that out to me |
| 00:30 | trptcolin_ | but... i kind of feel like in (:require [clojure.test :only (is)]), that clojure.test is in the same category |
| 00:30 | trptcolin_ | and it's forced to be a vector |
| 00:30 | technomancy | trptcolin_: yeah, but you never have to break the line inside that vector |
| 00:30 | technomancy | so I don't think it matters there |
| 00:31 | trptcolin_ | you could need a line break, right? - like if you have 10 vars in the :only? |
| 00:31 | trptcolin_ | but maybe i'm missing your point here |
| 00:31 | technomancy | well then the break is inside the :only inner vector, not the one starting with clojure.test |
| 00:31 | technomancy | in which case they're peers |
| 00:32 | _ato | (:require [clojure.test :only [is]]) |
| 00:32 | _ato | use a vector for the :only one |
| 00:32 | trptcolin_ | ah interesting, that would follow technomancy's rule about peers |
| 00:33 | _ato | that's the way I've always done it. (foo bar) "foo" is special, like when calling a function. [foo bar] foo and bar are equals |
| 00:34 | technomancy | exactly |
| 00:36 | trptcolin_ | totally makes sense. i feel like using a list is more common, though, as the seq given to :only |
| 00:38 | technomancy | possibly. I've been using the vector for use/require forever though |
| 00:38 | technomancy | and now I can descend to new depths of pedantry armed with arguments! |
| 00:39 | trptcolin_ | :) it was really interesting for me because i'm working on a big ol' blog post about use/require/import/ns |
| 00:39 | trptcolin_ | and hadn't considered reasoning; only what was conventional |
| 00:40 | technomancy | trptcolin_: are you going to cover the overhaul proposals? |
| 00:40 | trptcolin_ | hadn't planned to. has there been activity lately? i knew there was some stuff put out there quite awhile back |
| 00:40 | technomancy | http://dev.clojure.org/jira/browse/CLJ-272 |
| 00:41 | technomancy | nothing's really happened with it, no. |
| 00:42 | technomancy | will be good to see a post on that though; it's one of those things that is a lot more complicated than it needs to be and confuses newcomers |
| 00:42 | technomancy | would be better to just fix it in Clojure of course. =) |
| 00:42 | technomancy | heh... "just" |
| 00:43 | trptcolin_ | exactly. every time i talk to somebody new to clojure, that's a big source of confusion |
| 00:44 | trptcolin_ | ok "every time" is hyperbole |
| 00:46 | technomancy | I wonder if rich would be open to someone just moving forward with a concrete proposal plus implementation of clj-272 |
| 00:46 | amalloy | trptcolin_: every time i talk to myself about ns/require/use, there is a great deal of confusion (no hyperbole) |
| 00:46 | technomancy | the problem is it will probably just get bogged down in bikeshedding |
| 00:47 | trptcolin_ | amalloy: lol |
| 00:47 | technomancy | but it would be good to time it with the breaking dynamic vars changes in order to group together all the breaking changes, perhaps. |
| 00:48 | technomancy | maybe that's something I can tackle after lein 1.4 |
| 01:05 | Licenser | technomancy: it nearly is working :) |
| 01:15 | Lajla | Licenser, do you implement lSeq? |
| 01:16 | Lajla | Can I call seq on you? |
| 03:35 | samx | I'm looking to do something like the following: (until (pred1 ..) (pred2 ...) ... (predn ...)).. where i'd like the predicated to be executed one by one, until one is executed that does not return nil. At that point, the return value of the expression would be the return value of that specific predicate. Is there a higher order function in the libs to do that directly, or what would be the recommended way? |
| 03:38 | LauJensen | ClojureQL now released as beta2 |
| 03:38 | samx | sweet.. saw the video, and clojureql almost makes me want to work with relational databases again.. almost :-) |
| 03:39 | LauJensen | samx: The interfaces wouldn't change (much) when I make no-sql version so you might as well dig in :) |
| 03:39 | samx | :-) |
| 03:42 | Lajla | samx, isn't that just using or? |
| 03:43 | samx | hmm, likely.. figured there should be some easy way of doing that.. just not familiar with the libs at this point |
| 03:43 | Lajla | I guess or is what you want |
| 03:43 | Lajla | and does the inverse |
| 03:44 | samx | yup, looks to be what i was looking for.. thanks :-) |
| 03:45 | Lajla | It's not a funcoin though |
| 03:45 | Lajla | But it s cool |
| 03:46 | LauJensen | samx: Could also be a combination of map and or . (map #(or (pred1 %) (pred2 %) (pred3 %) :default) ...) |
| 03:46 | Lajla | &((constantly "I worship his shadow") 4) |
| 03:46 | sexpbot | ⟹ "I worship his shadow" |
| 03:56 | amalloy | samx, LauJensen: (or (p1 x) (p2 x) ...) is the same as (some #(% x) [p1 p2 ...]), isn't it? |
| 03:56 | LauJensen | no |
| 03:58 | LauJensen | wait, yes it is |
| 03:58 | amalloy | whew |
| 03:58 | amalloy | i always get nervous when i can't understand LauJensen but he's telling me i'm wrong |
| 03:58 | LauJensen | hehe, Im just a little slow this morning, sorry :) |
| 04:05 | amalloy | which reminds me, i've never quite understood why (some even? [4 1]) returns true instead of 4. i mean, of course it's because (even? 4) is true rather than 4, but it seems like it's named (some) because of mathematical precedents |
| 04:05 | amalloy | and when you say "some tall guy", you don't mean "tallness, assuming that there exists a tall person", you mean "a person, from the set of all people, who is tall" |
| 04:07 | amalloy | both behaviors are useful to have (see samx's request), but having to write (first (filter tall people)) vexes me. is there something better? |
| 04:07 | raek | it would be nice to have something like (defn passes [pred] (fn [x] (when (pred x) x))) and (defn fails [pred] (fn [x] (when-not (pred x) x))) |
| 04:08 | samx | do the standard libs have any non-determinism type functions in them.. i'm looking to do something like: (weighted 0.8 (doSomeStuff) 0.2 (doSomeOtherStuff)).. i assuming i'll need to build my own macro for it, but just making sure :-) |
| 04:08 | amalloy | raek: agreed. i've written such utility functions myself, but it would be nice to have them |
| 04:08 | amalloy | samx: augh not a macro. do this in a function |
| 04:09 | amalloy | though incanter does have this function already |
| 04:09 | samx | amalley, if i do it as a function, i'd have to quote the (doStuffs), which would likely be a pain to use |
| 04:09 | amalloy | samx: http://liebke.github.com/incanter/distributions-api.html#incanter.distributions/roulette-wheel |
| 04:09 | raek | amalloy: I'm just curious... what names did you give them? |
| 04:09 | amalloy | samx: no; you'd have to wrap them in a function |
| 04:10 | raek | and what would you call the class of functions they return? |
| 04:10 | samx | amalloy, why would you be against doing that as a macro? |
| 04:10 | raek | some libs use the term 'validator' for a fn that retuns the/a value if something is valid and nil else |
| 04:11 | amalloy | raek: actually i guess i haven't done that. i wrote (defn verify [f x] (when (f x) x)), but i haven't used it to return another function |
| 04:11 | amalloy | so far i haven't needed to, i guess |
| 04:13 | _ato | ah, nice. I often find myself trying to write something like: (if-let [x (even? (something))] ...) |
| 04:13 | amalloy | samx: because you can easily do it in a function, by using #(dostuff) or my-dostuff-fn instead of (dostuff) |
| 04:14 | _ato | macros should be a last resort, functions are much more composable |
| 04:16 | amalloy | samx: inevitably your macro will expand into (let [x (rand)] (condp < x, 0.5 (+ 1 y), 0.75 (* 2 y), 1 y)) |
| 04:16 | amalloy | what's so complicated about this that it needs the compiler to write it for you? |
| 04:17 | amalloy | since you'll have to call your macro as (weighted-choice 0.5 (+ 1 y), 0.75 (* 2 y), 1 y) anyway... |
| 04:19 | _ato | I guess the main benefit of a macro there is short circuiting, hmm dunno |
| 04:19 | _ato | short hand |
| 04:19 | amalloy | _ato: condp short circuits, o/w it wouldn't be very useful |
| 04:20 | _ato | ah, I missed what your condp bit |
| 04:20 | _ato | yep exactly |
| 04:22 | samx | ok, thet let condp sounds nice.. i'll just use a function :-).. thx.. though, the predicate should be > |
| 04:24 | amalloy | samx: damn. i finally remember the order of arguments to <, and i get the order in which condp passes them wrong |
| 04:27 | amalloy | anyway, i'm going to bed. happy thanksgiving, americans, and happy still-having-to-work-day for everyone else |
| 04:27 | samx | night |
| 06:25 | Guest44062 | Hello and good day :) |
| 08:05 | octe | how do i debug ArrayIndexOutOfBoundsException when compiling? |
| 08:08 | AWizzArd | octe: you can do println debugging. Just place 5 printls on toplevel into your code. (println 1) ... (println 2) ... and so on. |
| 08:09 | AWizzArd | When you see the printlns 1-4 but not 5, then you know that inbetween those two your array access takes place. On toplevel as it seems, otherwise you would not get an Exception during compilation. |
| 08:11 | hoeck | octe: and watch out for hashmaps |
| 08:11 | hoeck | ,{:a 1, :b} |
| 08:11 | clojurebot | java.lang.RuntimeException: java.lang.ArrayIndexOutOfBoundsException: 3 |
| 08:14 | jarpiain | ,(let [x {:a 1, :b}] (first x)) |
| 08:14 | clojurebot | 3 |
| 08:16 | jarpiain | ,(let [x (read-string "{:a 1, :b}")] (first x)) |
| 08:16 | clojurebot | [:a 1] |
| 08:18 | octe | AWizzArd, hoeck: yeah, it turned out to be a syntax error in a literal map |
| 08:18 | octe | thanks guys |
| 08:50 | fbru02 | what's the best way to keep listening to incoming messages of an open socket (and query them from time to time) while continuing with your program ? |
| 09:00 | neotyk | execute listening in future |
| 09:00 | neotyk | store received messages in BlockingQueue |
| 09:01 | neotyk | and read it later from different thread |
| 09:01 | neotyk | or go aleph |
| 09:01 | neotyk | :P |
| 09:16 | fbru02 | neotyk: thanks !! |
| 09:26 | neotyk | fbru02: you are welcome :) |
| 09:46 | lpetit | ~seen cemerick |
| 09:46 | clojurebot | cemerick was last seen in #clojure, 3903 minutes ago saying: then you need to use the same encoding to read the file as was used to write it |
| 10:07 | pomyk | quit |
| 11:30 | jacortinas | ,(println "Hello") |
| 11:30 | clojurebot | Hello |
| 11:30 | technomancy | clojurebot needs a will-see function |
| 11:32 | jacortinas | technomancy: eh? |
| 11:33 | technomancy | it could look into the future and let you know when that person will log on. |
| 11:34 | jacortinas | jaja |
| 11:34 | jacortinas | haha* |
| 11:34 | jacortinas | that would be pretty cool |
| 11:35 | alpheus | good morning |
| 13:31 | Raynes | technomancy: I've considered adding that to sexpbot, but I've yet to find a precognition library for Clojure/Java. |
| 14:01 | nickik | Hi all, I have a big textfile and I would like to get out it the information of witch letter comes up howmany times. |
| 14:01 | nickik | does anybody have a good tip or a library that would help me? |
| 14:04 | Raynes | &(frequencies "a b c d d b a c") |
| 14:04 | sexpbot | ⟹ {\a 2, \space 7, \b 2, \c 2, \d 2} |
| 14:05 | Raynes | Not sure how feasible that would be, considering your text file is described as 'big', but just throwing that out there anyway. |
| 14:07 | bobo_ | hm, promise seems to work on gae, but i need it to have a timeout. anyway to solve that without future (that int allowed on gae)? |
| 14:28 | tonyl | is there a way to transform .class files back to .java files? I am kinda new to the java environment |
| 14:30 | Lajla | tonyl, sure, it just won't become very readable java. |
| 14:30 | Lajla | that' the problem of decompilation eh. |
| 14:31 | tonyl | yeah, I bet. it comes with machine generated code |
| 14:31 | tonyl | how is it done? |
| 14:34 | nickik | #Raynes thanks i'll look into it. |
| 14:37 | Lajla | tonyl, decompilation? |
| 14:37 | tonyl | yes |
| 14:38 | Lajla | tonyl, same way as compilation |
| 14:38 | Lajla | technically there is also no difference. |
| 14:38 | Lajla | the point is, compilation is translating a programin one language to the same program in another language. |
| 14:39 | Lajla | Machine language, assembly, .class files, are also programming languages technically. |
| 14:39 | Lajla | But like |
| 14:39 | Lajla | a computer is still a computer |
| 14:39 | Lajla | it has no sense of aesthetics |
| 14:39 | Lajla | so compilation always produces 'ugly' code. |
| 14:39 | Lajla | Which is hard to read. |
| 14:39 | Lajla | Like, when you compile C to assembly |
| 14:39 | Lajla | it produces different assembly than what humans find easy to read. |
| 14:39 | Lajla | Or would make |
| 14:39 | Lajla | and the same applies in the reverse |
| 14:39 | Lajla | but people generally don't read assembly |
| 14:39 | Lajla | so it's not an issue there |
| 14:40 | tonyl | ok |
| 14:40 | tonyl | so the best way is familiarizing myself with jvm bytecode |
| 14:41 | nickik | how should the decompiler know where you used a macro for example |
| 14:41 | nickik | quite impossible |
| 14:41 | Lajla | Not impossible. |
| 14:41 | Lajla | Like |
| 14:41 | Lajla | you can write an AI. |
| 14:41 | Lajla | That tries to replicate code as written by humans. |
| 14:42 | Lajla | You can probably design a self-learning neural net for that. |
| 14:42 | Lajla | but it's advanced stuff. |
| 14:42 | Lajla | tonyl, well, generally people can't read assembly like that. |
| 14:42 | Raynes | Theoretically, time travel is possible. |
| 14:42 | Lajla | IT's too complex. |
| 14:42 | Lajla | For large projects. |
| 14:42 | Lajla | Raynes, no, theoretically it's impossible, depending on the theory. |
| 14:43 | Lajla | People often misunderstand GR as allowing time travel. |
| 14:43 | Lajla | But it's more that GR doesn't explicitly forbid, or is discovered to explicitly forbid local time distortions |
| 14:43 | Lajla | but doesn't explicitly allow them either. |
| 14:43 | tonyl | I just saw the .class file for a hello world o.0 |
| 14:44 | Lajla | But sure, it's quite possible for an AI to try to replicate human code. |
| 14:44 | Lajla | I mean, nowadays that can recognise faces to some degree. |
| 14:44 | Lajla | seems more daunting to me. |
| 14:44 | Lajla | Or translate one natural language (badly) into another. |
| 14:44 | moogatronic | computer vision is easier than having a computer generate human code. |
| 14:45 | Lajla | I'd disagree, I think the latter is actually easier because it is descrete. |
| 14:45 | Lajla | What you basically do is give the AI a lot of human examples. |
| 14:45 | Lajla | And let it learn from that |
| 14:45 | moogatronic | well, the definition of "human" |
| 14:45 | Lajla | Like how google translate works. |
| 14:45 | Lajla | I mean |
| 14:45 | Lajla | computers can already replicate the literary style of famous writers or tyhe musical style of famous composers. |
| 14:45 | Lajla | Shouldn't be hard to let them replicate the coding style of famous programmers. |
| 14:46 | Chousuke | they can't replicate the writing though. :P |
| 14:46 | moogatronic | but is the replication replicating new ideas? |
| 14:46 | Lajla | You can actually go a pretty far way with marhov chains and feed them a corpus. |
| 14:46 | moogatronic | or just emulating style and regurgitating the same ideas ,but re-written |
| 14:46 | Lajla | Let me rephrase |
| 14:46 | Lajla | they write new pieces. |
| 14:46 | Lajla | Which many people will say it's an unmistakable beethoven. |
| 14:46 | moogatronic | examples? |
| 14:46 | clojurebot | examples is http://en.wikibooks.org/wiki/Clojure_Programming/Examples/API_Examples |
| 14:46 | Lajla | You just give hem beethoven's corpus |
| 14:46 | Lajla | and you apply markhov chains to it. |
| 14:47 | Lajla | And they will run for a while to exhaust a pattern in it |
| 14:47 | Lajla | an work on that. |
| 14:47 | Lajla | THis is a lot easier than for instance recognising faces, which is 'continuous', this is descrete, you can input musical notes in a digital format. |
| 14:47 | Lajla | Just as you can with letters and code. |
| 14:47 | Lajla | Like ehh |
| 14:47 | Lajla | http://en.wikipedia.org/wiki/Chomskybot |
| 14:48 | Lajla | this one is pretty cool. |
| 14:48 | Lajla | It has a corpus of chomsky fed to it. |
| 14:48 | Lajla | And it produces grammatically valid but semantically nonsensical paragraphs in the literary style of chomsky. |
| 14:48 | moogatronic | right, but thats not doing what you described as being easy. |
| 14:49 | Lajla | Yes it does |
| 14:49 | Lajla | the bot has no concept of 'grammar' |
| 14:49 | Lajla | It just exhausts a pattern itself. |
| 14:49 | moogatronic | right, you can develop the grammar, but the content is what is "human" |
| 14:49 | Lajla | moogatronic, as I said. |
| 14:49 | Lajla | It can replicate the style of a 'famous programmer' |
| 14:49 | moogatronic | for computer vision, you are doing the same thing. |
| 14:49 | moogatronic | discritize points in a field, and match |
| 14:49 | moogatronic | ok, style. |
| 14:50 | moogatronic | but a famous programmer will also write code that does something, and has a purpose, and thats is sort of baked into the "style" to some degree. |
| 14:50 | Lajla | Style is also about which functions are programatically idiomatic. |
| 14:50 | Lajla | No, like. |
| 14:50 | Lajla | You have a famous programmer, and his code, and the assembly associated with it. |
| 14:50 | Lajla | Like, it goes -> that way. |
| 14:50 | Lajla | An AI should be able to exhaust that pattern and to some degree turn it around |
| 14:50 | Lajla | If given a large enough corpus. |
| 14:51 | Lajla | THis is how google translate works by th eway. |
| 14:51 | Lajla | IT's being fed 'parallel corpora' |
| 14:51 | Lajla | And natural languages are a lot harder of course than machine language. |
| 14:51 | Lajla | You just feed the bot a parallel corpora of assembly and java. |
| 14:51 | moogatronic | agreed |
| 14:51 | Lajla | I'd be interested to see if the current codebase of google translate already suffices for it. |
| 14:52 | Lajla | a parallel corpus* |
| 14:52 | Lajla | blaspheym |
| 14:52 | Lajla | I mean, it won't be completely perfect, but it c ould be a tool that makes .class files easier to read |
| 14:52 | Lajla | of course, comments are probably going to be gone. |
| 14:53 | Lajla | Or made it inserts them as well, if the original corpus is commented. =P |
| 14:53 | Lajla | I mean, the idea is that as the limit of the corpus -> infinity, the translation -> perfect |
| 15:17 | moogatronic | Lajla: I may have been confused by your statements initially, I was just getting at the idea of "Matching" ie, computer vision -> face recognition, is easier than the idea of meaningful generation, "Human code / Human Intent", but it sounds like perhaps you are speaking of translation/matching -> stylistic code generation. |
| 15:18 | moogatronic | (long delay due to shower / prep for massive food eating time) |
| 15:19 | moogatronic | also disclaimer, my AI experience is low, currently only in an introductory university course... doing homework for it right now as well... =) |
| 15:20 | moogatronic | feels like were blazing through the Russell and Norvig book at breakneck speed... it seems like any given chapter could be an entire course. |
| 15:44 | Lajla | moogatronic, well, I guess just to generate code that humans would find easier to read than what decompilation usually gives. |
| 16:05 | lpetit | Hi |
| 16:21 | replaca | howdy, laurent |
| 16:29 | lpetit | replaca: howdy |
| 16:29 | lpetit | hm, what does howdy mean, btw ? :) |
| 16:33 | slyrus_ | short for "how do you do" |
| 16:34 | lpetit | oh! |
| 16:34 | lpetit | then fine ! |
| 16:34 | lpetit | Still very happy to live such exciting times with clojure guys ! |
| 16:34 | replaca | lpetit: it's short for "how do you do" but usually used more like "hi" |
| 16:35 | replaca | lpetit: it seems to have come from the old west |
| 16:35 | replaca | lpetit: I know what you mean. It's great to see everything happen with ccw! |
| 16:35 | lpetit | ok, it does not necessarily imply that the people using it wants a long answer, more the kind of social thing people say at the start of the day, then ;) |
| 16:35 | replaca | exactly |
| 16:36 | lpetit | yeah, in fact I'm still so grateful to anybody having been involved in making me come to the conj a reality. |
| 16:36 | lpetit | But also, it's very interesting to interact with smart people for ccw: cemerick, aav, cgrand, mbrandmeyer, etc, etc |
| 16:37 | replaca | I'm still impressed that you (and cgrand, too) made such a great presentation after the trip you had |
| 16:39 | nickik | man i still feel like a outcast because i missed the conj |
| 16:39 | nickik | don't even know what pods are |
| 16:39 | replaca | nickik: rich didn't talk about pods at Clojure |
| 16:40 | lpetit | He, we dedicated the time stuck at Phillie's airport (when we really should have been playing "Go" with you) refining over and over again our pres :) |
| 16:40 | replaca | though we had a good discussion of it with chouser in a rental car parking lot on Sat night |
| 16:40 | lpetit | lol, indeed, the official site's still suggesting this pods talk :) |
| 16:40 | replaca | That go thing was fun, but I was totally fried that day |
| 16:41 | replaca | I hadn't been quite ready to go and ended up getting 2 1/2 hours sleep before my flight |
| 16:42 | lpetit | a little bit pressure before the talk, that's the "salt" without which you would not feel the "adrenaline" the same way :-D |
| 16:42 | replaca | bait and switch! complain to relevance: "we were sold pods and just got some yammer about hammocks" :) |
| 16:44 | Raynes | I remember meeting replaca in an elevator and not having a clue who he was until I happened to look at his name tag later on. |
| 16:46 | nickik | @replaca see I didn't know that :) |
| 16:50 | replaca | Raynes: hah! |
| 16:50 | replaca | just someone who doesn't sleep enough :) |
| 18:41 | edoloughlin | Anyone know how I rollback a transaction in clj-record? |
| 19:33 | tonyl | hi |
| 19:34 | Raynes | mattrepl: ohai |
| 19:35 | mattrepl | hey Raynes, saw your question about the warning |
| 19:36 | mattrepl | it's coming from the underlying http library, clj-apache-http |
| 19:36 | mattrepl | I'm not sure if there's a way to turn it off other then changing the log level |
| 19:37 | Raynes | Yeah, I started thinking that clojure-twitter probably wasn't the best place to create that issue, but I wasn't totally sure of what the actual problem was or the project that happens to be the culprit in this case. |
| 19:37 | Raynes | It's not that it's a huge problem as much as it's just annoying to not be able to suppress the log noise. |
| 19:37 | mattrepl | yeah, let me post a gist that you can use to modify log level |
| 19:38 | Raynes | Cool. :. |
| 19:38 | Raynes | :>* |
| 19:39 | mattrepl | oh darn, the one I have on hand is for log4j only. you don't by any chance already use it? I can whip up one for java.util.logging too though |
| 19:39 | Raynes | I'd prefer the latter, but I can always throw log4j in the mix if it's a problem. |
| 19:39 | Raynes | Already have a shitton. |
| 19:40 | mattrepl | ok, this was original source for the set-log-level we use in clj-sys projects: http://www.paullegato.com/blog/setting-clojure-log-level/ |
| 19:42 | Raynes | Hrm. log4j might be fairly useful in sexpbot in general. It's probably worth addin git. |
| 19:42 | Raynes | adding it* |
| 19:43 | mattrepl | making gist |
| 19:48 | mattrepl | https://gist.github.com/716124 |
| 19:49 | mattrepl | haven't actually tried that to turn off the warning messages, but I'd hope that'd do it |
| 19:51 | mattrepl | logging out for a bit, but lmk if that silences it |
| 20:11 | Raynes | Yay! No more annoying log messages. |
| 22:42 | Raynes | http://www.dwheeler.com/readable/sweet-expressions.html |