»ö« Welcome to Perl 6! | perl6.org/ | evalbot usage: 'perl6: say 3;' or rakudo:, niecza:, std:, or /msg camelia perl6: ... | irclog: irc.perl6.org | UTF-8 is our friend!
Set by sorear on 25 June 2013.
timotimo r: my @res := (1, 2 ... *) »*» 2; say @res[^10].perl; 00:01
camelia rakudo ebb29b: OUTPUT«()␤»
timotimo huh?
sorear std: my @res := (1, 2 ... *) »*» 2; say @res[^10].perl; 00:08
camelia std 85cf51d: OUTPUT«ok 00:00 46m␤»
sorear r: my @res := ((1, 2 ... *) »*» 2); say @res[^10].perl;
camelia rakudo ebb29b: OUTPUT«()␤»
timotimo whoa, what happened to the irclog? 00:10
(only the main page apparently?)
huh, expecting a *hyperop* to be lazy is kind of stupid, isn't it? 00:13
timotimo hm. sort isn't really lazy, right? but it probably could be ... 00:17
yay, triangle reduce is lazy :) 00:18
sorear yes
sorear feeding an infinite list to >>*>> *should* hang or die 00:18
returnign () is pretty bogus
[Coke] how can sort be lazy? Don't you have to sort everything to know you're done? 00:34
timotimo you are correct 00:35
sorear for a comparison sort, you need O(n*log(n)) work to sort everything, but you can get the first element with O(n) work 00:36
timotimo it can only be lazy if you merge multiple sorted lists
sorear there are several sorting algorithms that can be lazy in the sense of returning the first element in O(n) time
timotimo mymistake
selectionsort comes to mind 00:37
sorear heap sorts have that property naturally, and it's possible to build a quick sort that way
not sure about merge sorts
quicksort has the further interesting property that you can retrieve the kth result in O(n) time 00:39
you can for instance find the median of N numbers in O(N) time
moritz \o 05:39
sorear o/
moritz: any clue what happened to the irc.perlgeek.de main page around 5 hours ago? it's fixed now, but it was coming up blank 05:41
diakopter gremlibbles
moritz sorear: nothing interesting in the log files :( 05:42
raiph . 05:44
sorear :( 05:45
diakopter .tell raiph here you go :D
yoleaux diakopter: I'll pass your message to raiph.
raiph www.huffingtonpost.ca/2013/07/05/ho...lp00000009 06:00
yoleaux 05:45Z <diakopter> raiph: here you go :D
raiph (just milking the . for all it was worth) 06:05
raiph (giving gremlibbles a run for their money) 06:07
raiph 'gnite #perl6 coyot.es/crossing/2013/07/09/20-ama...xtroverts/ 06:24
labster o/ 08:46
FROGGS_ hi labster 08:47
labster hi FROGGS_ 08:48
dalek kudo/nom: 9bdb5bc | (Elizabeth Mattijsen)++ | src/core/traits.pm:
Move definition of $/, $! and $_ so "is default" might actually work in the future.
 11:42
daxim what's the perl6 equivalent of python/ecmascript yield? 11:53
FROGGS_ daxim: gather/take if I am not totally off 11:57
daxim you're off
wait, no, I better test my assumptions first
lizmat S17:558 describes yield as obsolete? then again S17 is nod even sludgy
synopsebot Link: perlcabal.org/syn/S17.html#line_558
lizmat *not
moritz basically lazy map is the equivalent of yield 11:58
ztt pass a code ref?
moritz doesn't understand what ztt is trying to say 12:01
daxim mls, please enable 12.2 / 12.3 -- build.opensuse.org/project/monitor...ges:parrot 12:03
ztt I think python/ruby yield is eq to pass a code ref
moritz passing a code ref to what? 12:08
moritz wonders if anybody has noticed the "Look for new lines" button in the IR clogs 12:09
FROGGS_ moritz: I've seen it now :o) 12:10
ahh, cool 12:11
moritz++
daxim gosh 12:19
where's the __END__ token gone? 12:20
if I have to write =begin pod =end pod every time I want to bisect I'm gonna jump out of the window
FROGGS_ daxim: you only have to care about =end twice fwiw 12:23
diakopter closes the window
FROGGS_ daxim: btw, my editor (scite) allows block comments, so I press ctrl+q to toggle 12:24
mls daxim: done, thanks for the hint ;) 12:32
tadzik daxim: it's called =begin END or something 12:39
daxim paste.scsys.co.uk/261897?tx=on # can't make this translation work, please help 12:51
ztt sorry i dropped line 12:57
moritz daxim: what's the problem? 12:58
ztt moritz: i want to express sub test(&code, $arg) { &code(do sth) } is eq yield
daxim the problem is I can't program perl6
moritz ztt: for a very, very loose definition of "equivalent" 12:59
daxim: I think you want 'gather for ...', not just 'gather ...'
ztt moritz: :P
moritz daxim: but if you get an error message or something, it would be helpful if you could tell us that
daxim the error message was ===SORRY!=== Unexpected block in infix position (two terms in a row, or previous statement missing semicolon?) at gen.pl:4 ------> gather zip 1..*, $lines ⏏-> $lineno, $line { expecting any of: postfix infix stopper infix or meta-infix 13:00
gather for works
moritz \o/
daxim how do I check whether it's lazy?
moritz you add a debugging say() or note() or so to it 13:01
and when all the debug statements are execute before all the other print statements, you know it's not lazy
or you use an infinite range as the argument 13:02
and if it prints at all, it's lazy
ztt yeah perl6 has faq faq.perl6.org/
daxim turns out, it's not lazy 13:03
ztt hat's the perl6 equivalent of ruby method_missing? 13:04
daxim where's the mistake?
moritz ztt: what's ruby's method_missing?
daxim AUTOLOAD
moritz there'a a fallback mechanism in the MOP, but it's not yet nicely exposed to the user 13:06
ztt moritz: oh it's really magic www.ruby-doc.org/core-2.0/BasicObje...od_missing
got it 13:07
daxim: how to test whether is lazy? 13:10
daxim I tried both things; infinite input (variabl $i) blocks 13:11
rakudo: my $i = 1..*; for pager($i) -> $line { say $line } # simple case runs as expected 13:12
camelia rakudo 9bdb5b: OUTPUT«===SORRY!===␤Undeclared routine:␤ pager used at line 1. Did you mean '&eager'?␤␤»
daxim oops
rakudo: my $i = 1..*; for $i -> $line { say $line } # simple case runs as expected
camelia rakudo 9bdb5b: OUTPUT«1..Inf␤»
daxim ah well, damn this bloody contraption, just run the code yourself
ztt daxi: range is lazy 13:13
daxim yeah, and the pager is not. why? *that's* what I want to know 13:15
ztt rakudo: my $s = gather for 0..Inf { take $_**2 } 13:19
camelia rakudo 9bdb5b: OUTPUT«(timeout)»
daxim have you run my translated program? 13:20
[Coke] daxim; isn't the syntax for zip: for zip(@names; @codes) -> $name, $zip ?? (S03) 13:21
daxim well, is it? you're the expert, tell me 13:22
I can only find the Z operator in that document
[Coke] I am only relatively the expert. I don't think you're going to get a direct line for line translation here. checking, as time permits. 13:23
daxim but what good is the renouned flexibility of perl syntax if I can't translate a toy program? :( 13:25
moritz daxim: have you tried infix Z instead of zip() 13:26
s/$/?/
ztt Oh it is hard to translate in pythonic taste
[Coke] daxim: you're not going to get a line by line translation from some arbitrary language, I wouldn't expect. you're going to have to translate the idiom in most cases.
daxim and now we have arrived 40 minutes ago - what's the equivalent of yield, then? 13:27
infix Z also blocks
zip(1..*; $lines) changes the meaning of the expression, this can't help 13:28
moritz 'take' is the closest equivalent to 'yield'. 13:29
summary: our tools for finding out where non-laziness comes from suck
colomon suspects this is just another case of for not being fully lazy 13:37
anyway, isn't the actual p6ish way of doing this to say gather for $lines.kv -> $lineno, $line ? 13:46
that gives you lineno minus one, but should work unless $lines is infinite
(Well, lineno starting from zero) 13:47
[Coke] huh. that does work. 13:48
... I wonder how many of my other variants worked because "\f" isn't doing anything in that terminal. 13:49
daxim_: gist.github.com/coke/6000078 13:50
colomon enumerate probably most directly translates to .kv anyway, assuming I understand what it is doing.
I think the problem with the older one (assuming nothing has changed since the last time I ran into this) is that for gets the list to iterate over non-lazily unless it *knows* the list is infinite. So 1..* it knows is infinite and treats lazily, but 1..* Z $lines it doesn't know, and it treats eagerly. 13:52
[Coke] colomon: but .kv isn't infinite, and it appears to DTRT. 13:55
ztt paste.scsys.co.uk/261903 this is my view that code ref eq yield @daxim @moritz
colomon .kv on a finite list is finte 13:56
self.keys.map: { ($_, self.at_pos($_)) }; # List.kv implementation
ztt sorry i forget you want lazy
1..100 range will be passed as lazy? 13:57
colomon that depends on what you mean by "passed"
ztt sub test(@a) { for @a -> $n 14:00
test 0..Inf # works 14:01
FROGGS_ the problem is: 14:03
r: say (0..Inf).infinite
camelia rakudo 9bdb5b: OUTPUT«True␤»
FROGGS_ r: say (0..Inf Z 0...4).infinite
camelia rakudo 9bdb5b: OUTPUT«(Mu)␤»
FROGGS_ err, no, it isnt
r: say (0..Inf Z 0..Inf).infinite # this is wrong IMO 14:04
camelia rakudo 9bdb5b: OUTPUT«(Mu)␤»
FROGGS_ the second one isnt infinite, since Z is only as big as the shortest range 14:05
colomon FROGGS_: it isn't *actually* infinite, but rakudo doesn't know that 14:07
ztt in scalar context 0..9 range is a range object; in array context range will be a list
and it is lazy
colomon Z isn't transmitting any info about whether or not it is infinite
r: say (0..4 Z 0..4).infinite 14:08
camelia rakudo 9bdb5b: OUTPUT«(Mu)␤»
FROGGS_ r: say (0..4 Z 0..4).WHAT
camelia rakudo 9bdb5b: OUTPUT«(List)␤»
FROGGS_ :/
I see 14:09
colomon it's a lazy list which is finite, but rakudo doesn't know it is finite
ztt 0..Inf Z 0..Inf will time out 14:09
colomon though this does raise the question of why 1..* Z $lines doesn't act finite.
ztt Nil.infinite is Mu 14:10
colomon nr: say (0..* Z 0..4).grep(*.is-prime) 14:11
camelia rakudo 9bdb5b, niecza v24-86-g39ab531: OUTPUT«2 2 3 3␤»
colomon nr: for (0..* Z 0..4) { .say if .is-prime } 14:12
camelia rakudo 9bdb5b, niecza v24-86-g39ab531: OUTPUT«2␤2␤3␤3␤»
mathw Sorry to go a bit off-topic but does anybody in here know if Perl 5 makes any promises about the order of evaluation of subroutine parameters? 14:15
ztt OH finally I get it! thanks [coke]
moritz doesn't know it
mathw ah, finally found the right google-fu 14:16
someone on perl monks says that because it's a list, it's down to the comma operator, and that's defined as left-to-right
just saw some code that set my C++-brain on fire
ztt mathw: the order of evaluation of subroutine parameters? what that mean? 14:19
mathw if you call a foo(bar(), baz()), does bar() or baz() get called first? Is there a defined order? Is it the same every time? In C, for example, the compiler can do whatever it likes and frequently you see right-to-left i.e. baz() is called first. 14:20
ztt When I am child, I think gather/take is just another map. I am wrong. thank you [coke]++, very impressive! 14:24
daxim_ [Coke], change $i to 1..* - it will block, do you observe that too? 14:25
and yes, kv is nicer than the zip. I didn't expect that method works on lists 14:26
ztt mathw: bar() first. I have tried 14:28
mathw ztt: yes, I know that's what Perl 5 does now, but that's because I found the answer. 14:30
dalek rlito: 206defd | (Flavio S. Glock)++ | src5/lib/Perlito5/Grammar/Print.pm:
Perlito5 - wip Perlito5/Grammar/Print.pm
mathw but an experiment can't actually prove it, because C compilers might decide to use a different order for every function call (the language allows it, although that's not likely in the real world)
Fortunately Perl is a bit more predictable :) 14:31
ztt mathw: a magic random
ztt r: for (1..9).kv -> $i, $v { say $i, $v } 14:34
camelia rakudo 9bdb5b: OUTPUT«01␤12␤23␤34␤45␤56␤67␤78␤89␤» 14:34
ztt rakudo: for (1..Inf).kv -> $i, $v { say $i, $v }
camelia rakudo 9bdb5b: OUTPUT«(timeout)»
BenGoldberg Good morning 14:37
moritz good morning
colomon nr: for (1..Inf).kv -> $i, $v { say $i, $v; last; } 14:39
camelia rakudo 9bdb5b: OUTPUT«(timeout)»
..niecza v24-86-g39ab531: OUTPUT«01␤»
ztt what a fruitful day! good night~ 14:41
BenGoldberg nr: ((1..Inf).kv)[0].say
camelia niecza v24-86-g39ab531: OUTPUT«0␤»
..rakudo 9bdb5b: OUTPUT«0 1␤»
BenGoldberg nr: ((1..Inf).kv)[5].say 14:43
camelia rakudo 9bdb5b: OUTPUT«5 6␤»
..niecza v24-86-g39ab531: OUTPUT«3␤»
BenGoldberg Most peculiar 14:44
moritz different flattening behavior
nr: say ((1..Inf).kv.flat)[0] 14:45
camelia rakudo 9bdb5b, niecza v24-86-g39ab531: OUTPUT«0␤»
moritz nr: say ((1..Inf).kv.tree)[5]
camelia niecza v24-86-g39ab531: OUTPUT«Unhandled exception: Unable to resolve method tree in type List␤ at /tmp/_0zHVEnJGM line 1 (mainline @ 4) ␤ at /home/p6eval/niecza/lib/CORE.setting line 4579 (ANON @ 3) ␤ at /home/p6eval/niecza/lib/CORE.setting line 4580 (module-CORE @ 576) ␤ at /home/…
..rakudo 9bdb5b: OUTPUT«5 6␤»
moritz I don't think niezca implements LoLs
BenGoldberg I don't think .kv produces a list of lists... it produces a list of Pair objects 14:46
Or at least, on rakduo it does
colomon BenGoldberg: no 14:47
it produces a list of parcels, I believe
nr: ((1..Inf).kv)[0].WHAT.say
camelia rakudo 9bdb5b: OUTPUT«(Parcel)␤»
..niecza v24-86-g39ab531: OUTPUT«(Int)␤»
timotimo is the thing with the pager still interesting?
colomon and niecza is doing some sort of premature flattening in there 14:48
timotimo i didn't backlog fully, but did seriously nobody notice the $ that should really have been an @ with a :=, or at least a .list for the zip metaop?
moritz seriosly didn't notice it 14:50
timotimo caught up 14:53
backlogging is so disempowering
arnsholt Is there a simple way to get NQP/JVM to not catch Java exceptions?
daxim_ timotimo, put your words into code 14:53
arnsholt Something's going wrong when JNA is loaded, so I actually do want the JVM stacktrace, rather than the NQP one 14:53
timotimo like watching a horror film where that one person decides they really need some alone-time from the group because they were having some argument and they walk into that hallway without an escape or maybe a garage and you yell at the screen "there is a dollar sign! you need an @ instead!" and all the other people in the theater decide you're probably mentally ill 14:54
r: my $i := 1 ... Inf; for $i { say $i } # no, this is *not* working as intended 14:55
er, with the binding, though, it probably is
camelia rakudo 9bdb5b: OUTPUT«(timeout)»
timotimo r: my $i = 1 ... Inf; for $i { say $i } # no, this is *not* working as intended
camelia rakudo 9bdb5b: OUTPUT«1␤»
timotimo wait what? now i'm confused, too
daxim_ yeah.
timotimo r: my $i = 1..*; for $i -> $line { say $line } # simple case runs as expected # line from before
camelia rakudo 9bdb5b: OUTPUT«1..Inf␤»
timotimo for $i say $i is of course not helpful :) 14:56
arnsholt timotimo: That was a gloriously mixed metaphor =D
timotimo it is really sufficiently late to expect me to be fully awake, but i'm not :P
daxim_ can you put this together with the sub pager? 14:58
timotimo yeah, sure 14:59
gimme a few seconds
r: sub pager(@list, $lpp=5) { gather for @list.kv -> $lno, $line { take $line; take '-- More --' if $lno %% $lpp } }; my @data := 1...Inf; say pager(@data)[^31] 15:01
camelia rakudo 9bdb5b: OUTPUT«(timeout)»
BenGoldberg mathw: Perl5, unlike perl6, is definited by the imlementation... there is no formal perl5 specification. In other words, for perl5, experimentation is in fact the only way to know.
timotimo ah, did we find out that .kv will try to be eager?
r: say (1..Inf).kv[^5]
camelia rakudo 9bdb5b: OUTPUT«0 1 1 2 2 3 3 4 4 5␤»
timotimo r: say (gather for (1..Inf).kv -> $no, $dat { say $no; say $dat })[^10] 15:02
camelia rakudo 9bdb5b: OUTPUT«(timeout)»
timotimo r: say (gather for 0..Inf Z 1..Inf -> $no, $dat { say $no; say $dat })[^10]
that is weird indeed. 15:03
camelia rakudo 9bdb5b: OUTPUT«(timeout)»
timotimo oh, no it isn't
when you say rather than take, of course it'll loop infinitely
r: say (gather for (1..Inf).kv -> $no, $dat { take $no; take $dat })[^10]
camelia rakudo 9bdb5b: OUTPUT«(timeout)»
timotimo r: say (gather for (0...) Z (1...) -> $no, $dat { take $no; take $dat })[^10] 15:04
camelia rakudo 9bdb5b: OUTPUT«===SORRY!===␤Bogus statement␤at /tmp/pWeHzMdl0t:1␤------> say (gather for (0...⏏) Z (1...) -> $no, $dat { take $no; take␤ expecting any of:␤ postfix␤ dotty method or postfix␤ prefix or term␤ prefix…
timotimo r: say (gather for (0...*) Z (1...*) -> $no, $dat { take $no; take $dat })[^10]
camelia rakudo 9bdb5b: OUTPUT«(timeout)»
arnsholt timotimo: Well, when you only say there's never a take, so it'll loop forever while looking for the first takes
timotimo yes
arnsholt Not sure why the other one times out though 15:05
timotimo finds out he'd fare as badly in a horror film, too
anyway, what i'd do is this:
BenGoldberg for (1..Inf).kv { $_.say; last if $_ > 5 } 15:06
timotimo r: my @paged <== map { ($line, ++(state $) %% 3 ?? '-- More --' !! ()) } <== 1...*; say @paged[^10]
camelia rakudo 9bdb5b: OUTPUT«===SORRY!===␤Variable '$line' is not declared␤at /tmp/tq1ZlOqgos:1␤------> my @paged <== map { ($line⏏, ++(state $) %% 3 ?? '-- More --' !! ()␤ expecting any of:␤ postfix␤»
BenGoldberg r: for (1..Inf).kv { $_.say; last if $_ > 5 }
timotimo r: my @paged <== map { ($_, ++(state $) %% 3 ?? '-- More --' !! ()) } <== 1...*; say @paged[^10]
camelia rakudo 9bdb5b: OUTPUT«(timeout)» 15:07
rakudo 9bdb5b: OUTPUT«===SORRY!===␤Unsupported use of $) variable; in Perl 6 please use $*EGID␤at /tmp/sLjAwBvOZz:1␤------> my @paged <== map { ($_, ++(state $)⏏ %% 3 ?? '-- More --' !! ()) } <== 1...*␤»
timotimo r: my @paged <== map { ($_, ++(state $num) %% 3 ?? '-- More --' !! ()) } <== 1...*; say @paged[^10]
camelia rakudo 9bdb5b: OUTPUT«(timeout)»
timotimo aaw come on!
what's wrong with you today?
is it something i said, camelia? :[
BenGoldberg r: my @p := map { ($_, ++(state $n) %% 3 ?? '--m--' !! ()) } <== 1..*; 'Alive'.say; 15:08
camelia rakudo 9bdb5b: OUTPUT«===SORRY!===␤Sorry, do not know how to handle this case of a feed operator yet.␤at /tmp/JQpOeeEptj:1␤------> te $n) %% 3 ?? '--m--' !! ()) } <== 1..*⏏; 'Alive'.say;␤ expecting any of:␤ postfix␤»
BenGoldberg r: my @p <== map { ($_, ++(state $n) %% 3 ?? '--m--' !! ()) } <== 1..*; 'Alive'.say; 15:09
camelia rakudo 9bdb5b: OUTPUT«(timeout)»
BenGoldberg Is the feed operator lazy, or eager?
timotimo it's supposed to be lazy
the map turns it eager for *some* reason, but i'm pretty sure it shouldn't do that 15:10
timotimo doesn't have the computing power to build an older rakudo
it seems like a regression
timotimo there ought to be spectests for lazyness of different constructs, too 15:11
r: use Test; is (1..* Z** 1..*).[^5], (1**1, 2**2, 3**3, 4**4, 5**5), "power with lazy lists"; 15:12
camelia rakudo 9bdb5b: OUTPUT«ok 1 - power with lazy lists␤»
BenGoldberg r: my @foo := gather { for (1..10) { $_.say; take $_; } }; @foo.kv.[5].say 15:15
camelia rakudo 9bdb5b: OUTPUT«1␤2␤3␤4␤5␤6␤7␤8␤9␤10␤5 6␤» 15:16
BenGoldberg r: my @foo := gather { for (1..10) { $_.say; take $_; } }; my @bar := @foo.kv; 'baz'.say 15:17
ztt r: for 1..4 -> $n { say $n }
camelia rakudo 9bdb5b: OUTPUT«1␤2␤3␤4␤5␤6␤7␤8␤9␤10␤baz␤»
rakudo 9bdb5b: OUTPUT«1␤2␤3␤4␤»
ztt r: my $a = 1..4; for $a -> $n { say $n }
camelia rakudo 9bdb5b: OUTPUT«1..4␤»
ztt Range() in different context confuse me 15:18
BenGoldberg r: my $a = 1..4; for @$a -> $n { say $n } 15:20
camelia rakudo 9bdb5b: OUTPUT«1␤2␤3␤4␤»
benabik r: my @a := 1..4; .say for @a
camelia rakudo 9bdb5b: OUTPUT«1␤2␤3␤4␤»
BenGoldberg zzt, 'for' thought you were passing in a list of one element.
benabik r: .say for 1..4 15:21
camelia rakudo 9bdb5b: OUTPUT«1␤2␤3␤4␤»
BenGoldberg r: my $eager = False; gather { for (1..10) { $eager = $_ == 10; take $_; } }.kv; $eager.say 15:24
camelia rakudo 9bdb5b: OUTPUT«True␤»
BenGoldberg r: gather { for (1..10) { $_.say; take $_; } }.first(*>5); 15:26
camelia rakudo 9bdb5b: OUTPUT«1␤2␤3␤4␤5␤6␤7␤8␤9␤10␤»
ztt BenGoldberg: finally I understand. pass a Range() object is reasonable! thx! 15:38
timotimo BenGoldberg: i think in that case the gather is getting sinked anyway, which makes it eager 15:40
r: my $eager = False; my @result := gather { for (1..10) { $eager = $_ == 10; take $_; } }.kv; $eager.say
camelia rakudo 9bdb5b: OUTPUT«True␤»
timotimo oh, or maybe not.
benabik r: my $eager = False; my @result := gather { for (1..10) { $eager = $_ == 10; take $_; } }; $eager.say; my @r2 := @result.kv; $eager.say 15:42
camelia rakudo 9bdb5b: OUTPUT«False␤True␤»
timotimo mhm 15:45
interestingly, in List, kv is implemented as a map over self.keys and self.keys is (0..self.end).list 15:46
not exactly sure which kv method is called there
timotimo r: my $eager = False; my @result := gather { for (1..10) { $eager = $_ == 10; take $_; } }; $eager.say; say @result.DUMP; 15:46
camelia rakudo 9bdb5b: OUTPUT«False␤List<1>(␤ :$!flattens(Mu),␤ :$!items(▶Mu),␤ :$!nextiter(ListIter<3>(␤ :$!list(=List<1>),␤ :$!reified(▶Mu),␤ :$!nextiter(▶Mu),␤ :$!rest(QRPA<4>(GatherIter<5>(␤ :$!reified(▶Any),␤ :$!coro(Coroutine<7>(.…
timotimo apparently list
so it has to be eager, because it calculates the length of the list
in order for .kv to be lazy, .end must not be used 15:47
timotimo alternatively, if finiteness cannot be established, it could fall back to a count-up thingie 16:00
moritz maybe self.keys should be { my Int $c = 0; self.map: -> $ { $c++ } } 16:04
moritz and self.kv would similarly by { my Int $c = 0; self.map -> $v { ($c++, $v) } } 16:05
anyone want to spectest that?
ztt OH my rakudo can not do ** say @result.DUMP; ** with 2013.02.1 version 16:13
moritz 5 months is a lot of time in Perl 6 land 16:15
ztt yes :) 16:16
timotimo also, .DUMP isn't considered specced, right? 16:18
moritz it's not 16:20
it's a purely internal debugging tool 16:21
[Coke] r: say &floor.DUMP 16:23
camelia rakudo 9bdb5b: OUTPUT«Sub+{<anon>}<1>(␤ :$!dispatchees(Parcel<2>(:$!storage(OwnedResizablePMCArray<3>(...)))),␤ :$!dispatcher_cache(Mu),␤ :$!dispatcher(Mu),␤ :$!rw(0),␤ :$!inline_info(Mu),␤ :$!yada(0),␤ :$!package(GLOBAL<7>(...)),␤ :$!onlystar(1),␤ :$!dispatch…
[Coke] ... I wonder what happens in rakudo-jvm land. shame I'm in the middle of a build and cannot test it. :) 16:24
ztt my $eager = False; test is really awesome! timotimo++ 16:31
ztt good night really 16:32
BenGoldberg rn: gather { take $_ for 1..9; 'x'.say }.first(*>4).say 16:48
camelia rakudo 9bdb5b: OUTPUT«x␤5␤»
..niecza v24-86-g39ab531: OUTPUT«5␤»
[Coke] Anyone hacking on remaining rakudo.jvm failures? Or working on adding more features that aren't in rakudo.parrot yet? 16:49
TimToady was also a bit horrified to see nobody noticing the 'for $i ->' 17:20
maybe we should warn on that
TimToady it's not a mistake that a P5er would typically make, but it's an easy mistake coming from languages that don't make distinctions about list interpolation as Perl does 17:22
[Coke] niecza has been dirty for 363 days. *sadface* 17:41
FROGGS ohh, something to celebrate in two days 17:42
[Coke] yah, not really. :| 17:45
dalek rl6-roast-data: 12ea887 | coke++ | / (5 files):
today (automated commit)
 17:47
dalek d: c2215f0 | larry++ | STD.pm6:
warn on for with single scalar variable
 18:22
jnthn o/ from a train somewhere in Denmark :) 18:36
yoleaux 06:49Z <diakopter> jnthn: as soon as you have 3 min, could you tersely explain how to call a 6model method from an op
jnthn Don't think this connection will hold too well, but this station means I can push a few commits... :) 18:38
dalek kudo/nom: 37bf15c | jonathan++ | src/vm/jvm/runtime/org/perl6/rakudo/Binder.java:
Die on unexpected arguments.

Handles both positional and named case. This clears up many of the remaining S06 test files with failures.
kudo/nom: 14c63bb | jonathan++ | src/vm/jvm/runtime/org/perl6/rakudo/RakOps.java:
Implement getThrower.

Means various error cases now through the correct typed exception.
timotimo \o/
dalek kudo/nom: 961c030 | jonathan++ | src/ (4 files):
Abstract a Parrotism hit in backtrace gen.
kudo/nom: 4ad1b8e | jonathan++ | src/core/Exception.pm:
Fix undeclared named reporting.

Makes S32-exceptions/misc.t get to the end, and a few other things pass.
jnthn I see I missed today's run :)
diakopter: context? 18:39
timotimo jnthn: would looking at the implementation of "is rw" for classes be a good starting point for making "is nodal" on a class turn all the protos and methods defined in it "is nodal", too? 18:40
jnthn timotimo: Perhaps, yes
uh-oh, we're leaving the station :)
timotimo ttyl :) 18:41
jnthn well, it may hold... :)
jnthn Seems like Buf and the LEAVE related stuff are two of the main reasons for the remaining failing tests. 18:42
PerlJam It's really neat to see the p5-mop project slowly morph Perl 5 into something more Perl 6-y.
PerlJam just read some of stevan's posts
arnsholt jnthn: Is there some bit of code I can twiddle to let Java exceptions percolate all the way to the top level? 18:43
(In NQP/JVM) 18:45
TimToady std: my $foo; for $foo { .say } 18:50
camelia std c2215f0: OUTPUT«Potential difficulties:␤ 'for $foo' will never flatten a $ variable;␤ to force list interpolation, please use either 'for @$foo' or 'for $foo[]';␤ if you just want item topicalization, use 'given $foo' instead at /tmp/70_3l87OPl line 1:␤------> my $foo; for [3…
TimToady std: my $foo; .say for $foo 18:51
camelia std c2215f0: OUTPUT«Potential difficulties:␤ 'for $foo' will never flatten a $ variable;␤ to force list interpolation, please use either 'for @$foo' or 'for $foo[]';␤ if you just want item topicalization, use 'given $foo' instead at /tmp/MR7t59MR4q line 1:␤------> my $foo; .say fo…
TimToady std: for $_ {} 18:53
camelia std c2215f0: OUTPUT«Potential difficulties:␤ 'for $_' will never flatten a $ variable;␤ to force list interpolation, please use either 'for @$_' or 'for $_[]';␤ if you just want item topicalization, use 'given $_' instead at /tmp/ccD13ELMyR line 1:␤------> for ⏏$_
..{}…
jnthn arnsholt: I tend to patch ExceptionHandler.java, in the dieInternal method that takes a throwable. 19:07
arnsholt: Add e.printStackTrace()
arnsholt jnthn: Brilliant! 19:11
jnthn arnsholt: You can make nqp-runtime.jar and then just copy it to your install-jvm directory without rebulding anything else, btw. 19:12
arnsholt: Or if you're already in NQP then you need not copy anything at all, just do the make :)
arnsholt Yeah, I'm doing the latter ATM 19:12
jnthn k
arnsholt This is all NQP hacking at the moment, so no need to install really
dalek ecza: 1f87209 | larry++ | src/STD.pm6:
hack in STD's 'for $' warning
 19:24
[Coke] hopes larry isn't still breaking niecza. 19:25
TimToady too 19:26
that larry guy keeps trying to pick off all the LTA LHF... 19:27
jnthn blogged: 6guts.wordpress.com/2013/07/15/raku...rototypes/ 19:40
colomon jnthn++ 19:47
moritz jnthn++ # blog, threads, promises 19:57
labster jnthn++ rakudo shows promise. 20:03
jnthn ;) 20:05
jnthn detrain & 20:09
tadzik anybody planning to go to LPW? 20:17
TimToady jnthn: the combinator for waiting for any of them is called "race" :) 20:41
TimToady oh, I see you mentioned race later 20:42
TimToady assiduously avoids making a pun on race relations 20:48
notjack if I craft a perl6 program using MONKEY_TYPING, spin up a million instances and let them run for a million years, do I have to share the book royalties with Larry? 21:15
timotimo m) 21:17
diakopter notjack: but how would anyone know which book to read? 21:24
tadzik a rege 21:29
x
Ulti blog.brentlaabs.com/2013/05/how-to-...erl-6.html this might be worth advertising or markdownafying for the rakudo docs 21:33
jnthn home 21:58
diakopter tadzik: lolololol 21:59
timotimo hmm. an example dataset to demonstrate feeds? :| 23:06

Powered by Cro and the Raku® Programming Language.

Please report any issues / comments / feature requests as an issue on App::Raku::Log.

Thank you!