--- Log opened Wed Jun 02 00:00:21 2010 |
00:00 | <@ToxicFrog> | Scala's infix handling fills me with carnal desires. |
00:06 | | AnnoDomini [annodomini@Nightstar-a4817aa4.adsl.tpnet.pl] has quit [[NS] Quit: Enough plotting.] |
00:06 | | You're now known as TheWatcher[T-2] |
00:10 | | You're now known as TheWatcher[zZzZ] |
00:20 | | Attilla [Attilla@Nightstar-ba480caf.threembb.co.uk] has quit [[NS] Quit: ] |
00:43 | | Derakon[AFK] is now known as Derakon |
00:43 | | Thaqui [Thaqui@27B34E.D54D49.F53FA1.6A113C] has quit [Connection closed] |
01:05 | | gnolam [lenin@Nightstar-38637aa0.priv.bahnhof.se] has quit [[NS] Quit: Z?] |
01:35 | < Derakon> | So have y'all seen the Javascript+HTML5 Flash player? http://smokescreen.us/demos/sb45demo.html |
01:53 | < Vornotron> | It seems to be missing some things. Like the text. |
01:53 | < Vornotron> | But that's pretty impressive. |
02:06 | | Vornotron is now known as Vornicus |
02:32 | < celticminstrel> | Okay. Regex problem. |
02:33 | < celticminstrel> | I have a regex that is supposed to match a line, and it ends with several optional parts (ie ?-modified) |
02:34 | < celticminstrel> | If I put (\S+) before those, it matches the optional portions as part of the group, but if I change it to (\S+?) then the group matches just one character. |
02:34 | < celticminstrel> | Adding a $ to the end makes the match fail. |
02:34 | < celticminstrel> | Any ideas? |
02:40 | < celticminstrel> | Hm. Maybe replacing \S with [^\s,!\.]... |
02:40 | < celticminstrel> | Yes, I think I finally solved it. |
03:02 | | Serah [Z@3A600C.A966FF.5BF32D.8E7ABA] has quit [Ping timeout: 121 seconds] |
03:12 | | Reiv[Graduate] [orthianz@Nightstar-0b5fda32.xnet.co.nz] has joined #code |
03:14 | | cpux [Moo@Nightstar-20a84089.dyn.optonline.net] has quit [Ping timeout: 121 seconds] |
03:45 | | Reiv[Graduate] [orthianz@Nightstar-0b5fda32.xnet.co.nz] has quit [Client closed the connection] |
03:50 | | cpux [Moo@Nightstar-20a84089.dyn.optonline.net] has joined #code |
03:53 | | Thaqui [Thaqui@27B34E.D54D49.F53FA1.6A113C] has joined #code |
03:57 | | Reiv[Graduate] [orthianz@Nightstar-1d9d791f.xnet.co.nz] has joined #code |
04:42 | <@ToxicFrog> | I think I just figured out how to implement both flavours of pipes in Scala. |
04:46 | <@ToxicFrog> | (reverse composition by implementing a Pipe class that defines two | methods; parallelism similarly but it turns into an Actor when instantiated) |
04:51 | < Derakon> | Hrmph. One of the problems with switching Jetblade to using OpenGL-based rendering is that now my in-game console can't be drawn. |
04:52 | < Derakon> | Since it uses pygame's drawing and font rendering routines. |
05:06 | < Derakon> | You wouldn't think it would be so hard to render text in OpenGL. |
05:06 | < celticminstrel> | Would the Perl equivalent of Python a[:-2] be $a[0..$#a-2]? |
05:06 | < Derakon> | Especially given how downright trivial it is in SDL. |
05:06 | < Derakon> | Celticminstrel: that looks about right, yeah. |
05:14 | < celticminstrel> | Surely (\S+) (\S+) (\S+) (\S+) (\S+) (\S+) (\S*) would fail to match anything shorter than six words? |
05:17 | < celticminstrel> | Perl seems to be full of strange, arcane symbols. |
05:19 | < celticminstrel> | What's the difference between %, @, and $ as a variable prefix? |
05:22 | < Derakon> | % indicates a hashmap, like Python's dicts. @ is a list, and $ is a scalar. |
05:23 | < celticminstrel> | Okay, $a is presumed to be a string. |
05:28 | | * Derakon refreshes himself on Perl's hashmap construction, runs into an amusing unexpected behavior. |
05:28 | < Derakon> | Try this mini-script out for size: |
05:28 | < Derakon> | use Data::Dumper; |
05:28 | < Derakon> | @foo = (1, 2, 3); |
05:28 | < Derakon> | $foo[3] = 4; |
05:28 | < Derakon> | print Data::Dumper::Dumper(\@foo); |
05:28 | < Derakon> | %bar = ('a' => @foo); |
05:28 | < Derakon> | print Data::Dumper::Dumper(\%bar); |
05:30 | < celticminstrel> | What's perl's o option on regex? |
05:30 | < Derakon> | No idea; look it up. |
05:34 | | * Derakon writes a post on the gamedev.net forums complaining about how stupidly hard it is to just load a font from a standard file format and then draw it to the screen in OpenGLg. |
05:34 | < Derakon> | Er, OpenGL. |
05:35 | < Derakon> | Anyway, I might end up having to write my own library that uses SDL to load fonts, generate textures from them, and then draw them. ¬.¬ |
05:36 | < PinkFreud> | Derakon: er, don't you need to do a => \@foo? |
05:37 | < Derakon> | PinkFreud: indeed. Hence why that example caught me off-guard. |
05:37 | < PinkFreud> | ahh hah. |
05:37 | < Derakon> | More in the fact that Perl accepted it than that it didn't work as it looks like it should. |
05:37 | < Derakon> | The way Perl automatically flattens lists and basically just treats the => operator as a comma is kinda...weird. But then, it's Perl. |
05:38 | < PinkFreud> | yeah, you assigned an array to something which should have been a scalar value. heh. |
05:38 | < PinkFreud> | hashes are technically arrays in perl |
05:38 | < PinkFreud> | they're just kept in a specific order, unlike your typical array |
05:40 | < PinkFreud> | er... |
05:40 | | * PinkFreud rereads what he just typed, boggles |
05:41 | < PinkFreud> | that's it. I'm going to bed. |
05:45 | | cpux is now known as shade_of_cpux |
05:45 | < Derakon> | Sleep well. |
05:54 | | Reiv[Graduate] [orthianz@Nightstar-1d9d791f.xnet.co.nz] has quit [Client closed the connection] |
06:00 | | Reiv[Graduate] [orthianz@Nightstar-1d9d791f.xnet.co.nz] has joined #code |
06:10 | < Alek> | so uh. |
06:10 | < Alek> | what's a good antispyware program? |
06:10 | < Alek> | besides Spybot. |
06:10 | < Alek> | which is VERY buggy. |
06:11 | < Namegduf> | Ubuntu. |
06:11 | < Namegduf> | :P |
06:14 | | * Alek smacks the fudgemaN. |
06:28 | | Derakon is now known as Derakon[AFK] |
06:29 | | Reiv[Graduate] [orthianz@Nightstar-1d9d791f.xnet.co.nz] has quit [Client closed the connection] |
06:37 | | Reiv[Graduate] [orthianz@Nightstar-1d9d791f.xnet.co.nz] has joined #code |
06:39 | | AnnoDomini [annodomini@Nightstar-a4817aa4.adsl.tpnet.pl] has joined #code |
06:39 | | mode/#code [+o AnnoDomini] by Reiver |
07:11 | | You're now known as TheWatcher |
07:16 | < Vornicus> | gah, dang. |
07:16 | < Vornicus> | thought I had it, and I was wrong. |
07:22 | < Reiv[Graduate]> | ?? |
07:22 | < Vornicus> | Ophanim, a level in Manufactoria |
07:32 | | celticminstrel [celticminstre@Nightstar-f8b608eb.cable.rogers.com] has quit [[NS] Quit: *whistles* Did you hear something?] |
07:35 | | Reiv[Graduate] is now known as Reivthia |
07:35 | | celticminstrel [celticminstre@Nightstar-f8b608eb.cable.rogers.com] has joined #code |
07:35 | | celticminstrel [celticminstre@Nightstar-f8b608eb.cable.rogers.com] has quit [[NS] Quit: *whistles* Did you hear something?] |
07:36 | <@Kazriko> | Vornicus, i think I have an idea, but I need to try it first. |
07:37 | | * Kazriko throws a block together to kill leading red dots. |
07:39 | | * jerith is still trying to make Police small enough to use as a component in Judiciary. |
07:39 | <@Kazriko> | that was tough. had to squeeze it in on the side. |
07:39 | <@Kazriko> | my police took roughly the left half of the board. |
07:40 | <@Kazriko> | built it that way so I had the entire right half for judiciary. |
07:41 | <@Kazriko> | 4x7 to kill leading red dots. :( |
07:42 | <@Kazriko> | now I need two nearly identical blocks, one that it starts out in and uses if B is bigger, one to use if A is bigger... |
07:42 | < Vornicus> | Leading red dots can be done smaller than that. |
07:43 | <@Kazriko> | I suspect so. :( |
07:43 | <@Kazriko> | technically, if I don't count the entrance or the yellow generator that shifts it over there, it's only 4x6 |
07:43 | < Vornicus> | I actually have both numbers getting done by the same four pieces. |
07:44 | <@Kazriko> | Nod. I can see how that would work. I'll see if I need to condense that down though. |
07:44 | <@Kazriko> | actually, that is a good optimzation. |
07:45 | | * Kazriko spins the green block upward and conveys it back to the red loop. |
07:45 | <@Kazriko> | now it's a 4x4 block.- |
07:45 | < Vornicus> | Right now my problem is: how do I test segment length nondestructively? |
07:46 | <@Kazriko> | I'm doing it backward... |
07:46 | < Vornicus> | Compare top to bottom, when one falls out, check length? |
07:46 | < Vornicus> | I tried that, but couldn't get enough open space together to get the length checks working. |
07:47 | <@Kazriko> | well, start at the end comparing along the way, one block if B is bigger or equal, the other if A is, that way if they're both equal in length it gets it right, if there's a blue left in one, then it wins. |
07:47 | <@Kazriko> | eat from the least significant rather than trying to check lengths. |
07:47 | < Vornicus> | start at the bottom? that'd be a sensible idea. |
07:47 | < Vornicus> | if I could get it to freaking /work/ |
07:48 | <@Kazriko> | Ok, let me try that, I just need to get the B-block working here, then I can mirror it... |
07:59 | <@Kazriko> | hopefully the A block will be narrower than the B block. heh |
08:00 | < Vornicus> | Yeah, my b-block is 8 wide. |
08:00 | <@Kazriko> | 7 here. |
08:01 | <@Kazriko> | but I'll only have 5 on the other side. |
08:03 | <@Kazriko> | I guess without the backfeed line B is only 6 wide, and my 5 already includes a backfeed line. |
08:03 | <@Kazriko> | without it. |
08:03 | < Vornicus> | oh, there it goes. my B is set up nicely. |
08:06 | <@Kazriko> | if A is blue in the A block, it doesn't matter what B is... just eat the last and backfeed... |
08:06 | <@Kazriko> | bah. made a small mistake in my B block. |
08:07 | <@jerith> | I have Judiciary, Generals and Seraphim open. |
08:07 | < Vornicus> | Judiciary benefits from knowing how to do Seraphim. |
08:07 | <@jerith> | Seraphim actually looks like an easier version of Judiciary. |
08:08 | < Vornicus> | (It's essentially Police + Seraphim) |
08:08 | <@Kazriko> | yeah. Judiciary is Seraphim + police. |
08:08 | <@Kazriko> | hah. |
08:08 | | * Vornicus wins! |
08:08 | <@jerith> | My first thought when I read the description: Why is this one half of Judiciary? |
08:09 | <@jerith> | Do I want to write a subtracter or a two's-complementer and an adder? |
08:09 | <@jerith> | For Generals, that is. |
08:09 | <@jerith> | Given that my adder only handles carry bits at the moment. |
08:10 | <@Kazriko> | I wrote a subtracter using borrow bits and flipping 0's to 1's as I went... |
08:10 | | You're now known as TheWatcher[afk] |
08:10 | <@Kazriko> | Only because my adder was a mess. |
08:11 | <@Kazriko> | the subtracter I wrote was significantly smaller. |
08:11 | <@jerith> | I was considering that. Just use my adder but translate carry bits into borrow bits. |
08:12 | <@Kazriko> | at some point I need to go back and rewrite the adder. |
08:13 | <@jerith> | My adder's 111/7:30 |
08:13 | <@jerith> | I can see an obvious optimisation, though. |
08:14 | <@jerith> | In space, at least. It might increase time. |
08:14 | <@Kazriko> | 59/4:22, subtracter is 34/1:16 |
08:14 | <@Kazriko> | space is time in this game I've found. |
08:14 | <@Kazriko> | At least with conveyor belts. |
08:14 | <@Kazriko> | I always build with too many belts going around to make the blocks easier to work with. |
08:14 | <@jerith> | Erm, component, not space. |
08:15 | <@jerith> | Yeah. It adds six seconds. |
08:15 | <@jerith> | But now I must go to work. |
08:16 | <@jerith> | I wish these things were easier to manipulate. |
08:16 | <@jerith> | And a component library would be nice. |
08:16 | <@Kazriko> | later. |
08:16 | < Vornicus> | VICTORY |
08:17 | < Vornicus> | 117/1:10 |
08:17 | <@jerith> | I may be around from work. Got more multiminute testing going on today. ;_; |
08:17 | < Vornicus> | jerith: my versions of generals and officers are /the same damn thing/ |
08:18 | <@jerith> | Vornicus: Does Generals do anything with negative numbers? |
08:18 | <@Kazriko> | Yeah. I can see how that would be. Just flipping 1's to 0's in officers and 0's to 1's in generals. |
08:18 | <@Kazriko> | They don't use negative numbers in the tests. :) |
08:18 | < Vornicus> | Generals guarantees positive input. |
08:18 | < Vornicus> | ...Metatron. |
08:19 | < Vornicus> | This will not end well. |
08:20 | <@jerith> | 84/7:36 for the adder. |
08:21 | <@jerith> | I could probably do it without the carry bit, actually. |
08:21 | <@jerith> | Bah. Must go to work. |
08:24 | | * Vornicus ...actually thinks he's got it. |
08:34 | < Vornicus> | oh, so pretty. |
08:43 | <@Kazriko> | wow, that's a mess. |
08:44 | <@Kazriko> | 148/1:29 |
08:45 | <@Kazriko> | Metatron looks... hrm. |
08:45 | <@Kazriko> | like a problem to be solved another night. |
08:47 | <@Kazriko> | I can see several ways to do it, just have to think about which one would use the fewest parts... |
08:52 | < Vornicus> | 110/1:51 |
08:53 | <@Kazriko> | For metatron? |
08:53 | < Vornicus> | Yeah. More parts than I had in mind, but the only difficult part was getting all the ducks in a row when the first number ran out before the second did. |
08:54 | < Vornicus> | And /that/ is all of them. |
08:57 | | Reiv[Graduate] [orthianz@Nightstar-6f03ee43.xnet.co.nz] has joined #code |
08:59 | | Reivthia [orthianz@Nightstar-1d9d791f.xnet.co.nz] has quit [Ping timeout: 121 seconds] |
09:35 | < Vornicus> | If there was a components library thing, I'd itch for more game. |
09:35 | <@Kazriko> | yeah. |
09:35 | | * Kazriko would love to have subroutine blocks too. |
09:36 | <@Kazriko> | but then, that would start feeling like work instead of play. |
09:36 | < Vornicus> | heh |
09:36 | < Vornicus> | Some of the custom levels people come up with are ridiculous too. |
09:36 | < Vornicus> | "Accept: binary numbers divisible by 3" |
09:36 | <@Kazriko> | I started making a ladder logic set for LittleBigPlanet once... |
09:37 | <@Kazriko> | Was going to make a tutorial for people to learn ladder programming... |
09:37 | <@Kazriko> | it got to be way too much like work though. |
09:41 | < Vornicus> | Yeah, I don't do fiddlyshit for work, so I enjoy playing with fiddlyshit. |
09:42 | < Vornicus> | Betcha I could make a multiplier or a divider. |
09:42 | <@Kazriko> | nod. |
09:42 | <@Kazriko> | Heh... |
09:42 | <@Kazriko> | i think once I finish that last one, I won't have any further desire to play that game... |
09:43 | <@Kazriko> | It's funny. I do stuff like this, so I end up doing django webpages for fun at home instead. |
09:44 | <@Kazriko> | except that occasionally I do those at work too, so when I'm doing that at work, I relax with an rpg game or strategy game... |
09:54 | | You're now known as TheWatcher |
09:55 | | Orth [orthianz@Nightstar-a1794d6e.xnet.co.nz] has joined #code |
09:58 | | Reiv[Graduate] [orthianz@Nightstar-6f03ee43.xnet.co.nz] has quit [Ping timeout: 121 seconds] |
10:07 | | Reiver [reaverta@ServerAdministrator.Nightstar.Net] has quit [Ping timeout: 121 seconds] |
10:13 | | Reiver [reaverta@ServerAdministrator.Nightstar.Net] has joined #code |
10:13 | | mode/#code [+qo Reiver Reiver] by ChanServ |
10:13 | | You're now known as TheWatcher[d00m] |
10:45 | | gnolam [lenin@Nightstar-38637aa0.priv.bahnhof.se] has joined #code |
10:56 | | You're now known as TheWatcher |
10:58 | | You're now known as TheWatcher[d00m] |
11:21 | | Vornicus is now known as Vornicus-Latens |
12:11 | | You're now known as TheWatcher |
12:17 | | Serah [Z@3A600C.A966FF.5BF32D.8E7ABA] has joined #code |
12:57 | | Orth [orthianz@Nightstar-a1794d6e.xnet.co.nz] has quit [Connection reset by peer] |
12:57 | | Reiv[Graduate] [orthianz@Nightstar-a1794d6e.xnet.co.nz] has joined #code |
12:57 | | Reiv[Graduate] [orthianz@Nightstar-a1794d6e.xnet.co.nz] has quit [Client closed the connection] |
12:59 | | Reiv[Graduate] [orthianz@Nightstar-ee5e0dfc.xnet.co.nz] has joined #code |
13:00 | | Vornicus-Latens [vorn@ServerAdministrator.Nightstar.Net] has quit [Connection reset by peer] |
13:23 | | Rhamphoryncus [rhamph@Nightstar-bbc709c4.abhsia.telus.net] has quit [Connection reset by peer] |
13:35 | | Serah [Z@3A600C.A966FF.5BF32D.8E7ABA] has quit [Ping timeout: 121 seconds] |
13:45 | | celticminstrel [celticminstre@Nightstar-f8b608eb.cable.rogers.com] has joined #code |
14:21 | | You're now known as TheWatcher[d00m] |
14:22 | <@ToxicFrog> | Quite some time ago, I said that I really liked Haskell, but somehow it's never the right tool for any job at hand. |
14:22 | <@ToxicFrog> | Scala looks like most of what I like about Haskell, except it is the right tool. |
14:22 | <@ToxicFrog> | I am happy. |
14:22 | <@ToxicFrog> | And also slightly confused because the type system is arguing with me~ |
14:24 | < Reiv[Graduate]> | What makes it the right tool, when Haskell could not be? |
14:26 | | celticminstrel [celticminstre@Nightstar-f8b608eb.cable.rogers.com] has quit [[NS] Quit: *whistles* Did you hear something?] |
14:28 | | * gnolam ponders upgrading to MSVS2010. |
14:34 | <@ToxicFrog> | Reiv[Graduate]: non-monadic stateful computation, runs on the JVM and can call Java code directly (and thus all Java libraries), and its infix handling is Idon'tevenhavewords. |
14:35 | < Reiv[Graduate]> | infix handling? |
14:36 | <@ToxicFrog> | Yeah. Ok, there's a few parts to this |
14:36 | <@ToxicFrog> | First of all, operators like + are legal identifiers. |
14:36 | <@ToxicFrog> | Secondly, 'expr id expr' is sugar for 'expr.id(expr)' |
14:36 | <@ToxicFrog> | All operators are implemented as methods (although the compiler can and does translate them into single opcodes where appropriate). |
14:37 | <@ToxicFrog> | Operators ending in : are right-associative, everything else is left-associative; precedence is normal with "non-symbol identifiers" having the lowest precedence and "symbols not otherwise listed" having the highest. |
14:38 | | * Reiv[Graduate] thinks. Haskell didn't do this? |
14:38 | <@ToxicFrog> | Haskell did something similar but uglier. |
14:38 | <@ToxicFrog> | In Haskell, expr `fn` expr is how you do infixing. |
14:38 | < Reiv[Graduate]> | Oh, yes, right |
14:38 | <@ToxicFrog> | So you have (contains list foo) or (list `contains` foo) rather than (list.contains(foo)) or (list contains foo) |
14:43 | <@ToxicFrog> | There do appear to be a few exceptions; in particular . and ; are not legal identifiers. |
14:43 | < Reiv[Graduate]> | curious. |
14:44 | | * ToxicFrog defines a thing such that 'pipe(val) | f1 | f2 | f3 ?' is equivalent to 'f3(f2(f1(val)))' |
14:47 | <@ToxicFrog> | It would be nice if I could just start it with 'val | ... |
14:47 | <@ToxicFrog> | ', but I'm not sure I can (or should) backpatch scala.Any |
14:52 | < gnolam> | In 2010-related news, Visio 2010 still sucks. |
14:52 | | Serah [Z@26ECB6.A4B64C.298B52.D80DA0] has joined #code |
14:53 | < Reiv[Graduate]> | No, really? |
14:54 | < gnolam> | All the same usability flaws but with a shiny new ribbon interface! |
14:55 | < gnolam> | Also: SVG output is still broken. |
15:06 | | You're now known as TheWatcher[afk] |
15:09 | <@ToxicFrog> | Oh god yes transparent remote actors |
15:10 | < Reiv[Graduate]> | ?? |
15:14 | <@ToxicFrog> | Reiv[Graduate]: actors are message-passing concurrent processors. |
15:14 | <@ToxicFrog> | Remote actors are actors located in other processors or on other machines. |
15:14 | <@ToxicFrog> | Transparent remote actors are remote actors that look just like local ones. |
15:17 | < Reiv[Graduate]> | impressive. |
15:17 | < Reiv[Graduate]> | This is still a functional language? |
15:18 | <@ToxicFrog> | Impure OO/functional hybrid. |
15:19 | < Reiv[Graduate]> | ... can you make it pure?~ |
15:19 | < Reiv[Graduate]> | Or would that ruin half the point. |
15:20 | < Reiv[Graduate]> | Or is it that you get to do functional programming on objects? >_> |
15:20 | <@ToxicFrog> | If you're writing something pure, declare stuff constant and the compiler will check it. |
15:21 | <@ToxicFrog> | "pure" WRT functional languages means "enforces referential transparency", not "permits it". |
15:22 | <@ToxicFrog> | So haskell is pure because it doesn't permit side effects (without monad juggling); Scala is impure because it does, even though you can choose to write code without side effects in it. |
15:23 | < Reiv[Graduate]> | aha |
15:33 | <@ToxicFrog> | Oh my god |
15:33 | <@ToxicFrog> | implicits |
15:33 | < Reiv[Graduate]> | ?? |
15:34 | <@ToxicFrog> | Ok, check this shit out |
15:34 | <@ToxicFrog> | You can't backpatch already-defined classes in Scala, unlike in Ruby or Lua |
15:35 | <@ToxicFrog> | So if you wanted to define, say, a "squared" method on Ints, you'd have to write a wrapper: |
15:35 | <@ToxicFrog> | class SquarableInt(val n: Int) { def squared = n*n } |
15:36 | <@ToxicFrog> | But now you're writing things like 'new SquarableInt(4).squared' everywhere and it gets ugly. |
15:36 | <@ToxicFrog> | So you define an implicit conversion: |
15:36 | <@ToxicFrog> | implicit def toSquarableInt(val n: Int) = new SquarableInt(n) |
15:36 | <@ToxicFrog> | And now you can just write "4 squared" |
15:36 | < Namegduf> | That's... kinda neat. |
15:37 | < Reiv[Graduate]> | haha. That's cute. |
15:38 | <@ToxicFrog> | If the compiler can unambiguously determine an implicit conversion to make the expression legal, it will; otherwise (no conversion, or multiple possible conversions) it will error. |
15:51 | < Namegduf> | Hmm. |
15:51 | < Namegduf> | Does that imply program-at-once compilation? |
16:02 | <@ToxicFrog> | I haven't looked under the hood yet. |
16:31 | <@ToxicFrog> | Oh hey Glade bindings for Java. |
16:32 | <@ToxicFrog> | Which are thus directly callable by Scala. |
17:03 | | Thaqui [Thaqui@27B34E.D54D49.F53FA1.6A113C] has quit [Client closed the connection] |
17:14 | <@ToxicFrog> | <Kost23> i need help in c++ with ado query who can help me i want to put in values a variable in c++ and i don;t know how to make it any idra |
17:14 | <@ToxicFrog> | Ladies and gentlemen, Freenode. |
17:15 | < gnolam> | Hah. |
17:15 | < gnolam> | Unfortunately, you get those pretty much everywhere. |
17:50 | <@ToxicFrog> | ^.^ |
17:50 | <@ToxicFrog> | scala> class Pipe[T](arg: T) { def |>[R](f: T => R): Pipe[R] = new Pipe(f(arg)); def ?(): T = arg; } |
17:50 | <@ToxicFrog> | scala> implicit def toPipe[T](v: T) = new Pipe(v) |
17:50 | <@ToxicFrog> | t |
17:50 | <@ToxicFrog> | scala> 2 |> (2+) |> (4*) |> (3-) ? |
17:50 | <@ToxicFrog> | res1: Int = -13 |
18:04 | | Reiv[Graduate] [orthianz@Nightstar-ee5e0dfc.xnet.co.nz] has quit [Connection reset by peer] |
18:09 | | AbuDhabi [annodomini@Nightstar-2075dedf.adsl.tpnet.pl] has joined #code |
18:09 | | AnnoDomini [annodomini@Nightstar-a4817aa4.adsl.tpnet.pl] has quit [Ping timeout: 121 seconds] |
18:10 | | Reiv[Graduate] [orthianz@Nightstar-ee5e0dfc.xnet.co.nz] has joined #code |
18:39 | | Attilla [Attilla@Nightstar-dc2d92b4.threembb.co.uk] has joined #code |
18:40 | | mode/#code [+o Attilla] by Reiver |
19:06 | | Reiv[Graduate] [orthianz@Nightstar-ee5e0dfc.xnet.co.nz] has quit [Client closed the connection] |
19:09 | < gnolam> | Hmm. Any dicebots around on this network anymore? |
19:11 | | You're now known as TheWatcher |
19:12 | | Reiv[Graduate] [orthianz@Nightstar-ee5e0dfc.xnet.co.nz] has joined #code |
19:12 | < gnolam> | Nevermind. |
19:13 | < gnolam> | We decided the issue through negotiation instead. |
20:48 | <@ToxicFrog> | Ok, that's cool. |
20:48 | | * ToxicFrog just implemented the ?: operator in scala. |
20:50 | <@ToxicFrog> | Well, the ? ?? operator, since : is reserved :/ |
20:53 | <@ToxicFrog> | Pass-by-name :3 |
20:55 | <@McMartin> | I choose to read :3 as "bi-tentacled mouth of Cthulhu face" |
20:56 | <@ToxicFrog> | Also acceptable~ |
20:58 | <@McMartin> | God damn it |
20:59 | <@McMartin> | Speaking of Cthulhuface, time to bust out the kernel debuggers again. |
20:59 | <@ToxicFrog> | Oh dear. |
21:00 | <@jerith> | :E |
21:02 | <@ToxicFrog> | :? |
21:02 | | Vornicus [vorn@ServerAdministrator.Nightstar.Net] has joined #code |
21:02 | | mode/#code [+o Vornicus] by Reiver |
21:02 | <@McMartin> | Speak of the squid |
21:18 | <@ToxicFrog> | Gnar. p4 really needs a "revert without closing" command, and both p4 and git need a "revert diff hunk" command. |
21:19 | <@McMartin> | s/both p4 and git/p4, git, svn, cvs, &c/ |
21:19 | <@McMartin> | I've never seen that feature, though I too have occasionally needed it |
21:19 | <@McMartin> | (And "gotten" it by making a patch, hand-editing it, reverting, applying edited patc |
21:19 | <@McMartin> | h) |
21:20 | <@ToxicFrog> | p4 and git are the only ones I use more frequently than once a year, so |
21:20 | <@McMartin> | svn/git here. |
21:20 | <@McMartin> | Though to date I'm only using git for I7 work |
21:21 | <@ToxicFrog> | I use svn once a semester to cache login credentials for git-svn~ |
21:21 | | * jerith usually uses something like meld for that. |
21:22 | <@ToxicFrog> | In git, I can generally fake it by staging the stuff I want to keep, and then doing commit, reset --hard HEAD, reset --soft HEAD~1 |
21:23 | <@ToxicFrog> | But that's not as tidy as right-clicking and choosing "revert diff hunk" in git-gui would be. |
21:50 | | Reiv[Graduate] [orthianz@Nightstar-ee5e0dfc.xnet.co.nz] has quit [Client closed the connection] |
22:21 | | * jerith gives up on trying to think about Ophanim, goes to sleep. |
22:44 | | RichardBarrell [mycatverbs@Nightstar-58acb782.cable.virginmedia.com] has joined #code |
23:23 | | celticminstrel [celticminstre@Nightstar-f8b608eb.cable.rogers.com] has joined #code |
23:31 | | shade_of_cpux is now known as cpux |
23:59 | | You're now known as TheWatcher[T-2] |
--- Log closed Thu Jun 03 00:00:22 2010 |