00:06:34 -!- shikhout has joined.
00:09:28 -!- shikhin has quit (Ping timeout: 258 seconds).
00:22:07 <oerjan> @tell ais523 <ais523> fizzie: and because of that, "was being" is typically only used to construct passives <-- i think you are being disingenious hth
00:22:07 <lambdabot> Consider it noted.
00:22:53 <oerjan> @tell ais523 *u
00:22:53 <lambdabot> Consider it noted.
00:34:07 <int-e> nice xkcd
00:42:58 <oerjan> it's the bee's knees
00:43:16 <oerjan> also, not loading
00:48:07 -!- Phantom__Hoover has quit (Ping timeout: 256 seconds).
01:13:10 <shachaf> copumpkin: Did you ever end up reading that thing?
01:21:12 <coppro> Recommended Windows IRC client?
01:22:20 <paul2520> coppro: PuTTY into a Linux server
01:22:42 <oerjan> i can second that!
01:22:52 <coppro> not an option for this individual
01:24:55 <paul2520> coppro: Raspberry Pis are cheap. but if Windows is a must, see http://www.makeuseof.com/tag/top-7-free-irc-clients-windows-7/
01:34:13 <elliott> just use hexchat.
01:34:20 <elliott> that list looks completely awful.
01:34:29 <zzo38> Well, I wrote a IRC client that can be used in Windows, although it requires PuTTY, so you will still require PuTTY. Also it is difference from other IRC client and some people might hate it.
01:35:19 <elliott> like, recommending the shareware windows xchat? and that thrashirc thing that I seriously doubt anyone uses?
01:36:02 <int-e> "These are 7 of the best IRC clients ..."
01:36:23 <int-e> SO logically that means *any* 7 IRC clients.
01:36:30 <paul2520> good point
01:37:00 <paul2520> zzo38: so if it requires PuTTY, is it running on some server somewhere?
01:37:13 <elliott> 3 of the best IRC clients: netcat, DelphiExampleIRCClient.exe, ZMODEM
01:37:40 <int-e> elliott: how do you use zmodem for that?
01:37:52 <elliott> int-e: VERY CAREFULLY.
01:38:10 <oerjan> do you get to whistle tones
01:38:10 <elliott> I'm sure you could work out *something*.
01:38:20 <int-e> netcat wouldn't be so bad if not for all the pings from the server.
01:38:44 <zzo38> paul2520: You can run the server on your own computer.
01:39:18 <oerjan> idea: netdog, like netcat except it will fetch pings for you.
01:39:57 <zzo38> int-e: If that is what you want, you can try my IRC client which adds autopong, not interfering input text with output, and syntax highlighting. (Also, it allows you to turn off autopong, and supports password masking and macros and a few other things.)
01:40:00 <oerjan> hm apparently that name is taken by something sinister
01:40:39 <zzo38> There is no DCC files and stuff like that though
01:40:52 <paul2520> zzo38: I'm interested. Is your client online somewhere?
01:41:42 <int-e> zzo38: it's not really what I want. but the few times I've used netcat (I guess I used telnet instead), the pong thing was the most annoying.
01:42:10 <zzo38> int-e: Ah, OK.
01:42:33 <zzo38> paul2520: Yes; it is http://zzo38computer.org/prog/PHIRC/phirc.zip
01:42:35 <int-e> I don't care about DCC.
01:42:47 * int-e cares about a fragment of CTCP though.
01:43:43 <paul2520> cool, I will check it out; thanks! zzo38 
01:43:48 <zzo38> int-e: Which ones? PHIRC does implement some CTCP stuff, such as VERSION, PING, and TIME.
01:44:08 <int-e> The one that I just demonstrated. ACTION.
01:45:04 <zzo38> Ah. Well, it can display and send ACTION but has no special support for it.
01:45:20 <int-e> no /me?
01:45:28 <zzo38> (The program is also open-source so you can change it if you like to.)
01:45:46 <zzo38> int-e: That is correct; it doesn't have any such command.
01:45:50 <int-e> But perhaps the whole idea of using / is not applicable.
01:45:57 <zzo38> (You can create macros for it though.)
01:47:10 <zzo38> For example you can assign one of the function keys to automatically type for you CTRL+A and ACTION and a space. You can also make it so that it adds a space in front automatically too if you want to (typing a space at the beginning of a command-line will automatically type PRIVMSG and the channel name and a colon).
01:48:57 <int-e> hehe, I can't even run phirc... (no php installed. a solvable problem, of course.)
01:49:59 <zzo38> Of course, it might not be what you want, but nevertheless it is there in case anyone like it; at least I use it myself because I do not like the other IRC clients much.
01:50:23 <int-e> I'm quite happy with irssi right now.
01:50:56 <zzo38> That's OK, then.
01:55:28 <Sgeo> Does Iceland have Subways
01:55:40 <Sgeo> http://www.subway.is/
01:55:51 <Sgeo> I have not the faintest idea what any of that says
01:59:02 <int-e> http://en.subway.is/ might help
01:59:29 <int-e> (alas, the contents is not the same)
02:00:26 <elliott> I...
02:00:31 <elliott> I must know why you're curious about this.
02:00:34 <zzo38> Have you ever tried to play chess in which it is allowed to promote a white pawn into a black pawn?
02:01:05 <elliott> wow, Iceland has 24 subways?
02:01:18 <elliott> that's kind of a lot for how few people there are / how few places they're concentrated in
02:01:55 <int-e> zzo38: no. why would you want to do that?
02:02:37 <int-e> and how does that interact with the two-square advance and en passant rules?
02:03:22 <zzo38> int-e: Of course then you would need to add rules to know how to do that; my own idea would be that two-square advance is allowed on its own second rank. (So, from there it can be moved one space, and then two spaces from there.)
02:04:02 <zzo38> How can I find the information about implementing Diehard test? I found a list of the tests, but not implementation details of how exactly these tests work.
02:04:07 <int-e> The only point would be that it's a piece that the opponent can't capture
02:04:43 <int-e> So it'll allow a few strange extra mating techniques. Other than that I see no incentive for ever using that option.
02:05:12 <zzo38> int-e: Yes, that is a point of it; it blocks other opponent's pieces. It might also possibly avoid opponent being stalemated?
02:05:27 <int-e> ah.
02:05:34 <int-e> yes it could
02:08:51 <int-e> hard to imagine that it wouldn't be possible to win in a different way, unless you're running against the 50 moves rule, and you won't because you've just advanced a pawn
02:09:24 <int-e> unless that was the 50th move... hmm.
02:10:27 <zzo38> Another thing would be to make up retro puzzles that specify that this is permitted
02:29:10 <oerjan> this has an example with promoting to a black knight https://en.wikipedia.org/wiki/Joke_chess_problem#Offbeat_interpretations_of_the_rules_of_chess
02:29:25 <oerjan> i think we've mentioned it before
02:35:31 <zzo38> Yes I have seen that
02:35:43 <zzo38> But I am talking about retro puzzles
02:40:18 <int-e> zzo38: For a non-retro puzzle maybe one can build something around 4K2r/3PRP2/7b/8/8/8/8/8
02:41:50 -!- yurichev has quit.
03:01:58 <Sgeo> It's not just my imagination that Scala lazy arguments can mess with refactoring, is it?
03:02:20 <Sgeo> You don't know whether or not you can safely pull out the g() in f(g()) without looking at f's type
03:05:02 <Sgeo> Reminds me of Clojure a bit, in that methods are not first class. But in Scala, methods are given all the cool stuff
03:34:10 <zzo38> How do I do in MinGW with SDL 1.x to call another program and read from what it sends to the stdout and you can write that it can receive by stdin?
04:16:39 -!- shikhout has quit (Ping timeout: 256 seconds).
05:02:36 <copumpkin> shachaf: nope :(
05:03:49 <lifthrasiir> zzo38: fix SDLmain.
05:07:03 <zzo38> How to do that?
05:08:22 <zzo38> I want something like the proc_open in PHP, but with C
05:13:31 <zzo38> I want a terminal emulator that does this:  http://zzo38computer.org/zmachine/doc/zterm.txt
05:14:23 <lifthrasiir> wait a min---I thought the called program uses SDL (which makes the redirection very hard)
05:14:37 <lifthrasiir> zzo38: use popen then.
05:15:33 <zzo38> No I mean the calling program should use SDL and the program it calls is using stdio
05:15:39 <lifthrasiir> ah well
05:15:49 <zzo38> But, I think popen is not good enough?
05:16:03 <lifthrasiir> in that case, you are out of luck. any program linking with SDLmain redirects its stdout and stderr to somewhere else.
05:16:50 <zzo38> I don't need the SDL program's stdio, only to access the stdin and stdout of another program it can call
05:17:32 <lifthrasiir> eh, then you just need popen, was that a question?
05:17:55 <lifthrasiir> (maybe the "called" program and the "calling" program is a confusing terminology)
05:19:15 <lifthrasiir> zzo38: have you tried a plain popen then?
05:20:10 <zzo38> But doesn't popen only go one way?
05:21:13 <lifthrasiir> then you'd use fork, exec and dup2?
05:21:48 <lifthrasiir> SO seems to have a good answer to that: http://stackoverflow.com/questions/6171552/popen-simultaneous-read-and-write
05:26:17 -!- qwertyo has joined.
05:38:36 <elliott> sdlmain is dead in sdl 2, right?
05:40:58 <zzo38> lifthrasiir: OK thank you
05:41:10 <lifthrasiir> elliott: yes. fortunately.
06:00:06 -!- de_aarde has joined.
06:04:20 -!- MDude has changed nick to MDream.
06:07:49 -!- de_aarde has left.
06:08:03 <zzo38> Do you think this ZTERM is OK now?
06:23:57 -!- qwertyo has quit (Ping timeout: 272 seconds).
06:28:35 <zzo38> It is a kind of alternative to Glk
07:02:00 <elliott> is there really no simple way to do what I'd expect "git clone --depth=1 --branch=some-sha1-commit-hash https://..." to do? :/
07:05:27 <coppro> elliott: what do you expect and what does it do?
07:06:47 <elliott> coppro: to give me a checkout at some-sha1-commit-hash, preferably without downloading more of the history than it has to (as in, comparable behaviour to --depth=1 on a branch). complain because some-sha1-commit-hash isn't a ref.
07:07:11 <elliott> (I also tried git init; git remote add origin https://...; git fetch origin sha1, which has the same issue.)
07:07:23 <elliott> or maybe it isn't looking for a ref exactly. that's what git-fetch's complaint was, anyway.
07:10:10 <shachaf> http://git.661346.n2.nabble.com/Fetch-by-SHA-missing-td5604552.html
08:29:11 -!- drdanmaku has quit (Quit: Connection closed for inactivity).
09:29:07 -!- shikhin has joined.
09:48:07 -!- oerjan has quit (Quit: leaving).
10:37:08 -!- boily has joined.
10:44:32 <mroman> fizzie: All factors 2 is tough
10:44:55 <mroman> !blsq {1 2 3 4}":,,,"XX**\[
10:44:55 <blsqbot>  {ERROR: Burlesque: (_+) Invalid arguments!}
10:44:57 <mroman> !blsq {1 2 3 4}":,,,"XX**
10:44:57 <blsqbot>  {1 ': 2 ', 3 ', 4 ',}
10:49:38 <fizzie> I'm using m]',IC to go from {1 2 3 4 5} to "1,2,3,4,5", FWIW.
10:54:38 <mroman> !blsq 6rom]',IC
10:54:38 <blsqbot>  "1,2,3,4,5,6"
10:55:16 <mroman> !blsq 6ro1SH~-
10:55:17 <blsqbot>  "1,2,3,4,5,6"
10:55:24 <mroman> fizzie: Then use 1SH~- instead
10:55:29 <mroman> i'ts shorter than m]',IC
10:55:32 <mroman> *it's
10:56:38 <mroman> (I'm using 1SH~- myself already)
10:56:41 <mroman> but still 28B
10:57:42 <mroman> I have another 28B without 1SH~-
10:59:55 <mroman> (It uses f~)
11:00:15 <mroman> !blsq "~:~"{10 1 2 5 10}f~
11:00:15 <blsqbot>  "10:12510"
11:00:20 <mroman> !blsq "~:~"{10 1 2 5 10}',[]f~
11:00:20 <blsqbot>  "10:,1,2,5,10"
11:00:29 <mroman> sorta like that
11:02:05 <fizzie> Oh, I didn't know anything about this format stuff.
11:12:22 <mroman> Jfc1SH~-Cl"~:~"jf~    Jfc1SH~-Cl':[]m]\[   Jfc1SH~-jSh':_+j_+
11:12:25 <mroman> all the same length
11:13:31 <mroman> Jfc',[]j+]"~:~"jf~   Jfc1SH~-':+]jShj.+
11:13:50 <mroman> all 5 approaches the same freaking length 
11:16:49 <mroman> http://codepad.org/JNCAxTPT <- my log
11:17:09 <mroman> maybe Jfc isn't the way to go :(
11:29:09 -!- boily has quit (Quit: APPROACHED CHICKEN).
11:51:24 -!- kline has joined.
12:03:18 <fizzie> My 24B does go via Jfc.
12:05:17 <fizzie> Actually, it's identical to the last line of your paste, except ?+ can do the work of the jShj.+ there.
12:07:30 -!- shikhout has joined.
12:08:23 <mroman> Yeah
12:08:30 <mroman> I just noticed that ?+ works that way
12:09:09 <mroman> ok. then it's not really tough
12:09:19 <mroman> I just forgot ?+
12:10:58 <mroman> !blsq 10{1 2 3 4 5}?+
12:10:58 <blsqbot>  {11 12 13 14 15}
12:11:01 -!- shikhin has quit (Ping timeout: 272 seconds).
12:11:06 <mroman> !blsq 10{1 2 3 4 5}[+
12:11:06 <blsqbot>  ERROR: Burlesque: ([+) Invalid arguments!
12:12:19 <mroman> ~- was actually introduced to get from {1 2 3} to "1, 2, 3"
12:12:29 <mroman> !blsq 3roSh
12:12:29 <blsqbot>  "[1, 2, 3]"
12:12:32 <mroman> !blsq 3roSh~-
12:12:32 <blsqbot>  "1, 2, 3"
12:13:25 <mroman> !blsq "abc""def"+]
12:13:25 <blsqbot>  ERROR: Burlesque: (+]) Invalid arguments!
12:13:43 <mroman> prepend/append could benefit from some more stuff
12:13:49 <mroman> !blsq "abc"5+]
12:13:49 <blsqbot>  ERROR: Burlesque: (+]) Invalid arguments!
12:13:52 <mroman> stuff like that
12:14:07 <mroman> String, Any b could actually just call Sh+]
12:14:30 <mroman> and then add String a, String b which prepends b to a
12:16:35 <mroman> !blsq "2 5"pe
12:16:35 <blsqbot>  5
12:16:39 <mroman> !blsq "2 5"pe#s
12:16:39 <blsqbot>  {5 2}
12:17:16 <mroman> !blsq "2 5"ps^p#s
12:17:16 <blsqbot>  {5 2}
12:17:20 <mroman> !blsq "2 5"psp^
12:17:20 <blsqbot>  2
12:17:23 <mroman> !blsq "2 5"psp^#s
12:17:23 <blsqbot>  {2 5}
12:17:46 <mroman> !blsq "2 5"pejbx#s
12:17:46 <blsqbot>  {{2} 5}
12:18:11 <mroman> !blsq "2 5"pejbxjE!#s
12:18:11 <blsqbot>  {2 2 2 2 2}
12:18:20 <mroman> hm
12:19:24 -!- Wooble has left ("ERC Version 5.3 (IRC client for Emacs)").
12:19:38 <mroman> !blsq "2 5"pejbx.*\[
12:19:38 <blsqbot>  ERROR: Burlesque: (\[) Invalid arguments!
12:19:40 <mroman> !blsq "2 5"pejbx.*
12:19:40 <blsqbot>  ERROR: Burlesque: (.*) Invalid arguments!
12:19:42 <mroman> !blsq "2 5"pejbx
12:19:42 <blsqbot>  {2}
12:19:45 <mroman> !blsq "2 5"pejbxj.*
12:19:45 <blsqbot>  {{2} {2} {2} {2} {2}}
12:19:50 <mroman> !blsq "2 5"pejbxj.*\[
12:19:50 <blsqbot>  {2 2 2 2 2}
12:20:04 <mroman> !blsq "2 5"pejbxj.*\[q?^r[
12:20:04 <blsqbot>  65536
12:20:38 <mroman> hu
12:20:41 <mroman> weird
12:20:44 <mroman> !blsq 2 2?^
12:20:44 <blsqbot>  4
12:20:47 <mroman> !blsq 2 2?^2?^
12:20:47 <blsqbot>  16
12:21:12 <mroman> !blsq 2 2?^2?^2?^
12:21:12 <blsqbot>  256
12:21:28 <mroman> !blsq 2 2?^2?^2?^2?^
12:21:28 <blsqbot>  65536
12:21:32 <mroman> !blsq 2 2?^2?^2?^2?^2?^
12:21:33 <blsqbot>  4294967296
12:21:36 <mroman> wth
12:21:43 <mroman> > 2**2**2
12:21:45 <lambdabot>  16.0
12:21:47 -!- sebbu2 has joined.
12:21:52 <mroman> > 2**2**2**2
12:21:54 <lambdabot>  65536.0
12:21:56 <mroman> > 2**2**2**2**2
12:21:58 <lambdabot>  Infinity
12:22:16 <mroman> > 2^2^2^2^2
12:22:18 <lambdabot>  2003529930406846464979072351560255750447825475569751419265016973710894059556...
12:22:24 -!- sebbu2 has quit (Changing host).
12:22:24 -!- sebbu2 has joined.
12:22:41 <mroman> ok
12:22:54 <mroman> !blsq 2.0 2?^2?^2?^2?^2?^
12:22:55 <blsqbot>  Ain't nobody got time fo' dat!
12:23:26 -!- sebbu has quit (Ping timeout: 256 seconds).
12:23:31 <b_jonas> [ 2^2^2^2
12:23:41 -!- j-bot has joined.
12:23:52 <b_jonas> [ 2^2^2^2
12:23:52 <j-bot> b_jonas: 65536
12:23:52 <mroman> is this right associative?
12:24:07 <mroman> > 2^65536
12:24:08 <b_jonas> sure, but I can add parenthesis
12:24:08 <lambdabot>  2003529930406846464979072351560255750447825475569751419265016973710894059556...
12:24:13 <b_jonas> [ 2^(2^(2^2))
12:24:14 <j-bot> b_jonas: 65536
12:25:29 <mroman> !blsq "2 5"pejbxj.*\[
12:25:30 <blsqbot>  {2 2 2 2 2}
12:25:46 <mroman> !blsq "2 5"pejbxj.*\[
12:25:47 <blsqbot>  {2 2 2 2 2}
12:25:49 <mroman> !blsq "2 5"pejbxj.*\[sa
12:25:49 <blsqbot>  5
12:26:04 <mroman> !blsq "2 5"pejbxj.*\[sa{?^}.*\[
12:26:04 <blsqbot>  ERROR: Burlesque: (\[) Invalid arguments!
12:26:07 <mroman> !blsq "2 5"pejbxj.*\[sa{?^}.*
12:26:07 <blsqbot>  ERROR: Burlesque: (.*) Invalid arguments!
12:26:16 <mroman> !blsq "2 5"pejbxj.*\[sa#s
12:26:16 <blsqbot>  {5 {2 2 2 2 2}}
12:26:23 <mroman> !blsq "2 5"pejbxj.*\[sa{?^}j
12:26:23 <blsqbot>  5
12:26:26 <mroman> !blsq "2 5"pejbxj.*\[sa{?^}j.*
12:26:26 <blsqbot>  {{?^} {?^} {?^} {?^} {?^}}
12:26:28 <mroman> !blsq "2 5"pejbxj.*\[sa{?^}j.*\[
12:26:28 <blsqbot>  {?^ ?^ ?^ ?^ ?^}
12:26:30 <mroman> !blsq "2 5"pejbxj.*\[sa{?^}j.*\[_+
12:26:30 <blsqbot>  {2 2 2 2 2 ?^ ?^ ?^ ?^ ?^}
12:26:34 <mroman> !blsq "2 5"pejbxj.*\[sa{?^}j.*\[_+e!
12:26:34 <blsqbot>  ERROR: Burlesque: (**) Invalid arguments!
12:26:41 <mroman> wth
12:26:52 <mroman> !blsq "2 5"pejbxj.*\[sa{?^}j?d.*\[_+e!
12:26:52 <blsqbot>  20035299304068464649790723515602557504478254755697514192650169737108940595563114
12:26:54 <mroman> ah
12:27:09 <b_jonas> that's truncated
12:27:18 <mroman> yep
12:27:25 <mroman> and it's only twice as long as fizzies solution
12:27:33 <b_jonas> [ ^/4$2
12:27:33 <j-bot> b_jonas: 65536
12:27:48 <b_jonas> [ 2^16
12:27:48 <j-bot> b_jonas: 65536
12:27:56 <b_jonas> [ 2^2^4
12:27:57 <j-bot> b_jonas: 65536
12:28:12 <mroman> hm
12:28:22 <mroman> > 2^(2^5)
12:28:23 <lambdabot>  4294967296
12:28:39 <mroman> > 2^(2*5)
12:28:41 <lambdabot>  1024
12:29:08 <b_jonas> [ 16(32)b.1
12:29:09 <j-bot> b_jonas: 65536
12:29:14 <mroman> > 2^4
12:29:16 <lambdabot>  16
12:29:43 <mroman> !blsq {2 2 2 2 2}q?^r[
12:29:43 <blsqbot>  65536
12:29:48 <mroman> !blsq {2 2 2 2 2}q?^r[2j?^
12:29:48 <blsqbot>  20035299304068464649790723515602557504478254755697514192650169737108940595563114
12:29:59 <mroman> !blsq {3 3 3}q?^r[2j?^
12:29:59 <blsqbot>  14907494374831386027492982111718907719449320022227325901415431501076384308276971
12:30:07 <mroman> !blsq {3 3 3}q?^r[3j?^
12:30:07 <blsqbot>  15054164145220926243143298033398654543076143473537427823628361588037621543571301
12:30:32 -!- sebbu2 has changed nick to sebbu.
12:30:40 <mroman> hm
12:30:50 <mroman> !blsq {3 3 3}3CO
12:30:50 <blsqbot>  {{3 3 3}}
12:30:53 <mroman> !blsq {3 3 3}3co
12:30:53 <blsqbot>  {{3 3 3}}
12:31:01 <mroman> !blsq {3 3 3}r@
12:31:01 <blsqbot>  {{3 3 3} {3 3 3} {3 3 3} {3 3 3} {3 3 3} {3 3 3}}
12:31:04 <mroman> !blsq {3 3 3}R
12:31:04 <blsqbot>  ERROR: (line 1, column 9):
12:31:05 <mroman> !blsq {3 3 3}R@
12:31:05 <blsqbot>  {{} {3} {3} {3 3} {3} {3 3} {3 3} {3 3 3}}
12:31:08 <mroman> !blsq {3 3 3}R@NB
12:31:08 <blsqbot>  {{} {3} {3 3} {3 3 3}}
12:31:15 <mroman> !blsq {3 3 3}R@NB{q?^r[}
12:31:15 <blsqbot>  {{?^} r[}
12:31:25 <mroman> !blsq {3 3 3}R@NB{q?^r[}m[
12:31:25 <blsqbot>  {ERROR: Burlesque: (r[) Empty list! 3 27 19683}
12:31:33 <mroman> !blsq {3 3 3}R@NB{q?^r[}m[[-
12:31:33 <blsqbot>  {3 27 19683}
12:31:41 <mroman> !blsq {3 3 3}R@NB{q?^r[}m[[-q?^l[
12:31:41 <blsqbot>  ERROR: Unknown command: (l[)!
12:31:43 <mroman> !blsq {3 3 3}R@NB{q?^r[}m[[-q?^r[
12:31:43 <blsqbot>  Ain't nobody got time fo' dat!
12:39:18 -!- shikhout has changed nick to shikhin.
12:39:30 <b_jonas> [ 3^3^3
12:39:30 <j-bot> b_jonas: 7.6256e12
12:53:18 -!- MDream has changed nick to MDude.
13:23:33 <fizzie> Heh, some LaTeX mishap has turned all the 'fi' ligatures in this PDF to £s.
13:24:34 <fizzie> "The £rst step in the algorithm --"  "The £nal step --"  "-- in the audio £le --"  "-- until we £nd an optimal --"
13:25:06 <fizzie> "We de£ne --"
13:41:16 -!- Sprocklem has quit (Ping timeout: 265 seconds).
14:25:14 -!- S1 has joined.
14:25:32 -!- S1 has quit (Client Quit).
14:28:03 -!- S1 has joined.
14:28:36 -!- S1 has quit (Client Quit).
14:29:02 -!- S1 has joined.
14:29:37 <elliott> fizzie: that's the origin of the pound sign, from the latin "fiscus"
14:29:58 <elliott> obviously it no longer looks much like a fi ligature
14:30:02 <elliott> like & is no longer et
14:55:08 -!- S1 has quit (Quit: S1).
15:17:50 -!- Sprocklem has joined.
15:19:22 <b_jonas> [ >:^:_1.0
15:19:23 <j-bot> b_jonas: >:^:_1
15:19:34 <b_jonas> [ >:^:_]1.0
15:19:50 <j-bot> b_jonas: |timeout
15:20:02 <b_jonas> [ >:^:_]2.0
15:20:18 <j-bot> b_jonas: |timeout
15:20:32 <b_jonas> timeout around 15 seconds? ok
15:29:03 -!- mihow has joined.
15:29:11 <mroman> that's a lot of seconds
15:29:52 <mroman> blsqbot has 42100 micro-seconds
15:30:57 <mroman> (i.e. 0.0421s)
15:31:36 <mroman> !blsq 1R@fC
15:31:36 <blsqbot>  Ain't nobody got time fo' dat!
15:32:05 <mroman> !blsq 1000000fC
15:32:05 <blsqbot>  {2 2 2 2 2 2 5 5 5 5 5 5}
15:32:11 <mroman> !blsq 10000000fC
15:32:12 <blsqbot>  {2 2 2 2 2 2 2 5 5 5 5 5 5 5}
15:32:14 <mroman> !blsq 100000000fC
15:32:15 <blsqbot>  {2 2 2 2 2 2 2 2 5 5 5 5 5 5 5 5}
15:32:22 <mroman> !blsq 123456789fC
15:32:22 <blsqbot>  {3 3 3607 3803}
15:32:26 <mroman> !blsq 12345678912fC
15:32:26 <blsqbot>  {2 2 2 2 2 2 3 7 9185773}
15:32:29 <mroman> !blsq 123456789123456789fC
15:32:29 <blsqbot>  {3 3 7 11 13 19 3607 3803 52579}
15:32:32 -!- drdanmaku has joined.
15:32:33 <mroman> !blsq 123456789123456789123456789fC
15:32:33 <blsqbot>  Ain't nobody got time fo' dat!
15:32:37 <mroman> !blsq 1234567891234567891234567fC
15:32:37 <blsqbot>  Ain't nobody got time fo' dat!
15:32:39 <mroman> !blsq 12345678912345678912345fC
15:32:39 <blsqbot>  Ain't nobody got time fo' dat!
15:32:42 <mroman> !blsq 123456789123456789123fC
15:32:42 <blsqbot>  Ain't nobody got time fo' dat!
15:32:45 <mroman> !blsq 1234567891234567891fC
15:32:45 <blsqbot>  Ain't nobody got time fo' dat!
15:32:47 <mroman> come on
15:32:49 <b_jonas> [ `: 123456789123456789123456789x
15:32:49 <mroman> !blsq 123456789123456789fC
15:32:50 <blsqbot>  {3 3 7 11 13 19 3607 3803 52579}
15:32:50 <j-bot> b_jonas: `:123456789123456789123456789x
15:32:52 <b_jonas> [ q: 123456789123456789123456789x
15:32:52 <j-bot> b_jonas: 3 3 3 757 3607 3803 440334654777631
15:32:59 <drdanmaku> wat
15:33:24 <mroman> !blsq 757fC
15:33:24 <blsqbot>  {757}
15:33:28 <mroman> hm
15:33:30 <mroman> interesting
15:33:44 <mroman> !blsq 757fc
15:33:44 <blsqbot>  {1 757}
15:34:20 <mroman> !blsq 123456789123456789fC
15:34:20 <blsqbot>  {3 3 7 11 13 19 3607 3803 52579}
15:34:27 <mroman> !blsq 123456789123456789 757 ./
15:34:27 <blsqbot>  163086907692809
15:34:34 <drdanmaku> !blsq 1fC
15:34:34 <blsqbot>  {}
15:34:37 <drdanmaku> !blsq 123fC
15:34:37 <blsqbot>  {3 41}
15:35:40 <mroman> 757 isn't a primefactor of 123456789123456789
15:35:44 <mroman> !blsq 123456789123456789 757.0 ./
15:35:44 <blsqbot>  163086907692809.5
15:36:04 <mroman> [ q: 123456789123456789x
15:36:04 <j-bot> mroman: 3 3 7 11 13 19 3607 3803 52579
15:39:55 <mroman> [ `: 123456789123456789x
15:39:56 <j-bot> mroman: `:123456789123456789x
15:40:20 <mroman> !blsq 123456789123456789123456789fC
15:40:20 <blsqbot>  Ain't nobody got time fo' dat!
15:40:30 <mroman> [ q: 123456789123456789123456789x
15:40:30 <j-bot> mroman: 3 3 3 757 3607 3803 440334654777631
15:41:01 <mroman> for what it's worth fc and fC are incredibly slow in burlesque
15:41:23 <mroman> 123456789123456789123456789fC takes about 5 seconds
15:42:06 <mroman> or 2 seconds if compiled with -O3
15:50:15 <b_jonas> !blsq {118510834 139026927 21900876 263490528 54952227 28989415 185234088 119320923}{JfC{}j+]j+]}m[
15:50:15 <blsqbot>  {{118510834 {2 13 4558109}} {139026927 {3 13 23 154991}} {21900876 {2 2 3 23 73 
15:50:43 <b_jonas> !blsq <@q: 118510834 139026927 21900876 263490528 54952227 28989415 185234088 119320923
15:50:43 <blsqbot>  119320923
15:50:50 <b_jonas> [ <@q: 118510834 139026927 21900876 263490528 54952227 28989415 185234088 119320923
15:50:51 <j-bot> b_jonas: +------------+--------------+----------------+--------------------+-------------+------------------+--------------------+----------+
15:50:51 <j-bot> b_jonas: |2 13 4558109|3 13 23 154991|2 2 3 23 73 1087|2 2 2 2 2 3 7 392099|3 3 11 555073|5 7 13 13 13 13 29|2 2 2 3 13 23 83 311|3 39773641|
15:50:51 <j-bot> b_jonas: +------------+--------------+----------------+--------------------+-------------+------------------+--------------------+----------+
15:52:03 <mroman> !blsq {118510834 139026927 21900876 263490528 54952227 28989415 185234088 119320923}JfCz[
15:52:03 <blsqbot>  {{118510834 {2 13 4558109}} {139026927 {3 13 23 154991}} {21900876 {2 2 3 23 73 
15:52:36 <b_jonas> ah!
15:52:48 <mroman> !blsq {118510834 139026927 21900876 263490528 54952227 28989415 185234088 119320923}JfCz[sp
15:52:49 <blsqbot>  118510834 [2, 13, 4558109]
15:52:58 <b_jonas> mroman: is there a command to create a block from the top two stack elements, or from the top one stack element?
15:53:07 <mroman> there's bx
15:53:09 <mroman> !blsq 5bx
15:53:09 <blsqbot>  {5}
15:53:18 <b_jonas> ah, good
15:53:26 <mroman> otherwise, no.
15:53:35 <mroman> !blsq 1 2bx_+
15:53:35 <blsqbot>  ERROR: Burlesque: (_+) Invalid arguments!
15:53:36 <b_jonas> !blsq 118510834JfCbXj+]
15:53:37 <blsqbot>  ERROR: Burlesque: (+]) Invalid arguments!
15:53:41 <mroman> !blsq 1 2bx+]
15:53:41 <blsqbot>  ERROR: Burlesque: (+]) Invalid arguments!
15:53:43 <mroman> !blsq 1 2bxj+]
15:53:43 <blsqbot>  {1 2}
15:53:44 <b_jonas> !blsq 118510834JfCbxj+]
15:53:44 <blsqbot>  {118510834 {2 13 4558109}}
15:55:11 <mroman> theres CL/Cl though
15:55:16 <mroman> which in some circumstances might work for you
15:55:20 <mroman> !blsq 1 2CL
15:55:21 <blsqbot>  {2 1}
15:55:22 <mroman> !blsq 1 2Cl
15:55:23 <blsqbot>  {1 2}
15:55:53 <b_jonas> !blsq 1 2#s
15:55:53 <blsqbot>  {2 1}
15:56:11 <mroman> !blsq 5{JCl}GO
15:56:11 <blsqbot>  {{1 1} {2 2} {3 3} {4 4} {5 5}}
15:57:01 <mroman> !blsq 5{JfcCl}GO
15:57:01 <blsqbot>  {{1 {1}} {2 {1 2}} {3 {1 3}} {4 {1 2 4}} {5 {1 5}}}
15:58:42 <mroman> !blsq 5{JfcCl}GOtp
15:58:42 <blsqbot>  {{1 2 3 4 5} {{1} {1 2} {1 3} {1 2 4} {1 5}}}
15:59:21 <mroman> !blsq 10qfcGO
15:59:21 <blsqbot>  {{1} {1 2} {1 3} {1 2 4} {1 5} {1 2 3 6} {1 7} {1 2 4 8} {1 3 9} {1 2 5 10}}
15:59:33 <mroman> !blsq 10qfcGO)++
15:59:33 <blsqbot>  {1 3 4 7 6 12 8 15 13 18}
16:00:25 <mroman> !blsq 50qfcGO)++
16:00:26 <blsqbot>  {1 3 4 7 6 12 8 15 13 18 12 28 14 24 24 31 18 39 20 42 32 36 24 60 31 42 40 56 3
16:00:39 <mroman> hm
16:01:14 <mroman> Is there a term for a pair of numbers (a,a+1) where the sum of all factors for both numbers is the same?
16:01:36 <mroman> !blsq 14fc++15fc++
16:01:36 <blsqbot>  24
16:01:39 <mroman> !blsq 14fc++15fc++#S
16:01:39 <blsqbot>  24
16:01:40 <mroman> !blsq 14fc++15fc++#s
16:01:40 <blsqbot>  {24 24}
16:01:46 <mroman> !blsq 14fc15fc#s
16:01:46 <blsqbot>  {{1 3 5 15} {1 2 7 14}}
16:01:52 <b_jonas> mroman: compute the first few and look it up in OEIS?
16:02:01 <mroman> puh
16:02:03 <mroman> alright
16:02:11 <mroman> !blsq 50qfcGO)++2co
16:02:11 <blsqbot>  {{1 3} {4 7} {6 12} {8 15} {13 18} {12 28} {14 24} {24 31} {18 39} {20 42} {32 3
16:02:14 <b_jonas> factors or proper factors?
16:02:19 <mroman> !blsq 50qfcGO)++2CO
16:02:19 <blsqbot>  {{1 3} {3 4} {4 7} {7 6} {6 12} {12 8} {8 15} {15 13} {13 18} {18 12} {12 28} {2
16:02:21 <mroman> factors
16:02:26 <b_jonas> wait, are there even such numbers?
16:02:30 <mroman> yes
16:02:32 <mroman> 14 and 15
16:02:45 <b_jonas> ok, are there at least 4 such numbers?
16:02:51 <b_jonas> one isn't enough for oeis
16:02:58 <mroman> I don't know :)
16:05:16 <mroman> @oeis 14 15 206 207 957 958
16:05:16 <lambdabot>  Table of consecutive numbers with the same sum of divisors.[14,15,206,207,95...
16:06:31 <b_jonas> um, that doesn't give an A-number
16:08:20 <fizzie> I was going to say "consecutive amicable numbers", but that's the sum of all proper divisors, not all factors.
16:11:18 <fizzie> There seems to be no pair of amicable numbers that are consecutive. ("In every known case, the numbers of a pair are either both even or both odd. It is not known whether an even-odd pair of amicable numbers exists, but if it does, the even number must either be a square number or twice one, and the odd number must be a square number.")
16:11:51 <fizzie> Oh, right, it's also sum-equals-the-other-number, not same-sum.
16:15:19 <HackEgo> [wiki] [[Talk:BytePusher]] M http://esolangs.org/w/index.php?diff=40700&oldid=39781 * Nucular * (+0) The JsBP repo was renamed
16:15:44 <HackEgo> [wiki] [[BytePusher]] M http://esolangs.org/w/index.php?diff=40701&oldid=40268 * Nucular * (+0) The JsBP repo was renamed
16:16:23 -!- myndzi\ has joined.
16:18:47 -!- weissschloss has quit (Max SendQ exceeded).
16:21:05 -!- weissschloss has joined.
16:29:19 <mroman> wtf keeps javac complaining about duplicate class
16:29:21 <mroman> is it insane?
16:31:04 <mroman> wth is going on
16:31:31 -!- nyuszika7h has quit (Quit: WeeChat 1.1-dev).
16:32:08 -!- nyuszika7h has joined.
16:33:23 <mroman> something is broken here o_O
16:34:04 <b_jonas> mroman: wait, do you mean javac keeps complaining about it, or something keeps javac from complaining about it when it shouldn't?
16:44:16 <mroman> it says my class is a duplicate
16:44:24 <mroman> but even if I rename it to HTunsauhntaeouhn it will still be a duplicate class
16:44:35 <mroman> no matter what the class is called it will complain about it being a duplicate
16:46:07 <b_jonas> mroman: are you sure you only have one class per source file, and that class has a name matching the filename? I think java is a bit moronic about that (even more than haskell)
16:48:12 <mroman> hm
16:48:33 <mroman> turns out I specified a package not matching the folder structure on the file system
16:48:49 <mroman> instead of foo.bar.baz i wrote foo.baz.bar
16:49:13 <mroman> why the fuck this will produce duplicate class error still remains a mystery
16:49:18 <mroman> there are no classes in foo.baz.bar
16:49:23 <mroman> it doesn't even exist
16:49:50 <mroman> *gotta catch train now*
17:06:15 -!- myndzi\ has quit.
17:13:53 <Taneb> I had a dream last night where someone told me I need to drink more alcohol
17:13:58 <Taneb> Like,as a general thing
17:16:29 -!- shikhin has quit (Ping timeout: 245 seconds).
17:33:32 -!- Frooxius has quit (Quit: *bubbles away*).
17:35:17 -!- Sprocklem has quit (Ping timeout: 245 seconds).
17:49:24 -!- nyuszika7h has quit (Quit: WeeChat 1.1-dev).
17:49:54 -!- nyuszika7h has joined.
17:51:52 -!- nyuszika7h has quit (Client Quit).
17:52:17 -!- nyuszika7h has joined.
18:10:55 <J_Arcane> Anyone know any code golf friendly tricks for text obfuscation?
18:13:04 <Taneb> Problem with my dream is, I look quite young, and I don't have any ID currently
18:13:33 <Taneb> So I can't get more alcohol
18:14:35 <kline> J_Arcane: python list comprehensions can be compact and well obfuscated
18:15:25 <J_Arcane> Was trying to think if I could hide a 'punchline' in a bit of tweet-sized code that when run would then spit out the intended message, without it being obvious at a glancy.
18:16:44 <fizzie> Isn't that kind of like the typical http://en.wikipedia.org/wiki/Just_another_Perl_hacker program.
18:17:14 <b_jonas> exactly, there's lots of perl obfus doing that
18:17:20 <b_jonas> and some in other languages too
18:17:38 <fizzie> Possibly not so often about compactness, but still.
18:17:44 <b_jonas> `perl -e sub h($){($_=$_[0]=pack b208,0 .unpack b362,$_[0])=~tr/\0-\c?/\0/;tr/\0/\377/c;$_}do{$y=$r;$v=join$r='',a..z;$r^=h$r&"\217"x26^h$v&$y for 0..6;$r^=$_ x26}for"k6sNP2B}({ambrusLB%Ox)Z]n0*zf\0I3"=~/./g;print$r
18:17:45 <HackEgo> Just another Perl hacker,
18:17:47 <fizzie> I like the "keywords only" code in that article.
18:17:52 <J_Arcane> Heh heh.
18:18:00 <b_jonas> I think that one doesn't fit in a tweet
18:18:11 <b_jonas> but I have shorter ones that do
18:19:31 <fizzie> The http://golf.shinh.org/p.rb?Helloworldless+Hello+world solutions might also give some ideas.
18:19:38 <fizzie> And those are designed for compactness.
18:20:01 <b_jonas> depending on how obfuscated you want, juts a simple transliteration (caesar cipher) can work. that's only a few characters
18:22:28 <fizzie> The Perl ones in that competition are a bit overly "binary", though.
18:36:04 -!- Sprocklem has joined.
18:57:34 -!- kcm1700 has joined.
18:58:46 -!- Sprocklem has quit (Ping timeout: 244 seconds).
19:00:23 -!- kcm1700_ has quit (Ping timeout: 240 seconds).
19:00:42 -!- Sprocklem has joined.
19:03:31 <J_Arcane> b_jonas: yeah, I was thinking of using Racket again for the challenge and just doing a quickie lambda to iterate over a rot47 string of the intended message.
19:04:58 -!- Sprocklem has quit (Ping timeout: 244 seconds).
19:15:37 <J_Arcane> Well. That was easier than expected. 1) Racket can do for loops over strings. 2) Racket is Unicode. 3) Because of 2 I was able to compress my message down to half the visible chars by using a ROT offset that bumped them into a ligature range.
19:35:27 -!- perrier has quit (Remote host closed the connection).
19:36:41 -!- perrier has joined.
19:44:57 <fizzie> https://dl.dropboxusercontent.com/u/113389132/Misc/20141028-esoteric-2014.ogg
19:46:51 -!- nycs has quit (Ping timeout: 255 seconds).
19:49:39 <zzo38> What is the safest way to measure electrical resistance of your body?
19:50:00 -!- `^_^v has joined.
19:51:40 <int-e> http://www.darwinawards.com/darwin/darwin1999-50.html is a data point of sorts
19:54:12 <zzo38> That is people misusing the device...
19:56:45 <zzo38> I refer to this like this http://www.lermanet.com/shock1.htm where some people believe it might be dangerous due to electricity passing through a body. (This is describing the "e-meter", a ridiculously overpriced ohmmeter with continuously variable range and sensitivity, and a built-in digital clock. However, there are also other similar devices, can be used as biofeedback.)
20:06:11 <int-e> I can't extract information from that page, beyond the carneval story.
20:08:41 <int-e> In particular this: "My calculations equate 2 shocks of a 200Volt 2 second AC treatment with 2.5 hours spent on an emeter" ... fine, but this says nothing about the effects.
20:11:40 <zzo38> Well, I have read stuff about possible effects, in other articles too.
20:12:24 <zzo38> There is stuff about electroplating and pain killing: http://www.lermanet.com/e-metershort.htm
20:12:44 <int-e> I always assumed that the main effects were psychological, but perhaps that was wrong.
20:13:08 <int-e> I don't really care either way, Scientology doesn't deserve that attention :P
20:14:36 <zzo38> I have also read of other things where the device may not be as accurate as it could be, as well as in one page, someone said it might possibly catch fire because it isn't built in best way.
20:14:44 <zzo38> (As well as problems with the fuse.)
20:15:15 <int-e> who cares about the accuracy?!
20:15:16 <zzo38> But it isn't about Scientology that I am talking about here, but rather simply a device which they use, as well as a class of similar devices.
20:15:33 <int-e> anyway, I'm out.
20:16:39 <zzo38> And how to improve the safety and accuracy of such classes of biofeedback ohmmeters.
21:00:24 -!- nycs has joined.
21:02:47 -!- `^_^v has quit (Ping timeout: 245 seconds).
21:50:04 <Bike> zzo38: it's not really constant even across parts of your body. i'd just use a multimeter and a harmlessly small power source, i guess
21:50:21 <Bike> human bodies aren't ohmic. imo, woe.
22:03:25 -!- nycs has quit (Quit: This computer has gone to sleep).
22:03:52 <FreeFull> With a normal multimeter, you won't feel it if it's across normal skin, but blood is conductive enough, that if you stick the pins into your thumbs, the current across your heart will stop it
22:05:35 <Sgeo> I remember wanting ... some weird scoping in Clojure. Now that I understand Scala implict arguments, I think that that's exactly what I wanted
22:13:48 -!- boily has joined.
22:17:27 -!- oerjan has joined.
22:27:44 <Bike> FreeFull: right, avoid that
22:29:02 <boily> Sgello. still discovering Scala?
22:30:18 <Taneb> Does anyone have a convinient BF Joust Hill Manager I can plug into an IRC bot written in Haskell?
22:31:19 <Sgeo> boily: My nick is Sgeo, not Sgello, hth
22:31:24 <Sgeo> I do not ping on Sgello
22:32:29 <boily> beuh :/
22:32:38 -!- mihow has quit (Quit: mihow).
22:33:04 <Sgeo> And yes, still learning about Scala
22:33:19 <oerjan> !help bfjoust
22:33:24 <Sgeo> I think I like the whole PartialFunction thing... or at least almost like it
22:33:29 <oerjan> hm
22:33:43 <oerjan> !bfjoust
22:33:43 <zemhill> oerjan: "!bfjoust progname code". See http://zem.fi/bfjoust/ for documentation.
22:33:55 <Sgeo> (You can define a function with pattern matching and if you don't define it for all domains, you can actually ask the function 
22:34:03 <Sgeo> 'are you defined on this value')
22:34:32 <Bike> something something halting problem !!!!!
22:35:07 <Taneb> oerjan, thanks
22:35:16 <Taneb> Any idea how to call Ruby from Haskell?
22:35:23 <oerjan> nope
22:35:25 <Sgeo> .isDefinedAt not guaranteed to be accurate
22:35:55 <Sgeo> But it's correct enough when definine functions via pattern matching, I think
22:36:02 <boily> it sounds a lot like some kind of multiple dispatch thingie...
22:36:06 <oerjan> Taneb: you might want to discuss this with fizzie since he wrote most of it. also he presumably has it on github.
22:36:09 <Sgeo> http://www.scala-lang.org/api/current/index.html#scala.PartialFunction
22:36:22 <boily> oh. partial. no polymorphic.
22:37:03 <Taneb> https://github.com/fis/chainlance/ I think
22:37:47 <oerjan> right
22:37:50 <Sgeo> Scala has polymorphic methods but not functions :(
22:38:58 -!- idris-bot has quit (Quit: Terminated).
22:39:16 <Taneb> Oh, it's mostly C
22:40:03 <oerjan> yeah the bfjoust interpreter itself is the same as was used in old EgoBot, i think
22:40:27 <oerjan> (fizzie wrote that one, too)
22:40:29 <Sgeo>   def implicitly[T](implicit e: T) = e    // for summoning implicit values from the nether world
22:42:35 <FireFly> Is that scala?
22:42:45 <FireFly> o wait you said so up there
22:44:44 <boily> nothing like a good summoning to liven up your code.
22:45:08 <Melvar> < fizzie> https://dl.dropboxusercontent.com/u/113389132/Misc/20141028-esoteric-2014.ogg – What is that?
22:47:47 <zzo38> I don't know what that is supposed to mean either.
22:48:39 <oerjan> Taneb: note that i don't think fizzie has yet managed to fix the bug in the matrix-based scoring
22:49:20 <oerjan> in the beginning things occasionally crashed, but lately i think results got completely out of whack?
22:49:36 -!- idris-bot has joined.
22:52:09 <zzo38> I wrote this API file for ZTERM: http://sprunge.us/JQHI Do you think it is OK, what other comment/complaint please?
22:54:26 <fizzie> oerjan: Yes to all: I haven't fixed anything, and there were some very suspicious results.
22:54:30 <zzo38> The actual definitions are almost all very short
22:54:59 <zzo38> Also, zterm_init() does nothing at all except on Windows (in which it changes stdin and stdout to binary)
22:56:55 <fizzie> Melvar: I've had this habit of every now and then converting some #esoteric-related statistic to an audio signal, that's just one more of those. The details probably aren't all too interesting. (It's based on channel activity again.)
22:57:33 <zzo38> fizzie: What is the methods of the data?
22:57:53 <Melvar> fizzie: Ah. Neat.
23:01:09 <fizzie> zzo38: Well. It was done by taking the 257 nicks with most messages in my logs for 2014, sorting them, and then building a message count matrix where rows correspond to nicks and columns to hours in 2014, taking the square root of that and considering it as a (non-redundant half of a) magnitude spectrum, and synthesizing a signal to have a spectrum like that. More or less.
23:03:19 <Taneb> fizzie, in theory, how hard would it be to call chainlance from Haskell?
23:04:05 <fizzie> Taneb: I don't know much about Haskell's IO/process bits, but I wouldn't think it'd be that hard. For hill use, you might want to be using the 'chainlanced' binary.
23:06:26 <fizzie> Taneb: Er, sorry, I mean "gearlanced".
23:08:07 <oerjan> it seems like the ruby version just calls it as an executable capturing stdin/stdout, so the haskell equivalent would be using System.Process and a couple threads, i think.
23:10:04 <Taneb> Lovely
23:10:22 <fizzie> The "protocol" it speaks to stdin/stdout is documented in the comments of gearlanced.c. It basically just keeps a set of N precompiled programs, and lets you run a challenger against the set efficiently, plus commands to set those "slots".
23:11:02 <oerjan> you might or might not need the threads, dependent on deadlock possibilities
23:12:41 <fizzie> It's designed to be somewhat friendly for pipe-based use, in the sense that if you write a full command to (its) stdin, and then read the correct amount of lines from (its) stdout, nothing should hang up due to unfilled pipe buffers.
23:13:34 <fizzie> Er, s/unfilled/filled-up/
23:15:49 <oerjan> sounds like threads are optional, then.
23:16:10 <oerjan> (could still be nice to use them in an irc bot)
23:17:01 <oerjan> handling PINGs if nothing else
23:17:16 <fizzie> The Ruby stuff doesn't involve threads in the "Gear" class, but there's one in the actual hill-manager, since it gets jobs from both the web-submission system and the IRC bot.
23:17:28 <oerjan> ah
23:19:22 <fizzie> I really should spend some time figuring out what's up with the crazy results, but I've spent all free-programming time fiddling with golf lately.
23:20:22 -!- heroux_ has quit (Ping timeout: 265 seconds).
23:20:43 <oerjan> i am not golfing anywhere near as much as you but _still_ my usual website browsing gets backlogged
23:21:03 -!- heroux has quit (Ping timeout: 255 seconds).
23:21:59 <oerjan> i suppose it might also be increased activity
23:27:25 <Sgeo> I wonder about the security implications of, say, custom string interpolation. Of course, it's /safe/ from, say, SQL injection (assuming an appropriate interpolation), but forcing a reader of the code to take their time to confirm that a line that looks unsafeish is actually safe is probably a bad idea. Also, someone could get used to it then see something simiilar in another language, then ignore it
23:28:08 <Sgeo> Although I guess sql"select * from foo where user=$user" the sql indication is obvious, and no one would be dumb enough to, say, have sql mean an unsafe interpolator
23:28:23 -!- Sprocklem has joined.
23:29:39 <oerjan> @list oeis
23:29:39 <lambdabot> oeis provides: oeis sequence
23:30:03 <oerjan> @sequence 14 15 206 207 957 958
23:30:03 <lambdabot>  Table of consecutive numbers with the same sum of divisors.[14,15,206,207,95...
23:30:15 <oerjan> hmph still no A number
23:30:51 <oerjan> :t oeis
23:30:52 <lambdabot> Not in scope: ‘oeis’
23:31:54 <Sgeo> Of /course/ Scala && etc are just methods that take the second argument by-name
23:32:00 <Sgeo> That's... really kind of neat
23:32:55 -!- heroux has joined.
23:33:12 <oerjan> Sgeo: any sentence beginning with "no one would be dumb enough to" is false hth
23:34:27 <oerjan> Sgeo: besides, dependent on language, the sql function may not see the contents of the string until after the interpolation is already done.
23:34:30 -!- heroux_ has joined.
23:34:58 <oerjan> perl and bash both come to mind
23:35:07 <Taneb> "no-one would be dumb enough to prepend this sentence with its own quotation" no-one would be dumb enough to prepend this sentence with its own quotation
23:36:03 <Sgeo> oerjan: referring to Scala specifically, custom String interpolators get to see the literal parts of the string and the values the user intends to insert into the string, although the API for making a custom interpolator is really weird. What do Perl/Bash do?
23:36:23 <oerjan> Taneb: that's not starting with it, although admittedly neither did Sgeo's instance
23:36:50 <boily> Taneb: but if the no-one-dumb-postulate is true, therefore this is false, therefore is dumb, therefore is true.
23:38:33 <oerjan> Sgeo: in those languages, it wouldn't be a custom string interpolation, just a function/command applied to an argument that happens to come from a string
23:38:57 <Sgeo> Ah
23:39:33 <zzo38> How can I fit geolocation data into a version 1 UUID?
23:40:03 <elliott> sql queries aren't strings anyway.
23:40:05 <zzo38> There is MAC address and the timestamp, which is good but then geolocation data should be added too in order to ensure better uniqueness.
23:40:09 <oerjan> i suppose haskell's quasiquotes would be similar to what scala does, so [sql|...|] in haskell would probably be assumed to take care of safety.
23:40:45 <Sgeo> https://gist.github.com/seratch/3436229
23:40:50 <zzo38> If you want to do executing SQL function you should use host parameters anyways for the parameter values, rather than putting them into the string, usually.
23:41:13 <Sgeo> zzo38: Scala lets you do that while making it look like you're making a string
23:41:38 <boily> zzo38: how many bits do you need for significant and useful geolocation data? or at least enough to avoid collisions?
23:42:39 <zzo38> boily: I don't know, but I only need enough to avoid collisions. But it needs to be good enough that the specified MAC address is guaranteed not to be in use elsewhere within the area it covers.
23:43:44 <FireFly> zzo38: why do you want to encode geolocation data in a UUID?
23:44:25 <boily> modulo spoofing, aren't MACs guaranteed by themselves to always be unique?
23:44:25 <zzo38> FireFly: In order to cause less interference in case the same MAC address is somehow duplicated
23:44:43 <boily> ah. spoofing.
23:44:56 <zzo38> (I know it isn't supposed to be duplicated, but I don't know what happens, in case a mistake it made or something)
23:45:12 <FireFly> boily: does "spoofing" include "nasty manufacturers not caring to follow MAC address registration procedures"?
23:46:45 <boily> it didn't, but now I think it does. I guess off-off-brand cheap manufacturers cloning existing hardware?
23:47:46 <zzo38> I think you could set the "locally administered" bit in the MAC address to indicate that, at least, if you are unable to register a unique MAC address for some reason.
23:48:06 <zzo38> (In such a case, you should also always allow the user to change it to a different locally administered address.)
23:48:53 <HackEgo> [wiki] [[Talk:Checkout]]  http://esolangs.org/w/index.php?diff=40702&oldid=34651 * 24.19.237.231 * (+757) /* Impossible to checkout to level 6? */ new section
23:49:40 <Sgeo> elliott: the result of interpolation in Scala isn't necessarily a string
23:53:12 <elliott> it's runtime, though, right?
23:53:19 <elliott> i.e. sql")" is a runtime error
23:53:33 <Sgeo> yes
23:53:42 <Sgeo> I think
23:53:54 <FireFly> boily: something like that.  I've heard of the situation happening