00:02:26 zzo38: it's rare that they come up 00:02:39 also C already has a well-known select function that does something entirely different 00:02:42 I find it come up a lot, actually 00:02:42 and it's not common enough to use ~ for it 00:02:48 so you'd have to use a different name, like iselect 00:02:52 or ¢ 00:02:59 I was thinking I wanted to use ~< and ~> for those two operations 00:04:52 I don't get all the fizzbuzzes 00:05:27 It's like Hello World, except takes about half a second more thought. 00:06:08 ais523: Did you ever have anything that you would use it, though? 00:06:22 zzo38: it would have been useful in writing C-INTERCAL 00:06:36 ais523: Yes, but that isn't what I meant. 00:06:48 :t (~<) 00:06:50 Not in scope: `~<' 00:06:50 Perhaps you meant one of these: 00:06:50 `<' (imported from Data.Ord), 00:06:52 apart from that, only when writing an FFT, and even then, the version of bit-reverse in terms of select isn't as clear as the implementation in terms of more usual bitwise operators 00:06:53 :t (~>) 00:06:54 Not in scope: `~>' 00:06:54 Perhaps you meant one of these: 00:06:54 `>' (imported from Data.Ord), 00:07:34 Why would you need anything more than putStrLn.unlines.map(\x->case(x)of(x`mod`15==0)->"FizzBuzz";(x`mod`3==0)->"Fizz";(x`mod`5==0)->"Buzz";otherwise->show(x))$[1..100] 00:07:43 Why indeed. 00:07:48 Hike 00:07:54 Hatchet. 00:08:00 haha 00:08:14 FreeFull: now can you translate that to Homespring? 00:08:15 Wait, that code doesn't work 00:08:15 @fresh 00:08:15 Hajl 00:08:24 ais523: Well, I have had things where I wanted to use, in various other programs too, such as in a Famicom pattern and nametable editor, and in a program to write music for the General Instrument AY-3-8910 00:08:25 FreeFull: I'm afraid you're not qualified for this position. 00:08:38 And in a few other things too. 00:08:42 zzo38: I've never tried writing any of those programs 00:08:45 I do like how Template Haskell separates the concept of producing code from the concept of custom syntax 00:08:51 > map(\x->case(x)of(x`mod`15==0)->"FizzBuzz";(x`mod`3==0)->"Fizz";(x`mod`5==0)->"Buzz";otherwise->show(x))$[1..100] 00:08:53 :1:19: Parse error in pattern: x `mod` 15 00:09:02 FreeFull: i thought that looked fishy 00:10:15 writing a correct fizzbuzz first time without something to warn you about syntax errors is probably quite difficult 00:10:16 ais523: But I have found it useful in other things too, I mean 00:10:24 oerjan: It'd be even more fishy in Homesprint 00:10:28 Homespring 00:10:31 ais523: hmm, now I kind of want to write a formally verified fizzbuzz 00:11:00 uh you can't prove anything about imperative programs sorry 00:11:10 Bike: um when did I say it would be imperative 00:11:19 > unwords[case(x`gcd`15)of 15->"FizzBuzz";3->"Fizz";5->"Buzz";_->show x|x<-[1..100]] 00:11:20 "1 2 Fizz 4 Buzz Fizz 7 8 Fizz Buzz 11 Fizz 13 14 FizzBuzz 16 17 Fizz 19 Bu... 00:11:22 `run perl -lpe 'for my $x (1..100) { print ($x % 15 == 0 ? "FizzBuzz" : $x % 5 == 0 ? "Buzz" : $x % 3 == 0 ? "Fizz" : $x); }' 00:11:22 * elliott has been trying to prove some things about imperative programs, in Coq. 00:11:30 > map(\x->case()of_|(x`mod`15==0)->"FizzBuzz"|(x`mod`3==0)->"Fizz";|x`mod`5==0)->"Buzz"|otherwise->show(x))$[1..100] 00:11:31 :1:18: parse error on input `|' 00:11:32 let's see if I did it first time 00:11:41 I may need to do it again because of HackEgo startup time 00:11:49 oh bleh 00:11:53 No output. 00:11:55 `run perl -le 'for my $x (1..100) { print ($x % 15 == 0 ? "FizzBuzz" : $x % 5 == 0 ? "Buzz" : $x % 3 == 0 ? "Fizz" : $x); }' 00:11:56 1 \ 2 \ Fizz \ 4 \ Buzz \ Fizz \ 7 \ 8 \ Fizz \ Buzz \ 11 \ Fizz \ 13 \ 14 \ FizzBuzz \ 16 \ 17 \ Fizz \ 19 \ Buzz \ Fizz \ 22 \ 23 \ Fizz \ Buzz \ 26 \ Fizz \ 28 \ 29 \ FizzBuzz \ 31 \ 32 \ Fizz \ 34 \ Buzz \ Fizz \ 37 \ 38 \ Fizz \ Buzz \ 41 \ Fizz \ 43 \ 44 \ FizzBuzz \ 46 \ 47 \ Fizz \ 49 \ Buzz \ Fizz \ 52 \ 53 \ Fizz \ Buzz \ 56 \ Fizz \ 58 \ 00:12:06 does invoking the interpreter incorrectly count? 00:12:08 -!- monqy has joined. 00:12:10 the program itself was right 00:12:41 elliott: use game semantics! 00:13:04 ais523: for what? 00:13:13 for fizzbuzz! 00:13:37 elliott: proving things about imperative programs 00:13:56 oerjan: Clever 00:14:04 thanks 00:14:29 oerjan: Too many spaces though 00:14:31 ais523: unconvinced that would help :P 00:14:49 elliott: it's one of the main applications that was found for it 00:15:02 yes but what I'm doing is sort of weird 00:15:21 why are we fizzbuzzing 00:15:37 Phantom_Hoover: because someone tried and failed to write fizzbuzz in Homespring 00:15:44 and I mentioned it here because here was the appropriate channel 00:15:53 FreeFull: um there's just one space 00:16:10 which i left in because removing it would add characters 00:17:38 One space is too many 00:17:45 hm does lambdabot have bang patterns 00:17:47 It's totally reasonable to consider making a Haskell monad for producing code in another (crappy) language, right? 00:17:52 > unwords[case(x`gcd`15)of!15->"FizzBuzz";3->"Fizz";5->"Buzz";_->show x|x<-[1..100]] 00:17:54 "1 2 Fizz 4 Buzz Fizz 7 8 Fizz Buzz 11 Fizz 13 14 FizzBuzz 16 17 Fizz 19 Bu... 00:17:55 sure!! 00:18:04 there you go then 00:18:08 :t (!) 00:18:09 Ix i => Array i e -> i -> e 00:18:24 FreeFull: it's not the operator, it's a strictness modifier on a pattern 00:18:33 Ah =P 00:18:38 And you can apply it to of 00:18:43 oerjan: is there any reason to strict the pattern? in order to leave no spaces in the program? 00:18:44 there's also a laziness modifier ~, but it wouldn't work there 00:18:49 FreeFull: to 15, actually 00:18:58 ais523: that was what FreeFull demanded :P 00:19:01 strict 15 00:19:01 right 00:19:21 FreeFull: entirely redundant semantically there, of course 00:19:25 also is there any difference in evaluation order between stricting and not stricting that pattern? 00:19:32 clearly it produces the same result 00:19:34 because gcd is total 00:19:35 ais523: not in that case, no 00:19:43 case of is strict by default 00:19:44 yeah, I meant in that case 00:19:49 let is lazy by default 00:20:00 itt fizzbuzz 00:20:20 well the original /original/ article was about demonstrating how pattern matching works by giving fizzbuzz as an example 00:20:25 ais523: adding a lazy ~ modifier _would_ break it. 00:20:25 so we've sort-of gone full circle 00:20:26 > let 5 = 6 in 5 00:20:28 5 00:20:33 the original what 00:20:33 oerjan: hmm, why? 00:20:36 > let !5 = 6 in 5 00:20:36 > unwords[case(x`gcd`15)of~15->"FizzBuzz";3->"Fizz";5->"Buzz";_->show x|x<-[1..100]] 00:20:37 *Exception: :3:5-10: Non-exhaustive patterns in pattern binding 00:20:37 can't find file: L.hs 00:20:38 elliott: original article 00:20:40 of what 00:20:53 elliott: I linked the channel to an unfinished attempt at FizzBuzz in Homespring 00:21:00 which was written in a comment to a Reddit post 00:21:01 ah 00:21:01 hm that's weird 00:21:27 and Homespring, which has nothing even remotely resembling arithmetic, is a pretty hard language to write FizzBuzzes in 00:21:29 i thought that should give a list of FizzBuzz only, but not actually err out 00:21:58 how do you get non-exhaustive patterns when one of them is _? 00:21:59 because ~15 means "don't actually check the pattern until a variable in it is evaluated" and there is no variable in it 00:22:02 > unwords [case x `gcd` 15 of ~15 -> "FizzBuzz" | x <- [1..100]] 00:22:04 "FizzBuzz FizzBuzz FizzBuzz FizzBuzz FizzBuzz FizzBuzz FizzBuzz FizzBuzz Fi... 00:22:13 maybe your extra cases are doing weird things. 00:22:13 deep 00:22:20 elliott: huh 00:22:21 i.e. the ~15 just becomes _irrefutable_ 00:22:26 rather than actually lazy 00:22:32 > unwords [case x `gcd` 15 of ~15 -> "FizzBuzz"; _ -> "hello" | x <- [1..100]] 00:22:34 mueval-core: UnknownError "GHC returned a result but said: [GhcError {errMs... 00:22:39 um, nice 00:22:57 i want to see the rest of the error! 00:23:04 elliott: i think we've found a bug in ghc :P 00:23:35 i don't get it locally (7.6.2) 00:24:10 http://sprunge.us/FbAX 00:24:50 No error here http://ideone.com/JRGZGo 00:24:51 ah ok then 00:25:13 > unwords [case 14 of ~15 -> "a", _ -> "b"] 00:25:14 Pattern syntax in expression context: _ -> "b" 00:25:16 err 00:25:31 > unwords [case 14 of ~15 -> "a"; _ -> "b"] 00:25:33 mueval-core: UnknownError "GHC returned a result but said: [GhcError {errMs... 00:25:34 ais523, you put , instead of ; 00:25:36 yeah 00:25:44 lambdabot/hint bug I assume? 00:25:48 > case 1 of ~2 -> 2; _ -> 1 00:25:49 sucks 00:25:50 mueval-core: UnknownError "GHC returned a result but said: [GhcError {errMs... 00:25:57 there we go, I guess that's a minimal test case 00:25:59 wait is that like four nested errors 00:26:01 cool 00:26:17 Bike: only three nested errors are visible there, but there might be more 00:26:41 i mean it's UnknownError, said, GhcError, errMs[g] 00:26:44 mueval-core: UnknownError "GHC returned a result but said: [GhcError {errMsg = \":3:1:\\n Warning: Pattern match(es) are overlapped\\n In a case alternative: _ -> ...\"} 00:26:45 ]" 00:26:45 Prelude> case 1 of ~2 -> 2; _ -> 1 00:26:57 my ghci gave the same warning, and returned 2 00:27:13 sweet 00:27:27 someone who knows more Haskell than me will need to explain whether the fault is in my understanding of Haskell, or of ghc's 00:27:34 (I'm guessing it's mine) 00:27:40 that is the correct result 00:27:44 ~ makes the pattern irrefutable 00:27:51 ah right 00:27:55 thus it forces the 1 to match 2? 00:27:56 (and hence, lazier) 00:28:00 ais523: it blithely assumes it does 00:28:04 yeah 00:28:09 consider also case undefined of ~(x,y) -> "hello" ++ show x ++ show y 00:28:09 and then because the internals of the 2 aren't used anywhere 00:28:20 it doesn't notice anything is wrong 00:28:23 or fix (\ ~(x:xs) -> 1:x:xs) 00:28:25 yeah 00:28:28 (which would be too strict without the ~) 00:28:36 (since, what if it's []? it'd want to give an error) 00:28:55 right, this makes sense 00:29:21 oh wait that line still has a space in it 00:29:32 hey you all are nerds right? what's a reader for android that'll let me read public domain text files without pausing to redownload everything every two minutes 00:29:37 > unwords[case(x`gcd`15)of!15->"FizzBuzz";3->"Fizz";5->"Buzz";_->show$x|x<-[1..100]] 00:29:38 "1 2 Fizz 4 Buzz Fizz 7 8 Fizz Buzz 11 Fizz 13 14 FizzBuzz 16 17 Fizz 19 Bu... 00:29:48 like how hard can it be to present text to me 00:29:48 Bike: that problem sounds suspiciously practical 00:29:54 FreeFull: MOAR FIXED 00:29:56 it's horribly practical ;_; 00:30:04 you could… write your own? 00:30:14 I don't know of one offhand, not owning an android phone 00:30:35 oerjan: Might as well use unlines 00:30:57 > unlines[case(x`gcd`15)of!15->"FizzBuzz";3->"Fizz";5->"Buzz";_->show$x|x<-[1..100]] 00:30:58 "1\n2\nFizz\n4\nBuzz\nFizz\n7\n8\nFizz\nBuzz\n11\nFizz\n13\n14\nFizzBuzz\n1... 00:31:08 it's not immensely pretty 00:31:13 > var$unlines[case(x`gcd`15)of!15->"FizzBuzz";3->"Fizz";5->"Buzz";_->show$x|x<-[1..100]] 00:31:14 1 00:31:15 2 00:31:15 Fizz 00:31:15 4 00:31:15 Buzz 00:31:16 [11 @more lines] 00:31:52 :t var 00:31:53 String -> Sym a 00:32:04 Interesting 00:32:29 it's a nice trick for unquoting a string lambdabot prints 00:33:48 > var "I like pie" 00:33:49 I like pie 00:33:51 var is only used because of its show method, right? 00:33:59 yep 00:34:16 > var $ ulines["foo","`echo hi"] 00:34:18 Not in scope: `ulines' 00:34:18 Perhaps you meant one of these: 00:34:19 `lines' (importe... 00:34:21 > var $ unlines["foo","`echo hi"] 00:34:21 > var "\0332" 00:34:22 mueval-core: : hPutChar: invalid argument (invalid character) 00:34:22 can't find file: L.hs 00:34:25 :t repeat 00:34:27 a -> [a] 00:34:35 FreeFull: lambdabot's Unicode support is buggy 00:34:43 ais523: i think you got a race condition 00:34:45 yeah 00:34:45 > var . take 100 $ repeat '\n' 00:34:47 > var $ unlines["foo","`echo hi"] 00:34:48 Terminated 00:34:49 foo 00:34:49 `echo hi 00:34:57 oh, it remembered the leading space that time 00:35:23 it always does, it just has two on the first one 00:35:33 oh right 00:36:08 > var "\xe2\x99\xa5" 00:36:09 mueval-core: : hPutChar: invalid argument (invalid character) 00:36:15 Dammit 00:37:21 > var "\180" 00:37:23 mueval-core: : hPutChar: invalid argument (invalid character) 00:37:36 it seems like it only allows ASCII... 00:37:50 or possibly things get double encoded 00:40:57 > var "\x40" 00:40:59 @ 00:46:15 Will it work in GCC for one module to specify that a type does not alias while in another module the same type does alias? 00:46:56 Furthermore, does it work in LLVM? 00:49:24 i think someone mentioned segways http://www.dagbladet.no/tegneserie/kellermannen/ 00:52:06 Will structures alias each other if one has an anonymous member having the type of the other structure as its first element? 00:55:44 -!- ais523 has quit. 00:59:09 -!- nooga has quit (Ping timeout: 245 seconds). 01:24:52 It's just that I see a lot of words with no point to them. Then I look to the left and it says . <-- i suggest reading from left to right would at least allow you break after 'hagb4rd' and not to waste your time :p 01:26:06 See, there's a useful suggestion. 01:26:23 cool ;) 01:31:02 not if you're using a client with decent justification 01:31:33 Phantom_Hoover: do you have a hihlight on hagb4rd? 01:32:30 no, hagb4rd, i just happened to check the channel 5 minutes after that exchange and half an hour after anything worthwhile was said 01:32:51 ok 01:34:53 -!- DHeadshot has quit (Read error: Connection reset by peer). 01:34:58 -!- DH____ has joined. 01:47:10 So nervous about tomorrow 01:47:18 Still sad about that other place though 01:47:29 If I screwed up with them, how can I avoid screwing up with Ipreo? 01:47:49 maybe you could not screw up the thing you screwed up before 01:48:03 I don't know exactly what I screwed up, though. 01:50:07 Maybe agreeing to send one of my worst pieces of code? 01:51:06 Which we barely talked about on the phone -- after a lengthy discussion about a piece of code which they suddenly decided was too long ago to look at. 01:53:08 maybe they just chose someone else over you 01:54:39 Sgeo: you didn't send them a piece of esolang code, did you? 01:55:04 I did not, unless you consider Tcl to be an esolang. 01:55:23 anyway: good luck! 01:55:26 But sending Tcl to a company that likes functional programming -> bad idea? 01:55:28 hagb4rd, thanks 01:55:52 why didn't you just send some häskéll 01:56:36 That wasn't what they asked for. I don't think I have any Haskell stuff listed on my resume. And the one project that I _could_ reasonably send that I did in Haskell seems a bit ... awkward to mention to potential employers 01:56:44 (It was a thing to attempt to manage speed dating things) 01:56:59 are you, like, victorian 02:01:56 just make it about 'speed interviews' instead 02:02:22 I don't think that would quite work 02:04:06 try to ask many questions, with an atitude of "what do you have to offer, so i'd like to work for you" 02:05:26 Sgeo: close enough? 02:05:40 Not really 02:05:42 Brb 02:08:23 It took as input number of straight/bi/gay men and women, and tried to match them up for each round 02:09:07 i read that as (straight/bi/gay men) and women 02:09:25 that sounds pretty generalizable 02:10:14 My algorithm sucked 02:10:26 did you use the list monad 02:10:30 it seems like it'd be useful 02:10:47 Yes. But the algorithm emits non-ideal results 02:11:08 like matching bi on gay? or what? 02:11:28 Say 3 straight men and 3 straight women. First round: m1-f1 m2-f2 m3-f3. Second round: m1-f3 m3-f1 no-match... 02:11:45 It doesn't manage to minimize people sitting out or number of rounds 02:12:15 I made the algorithm much uglier in attempts to at least minimize the pain 02:12:21 btw that doesn't seem that embarassing 02:12:38 Yeah, what are you, Victorian? 02:12:51 strikes me as an obvious "well here's a vaguely real-world application" thing 02:21:26 -!- Phantom_Hoover has quit (Quit: Leaving). 02:22:52 for a "straight situation" you could have just "shift" men OR women to the next table 02:23:08 `olist 02:23:16 olist: shachaf oerjan Sgeo 02:23:31 hagb4rd, correct. But it needs to generalize to mixed situations 02:23:44 There's probably a smarter way to handle it than brute-forcing 02:24:01 oerjan, this one is 877. 02:24:02 yea, thinking of that it's not THAT trivial 02:24:39 at least if we don't want to discriminate the dedrophiles 02:25:18 darn, my cache is _still_ stuck despite losing my visited links marking... 02:25:33 Any case where there are no bisexuals is trivial 02:25:49 yep, i thought so 02:26:11 oerjan, http://www.giantitp.com/comics/oots0877.html hth 02:26:17 you should rewrite this as a graph coloring problem. 02:27:31 I don't know graph theory. 02:28:05 or better: graph coloring solution :p 02:28:56 selling solutions is easier than selling problems 02:29:08 It's pretty easy. You have some dots and some lines and you can look up the answer becaue it was probably worked out decades ago. 02:31:23 so the question ist what have graphs in common with dots and lines 02:31:59 They're made out of dots and lines! Or in "the lingo", "nodes" or "vertices" and "edges". 02:32:02 Did I just blow your mind? 02:32:13 you don't say 02:53:56 -!- DH____ has quit (Read error: Connection reset by peer). 02:54:02 -!- DHeadshot has joined. 03:01:11 Thgeo 03:06:23 Template Haskell Sgeo? 03:07:10 -!- Nisstyre-laptop has joined. 03:07:11 Bike: why are they called "edges" 03:07:16 awful name imo 03:07:32 It has an edge to it 03:07:51 shachaf: euler's "bridges" never really caught on 03:08:05 how about "lines" 03:08:28 They tried that for a while, but then the geometers came around with bats. 03:08:50 Lines aren't abstract enough. 03:09:47 oh they are: the shortest conjuction between two points. but they don't feel comfortable with language anyone could understand 03:10:08 it just wouldn't feel right 03:10:21 Well, in graph theory edges don't usually have geometric length in the same way as uh, lines, do. 03:10:35 Wouldn't each edge have length 1? 03:10:37 you don't need metrics or nuthin. 03:11:20 What about topological geometry guys 03:11:21 Each edge is 1 edge in length. 03:11:39 a-b-c 03:11:55 a and b are 1 edge from eachother. The distance between a and c is 2 edges. 03:12:09 a-b-c 03:12:09 each edge is one edge in length. that's pretty deep. 03:12:10 \ / 03:12:18 v 03:12:25 ...didn't think that one through! 03:12:28 let's try this again 03:12:30 a-b-c 03:12:31 \ / 03:12:43 -!- Fiora has left. 03:12:48 d 03:12:49 -!- Fiora has joined. 03:13:04 Graphs aren't easy. 03:13:16 just convert it to a monoid 03:15:06 Oh, graphs actually do form metric spaces. Oopsie. 03:15:08 a─b─c 03:15:09 └───┘ 03:15:14 THERE 03:15:34 Thanks, box drawing characters. 03:15:48 Oh 03:15:52 Anyway then you'd usually say all of a b and c are one away from one another. 03:15:54 ywachaf 03:15:56 is that comparable with algorithms like A* ..in which an edge still can have a different value than? 03:15:57 graph { a--b; b--c; a--c; } 03:16:02 hagb4rd: Weights. 03:16:10 weight..sorry yes 03:16:20 Why are they weights and not masses 03:16:24 So geocentric 03:16:38 Because 03:16:44 (not to mention cumbersome) 03:16:49 Jafet does not understand the gravity of the situation 03:17:14 and yes, A* is a pathfinding algorithm for graphs of course. 03:17:52 That's a heavy thought to ponder. 03:18:07 @brain are you pondering what Jafet is pondering? 03:18:08 Well, I think so, Brain, but do I really need two tongues? 03:18:15 yea.. a good practical example is the shortest way in lenth != the sortest time you need to go 03:18:19 -!- Phantom_Hoover has joined. 03:18:20 -!- Phantom_Hoover has quit (Client Quit). 03:18:33 so weight is more general than length 03:18:49 depending on context 03:19:46 every edge can have a different weight.. at least the relations stay the same..right? 03:19:53 what relations 03:20:02 the "lines" 03:20:26 like streets 03:20:38 or whatever 03:20:44 to keep things simple 03:21:54 still i don't see clear how exactly that would solving the speed dating problem (which doesn't mean it would not) 03:22:47 *would help 03:22:47 because you could reframe it easily as graphshit and then use some known algorithm. 03:23:14 sounds reasonable 03:26:16 Graphshit theory 03:34:34 grapeshot theory 03:35:27 A whiff of graphshit 03:36:04 can i help you 03:37:37 grapeshot is a shitstorm 03:39:01 -!- Arc_Koen has quit (Quit: Arc_Koen). 03:44:52 -!- Jafet has quit (Quit: Leaving.). 03:53:27 http://intothecontinuum.tumblr.com/post/21482592732/mathematica-code-p-t-1-0-9-cos-8-t-1 03:54:23 -!- copumpkin has quit (Ping timeout: 252 seconds). 03:54:38 kmc: whoa man. drugs. 03:55:16 no 420s in the code :/ 03:55:21 -!- copumpkin has joined. 03:55:53 -!- Nisstyre-laptop has quit (Quit: Leaving). 03:57:35 that reminds me of http://mathworld.wolfram.com/CannabisCurve.html thank you wolfram mathworld 03:58:06 I wonder if there are any pretty curves involved with analysis of the endocanniboid system. 03:58:07 -!- Nisstyre-laptop has joined. 03:58:14 "Botanical Terminology" 03:58:29 man i cannot spell that word 03:59:54 kmc: A lot more in that category than I'd ever have expected. 04:17:38 -!- copumpkin has quit (Ping timeout: 245 seconds). 04:18:15 -!- copumpkin has joined. 04:42:50 -!- sebbu has quit (Ping timeout: 260 seconds). 04:54:10 -!- augur has quit (Remote host closed the connection). 05:02:21 -!- oerjan has quit (Quit: leaving). 05:06:07 Wonder if Randall opened up a can of security worms with people taking latest xkcd too seriously... 05:07:16 ☺ 05:07:45 aw man, goatkcd hasn't updated yet. 05:07:56 :☹) 05:44:40 -!- pikhq_ has joined. 05:45:04 -!- carado_ has quit (Ping timeout: 246 seconds). 05:45:24 -!- pikhq has quit (Ping timeout: 272 seconds). 05:47:58 -!- Nisstyre-laptop has quit (Quit: Leaving). 05:57:40 -!- GOMADWarrior has quit (Ping timeout: 246 seconds). 06:08:53 -!- DHeadshot has quit (Read error: Connection reset by peer). 06:09:13 -!- DHeadshot has joined. 06:30:36 sgeo: hah 06:31:35 -!- augur has joined. 06:41:18 Sgeo: Those that don't understand sarcasm? 06:43:54 -!- augur has quit (Read error: Connection reset by peer). 06:44:58 -!- augur has joined. 06:48:30 -!- sebbu has joined. 06:58:37 -!- iamcal_ has quit (Ping timeout: 256 seconds). 06:58:50 -!- surma has quit (Ping timeout: 252 seconds). 07:18:49 -!- surma has joined. 07:28:02 -!- FreeFull has quit. 07:39:59 -!- azaq23 has joined. 07:47:29 -!- Bike has quit (Quit: leaving). 07:51:57 -!- azaq23 has quit (Quit: Leaving.). 08:20:08 -!- epicmonkey has joined. 08:40:20 -!- doesthiswork has quit (Quit: Leaving.). 09:05:33 -!- nooga has joined. 09:06:55 -!- nooga has quit (Client Quit). 09:10:33 -!- DHeadshot has quit (Ping timeout: 245 seconds). 09:10:44 -!- fungot has quit (Ping timeout: 248 seconds). 09:12:48 -!- nooga has joined. 09:22:22 -!- iamcal_ has joined. 09:27:19 -!- copumpkin has quit (Ping timeout: 252 seconds). 09:27:58 -!- copumpkin has joined. 10:17:42 -!- Phantom_Hoover has joined. 10:17:48 Is there program viewing .ods file without needing editing feature and all that stuff? 10:18:19 -!- Jafet has joined. 10:27:52 % apt-cache search '\' 10:27:53