16:11:32 -!- esowiki has joined. 16:11:33 -!- glogbot has joined. 16:11:34 -!- EgoBot has joined. 16:11:36 -!- esowiki has joined. 16:11:37 -!- esowiki has joined. 16:13:05 on the bright side, HackEgo has been very responsible 16:13:29 I'm honestly not sure why glogbot didn't pop back up on its own... the system was up... 16:16:01 i was getting into this strange ritual of copying tunes logs into vim to reformat them 16:16:57 I'm sorry it's all my fault :'( 16:17:09 it's all forgiven 16:17:14 https://www.codeeval.com/open_challenges/185/ i'm having problems with the repeated parts 16:19:26 -!- MoALTz has joined. 16:20:21 any idea? :\ 16:20:38 well it says in point 1 that you have _all_ shifts 16:21:15 -!- AnotherTest has quit (Ping timeout: 250 seconds). 16:21:21 that probably is enough to make it solvable 16:23:58 as long as the n-1 first letters and the n-1 last letters aren't identical, then it's obviously not 16:24:22 (because then you get a loop that can start anywhere) 16:25:24 otherwise, here's how to find the first n-1 letters: it's the unique combination which occurs once more as the first n-1 chars in a piece than it does as the last n-1 chars. 16:25:42 similarly for last n-1. 16:25:54 yes that's all good 16:26:00 but how do you deal with the repeated parts? 16:26:36 hm 16:27:03 -!- AnotherTest has joined. 16:27:57 if there are any that are repeated 3 or more times, you cannot. 16:28:17 unless the part in between is also identical, i guess. 16:28:54 but do you have to... I mean they promise you that the solution will be unique 16:28:57 e.g. 123abc456abc789abc0 must become ambiguous 16:29:13 (with length 3) 16:30:07 actually isn't this basically a hamiltonian path problem. 16:30:33 yes. 16:30:41 each piece is a node, each possible next piece gives an edge 16:31:10 but I guess we can hope for a very sparse parse with lots of nodes having degree 2 16:31:11 or wait 16:31:19 ...sparse graph... 16:31:20 each piece is an _edge_ 16:31:46 well, hmm, it's a directed hamiltonian path problem 16:31:50 ...and it suddenly becomes a eulerian path problem 16:31:57 oh wait, directed 16:31:57 (at least that's how I would view it) 16:32:46 directed eulerian path sounds easier than hamiltonian, anyway 16:33:44 What are the nodes in your graph where each piece is an edge? 16:33:44 oh and the graph can have multiedges 16:34:13 fizzie: n-1 length substrings 16:34:31 fizzie: in my graph, the pieces are the nodes, and there's an edge between pieces that can be successive shifts. 16:34:41 int-e: Yes, that was easier. 16:34:46 -!- sacadouche has quit (Quit: Leaving...). 16:35:05 But I guess both make sense. 16:35:25 (oerjan wrote that differently above... hmm) 16:35:42 but it's an obvious encoding anyway 16:35:45 i'm sure i meant the same thing 16:36:09 well my point is that eulerian path problem is polynomial, while hamiltonian is NP-complete 16:36:15 oerjan: I meant you phrased it differently, not that it was different. 16:36:32 but that's undirected, not sure with directed 16:36:45 I don't see the eularian path 16:37:19 hm? when the pieces are edges, and you visit each piece once 16:37:43 oh. 16:38:21 * int-e missed a step there 16:39:59 many nodes with only two edges does help, you can collapse them 16:42:39 and then only the repeating n-1 strings will be left 16:42:49 okay, this looks plausible: there is a directed eularian circuit if a graph is strongly connected, and the indegree and outdegree of each node are equal. (without the strong connectedness, you can decompose it into circles, and by the connectedness you can glue them together into a single one) 16:43:12 (eularian paths follow) 16:44:02 int-e: um we cannot have circuits in this problem 16:44:13 they obviously give non-unique solutions. 16:44:25 oerjan: (eularian paths follow) ... we identify the two odd nodes and connect them by an artificial edge 16:44:26 although - we could add an edge from the beginning to the end 16:44:40 are we doing that thing again. 16:44:45 no 16:45:05 er end to beginning 16:45:18 which is that artificial edge 16:45:31 it's just that the eularian circuit case is nicer to characterize and reason about 16:45:40 quite so 16:46:00 now we need a uniqueness requirement. 16:46:40 constraints: "There is only one correct answer for each test case." 16:46:43 also his name was Euler not Eular hth 16:47:08 that was his last name 16:47:15 I should know. 16:48:01 I guess the "rian" is just too difficult to get right 16:48:35 * int-e is rationalizing... at least that part of the brain still works :P 16:48:46 ok the step i'm unsure of is how to decompose into circles 16:48:54 (and that's good; it's the most important part for staying sane) 16:48:55 [wiki] [[Pointer-ng]] http://esolangs.org/w/index.php?diff=45226&oldid=45188 * 93.198.137.24 * (+35) Updated download to official interpreter 16:49:23 oerjan: you just pick an edge and follow a path until you end up at the starting point... remove that circle, repeat 16:49:58 * izabera was doing that 16:50:01 hm you're right, because you still have ingoing = outgoing 16:50:42 In fact, amazingly, it's even easier than the usual parity argument for undirected graphs. 16:50:50 heh 16:51:25 ok so then it might be the gluing together... 16:51:43 that, too, should be simple 16:51:44 (trivial exercise: prove that in any eulerian graph, one can orient the edges such that indegree = outdegree for all vertices) 16:52:01 -!- mauris has joined. 16:52:24 izabera: ok so once you have decomposed it into circles, just join them in an arbitrary way 16:52:37 and you'll end up with a large one 16:52:59 and by the problem statement, it must be unique once you identify the starting/ending 16:53:08 -!- zadock has joined. 16:53:23 well unique in what string it gives, anyway 16:56:12 -!- mauris has quit (Ping timeout: 244 seconds). 16:57:16 step 1: make a dictionary of all n-1 size subpieces and their in/out pieces. 16:57:40 find the two unique ones that don't have the same number of in/out. 16:57:56 (that was step 2) 16:58:22 step 3: find a path, just by following edges, from the initial to the final subpiece. 16:58:37 (adjust the dictionary to remove the edges used) 16:58:45 -!- J_Arcane has quit (Ping timeout: 246 seconds). 16:59:22 another problem 16:59:29 step 4: while there are edges remaining in the dictionary, pick a subpiece in the dictionary that is also in the string constructed so far. 16:59:35 how do i identify the edge? 16:59:42 expand the string by a new path from that subpiece to itself. 16:59:57 let me explain 16:59:58 izabera: an edge is the same as a piece, here 17:00:04 no i mean 17:00:07 yes i know that 17:00:19 oh and they must be counted with multiplicity. 17:00:20 i mean the start/end of the cicle 17:00:32 edge in that sense 17:00:42 izabera: i told you how to identify the start/end n-1 subpieces 17:00:55 yes but 17:00:59 in that example 17:01:01 the edges will just fall into place when you complete the algorithm, i think 17:01:25 "The evil plan to hack CodeEval ranking." this is the first one i remove 17:01:57 after that, i'm left with "il-ev" "l-evi" "evil-" "-evil" "vil-e" 17:02:09 so i thought i could start from il-ev 17:02:35 izabera: no, you must choose a subpiece that is in the string so far. only vil fits, i think. 17:02:35 and if i try to build a new cycle from that, i can join all those pieces to il-evil-ev 17:02:48 i see 17:02:50 thanks 17:02:54 er, evil 17:08:55 -!- mauris has joined. 17:09:06 -!- AnotherTest has quit (Ping timeout: 260 seconds). 17:24:27 [wiki] [[RegexPL]] http://esolangs.org/w/index.php?diff=45227&oldid=45223 * Oerjan * (-13) Fix template call (only named parameters may contain =) 17:25:03 -!- AnotherTest has joined. 17:30:49 can i end up with a piece that doesn't fit in the original cycle? 17:31:12 [wiki] [[Template:Wayback]] http://esolangs.org/w/index.php?diff=45228&oldid=30812 * Oerjan * (+188) Explain how to use = 17:31:16 i mean i have the first cycle, then i find a new one, will it extend the first one? 17:32:28 no 17:32:49 but i can always find a cycle that extends the first one 17:32:53 this sounds correct 17:33:56 yeah because the graph is connected 17:34:24 -!- J_Arcane has joined. 17:39:07 [wiki] [[Pointer-ng]] http://esolangs.org/w/index.php?diff=45229&oldid=45226 * 93.198.137.24 * (+209) Added one more example 17:39:26 [wiki] [[Pointer-ng]] http://esolangs.org/w/index.php?diff=45230&oldid=45229 * 93.198.137.24 * (+6) /* Example Code */ 17:41:46 -!- gniourf has quit (Quit: Leaving). 17:42:04 [wiki] [[Special:Log/newusers]] create * Weloxux * New user account 17:44:13 -!- gniourf has joined. 17:49:09 -!- Welo has joined. 17:53:25 -!- Guest78999 has joined. 17:53:30 Hey. 17:53:38 Name's Alek. 17:53:52 If ANY OF YOU ARE ALIVE, Please Tell Me. 17:53:57 i'm mostly alive 17:54:02 Good. 17:54:39 I'm not 17:55:04 i'm a zombie 17:55:06 does that count? 17:55:29 i guess it depends on which kind of spell was used to summon you 17:55:34 -!- drdanmaku has quit (Quit: .). 17:55:36 Okay... 17:55:54 Still 17:56:15 fungot: u alive? 17:56:16 izabera: " sometimes known as crew". really? i've never seen a such bad situation in his screenplay but also included a scene from the " s", they were lower in social position than the arabs and berbers, and were fnord it around! odd! fnord 15:09, 12 aug 2004 ( utc) 17:56:57 IRC SPAM?! 17:57:08 unbelievable 17:57:25 That. Was Too Long. 17:57:48 i want to dye my hair pink 17:57:58 ... 17:57:58 not pink like the girl from lazy town 17:57:59 izabera: sounds good 17:58:03 Oh Well. 17:58:04 Bye. 17:58:05 more like pastel pink 17:58:06 -!- Guest78999 has left. 17:58:35 fungot: please explain Guest78999 17:58:35 int-e: ' ' the new york times mainly uses kiev. the times style guide http://www.timesonline.co.uk/ tol/ fnord/ fnord fnord 17:58:50 thanks, that made more sense than the actual person 17:58:54 :D 17:59:17 does it always quote fnord? 17:59:24 is that a fnord mode or something? 17:59:48 if I remember correctly, "fnord" is a placeholder for rare words that didn't make it into the language model's dictionary 18:00:19 (not sure how fizzie deals with actual occurrences of "fnord") 18:01:36 http://arin.ga/L249tM/raw ok i submitted this and it scores a whopping 5% 18:01:44 guess i'm doing something wrong 18:01:48 not sure what <.< 18:02:32 it solves their example and all the ones i came up with >.> 18:03:35 with 20 tests, 5% is just what you'd expect if it solves _only_ that example, right :P 18:04:01 can you show an example that fails? 18:04:02 what is the input format there... 18:04:11 it's |piece|piece|piece| 18:04:57 |a|a| doesn't work, for example 18:05:44 i don't think that's valid input <.< 18:06:14 ok it is but still 18:06:33 that's pretty degenerate 18:06:35 hmm, "The minimum length of a piece of text is 8" 18:06:35 sigh 18:06:40 \o/ 18:06:53 izabera: are you really making a cycle initially? 18:06:57 yes? 18:07:03 i hope so? 18:07:14 how do you deal with the initial and final pieces 18:07:53 i start with the first piece in that list, try to extend it as much as i can, and call what i get a cycle 18:08:35 initial and final pieces should be part of that first cycle 18:08:50 i don't see how you can get the initial piece 18:09:00 why not? 18:09:13 or, hm, are you going in both directions 18:09:16 yes 18:09:23 in the first cycle i am 18:09:26 ah. 18:09:36 well, it's a "path", not a cycle, anyway :P 18:09:46 ok 18:09:54 anyway it bails out at the first error 18:10:04 so it solves the first one, then gets an error 18:10:06 a hunch: what happens if your test includes strange chars that bash might have trouble with? 18:10:10 (e.g. ') 18:10:11 so it could potentially solve more than 1 18:10:20 no problem with any character 18:10:31 hmph 18:11:07 i'll change the exit to a break and resubmit, let me see how bad it is 18:11:34 izabera: um how are you reading the input, it's supposed to come from a file given on the command line 18:11:56 -!- mroman has quit (Quit: Lost terminal). 18:11:57 while loop in line 41 18:12:16 oh i didn't notice the < "$1" at the end 18:12:56 cool, now it timeouts 18:17:13 fancy 18:17:17 -!- oerjan has quit (Quit: Later). 18:25:19 if you start with substrings of length 2 of a^40b^40...y^40, then it does take a while to reconstruct the string 18:25:59 and that's still true if you change the piece length to 8 18:26:25 or 28 18:27:09 ("a while" meaning several seconds: about 5 here) 18:29:53 (concrete input: http://int-e.eu/~bf3/tmp/something) 18:30:13 oh god int-e wtf is that 18:30:45 izabera: well, try your bash script on it... burn a bit of CPU. 18:32:39 (I think this is within the parameters: pieces of length 28, and there's 973 of them) 18:34:15 Hmm, the file also produces unintended but interesting visual effects at various line break lengths, fun... 18:37:17 e.g. http://int-e.eu/~bf3/tmp/something.png 18:41:19 (I have not tried to figure out why it's slow; note that the order that the pieces are given in matters... so this may be far from the worst case) 18:42:05 -!- hppavilion[1] has joined. 18:44:35 -!- zadock has quit (Ping timeout: 264 seconds). 18:52:35 -!- Welo has quit (Quit: Leaving). 18:54:49 so it just times out even if my code is fine 18:54:51 great 18:55:38 -!- hppavilion[2] has joined. 18:56:22 actual input i managed to get from the site, + solution produced by my code http://arin.ga/3eZ8kV/raw 18:56:56 -!- zadock has joined. 18:57:10 -!- hppavilion[1] has quit (Ping timeout: 240 seconds). 18:58:38 -!- atrapado has joined. 19:16:51 why isn't mroman here 19:22:49 int-e: The png looks FAST. 19:23:44 Just, you know, æsthetically. 19:25:03 -!- Phantom_Hoover has joined. 19:26:23 pbbbt 19:27:13 @tell boily Give me an upboat: http://codegolf.stackexchange.com/questions/62732/implement-a-truth-machine/63402#63402 19:27:13 Consider it noted. 19:27:34 fizzie, oh wow it does 19:28:19 lightning! 19:30:49 where in england is "not" pronounced like "naught"? is it like the whole country or something? 19:31:03 I don't 19:31:09 So it's not the whole country 19:31:16 oh okay 19:31:18 hmm, english pronunciation i a knotty business 19:31:27 and a naughty one too 19:31:55 naught / not / knot was indeed my inspiration 19:32:38 but i know it's said that way in brighton... the kooks guy does it 19:33:21 in the U.S., e.g. Cali, the vowel shift moves in the other direction 19:34:00 (i.e. the "cot" side of the cot/caught merger) 19:34:40 i'm pretty sure england is an esolang 19:37:03 i like how 'compiler language with no pronounceable acronym' has a perfectly pronouncable acryonym in welsh 19:39:13 Kinda like cloonpa, right? 19:39:28 No, that would by CLYNPA 19:39:32 Maybe? 19:39:37 I don't know Welsh phonetics 19:43:33 oh man. it was a strange day today. 19:43:38 Looking it up, I think it'd be cloonpa 19:43:45 b_jonas, what happened? 19:44:13 Taneb: work stuff. complicated meeting where we actually talked about lots of relevant stuff, even if we didn't quite see eye to eye. 19:44:27 we definitely couldn't solve everything, but at least know more about what each of us thinks should be solved. 19:44:57 So basically, I waited for the meeting because some people were busy so it had to be delayed and then delayed again, 19:45:10 then participated on the complicated meeting and asked stupid questions and took notes, 19:45:23 then wrote a memo which was difficult because it was a long meeting with lots of things said, 19:45:38 but still had to be done so that later people can't claim they don't remember what happened on the meeting, 19:45:55 and in the middle of this I did lots of other small things that had to be done. 19:46:55 Like, with changes in how some procedures are done at the job, which are for the better in the long term, but cause a little hitch when we change to it, and people don't always know what's happening and say contradictory things. 19:49:43 Today I wrote a FizzBuzz that calls C (indirectly) from Agda 19:50:40 Taneb: great! 19:56:13 [wiki] [[DStack]] http://esolangs.org/w/index.php?diff=45231&oldid=45168 * -Dark-Phantom- * (-219) New instructions, string literals and improved examples 19:56:47 b_jonas, https://github.com/Taneb/AgdaCBuzz 19:57:22 Build instructions are non-existent, but it's cabal install ==> compile the agda file 20:05:39 I'm happy with my command prompt design :) 20:05:44 -!- hppavilion[2] has changed nick to hppavilion1. 20:05:48 [wiki] [[Hello world program in esoteric languages]] http://esolangs.org/w/index.php?diff=45232&oldid=45159 * -Dark-Phantom- * (-60) /* DStack */ 20:06:17 -!- hppavilion1 has changed nick to hppavilion[1]. 20:06:23 [wiki] [[List of quines]] http://esolangs.org/w/index.php?diff=45233&oldid=45169 * -Dark-Phantom- * (-439) /* DStack */ 20:06:24 There we go 20:06:55 [wiki] [[Truth-machine]] http://esolangs.org/w/index.php?diff=45234&oldid=45160 * -Dark-Phantom- * (-10) /* DStack */ 20:07:09 -!- Patashu has joined. 20:18:57 -!- zadock has quit (Quit: Leaving). 20:29:00 -!- hppavilion[1] has quit (Ping timeout: 250 seconds). 20:33:58 -!- _leaf_ has joined. 20:34:35 -!- hppavilion[1] has joined. 20:37:12 -!- hppavilion[2] has joined. 20:39:24 -!- hppavilion[1] has quit (Ping timeout: 250 seconds). 20:45:54 -!- Patashu has quit (Ping timeout: 250 seconds). 20:57:03 -!- Frooxius has quit (Quit: *bubbles away*). 20:57:06 -!- ^v has joined. 21:24:45 fungot, ais523 still hasn't returned? 21:24:45 b_jonas: fnord/ court/ state/ fnord. -user:splashsplashsmallsupuser talk:splashtalk/sup/small 00:24, 26 january 2007 ( utc)) 21:30:01 -!- TieSoul has quit (Read error: Connection reset by peer). 21:36:13 [wiki] [[SPLEMIT21]] N http://esolangs.org/w/index.php?oldid=45235 * 93.198.137.24 * (+1090) Created page with "SPLEMIT21 ''(short for Shortest Programming Language Ever Made In The 21st [Century])'' is a joke language developed by [http://twitter.com/fucketh1cs Maximilian Krause aka fu..." 21:37:54 [wiki] [[List of quines]] http://esolangs.org/w/index.php?diff=45236&oldid=45233 * 93.198.137.24 * (+24) /* Cheating Quines */ SPLEMIT21 21:40:19 -!- hppavilion[2] has quit (Ping timeout: 240 seconds). 21:50:54 do you say 'the omega+1-st step' ? 21:51:33 or 'the omega+1-th step' ? 21:52:34 izabera: "the step of index omega plus one", or "on the day omega plus one" 21:52:55 izabera: oh, you mean which of "st" or "th" suffix you use? probably "st" because English is crazy 21:53:04 yeah that 21:55:51 i guess + changes the normal rules 21:57:32 -!- hppavilion[2] has joined. 22:03:02 I now have an editor made solely for manipulating the default filesystem for my OS 22:04:28 a fs editor? 22:04:46 what does it do? 22:05:49 izabera: It allows me to manipulate files outside of the OS for convenience 22:06:09 No way to create a new file though, at least not yet 22:07:58 hppavilion[2]: can it grow the size of an existing file? 22:08:27 b_jonas: I believe so; I mean, no reason it wouldn't be able to 22:08:58 I'm using python for this (so it's not a "real" OS), meaning that I don't have arbitrary limitations like I would in C or the like 22:10:11 hppavilion[2]: finding where the bytes of the file are located by reading the metadata is easy. you have to know more about the fs than that if you also want to modify the metadata to allocate space for growing the file and associating that space with the file. 22:10:58 if you know where the bytes are stored, you can modify them directly, that much is easy. 22:11:18 this may depend on the details of file system, sure, but still 22:12:19 b_jonas: I'm storing the FS in JSON xD 22:12:40 It's saved to disk as a ".fsys" file (windows) that is really just a subset of JSON 22:13:22 that sounds strange for a filesystem, but ok 22:13:42 b_jonas: I mean that that's how it's stored when the OS is closed, so that you can go back to it later 22:14:26 does your fs allow storing arbitrary byte sequences as file content? if so, how do you encode that to json? 22:15:31 -!- atrapado has quit (Quit: Leaving). 22:15:35 b_jonas: Yes it does; the file data is just a string. 22:15:56 ALL files are like that, if you're willing to abuse ASCII 22:16:54 you can't seek if you have to decode json 22:17:24 izabera: ? 22:17:31 Can't seek as in...? 22:17:41 as in "go to byte 12345 in this file" 22:18:14 hppavilion[2]: the input of JSON encoding is a deep structure that contains character strings, and the output is a character string (often encoded as UTF-8, which is recommended for JSON). 22:18:49 hppavilion[2]: if you want to store binary strings, you have to somehow encode them to character strings, or else you won't know what backslash escapes to use for characters that you can't represent literally. 22:19:00 izabera: Ah. I can do that, because I decode it to Python Dicts on loading. I think that works. 22:19:20 b_jonas: I used the json module, which seems to handle everything like that for me xD 22:19:30 I'm doing this the cheaty way 22:20:06 ah, so basically you don't know what your code does. ok. 22:20:24 that could work. 22:20:45 b_jonas: That's how programming works xD 22:21:16 I don't so much "Not know what my code does" as "Using external services and tools to do the heavy lifting, which I need not understand because they're complicated" 22:21:29 "But they work, so it's OK" 22:21:38 "And they're open-source, so it's doubly-OK" 22:21:38 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 22:22:03 -!- Phantom_Hoover has joined. 22:36:02 -!- AnotherTest has quit (Quit: ZNC - http://znc.in). 22:36:52 -!- sacadouche has joined. 22:38:11 list 22:40:09 -!- bb010g has quit (Quit: Connection closed for inactivity). 22:42:26 `welcome 22:42:32 -!- _leaf_ has quit (Ping timeout: 272 seconds). 22:42:34 `welcome sacadouche 22:42:38 aww come on 22:42:39 sacadouche: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on EFnet or DALnet.) 22:42:40 Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on EFnet or DALnet.) 22:42:50 did i lag or HackEgo did? 22:43:22 -!- hppavilion[2] has quit (Ping timeout: 272 seconds). 22:43:23 -!- Phantom_Hoover has quit (Ping timeout: 252 seconds). 22:43:43 I think you did 22:44:09 -!- hppavilion[2] has joined. 22:44:11 :( 22:46:14 [wiki] [[Talk:Esoteric Operating System]] http://esolangs.org/w/index.php?diff=45237&oldid=43607 * Hppavilion1 * (+129) /* Making one */ new section 22:46:24 -!- hppavilion[2] has changed nick to hppavilion[1]. 22:48:41 I would like someone to define a command-line shell inspired by BF (because it's like the crowning esolang, despite its flaws (namely, the derivatives)). I can implement it. 22:48:48 SQLite now includes an extension to read/write JSON (although I also have my own extension to read JSON data with SQLite; my own doesn't write though) 22:51:03 hppavilion[1]: I wouldn't know how to define such a thing (as I cannot think of it right now), although if I do I will tell you; but probably you or someone else to figure it out. 22:53:26 I'm making the shape of the FileSys a digraph. 22:54:26 If you want to make it a graph then you might use RDF though, rather than JSON 22:56:17 zzo38: Well it's a digraph, which is fairly easy to represent with JSON 22:57:20 Perhaps a HYPERgraph would be more Eso... 22:57:49 zzo38: What do you think about a hypergraph filesys? 22:59:09 Maybe later. Don't know yet how to make that work 22:59:26 I don't know either, but if you do know how to make it work, go ahead and try please! 23:01:12 You certainly can represent a digraph with JSON, although I think RDF would work better for this purpose. For a hypergraph you will need to do something more (it can also be represented with RDF easily enough, I expect) 23:01:59 -!- boily has joined. 23:02:34 i thought you used json because objects form a tree-like structure 23:02:47 -!- Phantom_Hoover has joined. 23:03:39 i don't see how a generic graph is easy to represent with json 23:03:46 JSON is good for tree-like structure yes 23:06:35 what happens when a YAML parser parses a mutually recursive structure? 23:06:51 <> :edges [:v _:v1, _:v2, _:v3], [:v _:v2, _:v3], [:v _:v3, _:v5, _:v6], [:v _:v4]. # It is one possible way you may represent a hypergraph in RDF; you could even have more than one that shares nodes in this way 23:07:09 -!- oerjan has joined. 23:07:47 @massages-loud 23:07:48 quintopia said 3h 40m 34s ago: Give me an upboat: http://codegolf.stackexchange.com/questions/62732/implement-a-truth-machine/63402#63402 23:08:52 @tell quintopia the upboat was gladly given! :D 23:08:52 Consider it noted. 23:09:07 implement a pooch machine 23:09:29 hellochaf. pooch? 23:09:51 @tell quintopia heh, nice usage of "-ai". 23:09:51 Consider it noted. 23:10:31 boily: pooch 23:11:09 boily: apparently it means cabot hth 23:12:06 ah, un cabot! 23:12:28 tdh. 23:12:54 boily: its the fastest way to subtract large nums 23:13:08 boily: http://i.imgur.com/9n3q5pV.gifv 23:14:30 PURE UNDILUTED WIZZARDRY! 23:14:57 what is diluted wizardry like? 23:15:18 <-- i guess you need some kind of faster dictionary that allows you to quickly find the neighboring nodes and edges 23:15:21 oops 23:15:26 so it just times out even if my code is fine <-- i guess you need some kind of faster dictionary that allows you to quickly find the neighboring nodes and edges 23:15:52 don't know if bash has anything 23:15:56 it does 23:16:00 associative arrays 23:16:15 i was trying to improve it but then i started playing online <.< 23:16:19 The JSON1 extension of SQLite does not include aggregate functions. 23:17:11 izabera: Fentimans. 23:17:32 boily: you didnt vote :( 23:18:21 quintopia: yes I did, but because I just created an account it's not publicly visible :( 23:18:41 (I need 15 reputations for it to become public.) 23:18:48 hm you can vote immediately? 23:19:29 I can, and I get a nice small informative blue popup telling me I need to build more reputations. 23:19:50 well i didn't know it actually _saved_ your vote? 23:19:57 as opposed to ignoring it 23:20:46 Thanks for the feedback! Once you earn a total of 15 reputation, your votes will change the publicly displayed post score. 23:20:58 but then i didn't try voting in that short timespan 23:21:12 i probably didn't even register properly 23:21:18 :/ 23:21:44 uh oh 23:21:49 boily is too disreputable to vote? 23:22:06 i recall i waited about a year before i turned my loginless account into a proper one, and only because the cookie expired so it was the only way to get it back 23:22:49 boily: btw if you have enough rep on another SE account you can get 100 free by linking them 23:23:02 yeeeeesh... 23:29:05 -!- hppavilion[2] has joined. 23:29:20 `? yeeeeesh 23:29:21 yeeeeesh? ¯\(°​_o)/¯ 23:29:47 the only place i know yeeeeesh from is the Mutts comic 23:29:53 well, yesh 23:31:27 -!- hppavilion[1] has quit (Ping timeout: 244 seconds). 23:36:10 -!- dtscode has changed nick to nchambers. 23:52:01 -!- boily has quit (Quit: KNIT CHICKEN). 23:55:50 -!- hppavilion[2] has quit (Ping timeout: 240 seconds).