00:00:01 woot? 00:00:02 !sadol !a 00:00:09 ? 00:00:26 !sadol !"3oso 00:00:47 it is BROKEN?!?!?!?!?! 00:00:52 :DD 00:01:02 but, does it print lists? 00:01:10 of crs 00:01:17 good 00:01:24 !$3123 => (1 2 3) 00:01:28 only one character names for funcs etc? 00:01:33 yea 00:01:40 that's no good :\ 00:01:49 but you've got scopes 00:01:58 trues. 00:02:48 and u can do things like ~f2 ?=#_00 {something} ?=#_01 {something else} {...} 0 00:03:02 lists are passed by reference? 00:03:24 and then f0a is not the same as f1a 00:03:39 oh, who knows :d 00:04:04 :O 00:04:12 hard to make a binary sort if not... 00:04:17 oh 00:04:19 it's not 00:04:28 globals exist 00:04:41 make a function that takes list as a parameter and returns new list 00:04:42 fuck 00:04:52 i was thinking of a sort again... 00:04:58 search is trivial 00:05:05 just wait a few hours... 00:05:08 :D 00:05:18 http://regedit.gamedev.pl/BDSM/bubblesort.sad 00:05:22 a bubblesort 00:06:13 booblesort is the best 00:06:16 *bubble 00:07:36 boob le sort 00:09:05 (.)Y(.) 00:14:14 g2g bye 00:14:24 -!- nooga has quit. 00:18:58 -!- jix_ has quit ("Bitte waehlen Sie eine Beerdigungnachricht"). 00:22:53 -!- oerjan has quit ("Good night"). 00:37:38 -!- ihope__ has changed nick to ihope. 00:40:30 lol 00:40:38 35 min to do a search :) 00:40:47 hard lang to debug... 01:15:01 -!- calamari has quit ("Leaving"). 01:31:45 -!- tgwizard has quit (Remote closed the connection). 01:52:16 GregorR: Like the changes in the current Plof build. 01:52:36 Still doesn't have my for semantics, but. . . 01:54:25 i made quicksort, where 01:54:28 's the guy :\ 01:55:37 ~p1(3(2:b:a$0:s#:l#_00@#l-01?-1>:i[ls]ai]bi$2ab~q1?<#:f#_0-012f+q#:apf0q#a1 01:55:44 nice lang 01:56:15 !sadol 01:56:18 !sadol !5 01:56:27 why is it not working? :( 01:57:19 for({init},{while},{update},{code}); 01:57:33 i see 01:57:35 is how I would do it 01:57:42 oklopol: that wasn't for you 01:57:57 i know 01:58:02 :D 01:58:24 it was for pikhq, GregorR 01:58:42 i figured it right after i'd said my thing 01:58:45 as usual 01:58:49 :) 02:05:26 bsmntbombdood: And that's my modified for semantics. 02:05:41 Oh 02:05:59 for(reference, {while}, {update}, {code}); is what's current. 02:06:11 And update is evaluated before code. 02:06:22 (that is, in his current version) 02:06:32 what's reference? 02:06:39 A reference to a variable. 02:06:44 Like a pointer. 02:06:56 what for? 02:07:16 Well, sort-of like a pointer. . . 02:07:38 It's so that the variable is in the scope of while, update, and code. . . 02:07:55 odd 02:07:58 Which is pointless, since that variable is *already* in their scope. 02:08:18 It's a piece that was written *before* his interpreter. 02:10:04 I think it was before his scoping rules were fully defined, as well. 02:18:54 -!- pikhq has quit ("leaving"). 02:27:57 hmmm... 02:28:12 I need a language whose entire behavior is undefined. 02:28:23 maybe C? -evil snicker- 02:28:34 i have one 02:29:08 it's called zut 02:29:26 or gla 02:29:31 the name is not defined 02:30:07 god 4:24 sleep -> 03:11:02 sleep is for the weak 03:51:07 -!- Sgeo has joined. 03:51:08 hi Sgeo! 03:51:22 Hi 03:51:24 Is that a bot? 03:51:33 lol 03:51:42 pikhq: Stop making fun of me :P 03:51:48 erm 03:52:00 I mean, is it an automatic action to greet me? 03:52:25 Lesse 03:52:26 -!- GregorR has left (?). 03:52:39 -!- GregorR has joined. 03:52:39 hi GregorR! 03:52:51 Yes it is 03:56:04 heh 03:56:08 * bsmntbombdood hides 03:57:04 -!- bsmntbombdood has left (?). 03:57:04 -!- bsmntbombdood has joined. 03:57:04 hi bsmntbombdood! 03:57:14 * bsmntbombdood giggles 03:57:28 ~exec print [i[0].pattern for i in self.raw_regex_queue] 03:58:32 ~exec for i in raw_regex_queue: i[0].pattern != '.*JOIN :#esoteric.*' or self.raw_regex_queue.remove(i) 03:58:32 hi bsmntbombdood! 03:58:36 -!- bsmntbombdood has left (?). 03:58:37 -!- bsmntbombdood has joined. 03:58:37 hi bsmntbombdood! 03:58:47 urgh 03:59:02 ~exec for i in self.raw_regex_queue: i[0].pattern != '.*JOIN :#esoteric.*' or self.raw_regex_queue.remove(i) 03:59:08 -!- bsmntbombdood has left (?). 03:59:10 -!- bsmntbombdood has joined. 03:59:17 there we go 04:00:00 hms? 04:00:08 hms? 04:02:45 What is the code thingy? 04:02:52 ? 04:03:44 my bot? 04:04:41 What did you change? 04:04:43 And what lang? 04:04:49 python 04:05:13 And the "~exec for i in self.raw_regex_queue: i[0].pattern != '.*JOIN :#esoteric.*' or self.raw_regex_queue.remove(i)" took out the on-join hello message thing 04:08:44 ~exec self.raw("PRIVMSG #esoteric :hai2u") 04:08:44 hai2u 04:12:01 -!- beastman has joined. 04:12:12 hello, beastman! 04:12:18 hi 04:12:32 please write "hello world" 04:12:39 ~exec self.register_raw(".*(JOIN) :#esoteric.*", lambda x : bot.raw("PRIVMSG #esoteric :hi %s!" % re.compile("^:(\S+)!.*").match(x).group(1))) 04:12:51 ~raw PRIVMSG #esoteric hello world 04:12:51 hello 04:12:58 ~raw PRIVMSG #esoteric :hello world 04:12:58 hello world 04:13:10 :P 04:13:28 Please, some one write the first 16 numbers of the Fibonacci Sequence. 04:14:00 http://esoteric.voxelperfect.net/wiki/IRP 04:15:25 -!- beastman has left (?). 04:18:00 :( 05:40:12 -!- Sgeo has quit (Remote closed the connection). 06:00:35 -!- anonfunc has joined. 06:00:35 hi anonfunc! 06:01:14 hello, bot 06:18:13 hehehe 06:18:50 that's funny 07:09:43 -!- oerjan has joined. 07:09:43 hi oerjan! 07:19:33 1,1,3,5,8,13,21,34,55,89,144,233,377,610,987 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 10:21:35 1,1,2,3,5,8,13,21,... 10:21:46 er sec 10:22:20 yep 10:22:36 darn 10:23:06 that's what i get for trying to calculate by hand 10:23:59 or rather, memorizing the start 11:38:04 -!- oerjan has quit ("Later"). 11:44:56 -!- tgwizard has joined. 11:44:56 hi tgwizard! 12:20:26 -!- jix_ has joined. 12:20:27 hi jix_! 12:20:38 moin 13:02:16 -!- ihope has quit (Connection timed out). 13:09:08 -!- gerard_ has joined. 13:09:08 hi gerard_! 13:09:28 hi bsmnt_bot! 13:56:56 !help 15:07:40 -!- gerard_ has quit ("Leaving."). 16:21:20 -!- meolox has joined. 16:21:20 hi meolox! 16:21:43 print "test" || die "I'm dead for no reason" 16:25:29 cout << anyonethere ? "yes" : "no"; 16:27:48 -!- meolox has left (?). 17:30:02 why is the guy not here 17:30:04 :\ 17:32:44 ~exec self.raw_regex_queue.pop() 17:49:37 -!- calamari has joined. 18:10:53 :( 18:11:01 there already was a quicksort on the page 18:17:07 -!- okokokoko has joined. 18:17:08 -!- oklopol has quit (Read error: 54 (Connection reset by peer)). 18:17:52 -!- okokokoko has changed nick to oklopol. 18:58:30 hmmm... Lua looks pretty cool. 19:05:09 -!- oerjan has joined. 19:12:26 -!- calamari has quit (Read error: 104 (Connection reset by peer)). 19:21:56 -!- okokoko has joined. 19:22:14 -!- oklopol has quit (Read error: 54 (Connection reset by peer)). 19:28:03 * CakeProphet is looking for a new language to play around with... 19:28:18 something relatively unknown, and usable. 19:33:41 -!- calamari has joined. 19:44:06 -!- okokoko has changed nick to oklopol. 19:45:02 -!- oklobot2 has joined. 19:45:12 it has a language! D: 19:46:54 i'll now prove it to be turing complete 19:47:05 !exec "Hello, world!"PrntNl 19:47:08 Hello, world! 19:57:29 !exec "Hello, world!"PrntNl 19:57:32 Hello, world! 19:58:16 !exec "Argle bargle, glof glyp!"PrntNl 19:58:20 Argle bargle, glof glyp! 19:59:29 ok, it passed the Turing test in reverse :) 20:00:25 !exec "Argle bargle, "PrntNl "glyp glof!"PrntNl 20:00:28 Argle bargle, 20:00:32 glyp glof! 20:01:06 CakeProphet: D 20:01:23 E 20:01:59 (yes, there is a relatively unknown language named E) 20:02:12 :? 20:03:05 bah... 20:03:09 those damn letter languages. 20:03:12 too many of them! 20:03:52 In that case, 20:03:54 CakeProphet: Plo 20:03:54 in fact there appear to be at least two E languages 20:03:55 Erm 20:03:56 CakeProphet: Plof 20:04:20 i was referring to the secure distributed one 20:05:48 I may check out Alice... solely because it has a cool name. 20:05:51 * CakeProphet is shallow. 20:05:59 "E" is too bland of a name for my enjoyment. 20:07:39 !exec 5["Many hellos!"PrntNlDrp1SubDbl] 20:07:40 "Plof" is a cool name :P 20:07:42 Many hellos! 20:07:45 try programming in pure System F :) 20:07:46 Many hellos! 20:07:48 stupid lang 20:07:50 Many hellos! 20:07:54 stfu 20:07:54 Many hellos! 20:07:58 Many hellos! 20:08:41 hmm 20:11:22 !exec 3["Many hellos!"PrntNl1Sub] 20:11:25 Many hellos! 20:11:30 Many hellos! 20:11:32 Many hellos! 20:11:38 Many hellos! 20:11:42 Many hellos! 20:11:42 whoops 20:11:45 Many hellos! 20:11:49 Many hellos! 20:11:53 Many hellos! 20:11:56 CakeProphet: I know of A, B, C, D, and now E. 20:11:56 ... 20:11:56 Many hellos! 20:12:01 Many hellos! 20:12:06 Many hellos! 20:12:09 Many hellos! 20:12:13 Many hellos! 20:12:16 Many hellos! 20:12:21 Many hellos! 20:12:26 Many hellos! 20:12:28 Many hellos! 20:12:34 Many hellos! 20:12:36 Many hellos! 20:12:43 :DD 20:12:44 If only IRC servers followed the timeout principle of yesteryear. 20:12:44 Many hellos! 20:12:45 Many hellos! 20:12:49 Many hellos! 20:12:51 -!- oklobot2 has quit (Read error: 104 (Connection reset by peer)). 20:12:52 i seem to have seriously misunderstood the [] command 20:13:04 it does a drop 20:13:10 BURN HIM BURN HIM BURN HIM!!! 20:13:11 why? don't ask me 20:13:12 xD 20:13:25 PrntNl doesn't do a drop 20:13:30 why? same reason 20:13:35 What language is this? 20:13:44 no name 20:13:52 just made it when i did the bot 20:13:53 i thought it worked like BF, and the Drp and Dbl were redundant 20:14:03 What sort of a language is NoName? 20:14:07 nope, stack-based, ut brainfuck [] 20:14:17 *but 20:14:26 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ that sort 20:14:35 Aha. 20:15:06 you can do a lot of useless stuff with it but outputting sucks so i don't use it that much 20:15:32 very buggy, also, one night project :) 20:15:35 !exec 42PrntNl 20:15:46 overkill 20:15:58 ah it's gone 20:16:07 -!- oklobot2 has joined. 20:16:08 retry 20:16:11 !exec 42PrntNl 20:16:16 42 20:16:21 What's oklobot2 written in? 20:16:24 c++ 20:16:30 AH 20:16:37 EGAD, FELLOW! 20:17:02 :D 20:17:42 0["test"PrntNl] 20:17:51 !exec 0["test"PrntNl] 20:17:56 !exec 42 1 2 3SubSubSub2MulPrntNl 20:17:57 EgoBot is written in C++ *shrugs* 20:17:58 80 20:18:21 who wrote it? 20:18:32 oklopol: Take a wild guess :P 20:18:43 i took already :) 20:18:45 gregor? 20:18:53 You may be correct! 20:19:00 all of it? 20:19:06 it knows a lot of langs! 20:19:16 !eval ++1 2 3 20:19:18 ++1 2 3=6 20:19:23 infix = xD 20:20:04 !exec 2 1PrntNlDrpPrntNl 20:20:08 1 20:20:09 GregorR we could do some steamy code swapping but my code is too dirty 20:20:11 2 20:20:27 Also, my code is already out there available. 20:20:33 Forth is still the best stack based language I've seen. 20:20:38 !exec 2 1SwpPrntNl 20:20:40 2 20:20:50 oklobot2: Please tell me you write C++ code like GregorR does. 20:20:54 GregorR, link, please 20:21:13 :D 20:21:18 me or the bot? 20:21:28 http://www.esolangs.org/files/egobot/ 20:21:50 oklopol: actually Gregor wrote the IRC code and the interface which executes processes et al; the languages are the actual interpreters by various authors, I think you mean that 20:22:18 Yeah. 20:22:25 zap. 20:22:40 And in various languages :) 20:22:53 Hey, y'all who know Forth. 20:22:57 hey can i include langs in it if i make em? :O 20:23:03 Anyone up for a Forth IRC library? 20:23:56 20:24:15 <-- does not know Forth 20:24:33 oklopol: So long as they have no I/O other than std{in,out} 20:24:33 You know too few languages GregorR :P 20:24:34 oklopol: GregorR is the one who has to include them since he's who runs the bot, but you can run your own instance and incorporate a language written by you 20:25:26 I knew a bit of forth like... 25 years ago or something 20:25:43 It's pretty easy to learn. 20:25:44 (damn, now I feel overaged) 20:26:18 !exec 0 5[Dbl1SubDbl]Drp[MulSwpDbl]DrpPrntNl 20:26:21 120 20:26:23 GregorR does the bot take input? 20:26:39 !exec 0 10[Dbl1SubDbl]Drp[MulSwpDbl]DrpPrntNl 20:26:41 3628800 20:26:59 I challenge the community to make an alternative to EgoBot in CL or Forth. 20:27:07 you can't seriously be able to use that, oerjan? 20:27:19 bwahaha! 20:27:32 like my factorial program? :) 20:27:45 :) 20:28:33 Swp 20:28:38 how? 20:28:50 i just guessed Swp 20:28:55 and Mul 20:29:03 no, you used that above 20:29:09 oh i might've 20:29:24 you're sick 20:29:42 although i could have used just one loop if i knew what command does deep copy :) 20:30:02 there is a Rot 20:30:04 for 3 20:30:18 hm... 20:30:20 deep copy? 20:30:25 oklopol: 20:30:28 !help i 20:30:35 !help i? 20:30:41 getting a copy of something not on top of the stack 20:30:42 Oh wait, that's right - Hahahah 20:30:46 I disabled it last night :P 20:30:50 It still hasn't pinged out. 20:30:52 Incredible. 20:30:57 -!- EgoBot has quit (Read error: 104 (Connection reset by peer)). 20:31:01 :D 20:31:04 YOu were saying? 20:31:05 ;D 20:31:13 That wasn't a ping timeout. 20:31:13 oerjan, there is no way to do that 20:31:18 :D 20:31:20 Oh. True. 20:31:28 yet, you want? 20:31:28 -!- EgoBot has joined. 20:31:31 !help i 20:31:33 Use: i Function: send input to a process 20:31:46 however i can copy the second item by combining Rot and Dbl. 20:31:53 let's see... 20:32:04 yes, but you cannot copy the nth item 20:32:13 it don't think it's turing complete 20:32:15 You should add in capability for words, like Forth. 20:32:28 me of gregor? 20:32:35 You oklopol. 20:32:43 That way you can extend the language, kinda. 20:32:44 !exec "Sukoshi""o"SubPrntNl 20:32:47 Huh? 20:32:48 Sukshi 20:32:50 The phrase "me of Gregor" 20:32:57 Is how a caveman asks if I'm his father. 20:33:08 xD 20:33:08 *or 20:33:16 I ... have... the POWER!!!! 20:33:20 !exec 1 2 3RotPrntNl 20:33:23 Huh? 20:33:24 1 20:33:32 Poor EgoBot. 20:33:43 I'm so confused! 20:33:49 :) 20:34:13 oerjan, i've made fibonacci and factorials 20:34:27 and primes, tho don't remember what actually 20:34:30 something with them 20:34:43 !exec 1 10[DblRotMulSwp1SubDbl]DrpPrntNl 20:34:45 Huh? 20:34:46 3628800 20:35:08 simpler that way 20:35:10 you cannot concatenate numbers into a string yet 20:35:26 simpler than? 20:35:32 ah 20:35:34 than using two loops 20:35:40 i thought it was c/v 20:35:50 shame on me 20:36:11 Anyone accept my challenge?! 20:36:13 c/v? 20:36:24 copypaste 20:36:25 No. The EgoBot thing. 20:37:08 i don't know actually whether nums and strings can be concateneted 20:37:11 *ated 20:37:23 so i'll crash the bot now, prolly 20:37:29 !exec "o"6AddPrntNl 20:37:34 Huh? 20:37:56 survived but couldn't do it :) 20:38:30 darn 20:39:52 it _might_ still be Turing complete. We have free use of three variables which should give us a universal Minsky machine. 20:40:19 make a bf compiler :) 20:40:23 :DD 20:40:34 but, seems it is supported already 20:40:44 although that assumes bignums 20:41:00 there seems to be a special error type 20:41:34 oklobot has only implementation spesific range for the nums 20:42:07 !exec 4 "a"4Add Drp PrntNl 20:42:09 4 20:42:09 Huh? 20:42:19 the error was dropped 20:42:35 i'll change it now, ayway 20:42:37 *any 20:42:41 !exec 3"test"MulPrntNl 20:42:43 Huh? 20:42:44 testtesttest 20:42:53 yay! 20:44:13 :D 20:44:43 !exec 6"test"Mul"test"2MulSubPrntNl 20:44:46 Huh? 20:44:47 testtesttesttest 20:45:57 !exec 6"42"AddPrntNl 20:46:00 Huh? 20:46:33 !exec 42 6DivPrntNl 20:46:36 Huh? 20:46:36 7 20:47:00 !exec "TestTest"2DivPrntNl 20:47:04 Huh? 20:47:13 i might have it now 20:47:15 but gotta reboot 20:47:20 -!- oklobot2 has quit (Read error: 104 (Connection reset by peer)). 20:47:35 have what? 20:47:42 -!- oklobot2 has joined. 20:47:49 !exec 4" elephants"AddPrntNl 20:47:51 elephants 20:47:52 Huh? 20:47:54 ... 20:47:57 almost :) 20:48:17 !exec 65"elephants"AddPrntNl 20:48:18 Huh? 20:48:20 elephants 20:49:13 hmph 20:49:14 i blame the compiler 20:49:17 -!- oklobot2 has quit (Read error: 104 (Connection reset by peer)). 20:49:41 k it crashed 20:49:46 the compiler 20:49:55 as i closed the bot 20:50:10 vc++6, gotta recommend it 20:50:48 heh, a few days ago I stumbled upon gcc bug 28545 20:51:12 which is? 20:51:21 a miscompiled mul 20:52:00 squaring a variable multiplied it with the wrong register 20:52:30 -!- oklobot2 has joined. 20:52:35 !exec 6"6"AddPrntNl 20:52:38 Huh? 20:52:40 debug :) 20:53:04 -!- oklobot2 has quit (Read error: 104 (Connection reset by peer)). 20:53:12 i'm an idiot. 20:54:41 -!- oklobot2 has joined. 20:54:42 !exec 6"6"AddPrntNl 20:54:46 Huh? 20:54:49 66 20:55:55 with bignums, 3 vars is an infinite amount of vars with minited access 20:56:00 *limited 20:56:12 what have i been smoking 8| 21:00:28 is there any way to pick apart strings? 21:01:52 subtraction is the only thing 21:01:54 i think 21:01:55 i can check 21:02:38 haha xD 21:02:52 !exec "zupidap"NegPrntNl 21:02:54 padipuz 21:02:54 Huh? 21:03:55 !exec "dabale arroz a la zorra el abad"NegPrntNl 21:03:57 daba le arroz al a zorra elabad 21:03:58 Huh? 21:04:06 (spanish palindrome) 21:04:34 !exec "a man, a plan, a canal, panama"NegPrntNl 21:04:36 Huh? 21:04:37 amanap ,lanac a ,nalp a ,nam a 21:04:42 sorry, no :( 21:05:12 !exec "\""PrntNl 21:05:14 Huh? 21:05:23 :D 21:05:34 sorry, no way to do that xD 21:05:40 hard to get a quine then 21:05:52 impossible, proven 21:06:22 splitting strings... Div? 21:07:04 !exec1.2 1.2AddPrntNl 21:07:08 Huh? 21:07:24 no floats... 21:07:27 nope :\ 21:07:43 a new data type... 21:07:46 any way to test strings? 21:07:49 would take time :( 21:07:52 test? 21:08:06 !exec "asd""fgh"MrePrntNl 21:08:07 say, for equality, or being empty 21:08:08 Huh? 21:08:08 0 21:08:13 !exec "asd""fgh"LesPrntNl 21:08:16 1 21:08:17 Huh? 21:08:22 seems there is xD 21:08:29 i don't remember anything 21:08:42 Equ of course too 21:09:20 !exec "as" "asd"LesPrntNl 21:09:22 1 21:09:23 Huh? 21:09:35 i've been thinking about considering making a better language.... 21:09:42 !exec "as" "asd"MrePrntNl 21:09:44 0 21:09:44 Huh? 21:09:49 you know K? 21:10:07 no 21:10:21 i was gonna do K with code as just a list of ints 21:10:31 actually 21:10:37 i didn't mean to do K 21:11:00 i just happened to bump into it as i was coding my lang and it had most of the features 21:11:10 i think it was created just to annoy me 21:12:21 i still don't know what K means 21:12:30 floats would require me to alter the raw code parser 21:12:32 *shiver* 21:12:44 it's a lang you should learn :) 21:12:46 very cool 21:13:45 http://www.answers.com/topic/k-programming-language-1 21:14:23 best use of infix i ever saw 21:16:54 damn, soon there will be more than 26 single-letter languages 21:17:38 well, there is already Omega 21:18:27 gotta pick my letter fast before we run out! 21:18:33 i'll take iota 21:18:34 oh 21:18:36 it's taken 21:19:02 pi 21:19:15 well, there is pi calculus 21:20:16 :( 21:20:52 and at least gamma and lambda 21:21:20 and rho 21:21:39 so many langs i don't know 21:21:53 luckily most are the same and can be learned in an hour 21:22:05 (up to fibonacci level!) 21:26:19 !exec 1 1 5[RotRotDblRotAddRot1SubDbl]DrpPrntNl 21:26:22 13 21:26:22 Huh? 21:27:48 make it print 10 first in a row, hyphenated 21:28:03 10 might be too much 21:28:09 no 21:31:49 !exec 1 1 9[RotRotDblRotPrnt"-"PrntDrpAddRot1SubDbl]DrpPrntNl 21:31:51 Huh? 21:32:10 1PRIVMSG #esoteric :-PRIVMSG #esoteric :1PRIVMSG #esoteric :-PRIVMSG #esoteric :2PRIVMSG #esoteric :-PRIVMSG #esoteric :3PRIVMSG #esoteric :-PRIVMSG #esoteric :5PRIVMSG #esoteric :-PRIVMSG #esoteric :8PRIVMSG #esoteric :-PRIVMSG #esoteric :13PRIVMSG #esoteric :-PRIVMSG #esoteric :21PRIVMSG #esoteric :-PRIVMSG #esoteric :34PRIVMSG #esoteric :-PRIVMSG #esoteric :89 21:32:22 wow 21:33:31 is there no way to print a string without newline? 21:34:15 or maybe the above may be considered a bug. 21:37:34 haha xD 21:37:37 Nl is needed 21:38:22 it was Prnt first but i separated the newline so that you could "append to irc" without realizing other stuff is sent too :) 21:38:34 bug 21:38:36 kinda 21:38:50 supposed to work like that 21:38:57 but as it doesnt 21:39:06 !exec 3"-"4AddAddPrntNl 21:39:09 3-4 21:39:09 Huh? 21:39:46 the problem is i have already used up 3 variables so i don't have room to bring along a string. 21:40:59 :) 21:41:05 oh 21:41:39 you can end according to the sum instead of the number of fibonacci numbers 21:41:47 but it would be cheating, true 21:42:40 hmm i can make Lft 21:43:04 or Cpy 21:43:35 * oerjan snaps his fingers 21:43:58 i see a solution, though it is ugly 21:44:29 !exec 1 1 3[RotRotDblRotAddRot1SubDbl]DrpPrntNl 21:44:31 5 21:44:33 Huh? 21:45:25 ah :D 21:45:41 yeah you can make it with O(n^2) 21:45:52 found it too 21:45:55 no, it is better than that. 21:45:58 :O 21:46:07 i'll see the code then :) 21:52:09 i want that sadol guy here :( 22:02:03 you gonna do it? 22:02:32 !exec 1 1 8[RotRotDblRotAddRot1SubDbl]Drp""Rot[RotRotSwpDbl"-"SwpAddRotAddRotRotSwpDblRotSwpSubSwpRotRotDbl]DrpAddPrntNl 22:02:35 1-1-2-3-5-8-13-21-34-55 22:02:36 Huh? 22:03:03 right on cue :) 22:05:02 your idea of ending with the sum instead gave me the idea to carry the counter upwards, then the string downwards 22:05:26 since the basic fibonacci algorithm is reversible 22:06:33 god i'm stupid :O 22:06:37 so obvious 22:07:08 although it does duplicate work in a way 22:08:00 true, but i would've made it O(n^2) so... 22:09:01 hmm 22:09:04 by recalculating completely for each value? 22:09:11 yes :) 22:10:18 !exec 1 1 5[RotRotDblRotAddRot1SubDbl]DrpPrntNl 22:10:20 13 22:10:21 Huh? 22:12:43 !exec "" 10 [ Dbl 1 1 Rot 2Sub[RotRotDblRotAddRot1SubDbl]Drp Rot "-"Add Swp 1 Sub Dbl ] I have no idea anymore... fucking headache :(( 22:12:45 Huh? 22:12:54 !exec "" 10 [ Dbl 1 1 Rot 2Sub[RotRotDblRotAddRot1SubDbl]Drp Rot "-"Add Swp 1 Sub Dbl ] DrpPrntNl 22:12:58 Huh? 22:13:29 maybe in the morning... can't think now 22:15:07 !exec "" 10 [ Dbl 1 1 Rot 2Sub[RotRotDblRotAddRot1SubDbl]Drp Rot Add"-"Add Swp 1 Sub Dbl ] DrpPrntNl 22:15:10 Huh? 22:17:20 !exec "" 10 [ Dbl 1 1 Rot 2Sub[RotRotDblRotAddRot1SubDbl]Drp RotSwp Add"-"Add Swp 1 Sub Dbl ] DrpPrntNl 22:17:22 Huh? 22:17:26 can't see the problem :( 22:17:42 !exec "anyone there?"PrntNl 22:17:44 Huh? 22:17:44 anyone there? 22:17:52 :) 22:18:00 tell me the problem 22:18:15 why don't we do an active debug session on that code? 22:19:21 oklobot2 is not that interactive 22:19:36 oerjan can you see my problem? 22:20:01 ah 22:20:08 i'm an idiot 22:20:11 that's the problem 22:20:23 !exec 1 1 5[RotRotDblRotAddRot1SubDbl]DrpPrntNlDrpPrntNlDrpPrntNl 22:20:25 13 22:20:26 Huh? 22:20:29 8 22:20:35 you certainly seem to have an overly low self-esteem... 22:21:04 !exec "" 10 [ Dbl 1 1 Rot 2Sub[RotRotDblRotAddRot1SubDbl]Drp SwpDrp RotSwp Add"-"Add Swp 1 Sub Dbl ] DrpPrntNl 22:21:06 Huh? 22:21:09 -!- oklobot2 has quit (Read error: 104 (Connection reset by peer)). 22:21:12 :) 22:21:38 i was just about to convince myself you needed that change 22:22:02 -!- oklobot2 has joined. 22:22:42 gotta have more probs 22:22:56 but i won't rewrite it from scratch! 22:23:08 even if it takes only a minute 22:23:43 !exec "" 10 [ Dbl 1 1 Rot 2Sub[RotRotDblRotAddRot1SubDbl]Drp PrntNl SwpDrp RotSwp Add"-"Add Swp 1 Sub Dbl ] DrpPrntNl 22:23:46 55 22:23:46 Huh? 22:23:51 34 22:23:53 21 22:23:58 13 22:24:03 8 22:24:05 seems to work fine 22:24:08 5 22:24:10 3 22:24:14 2 22:24:18 1 22:24:22 -!- oklobot2 has quit (Read error: 104 (Connection reset by peer)). 22:24:25 :D 22:25:10 i do the thing for negative numbers 22:25:24 and for some reason it doesn't like it 22:25:30 :D 22:25:51 my problem is the "module" which i regarded as "safe" 22:26:09 try using [ Dbl 0 1 Rot 1Sub 22:26:44 !exec "" 10 [ Dbl 0 1 Rot 1Sub[RotRotDblRotAddRot1SubDbl]Drp PrntNl SwpDrp RotSwp Add"-"Add Swp 1 Sub Dbl ] DrpPrntNl 22:26:46 Huh? 22:26:47 or even [Dbl 1Neg 0 Rot 22:26:48 whoops 22:27:22 !exec "" 10 [ Dbl 0 1 Rot 1Sub[RotRotDblRotAddRot1SubDbl]DrpSwpDrp RotSwp Add"-"Add Swp 1 Sub Dbl ] PrntNl 22:27:26 Huh? 22:27:39 bot's not here 22:27:45 ... 22:27:49 you know what? 22:27:57 i'm an idiot. 22:28:03 i'd kick myself if i was op 22:28:12 the bot is ON 22:28:26 -!- oklobot2 has joined. 22:28:30 !exec "" 10 [ Dbl 0 1 Rot 1Sub[RotRotDblRotAddRot1SubDbl]DrpSwpDrp RotSwp Add"-"Add Swp 1 Sub Dbl ] DrpPrntNl 22:28:32 Huh? 22:28:38 haha :D 22:28:39 -!- oklobot2 has quit (Read error: 54 (Connection reset by peer)). 22:28:52 i have a non-irc debugger also 22:29:02 but would take me a year to locate the folder 22:29:16 -!- oklobot2 has joined. 22:29:16 i repeat: or even [Dbl 1Neg 0 Rot 22:29:53 but but btu butbtu 22:30:28 !exec "" 11 [ Dbl 0 1 Rot 1Sub[RotRotDblRotAddRot1SubDbl]DrpSwpDrp RotSwp Add"-"Add Swp 1 Sub 1Gre ] DrpPrntNl 22:30:31 -!- oklobot2 has quit (Read error: 54 (Connection reset by peer)). 22:30:32 Huh? 22:30:35 Mre 22:30:37 not Gre 22:31:05 -!- oklobot2 has joined. 22:31:05 you need to keep the Dbl as well 22:31:18 why? 22:31:28 true 22:31:34 !exec "" 11 [ Dbl 0 1 Rot 1Sub[RotRotDblRotAddRot1SubDbl]DrpSwpDrp RotSwp Add"-"Add Swp 1 Sub Dbl1Mre ] DrpPrntNl some day... 22:31:36 Huh? 22:31:37 89-55-34-21-13-8-5-3-2-1- 22:31:42 YE! 22:31:59 !exec "" 11 [ Dbl 0 1 Rot 1Sub[RotRotDblRotAddRot1SubDbl]DrpSwpDrp Rot Add"-"Add Swp 1 Sub Dbl1Mre ] DrpPrntNl 22:32:01 123581321345589---------- 22:32:02 Huh? 22:32:05 :D 22:32:16 !exec "" 11 [ Dbl 0 1 Rot 1Sub[RotRotDblRotAddRot1SubDbl]DrpSwpDrp Rot "-"AddAdd Swp 1 Sub Dbl1Mre ] DrpPrntNl 22:32:18 Huh? 22:32:18 123581321345589---------- 22:33:41 !exec "" 11 [ Dbl 0 1 Rot 1Sub[RotRotDblRotAddRot1SubDbl]DrpSwpDrp Rot Add"-"SwpAdd Swp 1 Sub Dbl1Mre ] DrpPrntNl 22:33:44 Huh? 22:33:48 -1-2-3-5-8-13-21-34-55-89 22:33:58 !exec "" 11 [ Dbl 0 1 Rot 1Sub[RotRotDblRotAddRot1SubDbl]DrpSwpDrp Rot Add"-"SwpAdd Swp 1 Sub Dbl1Mre ] Drp"-"SubPrntNl 22:34:01 1-2-3-5-8-13-21-34-55-89 22:34:02 Huh? 22:34:07 yay! 22:34:11 :D 22:34:12 -!- lindi- has left (?). 22:34:23 i managed to make a worse version! 22:34:48 i'm not really that lousy, it's the head, must be :D 22:54:44 wow... that's a weird language. 22:55:13 Hmmm... it reminds me of like... the stack of a prettier language. 22:55:25 the procedures appear after the input and such. 22:59:34 that one is a pretty standard bad stack-based language :) 22:59:37 you should see my esoteric ones 23:03:06 well... at least it's easy to parse :D 23:03:57 infix and stack-based are, that's why i usually make them :) 23:04:00 *prefix 23:04:03 polish 23:04:06 notation 23:04:11 not infix 23:04:15 that's the hard one 23:04:19 "hard" 23:06:13 hmm... like 2+ 2? 23:07:27 ? 23:07:36 is 2 + 2 infix? 23:07:40 * CakeProphet forgot his terminology 23:07:42 yes 23:08:05 heh... method calls are "almsost prefix" 23:08:16 i've made two infix parsers 23:08:34 zu 23:08:42 each worse than the other 23:08:49 Fun. 23:09:16 sure 23:09:38 you know how you sometimes get the feeling you gotta make an infix parser 23:10:32 -!- oerjan has quit ("Good night"). 23:12:10 ...no 23:12:18 -!- Asztal has joined. 23:12:28 really? 23:12:33 ...nope 23:12:57 what do you life for then? 23:12:57 hmm... I see how they would be neato. 23:13:00 *live 23:13:01 Like subject verb... 23:13:33 <.< 23:13:45 I made an infix parser for my test-case CAS. 23:13:58 i want to sleep goddamned, is there a sleepy language? :\ 23:14:01 I think parsing things in the order they are to be... evaluated... makes the most sense. :D 23:14:04 no, they're all great :( 23:14:09 C is fairly boring. 23:14:27 Well, it's not your most conceptually radical language on the block. 23:14:36 But it's fast and gets the job done. 23:16:10 * CakeProphet finds it confusing and annoying to work with. 23:16:35 Like a big rubix cube. 23:16:45 That random goes off into undefined behavior. 23:16:57 The only reason C is confusing is because you're thinking too much. 23:17:07 There's almost no other reason for it to be confusing. 23:17:46 I think it's easier to train someone in C than it is a lot of other languages because the conceptual baggage is so small. Pointers are ``complicated'' ? Yeah right, compare pointers to multiple inheritance. 23:17:48 isn't thinking by definition the only thing that can cunfuse you? 23:17:48 C++ is far better for undefined behaviour 23:17:54 *confuse 23:18:58 I think the only thing complicated about a pointer is that it's stupid terminology (why not simply call it an address?). 23:19:17 it doesn't have to be an address 23:19:24 Yeah, I was thinking that. 23:19:25 I don't think the C standard says that anywhere 23:19:48 Well, is a pointer a big sign with letters on it? No :P 23:20:27 Who knows, maybe someone will write a C interpreter, then it will just be a ... something :o 23:20:41 There are C interpreters out there, I'll betcha. 23:21:21 And I think maybe for a tad bit more ``cleanliness'' offer an alternative syntax for something like ``ptr int a; int b; a = (ptr) b;'' 23:21:44 (Note: I didn't think that through for a long time, so if there are conceptual errors, guffaw for you.) 23:22:01 VB used to have AddressOf and ValueAt ;) 23:22:18 Woaha. VB had pointers? :D 23:22:31 vb had everything 23:22:47 I don't see the use of pointeres.... 23:22:58 CakeProphet: ..................... ? 23:23:24 Imagine you have a magic function `` int magic'' 23:23:38 I mean... why do you want to explicitly define something to be a reference? 23:23:51 CakeProphet: How else would you? 23:23:52 You could just make everything a reference to an underlying thing in memory 23:24:17 Then how would you assign anything to anywhere? 23:24:55 (I think I understand your argument, but that's a question for more clarification.) 23:24:59 with... a variable assignment? 23:25:15 java-- 23:25:17 maybe? 23:25:25 x = 2 23:25:44 eh... it's how Python works. Although I don't exactly grasp the entire concept of a pointer, so I may have a bad idea of what they do. 23:25:57 No no, you've hit on the ages-old pointer gripe (I think). 23:26:11 a pointer is an integer :\ 23:26:16 nothing else. 23:26:25 I think, and here I'm not sure even, that the concept of a pointer is seperated from a normal variable only for the sake of side-effects in code. 23:27:14 So that, a function can have a copy of something, modify it to he**, and make the rest of the program none the wiser. Now why referential passing isn't default behavior and value passing is is anyone's guess. 23:27:36 *and value passing a special case 23:29:23 in Python, everything is implicitly a reference, and there are ways to "copy" the value of an object so that it's a separate entity. 23:29:37 That's something I'm not too fond of. 23:29:51 Because the concept of a reference is implied, not explicity. 23:30:03 x = [1,2,3,4,5,6]; x = y; x.append(2); x == y <---True 23:30:10 er... 23:30:12 y = x 23:30:34 Effeciency wise, that's slow. It's also annoying with low-level code. Plus it makes you memorize rules (like in Java, objects reference pass, but basic types value pass). 23:30:59 hmmm, seems intuitive to me, but Python is my first language soooo... 23:31:19 That's a'cuz you don't bit-twiddle much. 23:32:01 That distinction in conjunction with structs are what really give C power. My gripe is simply over the default distinction. 23:32:06 It's basically just for mutable sequences... immutable data can't be altered, and thus the difference reference and value is pretty much nothing. 23:32:39 But... you have to memorize what's mutable and immutable. 23:32:47 Giving you less flexibility on how you manage data. 23:32:49 *shrugs* Doesn't take too long. 23:33:27 tuples and strings are immutable. Lists and dictionaries are mutable. 23:34:33 and since OO in Python is basically just a pretty interface over dictionaries... classes and objects are mutable. 23:36:42 But why should a language even decide what data is or is not mutable? 23:37:04 *shrugs* It's just sort of the nature of the data itself that makes it so. 23:37:23 Remember where C is aimed. Not for building complex idioms or beautiful programs, it was originally designed to build OSs. 23:37:45 it's not an enforced thing... a mutable object can be duplicated. 23:37:48 You aren't going to get speed and control out of something that decides mutability for you. 23:38:11 *nods* Different design goals. 23:38:32 and since I'm not building OSes... I don't see much of a need for the paranoid efficiency of C. :D 23:38:59 Anything low-level, including I can almost guarantee, Python's interpreter. 23:39:42 Copying files, talking on a network, etc, etc. 23:40:00 eh... Python isn't as slow as people make it out to be. 23:40:14 If you use it right, it works fine for normal environments. 23:40:30 But, I'm not going to use Python to make something that copies files for me. 23:40:45 Or handles enormous amounts of data with/without transformations. 23:40:54 Sukoshi: well the harddisk will be the bottleneck even when you use python (for just copying) 23:41:07 jix_: Errr, I meant not *just* copying. 23:41:20 well then yes.... 23:41:46 I could consider file copying a "normal" situation. 23:41:52 Heck, some people even rewrite portions of libc and stdlib to get the speed they want in certain situations. 23:41:54 Python would work fine for file manipulations. 23:42:05 doing things like a chess AI is a thing i don't want to do in c because writing it in c is a pain in the ass but i don't want to use other higher level languages because i use too much performance :/ 23:42:12 Some people are insanely paranoid about speed. 23:42:36 Premature optimization. 23:42:50 CakeProphet: If you're writing a utility that's going to be widely used, portable on many OSs, or is something of that nature, you're going to use C. 23:43:23 I'm working on a project now (we're hoping to get it accepted into GNU) that deals a *lot* with sockets and files and parsers. This is C's domain. 23:43:35 That's simply because C is used everywhere. 23:43:42 I agree with Sukoshi. why I use C is mainly for portability, not for speed. 23:44:00 CakeProphet: Higher level languages are a pain to ensure portability for. 23:44:13 The higher the language, the harder to implement the idioms on different platforms. 23:44:39 yeah most portable apps are written in c..... 23:44:48 I have a utility for Python that compiles the entire program into an .exe that can work independent of a python interpreter. 23:44:50 or c++ that's pretty portable too 23:44:57 Sure... it adds a few MBs to the file size... but it's portable. :D 23:45:00 CakeProphet: on mac os x? 23:45:06 No. 23:45:16 Plus, the project I'm working on still is pretty slow compared to (one of) its competitor(s) (the project has multiple functions) -- GNU cp. 23:45:19 CakeProphet: on some propertary(wrong spelling for sure... i hate that word) embedded device? 23:45:20 I use XP myself... but the utility is independent of OS 23:45:35 no.. it's just a... program. 23:45:59 The mmap patch I recently committed sped it up, but we still need more optimizations. 23:46:06 jix_, but if you use somewhat difficult feature of C++, you could not get much portability 23:46:24 tokigun: i don't know.... never coded c++ myself.. i don't like it 23:46:32 tokigun: Oh *GOD*, I remember trying to write a SWIG wrapper for some complex C++ code... it was a nightmare. 23:46:35 hmm... it might be windows-only though... so maybe not. 23:46:37 Template/boost hell. 23:46:45 but milkytracker is written in c++ and is pretty portable... 23:47:18 well, it is mainly due to compiler (not target platform), since specification of C++ is hard to implement. 23:47:53 if you use restricted set of features in C++ only, almost all compiler can compile your program. but you should be careful. 23:48:32 * CakeProphet doesn't worry much about portability... most of his projects are directed towards personal use or developer use. 23:48:39 for example Mozilla doesn't use "mutable" keyword, because some C++ compilers don't support it. 23:50:19 considering this, boost is very carefully written library to support almost major (including buggy) compilers.