00:00:42 adamvh: well, we're already using reduce, so I don't want to rewrite that code. 00:00:57 (not that it's too hard to build it from do or loop) 00:01:11 it's hard in loop 00:01:17 It is hard in loop 00:01:27 (because of sequence) 00:01:31 -!- sohail [n=Sohail@unaffiliated/sohail] has quit [Read error: 110 (Connection timed out)] 00:01:47 hm, true, my version only works on lists :| 00:01:57 I was about to say that 00:02:02 adamvh: fold == reduce 00:02:18 thanks 00:02:44 The application is linear algebra, so I rather need to use vectors (: 00:03:45 speaking of which, anyone care to comment on the semantic distinction (non-existent in C) between multi-dimensional arrays and arrays of arrays of ... ? 00:04:19 _Pb [n=Pb@75.131.194.186] has joined #lisp 00:05:47 -!- billstclair [n=billstcl@unaffiliated/billstclair] has quit [Read error: 113 (No route to host)] 00:06:01 billstclair [n=billstcl@unaffiliated/billstclair] has joined #lisp 00:06:36 multi-dimensional arrays have less overhead 00:06:56 figured 00:07:16 is the former basically one big malloc'd block with pointers to rows? 00:07:35 and the latter a bunch of separately malloc'd blocks with pointers to each? 00:07:47 (forgive me for the C-speak) 00:08:03 <_3b> no need for pointers in multi-dimensional array, just dimension sizes 00:09:03 -!- Soulman [n=kvirc@154.80-202-254.nextgentel.com] has quit [Read error: 110 (Connection timed out)] 00:09:16 hence less overhead 00:09:45 figured thanks 00:09:52 <_3b> also fewer objects on the heap, possibly making GC easier 00:11:38 demmel [n=demmel@dslb-094-216-081-209.pools.arcor-ip.net] has joined #lisp 00:12:02 what command gives what version of clisp i am using? 00:12:06 also easier access, (aref array x y) instead of (aref (aref array x) y) 00:12:09 (version)? 00:12:12 clhs l-i-v 00:12:12 LISP-IMPLEMENTATION-VERSION: http://www.lispworks.com/reference/HyperSpec/Body/f_lisp_i.htm 00:16:12 -!- krumholt_ [n=krumholt@port-92-193-28-249.dynamic.qsc.de] has quit [Remote closed the connection] 00:19:02 athos pasted "unnamed" at http://paste.lisp.org/display/83432 00:19:22 -!- mogunus1 [n=marco@173-9-7-10-New-England.hfc.comcastbusiness.net] has quit [Read error: 110 (Connection timed out)] 00:19:24 man, this stupid form messed up all indentation 00:19:33 this code is actually from practical common lisp 00:19:49 but i can't get those macros work 00:20:10 -!- bgs100 [n=ian@unaffiliated/bgs100] has quit [] 00:20:38 mrsolo__ [n=mrsolo@adsl-68-126-190-177.dsl.pltn13.pacbell.net] has joined #lisp 00:20:42 mogunus [n=marco@173-9-7-10-New-England.hfc.comcastbusiness.net] has joined #lisp 00:20:48 -!- demmel [n=demmel@dslb-094-216-081-209.pools.arcor-ip.net] has quit [] 00:21:13 i even can't macroexpand something like: '(where :foo "bar"), because i get something like 00:21:20 unbound variable cd 00:21:52 it's unbound indeed 00:22:17 -!- saikat_ [n=saikat@adsl-76-228-82-245.dsl.pltn13.sbcglobal.net] has quit [] 00:22:22 hmm 00:23:00 but i think i got the exact same code as it's writtein PCL 00:23:29 and i thought that cd gets "bound"/available because of (lambda (cd) ... 00:24:24 <_3b> you evaluate it in make-comparisons-list 00:24:35 athos: make-comparisons-list should be a function 00:24:47 Adlai annotated #83431 "vector-reduce-intermediate for adamvh" at http://paste.lisp.org/display/83431#1 00:24:47 oh of course 00:24:50 man 00:24:53 all those macros.. ;-) 00:25:06 but it is a function stassats 00:25:11 now i'm confused 00:25:22 <_3b> athos: try -expr as a function 00:25:41 yes, i meant -expr 00:26:03 Adlai: sweet! 00:26:39 reduce has :start argument 00:26:49 how to open slime in a particular window? 00:27:12 JohnnyL [i=partyon@ool-182f0b98.dyn.optonline.net] has joined #lisp 00:27:21 -!- JohnnyL [i=partyon@ool-182f0b98.dyn.optonline.net] has left #lisp 00:27:24 two windows on buffer for writing other for interpreter 00:27:41 how to open interperter in second window? 00:28:07 <_3b> Bigshot_: C-x 2 or C-x 5 2 dependong on whether you want emacs definition of window or not 00:28:08 -!- _Pb [n=Pb@75.131.194.186] has quit ["Leaving"] 00:28:48 -!- schoppenhauer [n=christop@unaffiliated/schoppenhauer] has quit [Remote closed the connection] 00:28:49 -!- kleppari [n=spa@bitbucket.is] has quit [Read error: 104 (Connection reset by peer)] 00:28:53 <_3b> (then M-x slime in whichever you want to have the repl, or switch to the repl with C-x b or C-x C-b if you already have one started) 00:29:09 _3b, stassats, thank you! 00:29:14 that does the trick 00:29:31 or better, read emacs tutorial 00:29:51 of course there's no reason for it to be a macro :) 00:30:34 hrm, cffi is causing lots of trouble building certain packages here; they complain about SOCKADDR_IN and ADDRINFO. 00:31:11 in particular I'm trying to get teepeedee2 to install with asdf 00:31:41 I can get by all the errors with the "accept" option and run it in the repl, but trying to run a file that uses any part of tpd2 fails 00:33:25 -!- manuel_ [n=manuel@HSI-KBW-091-089-172-094.hsi2.kabel-badenwuerttemberg.de] has quit [] 00:33:48 Adlai: any reason you used (subseq vec 1) instead of just vec ? 00:34:12 kleppari [n=spa@bitbucket.is] has joined #lisp 00:35:06 hm, true. 00:35:34 if there were any, :start would be better 00:35:56 -!- jao [n=jao@93.Red-83-53-22.dynamicIP.rima-tde.net] has quit [Read error: 113 (No route to host)] 00:37:50 Adlai annotated #83431 ":start" at http://paste.lisp.org/display/83431#2 00:38:47 stassats, adamvh: I didn't think of :start 00:38:55 (elt vec 0) should be modified too? 00:39:32 stassats: why? 00:39:57 Adlai, stassats: I think that's right 00:40:17 because if it starts not at zero? 00:40:27 o true 00:41:01 Adlai annotated #83431 "better" at http://paste.lisp.org/display/83431#3 00:41:20 and length of the new vector 00:41:54 adamvh: I'll let you take over this function now 00:42:03 ...and other reduce keys for a bonus 00:42:04 but stassats, yes, good call there too. 00:42:19 Adlai: Yeah, thanks, you've been more than helpful 00:43:33 adamvh: no problem, good luck with your app. 00:44:22 and for extra points, don't use fill-pointer 00:44:45 stassats: how else would you incrementally collect elts? 00:44:58 maintain your own index 00:44:59 -!- claar [n=claar@85-169-63-25.rev.numericable.fr] has quit [Read error: 110 (Connection timed out)] 00:45:02 rogerwilco [n=rogerwil@pool-71-103-87-118.lsanca.dsl-w.verizon.net] has joined #lisp 00:45:22 if you want speed 00:45:26 stassats: that would make :start, :end, and :from-end much easier to implement. 00:46:16 <_3b> why not just write a function to return a function that returns a running total, then map that? 00:51:22 saikat_ [n=saikat@c-98-210-13-214.hsd1.ca.comcast.net] has joined #lisp 00:55:48 _3b: interesting idea. 00:58:24 -!- Yuuhi [n=user@p5483C384.dip.t-dialin.net] has quit ["ERC Version 5.3 (IRC client for Emacs)"] 01:04:55 -!- rogerwilco [n=rogerwil@pool-71-103-87-118.lsanca.dsl-w.verizon.net] has left #lisp 01:12:19 -!- madnificent [n=madnific@83.101.62.132] has quit [Read error: 104 (Connection reset by peer)] 01:13:09 madnificent [n=madnific@83.101.62.132] has joined #lisp 01:13:11 -!- slash_ [n=Unknown@p4FF0B204.dip.t-dialin.net] has quit [Client Quit] 01:23:16 -!- bobf [n=bob@unaffiliated/bob-f/x-6028553] has quit [Remote closed the connection] 01:23:38 bobf [n=bob@unaffiliated/bob-f/x-6028553] has joined #lisp 01:25:40 quek [n=read_eva@router1.gpy1.ms246.net] has joined #lisp 01:26:00 dlowe [n=dlowe@c-24-91-154-83.hsd1.ma.comcast.net] has joined #lisp 01:27:52 sohail [n=Sohail@unaffiliated/sohail] has joined #lisp 01:28:28 -!- daniel_ is now known as daniel 01:29:05 aja [n=aja@S01060018f3ab066e.ed.shawcable.net] has joined #lisp 01:29:17 I want to start the swank server only except when lisp is started by slime 01:29:21 is that possible 01:29:29 -!- loxs [n=loxs@82.137.72.32] has quit [Remote closed the connection] 01:29:53 at the moment I have (require 'swank) (swank:create-server :dont-close t) 01:29:58 in .sbclrc 01:29:58 -!- saikat_ [n=saikat@c-98-210-13-214.hsd1.ca.comcast.net] has quit [] 01:30:08 it is possible 01:30:38 -!- Adlai [n=user@bzq-84-109-63-215.red.bezeqint.net] has quit [Remote closed the connection] 01:31:07 Adlai [n=user@bzq-84-109-63-215.red.bezeqint.net] has joined #lisp 01:31:18 you could pass some argument, like --no-swank 01:32:42 I mean, start swank if lisp is started in terminal, otherwise don't start it 01:33:02 do you mean pass --no-swank in slime? 01:33:05 -!- blackened` [n=blackene@ip-89-102-28-224.karneval.cz] has quit [] 01:33:12 yes 01:33:17 ThomasI [n=thomas@unaffiliated/thomasi] has joined #lisp 01:34:24 -!- dlowe [n=dlowe@c-24-91-154-83.hsd1.ma.comcast.net] has quit ["Leaving."] 01:34:43 and (unless (member "--no-swank" sb-ext:*posix-argv* :key #'equal) ...) 01:35:36 s/key/test/ 01:35:42 simard [n=user@modemcable051.89-56-74.mc.videotron.ca] has joined #lisp 01:36:44 -!- aja [n=aja@S01060018f3ab066e.ed.shawcable.net] has quit [Read error: 60 (Operation timed out)] 01:38:18 aja [n=aja@S01060018f3ab066e.ed.shawcable.net] has joined #lisp 01:47:25 _Pb [n=Pb@75.131.194.186] has joined #lisp 01:52:56 -!- quek [n=read_eva@router1.gpy1.ms246.net] has quit [Remote closed the connection] 01:53:32 quek [n=read_eva@router1.gpy1.ms246.net] has joined #lisp 01:56:34 mattrepl [n=mattrepl@ip68-100-82-124.dc.dc.cox.net] has joined #lisp 01:56:37 -!- Sikander [n=soemraws@oemrawsingh.xs4all.nl] has quit ["Leaving"] 01:56:48 -!- alexsuraci [n=Alex@pool-71-188-133-67.aubnin.fios.verizon.net] has quit [] 02:05:53 -!- rullie [n=rullie@bas4-toronto47-1176149429.dsl.bell.ca] has quit ["Computer has gone to sleep"] 02:08:20 joshe [n=joshe@opal.elsasser.org] has joined #lisp 02:09:58 -!- dreish [n=dreish@minus.dreish.org] has quit [] 02:16:42 bgs100 [n=ian@h74.83.18.98.dynamic.ip.windstream.net] has joined #lisp 02:17:19 m801 [n=user@wsip-72-214-25-53.sd.sd.cox.net] has joined #lisp 02:18:49 -!- aja [n=aja@S01060018f3ab066e.ed.shawcable.net] has quit [Read error: 110 (Connection timed out)] 02:19:03 -!- m801 [n=user@wsip-72-214-25-53.sd.sd.cox.net] has left #lisp 02:19:20 -!- athos [n=philipp@92.250.250.68] has quit [Remote closed the connection] 02:19:57 saikat_ [n=saikat@c-98-210-13-214.hsd1.ca.comcast.net] has joined #lisp 02:26:58 shmho [n=user@58.142.15.103] has joined #lisp 02:27:32 -!- danlei [n=user@pD954F679.dip.t-dialin.net] has quit [Read error: 101 (Network is unreachable)] 02:28:04 aja [n=aja@S01060018f3ab066e.ed.shawcable.net] has joined #lisp 02:29:39 -!- _Pb [n=Pb@75.131.194.186] has quit ["Leaving"] 02:32:31 -!- ignas [n=ignas@ctv-79-132-160-221.vinita.lt] has quit [Read error: 110 (Connection timed out)] 02:34:14 Good morning. 02:37:50 so 02:39:56 I'm interested in designing a little unit conversion app (a la units(1)), and it seems like a good approach would be something data-driven based on a list of units in terms of eachother. 02:40:21 -!- ikki [n=ikki@189.247.80.117] has quit ["Leaving"] 02:40:28 -!- nha [n=prefect@137-64.105-92.cust.bluewin.ch] has quit ["My grandmother used anecdotal evidence all the time, and she lived to be 120 years old."] 02:40:32 at then performing a conversion by going from unit to unit until you arrive at the desired end-unit 02:40:51 but I have no idea how to actually do so, short of following every possible conversion path until one gets you there, and that's obviously not optimal. 02:41:01 anyone have any suggestions? 02:41:21 Ralith: search for "breadth-first search" 02:41:27 thanks 02:41:35 Ralith: Even if it is not optimal, how long is the chain going to be? 02:41:37 nah, have all units in one standard units 02:41:59 some-unit<->standard<->some-other-unit 02:42:13 That's probably the best solution. 02:42:17 I dunno 02:42:33 -!- Athas [n=athas@0x50a157d6.alb2nxx15.dynamic.dsl.tele.dk] has quit [Remote closed the connection] 02:42:40 I'd kind of like something that can handle things like arbitrarily combined units based on a minimum of information 02:43:02 and you can't express, say, newtons-to-meters as a single unitless factor. 02:43:22 in fact, such an expression in any way just doesn't make sense. 02:43:34 Ralith: You just lost me. 02:43:35 You might look at the scheme library for that. 02:43:35 *Ralith* probably hasn't thought about this enough 02:43:45 beach: yeah I think I lost myself too 02:43:46 BFS will give you what you want 02:43:47 give me a minute. 02:43:54 S11001001: looking into it 02:44:49 as an alternative if your model is a little more complex, Dijkstra's algorithm (yes that Dijkstra) 02:45:29 S11001001: I am very impressed that you know the algorithm to use. I don't even know the problem he is trying to solve. Do you? 02:45:53 beach: well, they're certainly relevant. 02:46:15 given that *I'm* not entirely sure what I want to solve, they seem like a good place to start at least in terms of research 02:46:16 beach: he's searching for shortest-path 02:46:37 maybe. 02:46:47 shortest path is through some standard unit, clearly 02:46:50 between two units, given a set of conversions (vertices) between values-as-units (nodes) 02:47:22 stassats: as with iconv, however, he may wish to allow provision of direct translations for special cases where it may be more efficient 02:47:44 S11001001: The shortest would then be to compute all possible one-step conversions. 02:47:55 but that's no fun at all. 02:48:04 davazp [n=user@56.Red-79-153-148.dynamicIP.rima-tde.net] has joined #lisp 02:48:10 alexsuraci [n=Alex@pool-71-188-133-67.aubnin.fios.verizon.net] has joined #lisp 02:48:18 But I am questioning the need to be faster than what stassats suggests. 02:48:19 okay, I've worked out exactly what I'd like to do 02:48:19 however, that would require nē storage or time, and it's cheaper just to use a shortest-path algorithm 02:48:34 beach: it's not a question of need; I'm doing this for fun. 02:48:57 practicality is secondary to elegance. 02:48:58 S11001001: Wow! You just made huge progress in fundamental CS, being able to convert space to time for all possible problems. 02:49:11 haha 02:49:22 :P 02:49:54 Ralith: That makes the specification very hard to follow, i.e., you don't want optimal time, nor optimal space, but the solution that is the most "fun". 02:50:17 beach: optimal time is fine. 02:50:23 I'm also assuming that some of the conversion functions may not be linear with a (0,0) intersection, in which case it's harder to precompute the conversion map like that 02:50:23 http://uim.googlecode.com/svn/vendor/slib/simetrix.scm <- have a look at this. 02:50:28 I guess what I really want to do is reimplement google's generalized unit math system. 02:51:49 *Ralith* shall think on this until he has better-formed questions. 02:52:55 Zhivago: looks interesting 02:56:06 rullie [n=rullie@bas4-toronto47-1176149429.dsl.bell.ca] has joined #lisp 03:11:31 -!- ianmcorvidae [n=ianmcorv@fsf/member/ianmcorvidae] has quit [Read error: 110 (Connection timed out)] 03:13:03 -!- kleppari [n=spa@bitbucket.is] has quit [Read error: 131 (Connection reset by peer)] 03:13:26 -!- quek [n=read_eva@router1.gpy1.ms246.net] has left #lisp 03:13:55 -!- ThomasI [n=thomas@unaffiliated/thomasi] has quit ["Bye Bye!"] 03:14:09 SandGorgon [n=OmNomNom@122.162.51.25] has joined #lisp 03:15:32 -!- shmho [n=user@58.142.15.103] has quit [Remote closed the connection] 03:16:53 is there something like multiple-value-bind but for lists? 03:17:26 e.g. (foo (bar baz blah) '(1 2 3) (+ bar baz blah)) == 6 03:17:26 clhs desctructuring-bind 03:17:27 Sorry, I couldn't find anything for desctructuring-bind. 03:17:32 ah, thanks 03:17:37 clhs destructuring-bind 03:17:38 http://www.lispworks.com/reference/HyperSpec/Body/m_destru.htm 03:18:23 kleppari [n=spa@bitbucket.is] has joined #lisp 03:20:35 anyone tried crunchbang? 03:22:27 what's that? 03:23:51 fvw [n=sdfpme@125.93.105.39] has joined #lisp 03:24:40 -!- mattrepl [n=mattrepl@ip68-100-82-124.dc.dc.cox.net] has quit [] 03:26:33 piso__ [n=peter@ip98-176-76-28.sd.sd.cox.net] has joined #lisp 03:26:44 ianmcorvidae [n=ianmcorv@ip70-162-187-21.ph.ph.cox.net] has joined #lisp 03:27:06 -!- piso [n=peter@ip98-176-76-28.sd.sd.cox.net] has quit [Read error: 110 (Connection timed out)] 03:27:47 -!- simard [n=user@modemcable051.89-56-74.mc.videotron.ca] has quit [Read error: 104 (Connection reset by peer)] 03:27:58 george__ [n=george@189.107.197.57] has joined #lisp 03:28:10 fast linux 03:29:04 -!- Nshag [i=user@Mix-Orleans-106-3-22.w193-248.abo.wanadoo.fr] has quit ["Quitte"] 03:29:19 -!- ianmcorvidae [n=ianmcorv@fsf/member/ianmcorvidae] has quit [Read error: 104 (Connection reset by peer)] 03:29:22 ianmcorvidae [n=ianmcorv@ip70-162-187-21.ph.ph.cox.net] has joined #lisp 03:31:15 -!- ianmcorvidae [n=ianmcorv@fsf/member/ianmcorvidae] has quit [Read error: 104 (Connection reset by peer)] 03:31:17 ianmcorvidae|alt [n=ianmcorv@fsf/member/ianmcorvidae] has joined #lisp 03:31:17 simard [n=user@modemcable051.89-56-74.mc.videotron.ca] has joined #lisp 03:31:19 Pegazus [n=eagaw@host250.190-224-109.telecom.net.ar] has joined #lisp 03:34:11 Is there a commonly used idiom/macro util "do-lines"? 03:34:35 what it's supposed to do? 03:36:41 Adlai pasted "I'm thinking along these lines..." at http://paste.lisp.org/display/83443 03:36:47 -!- aja [n=aja@S01060018f3ab066e.ed.shawcable.net] has quit [Read error: 104 (Connection reset by peer)] 03:37:47 You probably want do (progn ,@body) 03:37:48 so, when will it end? 03:38:56 aja [n=aja@S01060018f3ab066e.ed.shawcable.net] has joined #lisp 03:39:02 Zhivago: yes, or just do ,@body 03:39:11 that looks like an "anaphoric while", Adlai 03:39:18 stassats: oops. while line... 03:40:06 piso [n=peter@ip98-176-76-28.sd.sd.cox.net] has joined #lisp 03:40:24 lnostdal: now that you point it out, true, although I've seen this pattern a lot in code that deals with textual stuff, and it feels like there should be a util specifically for this purpose. 03:41:55 Strav [n=user@dsl-62-236.aei.ca] has joined #lisp 03:42:01 cgo [n=cgoellne@adsl-81-3-27.asm.bellsouth.net] has joined #lisp 03:42:29 -!- cgo [n=cgoellne@adsl-81-3-27.asm.bellsouth.net] has left #lisp 03:42:29 so if I'm writing this as a util for a project, should I go with the more general awhile, or this? 03:43:35 -!- Strav [n=user@dsl-62-236.aei.ca] has left #lisp 03:44:45 legumbre_ [n=user@r190-135-4-14.dialup.adsl.anteldata.net.uy] has joined #lisp 03:44:49 envi^home [n=envi@220.121.234.156] has joined #lisp 03:46:42 -!- Adlai [n=user@bzq-84-109-63-215.red.bezeqint.net] has quit [Remote closed the connection] 03:47:06 Adlai [n=user@bzq-84-109-63-215.red.bezeqint.net] has joined #lisp 03:47:11 -!- mrsolo__ [n=mrsolo@adsl-68-126-190-177.dsl.pltn13.pacbell.net] has quit [Read error: 110 (Connection timed out)] 03:50:38 -!- george__ [n=george@189.107.197.57] has quit [No route to host] 03:50:57 george__ [n=george@189.107.197.57] has joined #lisp 03:54:37 Demosthenex [n=demo@173.86.192.171] has joined #lisp 03:56:10 -!- piso__ [n=peter@ip98-176-76-28.sd.sd.cox.net] has quit [Read error: 110 (Connection timed out)] 03:57:34 CyberBlue [n=yong@60.26.114.206] has joined #lisp 03:57:59 -!- george_ [n=george@189.107.197.57] has quit [No route to host] 03:59:12 is there a function that would take a variable number of lists (each with a variable number of elements) and return a list of all possible combinations ? ie: (fun '(1 2 3) '(a b)) => '((1 a) (1 b) (2 a) (2 b) (3 a) (3 b)) 03:59:42 ianmcorvidae [n=ianmcorv@ip70-162-187-21.ph.ph.cox.net] has joined #lisp 04:01:05 -!- ianmcorvidae|alt [n=ianmcorv@fsf/member/ianmcorvidae] has quit [Read error: 104 (Connection reset by peer)] 04:01:36 simard: No 04:02:25 -!- saikat_ [n=saikat@c-98-210-13-214.hsd1.ca.comcast.net] has quit [] 04:02:47 -!- legumbre [n=user@r190-135-2-233.dialup.adsl.anteldata.net.uy] has quit [Read error: 110 (Connection timed out)] 04:02:48 |stern| [n=seelenqu@pD9E450CF.dip.t-dialin.net] has joined #lisp 04:02:48 Adlai: If I were you I'd use yours 04:03:51 adamvh: thx for the feedback... that's what I'm doing atm, as it makes my code clearer (imo) 04:05:05 Adlai: Of course, my judgment is tainted by Perl's while(<>) {} idiom, so take it with a grain of salt 04:05:33 Adlai: if supreme "lispy-ness" is your goal 04:06:04 simard: but it's trivial to define your own 04:06:53 yes well right now I'm kinda struggling around that :) 04:07:03 -!- ianmcorvidae [n=ianmcorv@fsf/member/ianmcorvidae] has quit [Remote closed the connection] 04:07:06 ianmcorvidae [n=ianmcorv@ip70-162-187-21.ph.ph.cox.net] has joined #lisp 04:07:45 (defun cartesian-product (a b) (mapcan (lambda (x) (mapcar (lambda (y) (list x y)) b)) a)) 04:09:42 I was thinking of a version that could take a variable number of arguments.. but I guess I could use the 2 element case recursively to make that general 04:10:36 is there a way to specialize * for custom types, or would that be bad practice? 04:10:43 custom structures* 04:10:56 Ralith: Multiplication? No. 04:11:05 aw. 04:11:14 Ralith, sort of, but it's a bit of a hack. 04:11:23 Ralith: the multiplication function is not a generic function, for reasons of performance. 04:11:33 Put your code in your one package, and shadow CL:* 04:11:43 shadow it with a generic fn that does whatever you want. 04:11:55 beach: ah, that makes sense from a performance perspective, anyway 04:11:55 *your own package 04:12:31 Is there a way to treat a 2-dimensional array as a sequence of its rows? 04:12:32 saikat_ [n=saikat@c-98-210-13-214.hsd1.ca.comcast.net] has joined #lisp 04:13:08 (make-array (array-total-size array) :displaced-to array) 04:14:17 Well I'll be 04:14:21 Does that copy the array? 04:14:27 No 04:14:28 no 04:14:45 So it's basically a different way of referring to the same chunk of memory? 04:14:58 yes 04:15:04 Nice. 04:15:13 How would one perform the inverse operation? 04:15:48 make a 2D array and displace it to a vector. 04:15:48 -!- simard [n=user@modemcable051.89-56-74.mc.videotron.ca] has quit [Remote closed the connection] 04:18:01 (make-array '(2 2) :displaced-to #(1 2 3 4 5 6) :displaced-index-offset 1) 04:18:04 is there something basically equivalent to 'or' but meant for use as a control structure? 04:18:13 i.e. evaluate its arguments until one is non-nil, then return that. 04:18:18 clhs some 04:18:18 clhs or 04:18:18 http://www.lispworks.com/reference/HyperSpec/Body/a_or.htm 04:18:18 http://www.lispworks.com/reference/HyperSpec/Body/f_everyc.htm 04:18:46 or is a control structure already 04:18:51 ah. 04:19:01 was recently reading PAIP and it strongly advised against using or as a control structure :P 04:19:05 oh, sorry misunderstood. 04:19:26 but it fits perfectly, so... 04:20:17 -!- _stern_ [n=seelenqu@pD9E45B28.dip.t-dialin.net] has quit [Read error: 110 (Connection timed out)] 04:20:31 the rule is, don't substitute if/when with or/and 04:20:31 stassats: doesn't your answer to adamvh's question using array-total-size just give an array of each element? 04:20:46 stassats: I suppose that makes sense. 04:20:54 -!- timchen1` [i=tim@kalug.ks.edu.tw] has quit [Read error: 113 (No route to host)] 04:21:11 Adlai: no, it gives a displaced array 04:21:41 yes, but I don't think it's a "sequence of its rows" 04:21:45 -!- Khisanth [n=Khisanth@pool-141-157-233-162.ny325.east.verizon.net] has quit [Read error: 110 (Connection timed out)] 04:21:50 it's instead a "sequence of its elements" 04:22:31 well, as opposed to sequence of columns, i think that's what adamvh wanted 04:22:46 stassats: no, I meant 04:23:10 once I've taken #2A((1 2) (3 4)) 04:23:30 into #(#(1 2) #(3 4)) 04:23:38 how do I go back to the #2A 04:23:41 representation 04:23:46 well then, why would you want to do this? 04:24:07 well, some linear algebra techniques 04:24:20 are easier to code as a series of operations on rows 04:24:26 e.g. gauss elimination 04:24:30 while others 04:24:48 with rows it's easy, what would you do with columns? 04:25:14 no I don't want columns 04:25:31 in the future too? 04:25:38 I just want ways to switch back and forth 04:25:51 between vector-of-vectors and multidimensional array 04:25:58 representations of the same matrix 04:26:06 depending on what I want to do to the matrix 04:26:13 displaced array will map all access to the target array 04:26:38 but if you want speed, then you'll have to do conversion yourself 04:27:00 How do you mean? 04:27:33 creating new array and filling it 04:28:45 any other programming language has concept of displaced arrays? 04:29:00 Yeah, C 04:29:06 kind of 04:29:48 You can have as many pointers into the chunk of memory holding an array as you want 04:30:26 well, pointers, but not displaced arrays as a concept 04:31:13 Khisanth [n=Khisanth@pool-141-157-233-162.ny325.east.verizon.net] has joined #lisp 04:31:35 It's certainly kind of idiomatic in numerical C code 04:31:50 but not technically a feature of the language I guess 04:34:35 strictly speaking, there is no arrays in C 04:34:42 lexa_ [n=lexa_@seonet.ru] has joined #lisp 04:35:09 -!- lexa_ is now known as Guest49983 04:35:14 Well, when you statically declare int[4]; 04:35:29 There is some semantic distinction between that and an array 04:35:48 and language standards refer to that case separately from the pure pointer case 04:35:51 but yes 04:36:05 basically no arrays 04:45:15 sellout [n=greg@75-25-126-88.lightspeed.sjcpca.sbcglobal.net] has joined #lisp 04:50:59 bobf_ [n=bob@host86-146-210-176.range86-146.btcentralplus.com] has joined #lisp 04:51:41 xan [n=xan@cs78225040.pp.htv.fi] has joined #lisp 04:52:50 cornucopic [n=r00t@115.184.187.10] has joined #lisp 04:56:06 -!- bobf [n=bob@unaffiliated/bob-f/x-6028553] has quit [Read error: 60 (Operation timed out)] 04:59:44 -!- ianmcorvidae [n=ianmcorv@fsf/member/ianmcorvidae] has quit [Read error: 104 (Connection reset by peer)] 04:59:45 ianmcorvidae|alt [n=ianmcorv@fsf/member/ianmcorvidae] has joined #lisp 04:59:48 _stern_ [n=seelenqu@pD9E44E75.dip.t-dialin.net] has joined #lisp 04:59:53 serichse1 [n=harleqin@xdsl-81-173-150-202.netcologne.de] has joined #lisp 04:59:59 -!- serichsen [n=harleqin@xdsl-81-173-153-106.netcologne.de] has quit [Read error: 104 (Connection reset by peer)] 05:00:46 lat_ [n=lat@125.167.140.159] has joined #lisp 05:01:18 sykopomp [n=user@unaffiliated/sykopomp] has joined #lisp 05:02:30 simard [n=user@modemcable051.89-56-74.mc.videotron.ca] has joined #lisp 05:02:48 is there a function that returns a symbol from a string ? 05:03:04 intern, make-symbol 05:03:05 clhs intern 05:03:05 http://www.lispworks.com/reference/HyperSpec/Body/f_intern.htm 05:03:39 -!- bgs100 [n=ian@unaffiliated/bgs100] has quit [] 05:04:55 ausente [n=user7994@189-19-119-72.dsl.telesp.net.br] has joined #lisp 05:05:26 -!- ausente is now known as dalton 05:06:28 -!- dto [n=user@pool-98-118-1-212.bstnma.fios.verizon.net] has quit [Remote closed the connection] 05:07:08 dto [n=user@pool-98-118-1-212.bstnma.fios.verizon.net] has joined #lisp 05:11:06 -!- nvoorhies [n=nvoorhie@adsl-75-36-204-63.dsl.pltn13.sbcglobal.net] has quit [] 05:12:17 Does slime keep the history of its command line? 05:12:32 it does 05:13:37 stassats, how can I access the last line typed? 05:13:38 lat_: try M-p M-n 05:15:10 stassats 05:15:40 and beach, you just made me happy! 05:16:13 lat_: Glad I could help. 05:17:16 -!- dalton is now known as betaborner 05:17:42 -!- ianmcorvidae|alt [n=ianmcorv@fsf/member/ianmcorvidae] has quit [Read error: 60 (Operation timed out)] 05:18:04 -!- |stern| [n=seelenqu@pD9E450CF.dip.t-dialin.net] has quit [Read error: 110 (Connection timed out)] 05:26:48 Emacs and the stumpwm has made me want to learn lisp. Is it possible in lisp to make a menu for stumpwm which will pop up with C-M m, showing a list of programs, that can then be launched by pressing 2 keys without pressing . The menu must then instantly exit from memory leaving the called program running. 05:27:55 -!- simard [n=user@modemcable051.89-56-74.mc.videotron.ca] has quit [Remote closed the connection] 05:31:21 bgs100 [n=ian@unaffiliated/bgs100] has joined #lisp 05:35:13 -!- saikat_ [n=saikat@c-98-210-13-214.hsd1.ca.comcast.net] has quit [] 05:36:35 saikat_ [n=saikat@c-98-210-13-214.hsd1.ca.comcast.net] has joined #lisp 05:40:24 I'm presently using a bash menu script. I press C-M m then one more key loads the program of my choice. Problem is I'm running out of one key codes. Also, the bash script will not exit out of memory until the called program exits. This causes a lot of unused windows to be left open. 05:40:59 -!- stassats [n=stassats@wikipedia/stassats] has quit [Read error: 110 (Connection timed out)] 05:41:56 you would probably have better luck asking in the stumpwm channel, assuming there is one 05:42:09 there is one 05:42:44 -!- bgs100 [n=ian@unaffiliated/bgs100] has quit [] 05:43:48 joshe, and Gertm , ok. Thanks. I'll switch over there. 05:44:06 nvoorhies [n=nvoorhie@adsl-75-36-204-63.dsl.pltn13.sbcglobal.net] has joined #lisp 05:48:02 -!- cornucopic [n=r00t@115.184.187.10] has quit [Read error: 110 (Connection timed out)] 05:49:04 -!- davazp [n=user@56.Red-79-153-148.dynamicIP.rima-tde.net] has quit ["ERC Version 5.2 (IRC client for Emacs)"] 05:50:11 oudeis [n=oudeis@89-138-15-114.bb.netvision.net.il] has joined #lisp 05:52:21 -!- fvw [n=sdfpme@125.93.105.39] has quit [Read error: 110 (Connection timed out)] 05:55:21 -!- lujz [n=lujz@cpe-92-37-0-24.dynamic.amis.net] has quit [Read error: 104 (Connection reset by peer)] 05:57:03 -!- adamvh [n=adamvh@c-76-125-233-103.hsd1.pa.comcast.net] has left #lisp 05:59:37 drafael [n=tapio@ip-118-90-140-71.xdsl.xnet.co.nz] has joined #lisp 06:00:20 nimalan [n=nimalan@64-46-16-106.dyn.novuscom.net] has joined #lisp 06:04:54 -!- nimalan [n=nimalan@64-46-16-106.dyn.novuscom.net] has quit [Client Quit] 06:05:37 nimalan [n=nimalan@64-46-16-106.dyn.novuscom.net] has joined #lisp 06:05:58 -!- nimalan [n=nimalan@64-46-16-106.dyn.novuscom.net] has quit [Client Quit] 06:08:27 -!- legumbre_ is now known as legumbre 06:10:14 jan247 [n=jan247@120.28.131.253] has joined #lisp 06:12:34 -!- nvoorhies [n=nvoorhie@adsl-75-36-204-63.dsl.pltn13.sbcglobal.net] has quit [] 06:13:21 nimalan [n=nimalan@64-46-16-106.dyn.novuscom.net] has joined #lisp 06:15:17 -!- CyberBlue [n=yong@60.26.114.206] has quit ["Leaving"] 06:24:07 lisppaste: url 06:24:07 To use the lisppaste bot, visit http://paste.lisp.org/new/lisp and enter your paste. 06:24:46 Demosthenex pasted "log5" at http://paste.lisp.org/display/83447 06:25:10 i feel like i'm missing something basic over why log5 won't work 06:25:53 -!- lat_ [n=lat@125.167.140.159] has quit ["Ex-Chat"] 06:26:18 lat_ [n=lat@125.167.140.159] has joined #lisp 06:26:55 <_3b> WARN vs. WARNING maybe? 06:29:28 <_3b> also, from the docs, it looks like you need to do more setup first 06:29:37 no, its complaining about the stream thing 06:29:41 never gers to the log-for 06:30:29 and the standard syslog levels are predefined 06:30:47 -!- Guest49983 [n=lexa_@seonet.ru] has left #lisp 06:31:04 <_3b> don't see START-LOG in the docs 06:31:05 Demosthenex pasted "Builtin Categories for Log5" at http://paste.lisp.org/display/83449 06:32:10 i was reading from the example included inthe source 06:32:15 log5-example.lisp 06:33:28 <_3b> http://common-lisp.net/project/log5/user-guide.html#header3-19 <- try that version maybe? 06:34:16 Demosthenex annotated #83447 "Fixed?" at http://paste.lisp.org/display/83447#1 06:34:27 getting closer, it appears some of the examples are outdated 06:36:27 -!- lat_ [n=lat@125.167.140.159] has quit ["Ex-Chat"] 06:36:48 lat_ [n=lat@125.167.140.159] has joined #lisp 06:38:12 -!- sohail [n=Sohail@unaffiliated/sohail] has quit [Read error: 113 (No route to host)] 06:49:08 -!- kmels [n=kmels@190.148.177.22] has quit [Read error: 104 (Connection reset by peer)] 06:49:28 kmels [n=kmels@190.148.177.22] has joined #lisp 06:49:47 -!- billstclair [n=billstcl@unaffiliated/billstclair] has quit [Read error: 113 (No route to host)] 06:50:04 billstclair [n=billstcl@dsl-74-209-25-119.taconic.net] has joined #lisp 06:53:12 justin` [n=justin@ip24-250-39-58.ri.ri.cox.net] has joined #lisp 06:53:16 -!- justin` [n=justin@ip24-250-39-58.ri.ri.cox.net] has left #lisp 06:53:52 -!- sykopomp [n=user@unaffiliated/sykopomp] has quit [Remote closed the connection] 06:55:24 sykopomp [n=sykopomp@unaffiliated/sykopomp] has joined #lisp 07:00:45 Drakeson` [n=user@69-196-169-53.dsl.teksavvy.com] has joined #lisp 07:01:02 -!- Drakeson [n=user@76-10-137-169.dsl.teksavvy.com] has quit [Read error: 60 (Operation timed out)] 07:04:13 -!- oudeis [n=oudeis@89-138-15-114.bb.netvision.net.il] has quit ["This computer has gone to sleep"] 07:07:43 fusss [n=chatzill@115.128.59.230] has joined #lisp 07:07:50 weetings 07:07:53 tcr [n=tcr@host145.natpool.mwn.de] has joined #lisp 07:08:36 unless there is an on going discussion, I am just gonna think out loud about input validation for web apps 07:10:04 last message was ~35 mins ago 07:10:17 i have classes that correspond with database records. instantiating one creates/updates a record. i need to do both javascript validation, for responsiveness, and also server-side validation for, well, everything else 07:10:52 I can create a generic function, VALIDATE, which specializes for every class (i.e. table) 07:11:24 oudeis [n=oudeis@bzq-79-176-53-236.red.bezeqint.net] has joined #lisp 07:11:43 I can then wrap make-instance with various make-foo functions that take keyword arguments, call validate on their inputs and pass the valid, sanitized input to make-instance 07:11:56 fusss: server side is in which language? 07:12:21 Pegazus: I only know Common Lisp web app development. 07:13:53 I could give you the solution I use, if you are into OOP... But you probably won't like it :p (And i'm not sure how to apply it to a javascript/lisp app, but it certainly is appliable) 07:14:41 I am mixing a few different issues; input valdiation vs input requiring/defaulting for missing fields (primary 'id' keys don't have to be supplied; the database maps those to an integer sequence, for example) 07:14:42 -!- Bigshot_ [n=BIG_SHOT@CPE002129abc864-CM001ac35cd4d0.cpe.net.cable.rogers.com] has quit [Read error: 104 (Connection reset by peer)] 07:14:47 Pegazus: speak away 07:15:42 Every time you create an object, validate in the instance creation method that that instance is valid.... This work's extremely well with inmmutable objects... 07:16:11 an around/before method for INITIALIZE-INSTANCE 07:16:19 what makes you think that isn't Lispy? :-) 07:16:59 ims [n=ims@112.200.115.107] has joined #lisp 07:17:05 Then, the page is probably "requesting" some action or info from the server, so you wil have to create a class for this "request" the page is doing (a class for each request, so each request will be an instance of a RequestKind of class), and then you can add validations to the request, when you create it, and then send it ot the server to be processed... 07:17:36 what makes you think that isn't Lispy? :-) ---> i never said it's not Lispy... OOP isn't about a language, but about a way of desiging programs... 07:17:51 Lisp is probably the 2nd best language to do OOP out there... 07:18:00 (defmethod initialize-instance :around ((user user)) (unless (stringp (user-name user)) (error 'user-error :msg "User name ~a is not of type string"))) (when (next-method-p) (call-next-method))) 07:18:17 Pegazus: Which would be the best one? 07:18:22 Smalltalk 07:18:45 Pegazus: for a different kind of OOP, yes, smalltalk is the best 07:19:12 hollyfuck, i just found it 07:19:28 for the best kind of OOP I know, it's Smalltalk... And i'vent found any better OOP yet... 07:19:42 well, you could always implement smalltalk OOP in lisp. 07:20:01 (that doesn't mean it doesn't exist my knowledge is pretty limited, but still i doubt it) 07:20:07 i can safely throw conditions and errors, and I would catch them in the page rendering function; instead of printing errors with format, I can grab error messages and insert them into DIVs :-) 07:20:33 Ralith: and get a back case of flavours :-P 07:20:55 -!- ims [n=ims@112.200.115.107] has quit ["Leaving"] 07:21:15 Ralith: so so... You'll have to redo a lot of lisp things from the ground... It's possible... it's probably not that practical.... 07:21:17 bdowning_ [n=bdowning@mnementh.lavos.net] has joined #lisp 07:22:04 Pegazus: it'd be quite practical, I'm sure; this sort of thing is what lisp is made for. 07:22:12 but in my case, i am trying to generate all pages with a generic DEFPAGE macro; if i go this route I would need to wrap a different handler-case around each page. maybe I can abstract that away and give defpage an error-handlers option, naturally, a condition/handler assoc :-) 07:22:35 <_3b> Ralith: the impractial part is reimplementing all of the smalltalk environment to go with the smalltalk OO :) 07:23:12 Pegazus: look into Slate, it is a smalltalk designed by a Lisper (who is also an smalltalker, selfer, and omega-er, or generally a competent PLs freak :-P) 07:24:04 _3b: eh, I'm sure you could do it lispily instead. 07:24:47 Ralith: Was not the first smalltalk actually implemented in lisp? 07:24:53 _3b: waddup dog ;-) 07:25:11 <_3b> Ralith: true, but that just adds the effort of translating the idiom onto the whole reimplementation effort :p 07:25:32 <_3b> fusss: trying to figure out how to generate ffi to flash libs for my flash compiler 07:25:34 _3b: sure, but the point is if one really wants it it's perfectly acheivable. 07:25:37 KingNatoG5 [n=patrik@84-217-12-193.tn.glocalnet.net] has joined #lisp 07:25:54 _3b: good lord! you're driven, my man 07:26:09 <_3b> fusss: nah, just very good at avoiding actual useful work :/ 07:26:43 *_3b* should have just written another ajax app and skipped flash completely :p 07:27:22 _3b: if you come Australia, you will be a rock star here. very few programmers (and generally, very few *people*) 07:27:35 I've just opened Slate, and I may be wrong, but my first impression is that whoever did that, doesn't know the slighest thing about Smalltalk OO.... 07:27:42 fvw [n=sdfpme@125.93.105.39] has joined #lisp 07:27:50 <_3b> heh, i'm too lazy to travel :) 07:27:56 I gave two speeches at two companies on my first month here, just because i am "web developer", the kind that doesn't use CMS ;-) 07:28:27 -!- xinming [n=hyy@218.73.143.144] has quit [Read error: 104 (Connection reset by peer)] 07:29:04 Pegazus: oh boy, you don't know what you just did. 07:29:10 nha [n=prefect@137-64.105-92.cust.bluewin.ch] has joined #lisp 07:29:32 fusss: you can tell me :) 07:29:40 xinming [n=hyy@125.109.248.244] has joined #lisp 07:31:30 Pegazus: to give you an analogy, you just walked into a cave and made a comment about the dirty little lion cubs sleeping in poop and fur. 07:31:42 slowly .. look behind you 07:32:08 *Pegazus* looks behind him... 07:33:03 danlei [n=user@pD954F755.dip.t-dialin.net] has joined #lisp 07:33:07 *fusss* remembers being torn a new one by brian when i said a similar thing about slate 07:33:37 jmbr [n=jmbr@173.32.220.87.dynamic.jazztel.es] has joined #lisp 07:33:43 okay O_o 07:34:28 Ragnaroek [n=chatzill@p54A6799D.dip.t-dialin.net] has joined #lisp 07:34:30 anyway, I maintain my position... sorry BrianRice... 07:35:15 xinming_ [n=hyy@218.73.141.211] has joined #lisp 07:35:50 -!- bdowning [n=bdowning@mnementh.lavos.net] has quit [Read error: 110 (Connection timed out)] 07:36:16 -!- bdowning_ is now known as bdowning 07:36:54 invalid-input and insufficient-input of type simple-error should be sufficient conditions for input validation imo. no need to define more. 07:37:31 -!- xinming [n=hyy@125.109.248.244] has quit [Read error: 104 (Connection reset by peer)] 07:39:15 -!- jan247 [n=jan247@120.28.131.253] has quit [] 07:40:21 -!- KingNatoG5_ [n=patrik@84-217-15-99.tn.glocalnet.net] has quit [Read error: 110 (Connection timed out)] 07:44:30 later 07:44:36 -!- fusss [n=chatzill@115.128.59.230] has quit ["ChatZilla 0.9.85 [Firefox 3.0.11/2009060215]"] 07:45:36 quek [n=read_eva@router1.gpy1.ms246.net] has joined #lisp 07:48:16 -!- rullie [n=rullie@bas4-toronto47-1176149429.dsl.bell.ca] has quit ["Computer has gone to sleep"] 07:50:01 xinming [n=hyy@125.109.250.73] has joined #lisp 07:50:26 splittist [n=dmurray@63-55.5-85.cust.bluewin.ch] has joined #lisp 07:50:28 morning 07:51:34 ianmcorvidae [n=ianmcorv@ip70-162-187-21.ph.ph.cox.net] has joined #lisp 07:51:35 -!- xinming_ [n=hyy@218.73.141.211] has quit [Read error: 104 (Connection reset by peer)] 07:52:06 what's the best way to grab web pages as strings given that different websites have a large range of different types of charset encoding which they may or may not advertise? 07:52:18 -!- sykopomp [n=sykopomp@unaffiliated/sykopomp] has quit [Read error: 104 (Connection reset by peer)] 07:52:39 sykopomp [n=sykopomp@unaffiliated/sykopomp] has joined #lisp 07:53:26 i just grab them with drakma and it has figured them out right till now 07:53:52 try http://xkcd.com/rss.xml 07:54:23 generally speaking, you can trust either the http-header, xml-header or meta-tags 07:56:22 looks like it's just that one actually, I was worried it might be a more prevalent problem 07:57:36 interesting 07:58:57 there's only xml-encoding 07:59:17 drakma doesn't even try to find out what the encoding is 08:00:25 manuel_ [n=manuel@HSI-KBW-091-089-172-094.hsi2.kabel-badenwuerttemberg.de] has joined #lisp 08:00:36 -!- Adlai [n=user@bzq-84-109-63-215.red.bezeqint.net] has quit [Remote closed the connection] 08:00:46 well, it's good to know that it hasn't bothered you before at least 08:01:14 I'll just add some sort of handler for when it returns octets for now 08:02:21 flexi-streams:octets-to-string does the trick. but it would be interesting to know how to do this right... 08:02:57 With the mess we have in the web (with ungueassable single-byte encodings) it's pretty much impossible to do this right. 08:03:39 web server should just provide the encoding 08:04:07 Though a friend of mine wrote some good guessing code for messed up encodings (like utf8 interpreted as latin-2 displayed as latin-1 :)). 08:04:21 http://krzaki.blizinski.pl/ 08:05:52 I'm sure he'd share the source if you ask (it's in Python). 08:08:33 ianmcorvidae|alt [n=ianmcorv@fsf/member/ianmcorvidae] has joined #lisp 08:09:40 -!- ianmcorvidae [n=ianmcorv@fsf/member/ianmcorvidae] has quit [Read error: 104 (Connection reset by peer)] 08:10:44 pstickne [n=pstickne@c-24-21-76-57.hsd1.wa.comcast.net] has joined #lisp 08:11:05 morning 08:13:11 i'd actually need something like that, but the application where it's most needed is in perl :/ 08:13:11 morning, p_l 08:14:04 Off to do some editing in windows :( 08:14:04 antoszka: looks like effects of using MySQL 08:14:13 p_l: Mainly. 08:14:26 p_l: But can happen anywhere, really. 08:14:36 interpreted as 08:14:47 (and compound versions, too) 08:15:10 BBL 08:15:12 -!- antoszka [n=antoszka@unaffiliated/antoszka] has quit ["+++ killed by SIGSEGV +++"] 08:15:17 antoszka: well, I did switch to Postgres due to a MySQL encoding errors in a project that had to support UTF-8 but data was passed around from different versions of database and between windows and netbsd.. 08:22:19 mathrick [n=mathrick@users177.kollegienet.dk] has joined #lisp 08:24:00 -!- wubbster [n=wubb@doc-24-206-235-153.kw.tx.cebridge.net] has quit ["Leaving"] 08:27:38 cp2 [n=will@unaffiliated/cp2] has joined #lisp 08:34:00 -!- aja [n=aja@S01060018f3ab066e.ed.shawcable.net] has quit [Read error: 110 (Connection timed out)] 08:35:21 Hun [n=hun@pd956be5d.dip0.t-ipconnect.de] has joined #lisp 08:40:42 -!- sykopomp [n=sykopomp@unaffiliated/sykopomp] has quit [Remote closed the connection] 08:40:59 sykopomp [n=sykopomp@unaffiliated/sykopomp] has joined #lisp 08:43:49 jan247 [n=jan247@120.28.131.253] has joined #lisp 08:47:13 -!- saikat_ [n=saikat@c-98-210-13-214.hsd1.ca.comcast.net] has quit [] 08:50:10 Soulman [n=kvirc@154.80-202-254.nextgentel.com] has joined #lisp 08:51:15 -!- cp2 [n=will@unaffiliated/cp2] has quit ["Reconnecting"] 08:51:19 cp2 [n=will@please.dont.make.me.eatddos.info] has joined #lisp 08:52:30 -!- Phoodus [i=foo@ip68-231-38-131.ph.ph.cox.net] has quit [Read error: 104 (Connection reset by peer)] 08:55:39 -!- edeion [n=ed@eccica.inria.fr] has quit [Read error: 54 (Connection reset by peer)] 08:56:23 loxs [n=loxs@82.137.72.32] has joined #lisp 08:58:02 edeion [n=ed@eccica.inria.fr] has joined #lisp 09:00:04 cmm- [n=cmm@bzq-79-176-59-31.red.bezeqint.net] has joined #lisp 09:06:48 -!- fvw [n=sdfpme@125.93.105.39] has quit ["leaving"] 09:09:12 bobf [n=bob@unaffiliated/bob-f/x-6028553] has joined #lisp 09:10:06 -!- edeion [n=ed@eccica.inria.fr] has quit [Read error: 104 (Connection reset by peer)] 09:12:52 c|p [n=will@please.dont.make.me.eatddos.info] has joined #lisp 09:14:19 bobf__ [n=bob@host86-162-64-255.range86-162.btcentralplus.com] has joined #lisp 09:16:52 edeion [n=ed@eccica.inria.fr] has joined #lisp 09:17:29 -!- cmm [n=cmm@bzq-79-180-129-66.red.bezeqint.net] has quit [Read error: 110 (Connection timed out)] 09:20:38 -!- beach [n=user@ABordeaux-158-1-36-70.w90-55.abo.wanadoo.fr] has quit [Read error: 104 (Connection reset by peer)] 09:25:15 -!- knobo` [n=user@ti0073a340-0120.bb.online.no] has quit [Read error: 104 (Connection reset by peer)] 09:31:04 ccl-logbot [n=ccl-logb@master.clozure.com] has joined #lisp 09:31:04 09:31:04 -!- names: ccl-logbot beach bobf__ c|p cmm- loxs cp2 Soulman jan247 sykopomp Hun mathrick ianmcorvidae|alt manuel_ xinming quek Ragnaroek danlei nha KingNatoG5 bdowning oudeis tcr Drakeson` billstclair kmels lat_ nimalan drafael dto betaborner serichse1 _stern_ xan bobf_ sellout Khisanth Demosthenex george__ envi^home legumbre piso Pegazus kleppari SandGorgon alexsuraci joshe madnificent mogunus _8david TuxPurple ajhager Gertm Adamant TR2N Holcxjo S11001001 09:31:04 -!- names: elias` phadthai benny tsuru rdd DeusExPikachu djinni` fnordus Xof cods trebor_dki gh7d395pi69wd tltstc Ringo48 rapacity a-s`` l_a_m z0d tic_ ia borism daniel djkthx Krystof moocow Elench-Fishing chii krappie guenthr rlonstein bfein dcrawford Borbus _3b DrForr tvaalen gz galdor cavelife^ Fade ilitirit luis r0bby sciendan minion cYmen joga vsync johs leo2007 erk easyE mtd bob_f meingbg JeLuF xristos boyscared Taggnostr maxote slyrus jrockway 09:31:04 -!- names: hyperboreean lisppaste Ginei_Morioka prip_ azanar Tordek Swordsman jlf` lemoinem kuhzoo Soulmann Guest497` p_l spiaggia wlr nowhereman ``Erik [df]_ housel jsnell clog sjbach kuwabara1 rread AntiSpamMeta Riastradh pitui araujo JuanDaugherty mbishop replaca__ rotty ryepup yango mikezor srcerer deepfire dalkvist antifuchs CuriousTrain froydnj kefka Buganini schme rey_ keithr erg Xach nicktastic arbscht_ kei ecraven drewc rbancroft michaelw specbot 09:31:04 -!- names: dostoyevsky herbieB sad0ur rsynnott Bucciarati spacebat_ PissedNumlock Ralith ineiros felipe egn zbigniew vcgomes tcoppi retupmoca Axioplase_ scode Aisling pok alexbobp ace4016 Adrinael Zhivago p8m guaqua Draggor _3b` sepisultrum azuk` tarbo CrEddy seejay pkhuong Bootvis Quadrescence matimago sytse wgl ski dmiles_afk mgr nerdshark pjb enn pragma_ Pepe_ acieroid BrianRice noptys_ roderic eno ennen anekos jyujin lnostdal Maddas `lhz jkantz stepnem 09:31:04 -!- names: moesenle rstandy cracki fe[nl]ix meingbg_ gmdjm1959 yahooooo ASau ASau` grouzen s0ber synic Kirklander kpreid foom ramus` Patzy Fufie peddie_ manic12_ sbahra Jasko mkfort tessier kerimbasol dialtone blast_hardcheese zophy joast kami- yoonkn__ mornfall Orest^bnc koollman bohanlon konr authentic rtoym_ dfox 09:31:37 -!- nimalan [n=nimalan@64-46-16-106.dyn.novuscom.net] has quit [] 09:31:42 edeion [n=ed@eccica.inria.fr] has joined #lisp 09:31:56 beach: CFFI to existing latin script OCR, except trained for Vietnamese variant 09:32:18 That's ceating. 09:32:27 er 09:32:43 *cheating 09:32:44 I recall some good library being released not so long ago (it wasn't touched in long time, but apparently fared better than gocr on the stuff it was trained) 09:32:49 There are some advantages in that the syllable clusters are relatively large and constrained. 09:33:16 beach: you can always rewrite the algorithms in CL and reuse learning data 09:33:49 I also have a particular scenaro in mind, which I haven't seen treated very well by existing software, but I haven't looked into every library or program of course.