2012-11-10
| 00:05 | XPherior | Who's awake?! |
| 00:06 | twobitsprite | you |
| 00:06 | XPherior | Haw. |
| 00:47 | brainproxy | Sgeo: https://gist.github.com/4050049 |
| 00:48 | brainproxy | I'm working on monad transformers, and discovered by experiment that the algo.monads implementation and the protocol-monads (my fork) implementation are giving different answers |
| 00:49 | brainproxy | for monadic plus in the context of the list/sequence transformer applied to the set monad |
| 00:49 | brainproxy | but which one is "correct"? |
| 00:49 | brainproxy | having a hard time consulting the haskell wiki as the notation is hard for me to follow |
| 00:50 | Sgeo | Is there a difference between the "set" monad concept and the list monad? |
| 00:50 | Sgeo | What happens if you try these examples, converting to the list monad? |
| 00:50 | brainproxy | so, sequence/list transformer over the list-monad? |
| 00:51 | Sgeo | Hold on, I'm not thinking this through |
| 00:51 | brainproxy | okay, thanks for your time, I actually need to step away for a little bit, but I appreciate your input |
| 00:51 | brainproxy | should be back in 25 min or so |
| 00:52 | Sgeo | Are you sure that the inputs you're giving to the function are effectively similar enough for the question to make sense? |
| 00:52 | imeredith | brainproxy: i dont get clojures syntax well, but are you basically trying to do something like ... Set(1 2) + Set(3 4) ? |
| 00:52 | brainproxy | Sgeo: yes, they're the same inputs |
| 00:52 | brainproxy | effectively, i mean |
| 00:52 | brainproxy | well... I have a high degree of confidence they are |
| 00:52 | Sgeo | Because the first one is giving am/m-plus a bunch of sets that themselves contain a list |
| 00:53 | amalloy | imeredith: no, he's doing something pretty obscure; i wouldn't worry about it |
| 00:53 | Sgeo | And the second is giving... not entirely sure about that list-t stuff, but looks like just a bunch of lists? |
| 00:53 | brainproxy | the first one is asking to carry out monadic plus on the set-list monadic values |
| 00:53 | brainproxy | and the same for the second |
| 00:53 | imeredith | amalloy: k, i was going to see what scalaz did, but i cant grok clojure well :) |
| 00:54 | brainproxy | imeredith: thanks for thinking about it :) |
| 00:54 | brainproxy | Sgeo: (set-list 1 2) is effectively the same as #{(1 2} |
| 00:55 | amalloy | as a fun aside, brainproxy and Sgeo, have you tried to provide an instance of Monad for Set in haskell? |
| 00:55 | brainproxy | amalloy: i don't know a lick of haskell, yet |
| 00:56 | Sgeo | istr that one of the problems in attempting to do so is that Sets require a typeclass constraint (forgot if that's the term), and thus >>= for sets would have to be (Ord a, Ord b) => Set a -> (a -> Set b) -> Set b |
| 00:57 | amalloy | Sgeo: right on the nose |
| 00:57 | Sgeo | And you can't write that instance, since >>= is not supposed to have that constraint |
| 00:57 | brainproxy | okay, well let me try with list transformer over list monad |
| 00:57 | brainproxy | and see how results compare in the two librarier |
| 00:57 | Sgeo | But that's irrelevent to Clojure |
| 00:57 | amalloy | although i didn't know Set had that constraint; i thought it was just the union function |
| 00:57 | brainproxy | *libraries |
| 00:57 | Sgeo | amalloy, hmm, hold on' |
| 00:57 | amalloy | well, that's why i said "as a fun aside" |
| 00:58 | Sgeo | amalloy, um, I think it's that >>= would need to use a function that requires Ord... I don't really remember |
| 00:58 | Sgeo | I do recall that using constraints in the data declaration is recommended against, so that they're not needed everywhere. |
| 00:58 | Sgeo | It's been a while |
| 00:59 | Sgeo | So probably not that Set requires it, but some operation that >>= needs would require it |
| 00:59 | imeredith | Sgeo: amalloy, at worst dont sets just require equals? |
| 00:59 | amalloy | Sgeo: yes |
| 00:59 | Sgeo | imeredith, in theory, but an efficient implementation needs some ordering, even if it's arbitrary |
| 00:59 | imeredith | of course |
| 01:01 | brainproxy | Sgeo: https://gist.github.com/4050099 |
| 01:02 | brainproxy | similar result |
| 01:03 | Sgeo | > msum [[[1, 2, 3]], [[]], [[3, 4]]] |
| 01:03 | Sgeo | => [[1,2,3],[],[3,4]] |
| 01:03 | Sgeo | Still not entirely sure of what you're inputting for the second one |
| 01:03 | Sgeo | What's the list-t used for here? |
| 01:04 | brainproxy | list-t is the list transformer |
| 01:04 | imeredith | oh |
| 01:04 | brainproxy | applying it to the list monad |
| 01:04 | Sgeo | This seems like it's likely to be a different operation from just putting a list in a list |
| 01:06 | Sgeo | I'm not certain, because I don't understand monad transformers too well, and especially not in the context of Clojure |
| 01:06 | brainproxy | https://github.com/clojure/algo.monads/blob/master/src/main/clojure/clojure/algo/monads.clj#L610 |
| 01:06 | imeredith | i really wish multibot was going |
| 01:06 | brainproxy | i think I understand the docstring more clearly now |
| 01:09 | brainproxy | Sgeo: thanks, it looks like algo.monads has it right and the protocol-monads have a subtle implementation problem |
| 01:09 | Sgeo | You're... welcome, but I still wish I entirely understood what is going on |
| 01:09 | brainproxy | that is, given that haskell's msum and algo.monads m-plus are doing the same thing |
| 01:09 | Sgeo | Are you certain that trying something closer to the equivalent in protocol monads won't give you the same result? |
| 01:10 | brainproxy | well I'm not sure I do either, I'm learning what it all means by banging around with the two libraries, and grok'ing what I can from haskell-related discussions |
| 01:11 | brainproxy | but the idea is that the list monad has been composed with the list monad, and there are rules for how to to deal with that when you want to do monadic operations on the compound monad |
| 01:11 | Sgeo | @(m/m-plus [(list (list 1 2 3)) (list (list)) (list (list 3 4))]) |
| 01:11 | muhoo | i don't think i've ever seen a monad in clojure code in the wild. |
| 01:11 | Sgeo | brainproxy, maybe compare it with ... oh, I see, you are |
| 01:11 | Sgeo | Oh, I don't know if the Haskell code I pasted actually corresponds properly |
| 01:13 | brainproxy | okay |
| 01:13 | imeredith | brainproxy: so basically whats going on is that the list transformer gives you access to the inner stuff, hense you are combining your inner lists into on |
| 01:13 | imeredith | e |
| 01:13 | imeredith | then it unwraps it into the outer bit which is a list |
| 01:14 | brainproxy | imeredith: close |
| 01:14 | brainproxy | but that's the basic idea |
| 01:14 | imeredith | brainproxy: try using an option instead of a list, and i think it should become clearer |
| 01:15 | brainproxy | option? |
| 01:15 | imeredith | err |
| 01:15 | imeredith | maybe |
| 01:15 | imeredith | oh |
| 01:15 | brainproxy | like maybe monad? |
| 01:15 | imeredith | brainproxy: sorry, i see the subtle difference |
| 01:15 | imeredith | brainproxy: yeah, im just saying, i think you are being confused by it being a list-t of lists |
| 01:16 | brainproxy | dang... I wish I knew how to express this in haskell, need to learn some more stuff |
| 01:16 | imeredith | sorry i cant express stuff in clojure |
| 01:16 | brainproxy | it's okay |
| 01:17 | brainproxy | my problem is I've been learning monads by studying source of algo.monads and protocol-monads and reading related tutorials |
| 01:17 | imeredith | in scala i would go ListT(Some(List(1,2,3))) which would have the type ListT[Option, Int] |
| 01:17 | imeredith | Option = Maybe in this case |
| 01:17 | brainproxy | gotcha |
| 01:18 | shachaf | Is someone expressing something in Haskell? |
| 01:18 | imeredith | brainproxy: im biased, but i do think that static typing will help you learn this stuff heh |
| 01:18 | imeredith | not that im an expert :( |
| 01:18 | brainproxy | imeredith: right, that's actually one of the nice things about jim duey's protocol monads |
| 01:18 | brainproxy | is they give you a way to reason about the types |
| 01:19 | Grozhnabev | shachaf, you hold no power over me here, you evil man. |
| 01:19 | brainproxy | whereas algo.monads is purely interface driven |
| 01:19 | Grozhnabev | Freedom shall carry on. |
| 01:21 | imeredith | brainproxy: how do they give you a way to reason over types? |
| 01:22 | brainproxy | because the bind and result are implemented as protocol methods |
| 01:22 | brainproxy | as well zero and plus |
| 01:22 | imeredith | brainproxy: honestly the types thing is one of the main reasons i havent gotten into clojure more, i started down the monad track at the same time i was looking into clojure, and now i cant even imagine doing it without static typing |
| 01:22 | shachaf | Please stop changing your nick, Grozhnabev. |
| 01:22 | shachaf | It's just annoying. :-( |
| 01:22 | brainproxy | imeredith: see https://github.com/michaelsbradleyjr/protocol-monads/blob/examples/src/monads/core.clj |
| 01:23 | Grozhnabev | shachaf, "freedom annoys those who seek to oppress others" - Virgil, 0231 CE |
| 01:23 | brainproxy | that's my fork of duey's library, and I've been paying a lot of attention to type-related issues |
| 01:23 | brainproxy | there's even a "return type checker" |
| 01:23 | brainproxy | which is purely optional |
| 01:24 | brainproxy | meant to help the developer reason more carefully about the steps in his monadic computations |
| 01:24 | imeredith | brainproxy: so when does the type stuff kick in? when you load the code? |
| 01:24 | brainproxy | no, if you bind *throw-on-mismatch* to true |
| 01:25 | brainproxy | then if you have a mismatch between a bound monadic value and the return of a monadic function |
| 01:25 | brainproxy | you get an exception |
| 01:25 | imeredith | at runtime? |
| 01:25 | brainproxy | yeah |
| 01:25 | imeredith | i guess you then rely on tests to pick up any problems? |
| 01:25 | Sgeo | imeredith, one of the notable things in Haskell that you can't do in Clojure due to the differnt type systems is polymorphism on the return type |
| 01:26 | brainproxy | imeredith: well, the checker is meant itself as a way to identity subtle errors during development |
| 01:26 | Sgeo | That is, can't really do a return :: (Monad m) => a -> m a |
| 01:26 | imeredith | brainproxy: right |
| 01:26 | imeredith | Sgeo: in clojure you cant? |
| 01:26 | imeredith | oh |
| 01:26 | Sgeo | core.algo.monads works around it by sort of supplying the information in a dynamically-scoped way |
| 01:26 | imeredith | i see |
| 01:26 | Sgeo | I think protocol-monads does it by not actually supplying a return function, but not entirely sure |
| 01:27 | brainproxy | Sgeo: what do you mean? |
| 01:27 | imeredith | how do you get by without return? |
| 01:27 | Sgeo | brainproxy, let's try a simpler example than return. Haskell has a value called maxBound |
| 01:27 | Sgeo | If used where an Int is expected, maxBound is the maximum Int value |
| 01:28 | imeredith | do-result isnt return? |
| 01:28 | Sgeo | If used where a Char is expected, maxBound is the maximum Char |
| 01:28 | Sgeo | etc. etc. |
| 01:28 | Sgeo | imeredith, erm, it probably is, but ... hold on |
| 01:28 | imeredith | I take it MonadZero is Monoid too |
| 01:29 | Sgeo | Note that do-result takes an argument that it ignores |
| 01:29 | brainproxy | note on the thing I just linked to on github, the transformer sections are still being adjusted w.r.t. to the type checker stuff I implemented |
| 01:29 | brainproxy | and so there are / are probably things wrong with them |
| 01:29 | brainproxy | but up to that section, everything is pretty solid |
| 01:30 | Sgeo | That argument is not needed in Haskell, because the type system effectively supplies that information |
| 01:30 | imeredith | brainproxy: no reader monad? :( |
| 01:30 | brainproxy | imeredith: not yet |
| 01:31 | imeredith | Kleisli/ReaderT is my favourite monad trnasformer atm - probably because its the only one i really understand |
| 01:31 | imeredith | :) |
| 01:32 | Sgeo | Protocol monads keeps calling "monads" what I would term "monadic values" :( |
| 01:32 | Sgeo | Although in protocol monads, you can get the information about the monad from a monadic value |
| 01:32 | brainproxy | right |
| 01:32 | Sgeo | So, I guess it sort of makes sense |
| 01:33 | brainproxy | so when you do (m/bind [1 2 3] (fn [x] ...)) |
| 01:33 | brainproxy | the monad is the vector monad |
| 01:33 | brainproxy | since the monadic value is a vector |
| 01:35 | brainproxy | i've worked to flesh out the test suite a good bit |
| 01:36 | brainproxy | which helped me to think about what everything actually does ... just that I've hit a wall w/ transformers since I don't have the knowledge to begin with know whether the lib is implementing them correctly |
| 02:13 | brainproxy | Sgeo: just realized I could simplify bind and plus for the ListTransformer, revealing an "inner plus" at work |
| 02:13 | brainproxy | https://github.com/michaelsbradleyjr/protocol-monads/blob/examples/src/monads/core.clj#L728 |
| 02:52 | muhoo | i suspect, as a complete gut hunch, that monads are only necessary to get around limitations created by haskell, i.e. its strict type checking. the same way that things like design patterns are necessary to get around limitations in oop. |
| 02:56 | amalloy | muhoo: nobody would bother porting them to clojure if that were true |
| 03:01 | amalloy | monads capture a common pattern that is useful in a lot of contexts. for example, clojure's for macro is a special-cased version of the list monad |
| 03:02 | shachaf | That's silly. "Monad" is just the name of a generic API that a lot of different types in Haskell expose. |
| 03:02 | amalloy | shachaf: sorry, which is silly? |
| 03:02 | shachaf | You can perfectly well write Haskell code without ever using this API, but it's a nice abstraction to recognize. |
| 03:02 | shachaf | "necessary to get around limitations created by haskell" |
| 03:03 | Sgeo | bound-fn bothers me a little. What if I have a macro that expands into an fn form, but where I'm using the macro I'd rather it expand into bound-fn |
| 03:03 | amalloy | well, he's presumably thinking of IO, which is in some ways what he's claiming |
| 03:03 | Sgeo | Am I just out of luck? |
| 03:04 | shachaf | amalloy: The way IO is done in Haskell has nothing to do with type checking. |
| 03:04 | tomoj | Sgeo: bound-fn* ? |
| 03:04 | shachaf | It has everything to do with purity, and if you had a dynamically typed pure language, you could do the exact same thing. |
| 03:04 | tomoj | not sure what you mean |
| 03:05 | Sgeo | tomoj, suppose I am using future |
| 03:05 | Sgeo | But I want the code inside my future block to see some dynamic variable |
| 03:05 | Sgeo | How do I make it use bound-fn or bound-fn* instead? |
| 03:06 | amalloy | shachaf: yes. i don't think it's unreasonable for him to think those are the same thing, right? the haskell type system prevents you from performing IO except in functions which deal in IO. type safety and purity seem pretty related to me |
| 03:06 | tomoj | futures already have binding conveyance |
| 03:06 | shachaf | amalloy: That has nothing to do with the type system. |
| 03:06 | shachaf | It could work precisely the same way in a dynamically-typed language. |
| 03:06 | shachaf | IO String isn't a "tagged" String which the type system keeps apart from String; it's a completely different kind of value. |
| 03:07 | tomoj | I guess you might mean (future-call (bound-fn* f)) ? but that could only make sense if you called bound-fn* in some other dynamic scope |
| 03:07 | tomoj | I think? |
| 03:07 | shachaf | 00:05 <lambdabot> shachaf says: getLine :: IO String contains a String in the same way that /bin/ls contains a list of files |
| 03:10 | Sgeo | (println "Hello") could return a 0 argument function, which I then call to actually print "Hello" |
| 03:11 | Sgeo | ((println "Hello")).. except I don't do that, rather, I build up a huge 0-argument function out of several pieces, and tell the compiler where it is |
| 03:43 | raek | Sgeo: I think 'future' itself already acts as a 'bound-fn' |
| 03:44 | bbloom | ,(source bound-fn) |
| 03:44 | clojurebot | Source not found |
| 03:44 | Sgeo | So, in my own code, if I want to output an fn based off code passed into the macro, I should likely use bound-fn? |
| 03:44 | Sgeo | Blah |
| 03:45 | bbloom | works locally |
| 03:45 | bbloom | ,(doc bound-fn) |
| 03:45 | clojurebot | "([& fntail]); Returns a function defined by the given fntail, which will install the same bindings in effect as in the thread at the time bound-fn was called. This may be used to define a helper function which runs on a different thread, but needs the same bindings in place." |
| 03:45 | bbloom | ,(doc bound-fn*) |
| 03:45 | clojurebot | "([f]); Returns a function, which will install the same bindings in effect as in the thread at the time bound-fn* was called and then call f with any given arguments. This may be used to define a helper function which runs on a different thread, but needs the same bindings in place." |
| 03:45 | raek | if you want the current value of some dynamics vars, perhaps you could just let them |
| 03:45 | bbloom | ,(doc with-bindings) |
| 03:45 | clojurebot | "([binding-map & body]); Takes a map of Var/value pairs. Installs for the given Vars the associated values as thread-local bindings. The executes body. Pops the installed bindings after body was evaluated. Returns the value of body." |
| 03:46 | tomoj | I don't think you can do that |
| 03:46 | brainproxy | Sgeo: okay, figured it out |
| 03:46 | brainproxy | https://gist.github.com/4050099 |
| 03:46 | tomoj | the macro returns code, how are you going to get the bindings in there? |
| 03:47 | brainproxy | with a flag, the algo.monads version will implement the same op as protocol-monads |
| 03:47 | tomoj | oh |
| 03:47 | tomoj | I think I misunderstood you |
| 03:47 | raek | (defmacro foo [] `(let [x# (quote ~*x*), y# (quote ~*y*)] (defn ... x# ... y# ...))) |
| 03:48 | raek | I find dynamic vars hard to use |
| 03:53 | bbloom | raek: let is lexical, you want binding |
| 03:53 | bbloom | ,(doc binding) |
| 03:53 | clojurebot | "([bindings & body]); binding => var-symbol init-expr Creates new bindings for the (already-existing) vars, with the supplied initial values, executes the exprs in an implicit do, then re-establishes the bindings that existed before. The new bindings are made in parallel (unlike let); all init-exprs are evaluated before the vars are bound to their new values." |
| 05:23 | nicl | how do I check the case of a character in a string? |
| 05:24 | nicl | basically, I would like to filter a string by case |
| 05:34 | ajmccluskey | nicl: I'm really new to clojure, so there's probably better ways, but my first thoughts would be something like (defn is-upper-case? [c] (= (clojure.string/upper-case c) c)) |
| 05:34 | nicl | ajmccluskey: ah yes, don't know why I didn't think of that?! |
| 05:35 | nicl | ajmccluskey: thanks |
| 05:35 | ajmccluskey | nicl: no worries. Just glad I could help someone else for a change :) |
| 05:42 | Raynes | er |
| 05:42 | Raynes | &(Character/isUpperCase \x) |
| 05:42 | lazybot | ⇒ false |
| 05:42 | Raynes | &(Character/isUpperCase \X) |
| 05:42 | lazybot | ⇒ true |
| 05:42 | Raynes | nicl: ^ |
| 05:43 | ajmccluskey | nicl: I think Raynes has a far better answer |
| 05:44 | Raynes | Your answer was clever. |
| 05:45 | Raynes | Don't feel bad because you haven't memorized the java standard library. :) |
| 05:46 | nicl | Ragnes: thanks! |
| 05:46 | nicl | Raynes: ah sorry, got your name wrong. |
| 05:46 | nicl | Raynes: thanks. Was thinking there would be something like that |
| 05:47 | ajmccluskey | Haha, thanks. Using already working code is cleverer though :p. |
| 05:50 | nicl | ajmccluskey: I agree with Raynes though - you're solution was solid common sense |
| 05:50 | nicl | which is to be applauded! |
| 06:09 | daniel__ | is there an easy way of debugging what takes a long time to load when including a namespace i.e. (use 'backend.core) (REPL) |
| 06:24 | ivan | daniel__: reloading via tools.namespace or by using eval-defun repeatedly in Emacs with nrepl |
| 06:24 | ivan | the general idea is to keep your JVM running |
| 06:30 | daniel__ | thanks ivan |
| 06:31 | daniel__ | im also having a problem serializing a protobuf-dump (byte array) to a string if anyone can help there? |
| 06:31 | daniel__ | it works in some cases and not in others, i need a reliable way of going from protobuf-dump -> string |
| 07:11 | ithildin | Hey, not sure who's around this early. I'm new to clojure (and linux, double whammy) and I'm wondering what my options are for writing something with a GUI |
| 07:11 | ithildin | Is there much there outside of Swing? |
| 07:12 | ithildin | In case it wasn't too clear, that's GUI options for clojure in linux |
| 07:19 | ChongLi | ithildin: you could write your GUI in opengl |
| 07:20 | ChongLi | that's a big undertaking though |
| 07:20 | ithildin | yeah, that seems like overkill to get some buttons and text on the screen |
| 07:21 | ChongLi | seesaw |
| 07:21 | ChongLi | it's a DSL built on swing |
| 07:21 | ChongLi | https://github.com/daveray/seesaw |
| 07:21 | ithildin | I have seen seesaw when I've searched. |
| 07:22 | ithildin | so it would be nicer than normal Swing. but I've not had good experiences with swing |
| 07:22 | ithildin | granted, that was years and years ago |
| 07:22 | ithildin | maybe things have gotten better? |
| 07:22 | ChongLi | probably |
| 07:22 | ChongLi | the number of users of swing is pretty staggering |
| 07:23 | ithildin | Yeah, that's the advantage. Coming from web development or iOS development (or Delphi or VisualWhatever) it seemed really annoying though |
| 07:24 | scottj | ithildin: there's GUIFTW that supports SWT (eclipse) |
| 07:24 | ChongLi | the other advantage is the fact that clojure is a lisp |
| 07:24 | ChongLi | allowing library writers a lot of liberty in building nice DSLs with macros |
| 07:24 | ithildin | hmm I'll have to check that out as well scottj |
| 07:25 | scottj | ithildin: https://github.com/santamon/GUIFTW it hasn't been updated in a year so unless you really don't want swing I'd go with seesaw which is very actively developed |
| 07:25 | ithildin | ah, ok |
| 07:26 | ithildin | yeah, not a good sign when the readme says "It's in alpha stage" and then it hasn't been updated for a year |
| 07:27 | ChongLi | yeah it's always a shame when things are seemingly abandoned |
| 07:28 | ithildin | ha, apparently I don't know the keyboard shortcuts in xchat |
| 07:29 | daniel__ | How do i serialize a protobuf-dump when i have it as a byte array? |
| 07:29 | daniel__ | I'm sending it as a string with ZeroMQ |
| 07:34 | raek | another thing that happens a lot is that the readme says "It's in alpha stage" but the project is actively used by hundreds persons and is actively maintained |
| 07:35 | raek | people should bump up their versions from 0.x.0 to 1.0.0 more often |
| 07:39 | rodnaph_ | raek: +1 if it's not some big commercial offering then "usable" should be 1.0 |
| 07:40 | rodnaph_ | (though i am guilty of not doing this too) |
| 07:46 | daniel__ | i have a print inside a function that isnt printing to the repl |
| 07:46 | daniel__ | maybe its because its in a try block, maybe because its within a while loop? |
| 07:47 | raek | daniel__: is it in another thread? |
| 07:48 | raek | try and while shouldn't affect it |
| 07:49 | rodnaph_ | is it part of some lazy evaluation that hasn't been realised? |
| 07:49 | daniel__ | i dont think so https://gist.github.com/4050976 |
| 07:50 | daniel__ | line 7 |
| 07:55 | daniel__ | any ideas? |
| 07:58 | daniel__ | just noticed my try block isnt properly formed |
| 07:59 | andrewmcveigh | daniel__: the "future" is spinning up another thread. |
| 07:59 | andrewmcveigh | ah, sorry... your println is not involved. |
| 07:59 | daniel__ | yeah its outside the future |
| 08:00 | daniel__ | the second deref should be cached as well shouldnt it? |
| 08:01 | daniel__ | added a modification, this is how my try should be isnt it? https://gist.github.com/4050976 |
| 08:02 | andrewmcveigh | daniel__: no, you had the try block right the first time. |
| 08:02 | daniel__ | should it be (try expr (finally ..) |
| 08:02 | clojurebot | Cool story bro. |
| 08:03 | andrewmcveigh | yeah |
| 08:03 | daniel__ | shouldnt it* |
| 08:03 | raek | daniel__: println-str prints to a string and returns it. but it is not passed out from the while form |
| 08:03 | raek | daniel__: try changing it to 'println' |
| 08:03 | daniel__ | raek, i tried with print as well |
| 08:03 | daniel__ | ok |
| 08:04 | daniel__ | andrewmcveigh: in the first example, dont i have (try expr1 expr2 (finally .. ? |
| 08:04 | raek | or if it clojure data structures, use 'prn' |
| 08:04 | raek | ,(doc while) |
| 08:04 | clojurebot | "([test & body]); Repeatedly executes body while test expression is true. Presumes some side-effect will cause test to become false/nil. Returns nil" |
| 08:04 | daniel__ | im hoping its a string, but thats why i want to print it |
| 08:04 | raek | println-str does not print |
| 08:05 | andrewmcveigh | daniel__: yes, that's fine. |
| 08:05 | raek | it behaves as 'format', but adds a newline |
| 08:05 | daniel__ | no but i mean, im not sure if its a clojure data structure or not, i want to verify what it is |
| 08:05 | raek | daniel__: what happens if you use 'prn' instead of 'print-str'? |
| 08:05 | daniel__ | let me just test it |
| 08:06 | raek | also, do you call (server ..) directly in the repl? |
| 08:06 | daniel__ | ok :) with println it works :D |
| 08:06 | raek | daniel__: do you understand the difference? |
| 08:06 | daniel__ | im sure i tried with (print before , shouldnt they be the same except for a (newline) |
| 08:06 | raek | yes |
| 08:06 | daniel__ | raek, yeah i call it directly |
| 08:07 | daniel__ | the difference between prn and print i dont know |
| 08:07 | daniel__ | i will investigate |
| 08:07 | raek | between println and println-str |
| 08:07 | daniel__ | oh, println-str prints to a string and then returns that string |
| 08:07 | daniel__ | and the while wasnt returning anything |
| 08:07 | raek | ,(pr '[foo "foo bar"]) |
| 08:07 | clojurebot | [foo "foo bar"] |
| 08:07 | raek | ,(print '[foo "foo bar"]) |
| 08:07 | clojurebot | [foo foo bar] |
| 08:08 | daniel__ | print prints to *out* |
| 08:08 | raek | daniel__: exatctly |
| 08:08 | daniel__ | im just puzzled why it didnt seem to work when i tried it with print before |
| 08:09 | raek | pr/prn/pr-str turns clojure data into strings so that they can be read again |
| 08:09 | raek | print/println/str turns stuff into strings in random ways |
| 08:09 | daniel__ | i see |
| 08:11 | wingy | how can i check the path of the current file? |
| 08:11 | daniel__ | *file* wingy |
| 08:12 | daniel__ | includes the filename |
| 08:12 | wingy | daniel__: hmm Light Table returns nil |
| 08:12 | daniel__ | its nil in the repl |
| 08:12 | daniel__ | not sure how light table works |
| 08:13 | wingy | nil in the repl as well? |
| 08:14 | wingy | damn i have a file opened but i dont know where its located |
| 08:14 | raek | wingy: a repl is not really in a file. (it is in a namespace though) |
| 08:14 | raek | oh, maybe this was a light table specific thing |
| 08:14 | wingy | raek: yes |
| 08:21 | wingy | used grep to find it instead |
| 08:32 | darq | Hi. How can someone help me how to negate (membero 2 [1 2 3]) in core.logic? Instead of the goal to succed i want it to fail |
| 08:36 | daniel__ | Does anyone have any advice for handing ctrl+c in the repl? I have a function running in a (while true .. which i sometimes want to break out of with ctrl+c .. the problem is, the next time i launch the function the repl crashes |
| 08:36 | daniel__ | i need to make sure i execute the finally block on ctrl+c |
| 09:03 | Neurus__ | Hi, I'm starting with Clojure. |
| 09:04 | Neurus__ | whats the sharp (#) sign? (map #(+ 10 %) [ 1 3 5 7 ]) |
| 09:04 | Neurus__ | |
| 09:05 | andrewmcveigh | Neurus__: #(+ 10 %) is shorthand for (fn [a] (+ 10 a)) |
| 09:06 | Bronsa | ,'#(+ 10 %) |
| 09:06 | clojurebot | (fn* [p1__27#] (+ 10 p1__27#)) |
| 09:06 | Neurus__ | tks andrewmcveigh , Tried googling but didn't find it :( |
| 09:08 | andrewmcveigh | Neurus__: np. It's not easy googling for # |
| 09:18 | Neurus__ | really enjoing 4clojure.com |
| 09:22 | andrewmcveigh | Neurus__: yeah, it's a cool site. |
| 09:58 | ambrosebs | brainproxy: you might be interested in my work in statically typing algo.monads https://github.com/frenchy64/typed-clojure/blob/master/test/typed/test/monads.clj#L278 |
| 09:58 | ambrosebs | brainproxy: I saw your protocol monads fork with type related debugging |
| 11:22 | ebaxt | Is it possible to add login hooks when using friend? |
| 11:36 | hcumberdale | cemerick ..? |
| 11:37 | hcumberdale | I'm trying to get started with friend |
| 11:37 | hcumberdale | I like to use compojure |
| 11:38 | hcumberdale | But I do not understand how the samples on https://github.com/cemerick/friend are connected to each other? |
| 11:39 | cemerick | hcumberdale: compojure |
| 11:39 | cemerick | gah |
| 11:39 | hcumberdale | Hi cemerick |
| 11:39 | cemerick | hcumberdale: compojure is mostly just some routing and helpers around ring handlers, so the ring-only examples are equally applicable to handlers produced by compojure fns and macros |
| 11:40 | hcumberdale | And how does the "(friend/authenticate {:credential-fn " stuff work? |
| 11:40 | cemerick | hcumberdale: perhaps looking at the mock app used in friends tests would be helpful: https://github.com/cemerick/friend/blob/master/test/test_friend/mock_app.clj |
| 11:40 | hcumberdale | Do I need friend/authenticate when I use friend/wrap-authorize ? |
| 11:40 | cemerick | well, the map provided to friend/authenticate is configuration for the friend middleware |
| 11:41 | cemerick | Yes |
| 11:41 | hcumberdale | Ahh, that's a bit disconnected to the compojure sample |
| 11:41 | cemerick | well, it's not a compojure sample per se, just a sample focused on authorization that happens to use compojure routes |
| 11:42 | hcumberdale | Ahh! ;) |
| 11:42 | hcumberdale | cemerick I'm currently using sandbar |
| 11:42 | hcumberdale | I forked it to fix the issue that it can not work with numbers as password |
| 11:43 | hcumberdale | compojure/context & friend/wrap-authorize should be similar to a regex like "/user*" :user right? |
| 11:45 | cemerick | wrap-authorize (and everything else in friend) is entirely ignorant of whatever you're using for routing |
| 11:45 | hcumberdale | Does friend store the session in the default ring session store? So is it possible to stay with "(wrap-stateful-session {:store (session-store :sessions)})" ? |
| 11:46 | cemerick | Yes, friend presumes the use of ring sessions. |
| 11:49 | hcumberdale | So "friend/authenticate" does not mean that there is actually authentication? |
| 11:50 | hcumberdale | It just means, it is there if authorize is used? |
| 11:50 | hcumberdale | authorize or authenticated ...? |
| 11:51 | ebaxt | cemerick: Is it possible to add login hooks when using friend? |
| 11:52 | cemerick | hcumberdale: I'm not clear on your question... |
| 11:52 | cemerick | ebaxt: login hooks? |
| 11:54 | hcumberdale | friend/authenticate does nothing if there is neither authorize or authenticated used? |
| 11:56 | cemerick | it establishes the scope within the app within which (a) a user may become authenticated, and (b) an authorization error will be automagically (i.e. by redirection to a login page, etc) |
| 11:57 | ebaxt | cemerick: a function called after login before redirecting. Or do I have to write a custom workflow? |
| 11:57 | hcumberdale | So friend/authenticate is like a "wrap-authentication-context" |
| 11:57 | cemerick | ebaxt: or add the hook to your credential fn |
| 11:57 | cemerick | bbl |
| 12:01 | hcumberdale | Is there a html-form example for interactive-form ? |
| 12:20 | hcumberdale | clojure.lang.ArityException: Wrong number of args (2) passed to: friend$authenticate$fn |
| 12:20 | hcumberdale | mhhh |
| 12:42 | SrPx | Can you give help about clojurescript? |
| 12:42 | SrPx | I am getting 'cannot set property error of undefined' when trying to run the compiled js of a simple hello world. |
| 12:54 | SrPx | ); |
| 13:04 | wink | hey, any clues how to get (let [x '(+ 2 3)] (+ 1 x)) work? (I know, taking off ' just works, but I happen to have a function call that I want to completely use as an argument, then call it) |
| 13:06 | malcolmsparks | (let [x '(+ 2 3)] (+ 1 (eval x))) ?? |
| 13:06 | lazybot | malcolmsparks: Uh, no. Why would you even ask? |
| 13:07 | dspp | ,(let [x '(+ 2 3)] (+ 1 ~x)) |
| 13:07 | clojurebot | #<IllegalStateException java.lang.IllegalStateException: Attempting to call unbound fn: #'clojure.core/unquote> |
| 13:08 | dspp | ,(let [x '(+ 2 3)] (+ 1 (eval x))) |
| 13:08 | clojurebot | #<Exception java.lang.Exception: SANBOX DENIED> |
| 13:09 | _tca | what's the reason you want to use it as an argument also wink |
| 13:10 | _tca | does it need to be a list? |
| 13:12 | wink | _tca: well maybe it can be done more elegantly, but I basically have some wrapper function and I'm passing a block of (clojure.java.jdbc/update-or-insert-values) into it, so at the moment there's no db connection yet |
| 13:19 | malcolmsparks | wink, could you may be wrap your function in a delay, and then deref it once you have the db connection? |
| 13:21 | malcolmsparks | or just wrap it in a function? |
| 13:22 | wink | malcolmsparks: thanks, I didn't know about delay, works perfectly |
| 13:23 | Sgeo_ | Is there a delay* ? |
| 13:23 | hcumberdale | friend :unauthorized-handler does not work ! ;( |
| 13:24 | malcolmsparks | I think that's an overblown solution, I'm regretting mentioning it because it should be possible to simply wrap in a function |
| 13:24 | malcolmsparks | eg. |
| 13:25 | hcumberdale | https://www.refheap.com/paste/6524 |
| 13:25 | malcolmsparks | (let [x (fn [] (+ 2 3))] (+ 1 (x))) |
| 13:25 | malcolmsparks | ie. so that evaluation is delayed until the db connection is in scope |
| 13:25 | hcumberdale | https://www.refheap.com/paste/6525 |
| 13:26 | malcolmsparks | delays have extra semantics (memoization) that you don't need |
| 13:27 | malcolmsparks | but delays are useful to know about - I use them for somewhat expensive operations (eg. looking up a static value in a database that won't change) |
| 13:27 | malcolmsparks | where I don't want to pay for the database query until the value is actually needed |
| 13:27 | malcolmsparks | and when I know it won't change so don't want to visit the database each time the value is required |
| 13:28 | wink | hm, yeah |
| 13:28 | wink | malcolmsparks: thanks, used fn now :) |
| 13:29 | malcolmsparks | is this the right channel to ask core.logic questions? or is there a dedicated irc channel for that |
| 13:29 | wink | I still don't really get why in one direction it's like this: (1 2 3) => cannot execute function named "1", but on the other hand I can't call something like '(1 2 3) |
| 13:30 | malcolmsparks | '(1 2 3) is a list (data) because you're quoting it |
| 13:30 | malcolmsparks | (1 2 3) is the function '1' with two arguments (2 and 3) |
| 13:31 | malcolmsparks | since '1' isn't a function, you get an error |
| 13:31 | wink | yes |
| 13:31 | malcolmsparks | as soon as you present the special form (a ...) to clojure it gets excited and tries to apply it immediately |
| 13:32 | malcolmsparks | btw. 'apply' means run the function named in the first item of the list with the arguments in the rest of the list |
| 13:33 | wink | wait, that works? |
| 13:36 | wink | malcolmsparks: I'm not sure how that would work besides: (def x ["str" "a" "b"]) (apply (eval(read-string (first x))) x) |
| 13:41 | malcolmsparks | wink, I'm not sure what you're asking |
| 13:41 | malcolmsparks | can you rephrase? |
| 13:42 | wink | malcolmsparks: I'm not asking this time, I'm questioning " 'apply' means run the function named in the first item of the list with the arguments in the rest of the list" |
| 13:44 | SrPx | Anyone has an idea why clojurescript is not working here ? http://stackoverflow.com/questions/13324490/getting-cannot-set-property-error-of-undefined-when-trying-to-run-the-js-outp#comment18177550_13324490 |
| 13:45 | malcolmsparks | Here's a list: (1 2 3) - but if it isn't quoted Lisp sees this as a 'special form' and evaluates it, that's all I meant. The rule for evaluation is to consider the first item of the list (a) to be the function, and it is given b and c as arguments. |
| 13:45 | malcolmsparks | (a b c) |
| 13:46 | wink | yes of course, but core/apply takes 2 arguments. not one, even if it's a list. or am I mistaken? |
| 13:50 | malcolmsparks | ah, I see the confusion, I didn't mean core/apply when I used the word 'apply' |
| 13:50 | tomoj | SrPx: maybe try putting [org.clojure/clojurescript "0.0-1535"] in your dependencies |
| 13:50 | malcolmsparks | clojure.core/apply takes 2 args yes, the first is the function, the second is the list of args |
| 13:50 | tomoj | SrPx: and run lein cljsbuild clean I guess.. |
| 13:51 | tomoj | kinda strange to me that cljsbuild magically includes a cljs dependency |
| 13:52 | SrPx | tomoj: :dependencies [[org.clojure/clojurescript "0.0-1535"]] , with the double [[]] right |
| 13:52 | tomoj | yeah |
| 13:53 | SrPx | tomoj: thanks but nothing. ): |
| 13:53 | tomoj | I know some nodejs problems were fixed recently, can't remember if your error was one of them |
| 13:53 | SrPx | Just downloaded it today ;/ |
| 13:54 | SrPx | Wait actually, I'm not sure. Can I redownload the :plugins [[lein-cljsbuild "0.2.9"]] ? |
| 13:54 | tomoj | no need |
| 13:55 | SrPx | Hmm. Perhaps it's node.js's fault? |
| 13:57 | SrPx | Wow it workeeeed. |
| 13:57 | SrPx | Can't believe (: just ran "lein deps" |
| 13:58 | SrPx | Oh and lein cljsbuild clean as you said |
| 13:58 | SrPx | probably was that |
| 13:58 | tomoj | huh.. |
| 13:58 | tomoj | I tried it and got a similar but different error |
| 13:58 | SrPx | What? |
| 13:58 | clojurebot | What is @ |
| 13:58 | SrPx | Which* |
| 13:59 | tomoj | uncommenting `:optimizations :simple` made it almost work |
| 13:59 | tomoj | which is odd - I thought the cljs compiler defaulted to :simple for node |
| 14:00 | tomoj | but then I also needed https://www.refheap.com/paste/2cdbc41ebdb9771ae45bfaad7 |
| 14:01 | tomoj | to avoid a different error |
| 14:01 | SrPx | 'almost work'? |
| 14:02 | tomoj | well 'almost work' in that unless I set! *main-cli-fn*, I still get an error |
| 14:02 | tomoj | which is expected |
| 14:03 | tomoj | strange though, even if cljsbuild told the compiler to use :whitespace, I'd thought it would still use :simple |
| 14:04 | SrPx | hmm |
| 14:04 | SrPx | (: |
| 14:05 | tomoj | I'm surprised (js/console.log "hello") works - I always do (.log js/console "hello") |
| 14:11 | amalloy | Sgeo: delay*? wouldn't that just be fn? |
| 14:13 | amalloy | or maybe identity, since i assume delay* would be passed a function rather than an expression body |
| 14:14 | tomoj | memoize? |
| 14:15 | amalloy | maybe |
| 14:16 | mudge | just curious what people's favorite clojure books are |
| 14:16 | tomoj | I guess memoize might still execute the function more than once? |
| 14:17 | tomoj | &(let [f (memoize (fn [] (do (println "called!") 42)))] (future (f)) (future (f))) |
| 14:17 | lazybot | java.lang.SecurityException: You tripped the alarm! future-call is bad! |
| 14:19 | tomoj | delay's mechanism for ensuring the fn is only called once seems magic |
| 14:20 | tomoj | oh, guess not. deref is synchronized |
| 14:22 | SrPx | Why it wouldn't work? |
| 14:23 | SrPx | I don't understand clojruescript's approach. 20k lines? Why not just compile to readable javascript? Is it impossible? Or because this way it is optimized? |
| 14:33 | amalloy | tomoj: yeah, memoize can call twice. it's a fun little exercise to write a version that never does (but it comes out to be substantially slower than memoize, so presumably the tradeoff was made on purpose) |
| 14:36 | hcumberdale | SrPx what are you doing with clojurescript? |
| 14:36 | hcumberdale | Have not tried it,... |
| 14:37 | SrPx | At the moment nothing special, just learning how it works |
| 14:37 | SrPx | I'm trying to get parenscript to work now , to compare them |
| 14:38 | Drakeson | is there a straighforward bridge between a dialect of scheme and javascript? |
| 14:40 | hcumberdale | SrPx what is a possible usecase for clojurescript? |
| 14:40 | hcumberdale | replace jquery? ;) |
| 14:45 | cmn | sure, or the power goes out, or your cat stays too long on your laptop's power button |
| 14:45 | cmn | sorry, wrong window |
| 14:49 | SrPx | hcumberdale: program things ? |
| 14:49 | SrPx | hcumberdale: not replace jquery, you'll probably use it with clojurescript |
| 14:50 | SrPx | hcumberdale: clojurescript is just a language that compiles to javascript and people using it are probably those who don't like javascript's syntax and stuff and prefer to code in a better language |
| 14:51 | SrPx | Drakeson: that's what I was wondering too |
| 14:51 | SrPx | Drakeson: if you find something please tell me, but it doesn't seem to be the case |
| 15:03 | jamii | http://i.imgur.com/6g8Fh.jpg |
| 15:03 | jamii | Clearly working hard here... |
| 15:07 | tomoj | amalloy: shit |
| 15:07 | tomoj | I used memoize wrongly |
| 15:07 | amalloy | eh? |
| 15:07 | tomoj | I knew it felt fishy at the time |
| 15:08 | tomoj | (fn id-factory [part] (memoize (fn [& args] (datomic.api/tempid part)))) |
| 15:09 | tomoj | only one thread touches that right now, but that could've been hell later.. |
| 15:11 | tomoj | I wonder thought whether that is a dangerous use of memoize or a bad idea generally |
| 15:46 | zackzackzack | If I want to shush log4j when I am running lein tests, where should I put the log4.properties file? |
| 15:48 | darq | Hi. (run 3 [q] (without [:a :b :c] [:a] q)) => (:b :c) ? is there a way in core.logic to get ([:b :c]) so that the result is in a vector |
| 15:52 | dakrone | zackzackzack: you should be able to put it anywhere in your resource path, you can either set :resource-paths in lein2, or put it in the 'test' folder so it'll only take effect while testing |
| 15:54 | zackzackzack | dakrone: Haha! Into the test folder it goes |
| 16:13 | amalloy | (list (vec (run ...))) |
| 16:14 | tomoj | &(assoc {} 1 2 3) |
| 16:14 | lazybot | ⇒ {3 nil, 1 2} |
| 16:14 | amalloy | pffft |
| 16:16 | raek | hrm, I have a problem with aleph (or gloss, more specifically). when I try to read lines from a socket using :delimiers ["\r\n" "\n"], lines don't "get through" until the next line is sent... |
| 16:16 | raek | when I use :delimiers ["\n"] it works correctly |
| 16:17 | amalloy | raek: i assume you're spelling delimiters right in your real code? |
| 16:19 | tomoj | not being able to use your own libraries in a transaction fn seems cumbersome. I'm tempted to try to macroexpand on the peer that defines a fn, but that seems.. bad |
| 16:19 | raek | amalloy: yeah |
| 16:22 | amalloy | raek: https://github.com/ztellman/gloss/blob/0.2.2/src/gloss/data/bytes/delimited.clj#L48 looks like it might be relevant. i can't see the details, obviously, but it looks like it might be saying "the largest delimiter i might find is size 2, therefore i need two bytes to start looking for a delimiter" |
| 17:04 | tomoj | warning, if you accidentally say :db.type/ref when you mean :db.type/long, datomic will happily oblige |
| 17:05 | Cubic | Why does loop need to be a special form? Couldn't it have been a macro that evaluates to a fn? |
| 17:07 | amalloy | just performance. let could be a macro too, but even scheme isn't that wasteful |
| 17:11 | augustl | how do I create a multimethod that dispatches on whether an arg is a string or a function? |
| 17:12 | augustl | (class (fn [])) is "user$eval952$fn__953", not sure how to write a defmethod that dispatches on that.. |
| 17:14 | Cubic | Dispatch on keywords :string and :function, and then just check in the dispatch function for string? or function? |
| 17:14 | Cubic | ,(doc string?) |
| 17:15 | clojurebot | "([x]); Return true if x is a String" |
| 17:15 | Cubic | ,(doc fn?) |
| 17:15 | clojurebot | "([x]); Returns true if x implements Fn, i.e. is an object created via fn." |
| 17:15 | augustl | hmm |
| 17:15 | amalloy | augustl: IFn |
| 17:19 | Cubic | amalloy: I guess that depends on whether he wants ifn? or fn? |
| 17:19 | amalloy | sure |
| 17:21 | augustl | ended up just doing an if/else ;) |
| 17:22 | augustl | getting "signing failed: No secret key" when trying to deploy to clojars with leiningen, is the process of "lein deploy clojars" documented somewhere? |
| 17:22 | amalloy | http://www.antiifcampaign.com/ always makes me laugh |
| 17:23 | tomoj | use objects to build a code! |
| 17:24 | bosie | vim (vimclojure) question: closing the vimclojure window with ^c screws with it as i can't seem to reopen it. it always throws a "cannot find my window" exception |
| 17:28 | bosie | nvm, found it |
| 17:40 | yedi | is chris granger still streaming? |
| 17:53 | muhoo | mudge: i like clojurebook.com, if you're coming from a web-dev, non-fp background |
| 17:54 | mudge | muhoo: does it teach the fp way to program? |
| 17:55 | muhoo | mudge: it's more "here's how to use clojure (and fp) to Do Stuff". |
| 17:55 | mudge | muhoo: cool |
| 17:55 | muhoo | very practical. it certainly does use idiomatic, clojure/fp ways of doing stuff, but the focus is on practical tasks |
| 17:56 | Raynes | First of all, monads are like burritos. |
| 17:56 | Raynes | You'll be fine now. |
| 17:56 | muhoo | Raynes: the morning after, not so much. |
| 17:57 | mudge | *farts* |
| 17:58 | muhoo | Raynes: i haven't messed with haskell much, but monads smell a bit to me like something that had to be invented to get around haskell's BDSM type system, much the way design patterns had to be invented to get around limitations in OOP |
| 17:59 | Raynes | muhoo: Get out of my internet. |
| 17:59 | muhoo | hehehe |
| 18:00 | amalloy | muhoo: you made that statement yesterday, but i don't think you listened to or noticed any of the counterarguments |
| 18:00 | muhoo | don't think i saw them, actually. must scroll back. |
| 18:01 | amalloy | it's like saying that parens had to be invented to fit the ludicrous requirements imposed on lisp by macros |
| 18:01 | Raynes | muhoo: Monads weren't actually created for Haskell, right? It was Opal. |
| 18:01 | amalloy | Raynes: for mathematicians first :P |
| 18:02 | Raynes | Yeah, but mathematical monads are different, right? |
| 18:02 | amalloy | naw |
| 18:02 | Raynes | Wikipedia says they "are not identical" |
| 18:02 | amalloy | well. i'm not an expert on category theory by any means |
| 18:03 | Raynes | muhoo: Why do you hate the Haskells? |
| 18:04 | Raynes | It's so much fun. |
| 18:04 | Raynes | I've been writing random crap in it just for the sake of it. |
| 18:04 | muhoo | i don't. i'm sure i'll learn it at some point. |
| 18:04 | muhoo | amalloy: thanks, the discussion happened after i was AFK, and looks very informative. |
| 18:38 | augustl | should I ever do the transient/persistent thing when building collections without first making sure it's actually a performance reason to do it in my system? :) |
| 19:06 | Cubic | augustl: what thing? |
| 19:48 | Cubic | Awesome. Just spend two hours fixing a bug that happened because I thought that '(start)==(list start) for some reason (I kinda knew it wasn't, but that slipped past me right now) |
| 19:55 | hughfdjackson | Cubic: painful experiences make for better programmers :D |
| 19:55 | hughfdjackson | hopefully.. |
| 19:57 | Cubic | I guess. Made me realize that I could use a vector just as well as a stack as a list. |
| 21:02 | XPherior | So I've been messing around with this concept of seeding a database without knowing the concrete types. Does this make sense to anyone else? http://michaeldrogalis.github.com/dibble/ |
| 21:12 | fluke777 | Hi everybody. I have a problem with proxy. I am using this code https://gist.github.com/4053357 to call a visitor which create AST as it goes. For testing purposes I just change the state once I enter the method visitMetricExpr. What baffles me is that when I run it in REPL (nrepl) it always return 3. When I package to a jar use reply to run the exact same code it returns one. I am kinda lost not really sure where to look. Can anyone take a look and maybe |
| 21:12 | fluke777 | something completely stupid that I am doing? |
| 22:51 | augustl | any suggestions for option parse libraries other than clojopts? It seems to not handle operands at all |
| 22:52 | augustl | hmm, seems that the actual problem is that it doesn't support --foo 123, only --foo=123 |
| 22:53 | amalloy | augustl: really? it uses the java port of gnu getopt, which i thought accepted both |
| 22:53 | amalloy | i wrote clojopts but haven't touched it in over a year; there's a contrib lib that's probably more maintained |
| 22:53 | augustl | a http://pubs.opengroup.org/onlinepubs/9699919799/ compliant jvm option parser would be nice :) |
| 22:54 | augustl | I not sure if gnu getopt is posix compliant |
| 22:54 | augustl | the biggest problem is ambiguities really, -bar can mean -b -a -r and -b=ar |
| 22:54 | augustl | and so on |
| 22:55 | augustl | already wrote one, but for Node.js ;) https://github.com/busterjs/posix-argv-parser |
| 22:55 | amalloy | i don't think that's an ambiguity; you just have to define whether b accepts a value, and whether a/r are valid options, after which there's a nonambiguous parse |
| 22:56 | augustl | indeed, as long as it's possible to define it beforehand it should be all good |
| 22:57 | augustl | here's my code, https://www.refheap.com/paste/6533, running that with "lein run --port 4224" prints {:clojopts/more (4224), :port nil} for `opts` |
| 22:57 | augustl | but --port=4224 works |
| 22:57 | augustl | interestingly enough -p4224 doesn't, even though the help output says it does :) |
| 22:58 | augustl | uh nvm I did --p4224 |
| 23:00 | augustl | http://commons.apache.org/cli/ looks pretty good |
| 23:00 | amalloy | augustl: if you say the arg's value is optional, then --port 4224 isn't attaching the value |
| 23:01 | amalloy | if you switch from optional-arg to with-arg, i think those both parse the same |
| 23:02 | amalloy | afaict that's how getopt in c behaves also, if you say the arg is optional |
| 23:05 | augustl | amalloy: ah, I see |
| 23:12 | augustl | the apache commons lib worked just like I wanted :) https://www.refheap.com/paste/6534 |
| 23:16 | brainproxy | looking to switch some deftype things over to defrecord, but upon doing so I'm getting exceptions in the REPL re: print-method |
| 23:16 | brainproxy | that is, as a multi-method it's not sure which dispatch to prefer |
| 23:17 | brainproxy | what I'd really like is to have the same print-method impl that deftype gives me |
| 23:20 | devth | when using :keys in a fn's args list, can you do additional destructuring? e.g.: (defn f [{:keys [a]}] a), then i call: (f {a: [1 2 3]}) and i only care about 3. |
| 23:21 | devth | seems like i'd have to do another separate round of destructuring in a let form - just making sure i'm not missing something. |
| 23:22 | amalloy | no. just don't use the :keys shortcut |
| 23:23 | amalloy | (let [{[_ _ x] :a} m] ...) |
| 23:26 | amalloy | augustl: did that fix your problem? |
| 23:27 | devth | amalloy: ah, hadn't thought of that. ty |
| 23:29 | augustl | amalloy: yup! |
| 23:30 | jamii | Turns out you can just wing emacs list - https://gist.github.com/4053713 |
| 23:30 | jamii | Seems to work |
