00:10:23 !bf_txtgen Lea 00:10:47 50 +++++++++++[>+++++++>+++++++++>><<<<-]>-.>++.----. [679] 00:37:04 !bf8 +++++++++++[>+++++++>++<<-]>-.[->+<]>+++.----. 00:37:07 Lea 00:37:51 !bf64 ++.++.++.++.++.+[.>+.++.++.++.>+.+<.<-.]>.-..[-.>+.<].>+.++..-.--.-.. 00:37:55 00:38:12 :P 00:38:28 Huh? 00:38:34 !bf64 +++++++++++[.>+.++.++.++.>+.+<.<-.]>.-..[-.>+.<].>+.++..-.--.-.. 00:38:38 00:39:48 is that supposed to mean anything because i just see a couple of control characters 00:40:39 No, it's not - I just stuck random outputs into the code :P 00:41:02 !bf8 +++++++++++[>+++++++>++<<-]>.-.[->+<]>.+.+.+.-.-.-.-. 00:41:06 MLbcdedcba 00:43:19 * pikhq gives up on his current bit of strings.bfm, and does the much simpler (but less efficient) method of writing it: Huge amounts of "+". 00:44:58 Was strings.bfm to depend on a constants.bfm, or just be magic? ^^ 00:52:04 Being hand-coded by making the constant loops write to multiple locations in the array. . . 00:52:04 Difficult as hell. 00:52:04 I'd rather get the compiler working in full first. 00:52:04 !bf8 +++++[>+++++>-]>[>+++>++++<<-]>+.>+.----. 00:52:04 realloc: Cannot allocate memory 00:52:04 whoops, a > should be < 00:52:04 !bf8 +++++[>+++++<-]>[>+++>++++<<-]>+.>+.----. 00:52:04 Lea 00:52:04 I'll just make strings.simple.bfm a drop-in replacement for strings.bfm, so nothing will need to be changed from my efficient attempts. . . 00:59:00 -!- CakeProphet has quit (Read error: 104 (Connection reset by peer)). 00:59:02 -!- CXI has quit (Read error: 104 (Connection reset by peer)). 00:59:59 -!- CakeProphet has joined. 01:00:05 -!- CXI has joined. 01:04:35 !bf8 +[+++++>->-->--<<<]>-[-->-<]>-.>-.----. 01:04:38 3™• 01:07:50 !bf8 +[----->->-->--<<<]>-[-->-<]>-.>-.----. 01:07:54 Lea 01:08:42 interesting - just a single + in the wrapping version 01:10:01 Mmkay. . . I've got string0 done. . . 01:12:57 !bf8 +[+++++>+]>+[++>+++>++++<<]>+.>+.----. 01:13:10 realloc: Cannot allocate memory 01:13:41 !bf8 +[+++++<+]>+[++>+++>++++<<]>+.>+.----. 01:14:12 bbl 01:14:32 -!- calamari has quit ("Leaving"). 01:19:51 !bf8 -[+++++>+<]>+[++>+++>++++<<]>+.>+.----. 01:19:54 Lea 01:20:02 -!- GregorR-W has quit ("kill(getpid(), SIGWEEKEND)"). 01:29:09 !bf8 -[----->->->-<<<]>+[-->->--<<]>.>.----. 01:29:12 fÿû 01:32:05 !bf8 +[----->->->-<<<]>-[-->->--<<]>.>.----. 01:32:08 ı 01:32:14 argh 01:33:37 !bf8 -[----->->+>+<<<]>+[-->->--<<]>.>.----. 01:33:40 Ìea 01:35:55 !bf8 -[----->->+>+<<<]>+[++>+>++<<]>.>.----. 01:35:58 Lea 01:44:15 . . . Why. . .? 01:44:24 why what? 01:44:54 i'm just experimenting with wrapping on a word Calamari put into bf_txtgen 01:45:43 no, cakeprophet was it 01:46:11 or where you thinking of something more important? 01:46:19 *were 01:47:37 No. . . Why don't you use your own Brainfuck interpreter? 01:47:54 Egobfi, the one used by Egobot, is a very nice one. 01:48:03 Written by Gregor. ;) 01:48:29 i found a nice online debugger the other day but it does not wrap 01:54:27 !help 01:54:30 help ps kill i eof flush show ls bf_txtgen usertrig daemon undaemon 01:54:32 1l 2l adjust axo bch bf{8,[16],32,64} funge93 fyb fybs glass glypho kipple lambda lazyk linguine malbolge pbrain qbf rail rhotor sadol sceql trigger udage01 unlambda whirl 01:54:55 !help bf 01:54:56 To use an interpreter: Note: can be the actual program, an http:// URL, or a file:// URL which refers to my pseudofilesystem. 01:57:11 oerjan: Seriously, install Egobfi. . . 01:57:52 (if you're on Windows, install Cygwin to compile it. If on Mac, just open up a terminal to compile. If on a normal *NIX, do I need to explain the drill?) 02:00:05 http://esolangs.org/files/brainfuck/impl/egobf-0.7.1.tar.bz2 02:08:19 -!- |wez| has joined. 02:37:08 -!- bsmntbom1dood has joined. 02:49:45 -!- bsmntbombdood has quit (Read error: 110 (Connection timed out)). 02:54:31 -!- bsmntbom1dood has changed nick to bsmntbombdood. 03:48:36 -!- |wez| has quit. 03:49:58 -!- puzzlet has joined. 04:08:43 -!- GregorR-L has joined. 04:45:34 -!- ivan` has quit (" HydraIRC -> http://www.hydrairc.com <- IRC has never been so good"). 05:00:39 -!- oerjan has quit ("Good night."). 05:03:16 -!- Asztal has quit (Read error: 110 (Connection timed out)). 05:29:57 -!- ivan` has joined. 06:10:24 -!- Sgeo has quit (Connection timed out). 07:00:54 -!- GregorR-L has quit ("Leaving"). 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:02:30 -!- ivan` has quit (" HydraIRC -> http://www.hydrairc.com <- Go on, try it!"). 08:34:31 -!- tgwizard has joined. 09:09:58 -!- tgwizard has quit (Remote closed the connection). 10:18:16 -!- kipple_ has joined. 10:58:07 -!- jix has joined. 12:29:44 -!- |wez| has joined. 12:36:32 -!- oerjan has joined. 13:57:19 -!- puzzlet_ has joined. 13:57:25 -!- puzzlet has quit (Remote closed the connection). 14:49:23 -!- Azstal has joined. 14:49:26 -!- Azstal has changed nick to Asztal. 15:01:21 -!- Sgeo has joined. 15:20:33 -!- ihope has joined. 15:20:48 It's that one song, on that one game... 15:21:34 And suddenly, I must leave. 15:21:37 -!- ihope has quit (Remote closed the connection). 15:44:17 -!- W_ has quit (niven.freenode.net irc.freenode.net). 15:44:17 -!- cmeme has quit (niven.freenode.net irc.freenode.net). 15:45:24 -!- W_ has joined. 15:45:24 -!- cmeme has joined. 15:45:34 -!- W_ has quit (Read error: 131 (Connection reset by peer)). 15:46:09 ouch 15:49:56 -!- cmeme has quit (Connection timed out). 15:54:12 -!- cmeme has joined. 16:12:04 argh. is anyone here with special access to the wiki? i am trying to update Brainfuck_constants in one go, but i keep getting a server error 16:41:48 never mind, i managed to split it into four batches 17:27:31 -!- oerjan has quit ("Aquiferous"). 21:13:31 -!- calamari has joined. 21:16:28 calamari: Know of any concise itoa implementations that I could use for BFM? 21:17:15 suggest that for a bf gold 21:17:17 golf 21:17:32 I have written one but it is reported to be buggy 21:18:03 I'd suggest it for BF Golf, but I'd rather have it be a golf idea I can actually write. . . :p 21:18:18 * pikhq seriously can't think of where to start with it. . . 21:18:30 If I could, then I wouldn't be asking around, would I? :P 21:23:44 http://www.freebookzone.com/others/itoa.h ? 21:26:24 oh.. haha 21:26:32 that code is copyrighted, but you could re-engineer it to create a GPL-compliant implementation. 21:26:33 I was thinking of something else (input -> decimal) 21:26:46 -!- ivan` has joined. 21:26:59 there must be a free one in glibc someplace 21:27:11 wouldn't be surprised. 21:27:33 or maybe uclibc would be better 21:27:38 (smaller download) 21:27:46 * RodgerTheGreat shrugs 21:27:59 In Brainfuck. -_-' 21:28:26 oh, you mean an already implemented version of itoa in brainfuck? Hm. 21:28:29 Unless you wish to argue that C code is usable in a macro language which compiles to Brainfuck? 21:28:43 pikhq: how is the integer stored in bf? 21:28:54 or are you imagining very large cells? 21:28:55 well, I don't see anything about that C code that's *impossible* in bf... 21:29:13 RodgerTheGreat: Except that I'm lazy. 21:29:22 ... 21:29:26 calamari: A char. 21:29:46 so 0-255 only? 21:29:54 RodgerTheGreat: Although that's just a limiting factor in complexity of what *I* will write, not a limiting factor in the complexity of possible code. :p 21:30:04 calamari: Um, yeah. . . It's *Brainfuck*. 21:30:35 pikhq: I know bf.. trust me :) there are many variations and I do not know what your assumptions are 21:31:25 EOF=0 or no change, 30,000 char array with wrapping cells. 21:31:26 does walking around while stressed help strenght? 21:31:32 oops, W 21:31:34 oops, WW 21:33:09 The *goal* is to have itoa.bfm in BFM's stdlibs. . . 21:34:14 Preferably one that uses a small amount of memory. 21:35:24 do you have a routine that divides by 10? 21:35:47 x % 10 = x - 10 * int(x / 10) 21:36:25 No, but I can no doubt come up with a quick macro for that. 21:36:45 if you don't , I'm pretty sure there is one on my hd someplace 21:36:53 do you understand the above equation ? 21:37:29 Yeah. 21:37:50 I think that will give you everything you need 21:38:02 . . . 21:38:09 it gives the digits in reverse order, but since there are only 3 it's not a big deal 21:38:22 * pikhq has a flash of insight and a feeling of stupidity for his previous attempts 21:38:53 for example: 123 / 10 = 12.3, int(12.3)=12 * 10=120, 123-120=3 21:51:01 Mmkay. . . 21:51:14 I've got a somewhat messy bit of code, but I think it should work. . . 21:54:31 would be a good bf golf challenge.. you should suggest it 22:00:14 I would have thought that a BF division algorithm would produce the remainder as a side effect. 22:01:27 yeah 22:01:38 good point 22:08:51 I suspect that since we konw the divisor is 10, we can write something much more efficient than the normal division algorithm. 22:08:59 yes 22:10:05 * pikhq curses at his code 22:10:12 Yeah. Not working. :'( 22:10:23 http://rafb.net/paste/results/RSGCX338.html 22:10:38 that is a divide by 10 algorithm.. I didn't write it 22:12:42 * SimonRC was imaginig something with cleverly-designed loops nested 10 deep. 22:14:41 well, here is a divide by 2 algorithm that works with half of the numbers: [-->+<] mod it for the other half ;) 22:32:55 here is one that works for all numbers but requires some zeros around the number to devide: [-[->+>]<<]>[<<]>> 22:40:01 Here is one that works in Boolfuck: +[+>+<]>[<+>] 22:40:02 :p 22:41:23 jix: throws away the remainder.. can it be saved? 22:41:32 calamari: yes 22:43:22 [-[->+>]<<]>>>[>+>]<< 22:43:28 but requires even more space 22:43:34 (that is zero) 22:43:47 but i guess there is place for optimizations on that aspect 22:44:54 oh and it fails with 1 as input 22:45:44 can easily be solved by prefixing it with ++ and postfixing it with - 22:45:50 (of course the code is nonwrapping)