»ö« Welcome to Perl 6! | perl6.org/ | evalbot usage: 'p6: say 3;' or rakudo:, or /msg camelia p6: ... | irclog: irc.perl6.org or colabti.org/irclogger/irclogger_logs/perl6 | UTF-8 is our friend!
Set by moritz on 22 December 2015.
SmokeMachine____ hi! whats the difference between [] and $[]? 00:05
m: say set([1, 2]) (-) set([1, 2]); say set($[1, 2]) (-) set($[1, 2]) 00:06
camelia rakudo-moar 553ced: OUTPUT«set()␤set([1 2])␤»
SmokeMachine____ the same with () and $() 00:07
SmokeMachine____ m: say set((1, 2)) (-) set((1, 2)); say set($(1, 2)) (-) set($(1, 2)) 00:08
camelia rakudo-moar 553ced: OUTPUT«set()␤set((1 2))␤»
SmokeMachine____ m: say set((1, 2)) (|) set((1, 2)); say set($(1, 2)) (|) set($(1, 2)) 00:09
camelia rakudo-moar 553ced: OUTPUT«set(1, 2)␤set((1 2), (1 2))␤»
SmokeMachine____ thats confusing...
skids m: say (1, [2,3], $[4,5], 6).flat # The $ itemizes, which protects from flattening. 00:10
camelia rakudo-moar 553ced: OUTPUT«(1 2 3 [4 5] 6)␤»
SmokeMachine____ m: say set([1, 2]) (|) set([1, 2]); say set($[1, 2]) (|) set($[1, 2])
camelia rakudo-moar 553ced: OUTPUT«set(1, 2)␤set([1 2], [1 2])␤»
skids But, be careful, it does not stp single-element iteration: 00:11
m: say ($[1,2]).flat
camelia rakudo-moar 553ced: OUTPUT«(1 2)␤»
SmokeMachine____ skids: so, how can I make a set of arrays? 00:12
m: say set($[1, 2], $[1, 2])
camelia rakudo-moar 553ced: OUTPUT«set([1 2], [1 2])␤»
skids If you need to itemize a bunch of things, take advantage of the fact that inside [], everything gets an invisible $. 00:13
SmokeMachine____ m: class Bla {has $.a; has $.b}; say set(Bla.new(:a(1), :b(2)), Bla.new(:a(1), :b(2)))
camelia rakudo-moar 553ced: OUTPUT«set(Bla.new(a => 1, b => 2), Bla.new(a => 1, b => 2))␤»
skids m: say set([[1,2],[1,2]])
camelia rakudo-moar 553ced: OUTPUT«set([1 2], [1 2])␤»
SmokeMachine____ skids: but I am using a set to do not repeat elements... 00:14
skids I see what you mean now.
SmokeMachine____ and... 00:15
skids Containers are not value types, so each [] is a different object, which is why that is not working.
SmokeMachine____ m: my %a := set $[1, 2]; say %a{$[1, 2]}
camelia rakudo-moar 553ced: OUTPUT«False␤»
skids m: [1,2].WHICH.say; [1,2].WHICH.say;
camelia rakudo-moar 553ced: OUTPUT«Array|64433024␤Array|64433088␤»
SmokeMachine____ ok, I understand that... 00:16
but:
m: [1, 2] ~~ [1, 2]
camelia ( no output )
SmokeMachine____ m: say [1, 2] ~~ [1, 2]
camelia rakudo-moar 553ced: OUTPUT«True␤»
skids right. Smartmatch doesn't check identity, just value. 00:17
m: say [1,2] === [1,2]
camelia rakudo-moar 553ced: OUTPUT«False␤»
SmokeMachine____ Shouldn't the bouth arrays create the same hash to use on the set? (assuming that the set uses a hash function...) 00:18
skids sets use the WHICH.
SmokeMachine____ because, if it uses === and not a hash function, so it probably have to compare item by item... so its insertion, get, etc will not be O(1) 00:19
skids Hash by default uses the stringification. Object hashes use the WHICH, though.
timotimo a set of arrays is very problematic
yes, for that reason
arrays are mutable
but skids already said that
skids mutability really isn't the issue, lists won't work either. 00:20
SmokeMachine____ it compares the new value with all the itens on insert? 00:20
skids It looks at the WHICH, and compares it to the other WHICH's 00:21
So it doesn't traverse all the elements.
SmokeMachine____ m: my %a{Any}; %a{$[1,2]}++; %a{$[1,2]}++; say %a
camelia rakudo-moar 553ced: OUTPUT«{[1 2] => 1, [1 2] => 1}␤»
SmokeMachine____ skids: so, the insertion's complexity is O(n), not O(1)? 00:22
and looks the the hash is the same, right?
skids Likely it hashes the WHICH value, I'm not sure.
timotimo i think that's how, yes 00:23
er, no, actually
skids So probably some O(log N)ish
timotimo we have an "object id" mechanism for that
it moves an object into the second gen so that it never moves again and then uses its location in memory as its ID
that is then used for hashing 00:24
SmokeMachine____ skids: if it uses a hash function and insert on that position, it would be O(1), or am I wrong?
skids Hash tables aren't actually O(1).
timotimo amortized they are, no?
skids I think that's a stretch/creative accounting. Suffice to say tey are the fastest thing we have :-). 00:26
timotimo creative accounting is what amortization is 00:28
skids Speaking of that anchoring mechanism, how would I anchor the memory in a Buf so it can't move but still can get GCd later.
skids wonders whether SmokeMachine____'s arrays need to preserve order 00:31
m: say set(set(1,2)) (-) set(set(1,2))
camelia rakudo-moar 553ced: OUTPUT«set()␤»
skids Looks like sets are value objects.
SmokeMachine____ Is there a way to change the way that the set is "indexed"?
skids Depends on the precise definition of "indexed"? 00:32
timotimo depends on what your definition of "is" is.
SmokeMachine____ I don't need order, I am trying to create a set of points...
I am trying to do some thing like: set $(1,2), $(2,4), $(1, 4) 00:33
skids m: say set(set(:1x,:2y)) (-) set(set(:1x,:2y))
camelia rakudo-moar 553ced: OUTPUT«Unexpected named argument 'x' passed␤ in block <unit> at <tmp> line 1␤␤»
skids m: say set(set($:1x,$:2y)) (-) set(set($:1x,$:2y)) 00:34
camelia rakudo-moar 553ced: OUTPUT«5===SORRY!5=== Error while compiling <tmp>␤You can't adverb $ANON_VAR__1␤at <tmp>:1␤------> 3say set(set($:1x7⏏5,$:2y)) (-) set(set($:1x,$:2y))␤»
skids m: :1x.WHICH.say; :1x.WHICH.say 00:35
camelia rakudo-moar 553ced: OUTPUT«Pair|Str|x|Int|1␤Pair|Str|x|Int|1␤»
skids m: say :1x === :1x
camelia rakudo-moar 553ced: OUTPUT«True␤»
skids m: say [:1x,:2y].Set # o.O this I don't get. 00:37
camelia rakudo-moar 553ced: OUTPUT«set(x, y)␤»
SmokeMachine____ m: say {:x(1),:y(2)} === say {:x(1),:y(2)}
camelia rakudo-moar 553ced: OUTPUT«{x => 1, y => 2}␤False␤»
skids m: say {:x(1),:y(2)} === {:x(1),:y(2)}
camelia rakudo-moar 553ced: OUTPUT«False␤»
skids m: say Set(Pair.new("x",1),Pair.new("y",2)) 00:39
camelia rakudo-moar 553ced: OUTPUT«set(x, y)␤»
timotimo so ... compiz and compiz fusion are kind of dead; what project would supercede those?
skids m: Set([1.0,2e0]).perl.say # dirty trick 00:44
camelia rakudo-moar 553ced: OUTPUT«set(2e0,1.0)␤»
tushar how can I identify "nl-in"? Also, how can I set "nl-out"? 00:52
MasterDuke m: my $h = IO::Handle.new; dd $h.nl-in; dd $h.nl-out; $h.nl-out = "\t"; dd $h.nl-out 00:56
camelia rakudo-moar 553ced: OUTPUT«IO::Handle is disallowed in restricted setting␤ in sub restricted at src/RESTRICTED.setting line 1␤ in method new at src/RESTRICTED.setting line 32␤ in block <unit> at <tmp> line 1␤␤»
MasterDuke tushar: $["\n", "\r\n"] 00:57
Str $!nl-out = "\n"
Str $!nl-out = "\t"
that's what i get when i run the above code
tushar MasterDuke: Thanks. I have one question though, when I try "$FH.nl-in" where $FH = input file handle, I got an array containing \n and \r\n. I created a text file on my MAC using vi editor. I am expecting to get either "\n" or "\r" but not "\r\n". Do you have any idea that why am I getting "\r\n"? 01:01
skids It would appear the default is "on input, take either \n or \r\n as a newline" 01:08
Or in other words, "sorry really old Apple users, the world has moved on" :-) 01:09
tushar skids: hahaha.. I am quite young.. 01:13
tushar Is there any way of detecting type of file? I meant text or csv file. I know I can check the extension. But many time extensions are not consistent with the content? So is there any way to detect file type from file content? 01:15
skids Well, you don't have to be old to use a really old Apple, but it sure helps :-) 01:16
SmokeMachine____ Any way to change the which method and do not have troubles with the gc?
tushar skids: me and my mac both are quite young.. ;) 01:17
skids tushar: maybe use one of the Perl5 modules for file type identification using :from<perl5>? 01:18
Or use NativeCall with libmagic or somesuch.
kerframil tushar: Lib::FileMagic. there's a p6 port.
skids Oh cool.
tushar kerframil: Does Lib::FileMagic available on modules.perl6.org? Because I am not available to find it. Could you please provide a link to it? 01:23
tushar Thanks. 01:24
kerframil tushar: I have no idea, but it's in Dave Rolsky's github repo 01:26
github.com/autarch/perl6-File-LibMagic
tushar kerframil:thanks a lot
kerframil you'd need the libmagic library and headers installed to build it
tushar hmmm 01:30
zengargoyle heh, looks like ∘ (function composition) and ≅ (approximately equal) are created using the unicode name and then have Texas version just calling the unicode version. 01:57
other ones are defined the Texas way and have a unicode version that just calls the Texas version. weird. 01:58
skids That module does not look like it needs headers so it should just need the lib itself.
skids probably just because those were late adds/author preference. 02:00
BenGoldberg .tell tushar For a conventient way to install libmagic, consider using the perl5 module Alien::LibMagic. 02:05
yoleaux BenGoldberg: I'll pass your message to tushar.
zwu I just checked the performance of perl6 running gist.github.com/anonymous/f31c6b7e...9a1085894, compared with github.com/famzah/langs-performance. The perl6 version is about 13 times slower than python version today, while in May, it was about 17 times slower. 02:07
TEttinger nice zwu 02:41
improvement is improving
Xliff_ What's the best way to re-initialize a CArray? This is in the context of reasignment by infix<=> 04:55
Particularly, the case when we need to drop the original contents for a new list (or single item) 04:56
pmurias hi 07:57
El_Che hi pmurias 08:00
pmurias: you were talking about perl 6 vim integration, but I didn't get what you eactly wanted to do. Semantic autocomplete? 08:01
pmurias El_Che: semantic movement/text selection 08:24
pmurias El_Che: so just like we have dw do delete a word we could have d<some char that we map to perl6 string literal> 08:25
El_Che pmurias: interesting 08:30
pmurias: can you hook that to an existing plugin framework or it is standalone?
pmurias El_Che: it's still in the thought experiment stage, there seems to be a plugin framework vim-textobj-user that could be hooked in, but I haven't looked into details seriously 08:46
El_Che pmurias: I had a look at the syntastic (wrote a small perl6 plugin for it) for syntax and youcompleteme for semantic support (was not so straight forward) 08:53
go support is handled by a local web service by example
dalek c: 0bce341 | gfldex++ | doc/Type/WrapHandle.pod6:
doc class WrapHandle
 10:07
lizmat gfldex: I wonder whether WrapHandle isn't a rakudo implementation detail 10:12
gfldex lizmat: S06-advanced/wrap.t 10:13
also .restore is very useful
lizmat well, yes, but the functionality. the word WrapHandle doesn't occur in roast 10:14
and its mention in specs appears to be documenting the state in rakudo, afaics 10:15
gfldex i can't doc a free floating method 10:15
lizmat ah, the restore you mean, ok, fair enough :-) 10:16
gfldex well, I can if I really have to. And if WrapHandle shall not be named then it may need anonymising in rakudo 10:17
lizmat true
gfldex not sure if we want that tho as it would create LTA messages
travis-ci Doc build failed. Wenzel P. P. Peppmeyer 'doc class WrapHandle' 10:17
travis-ci.org/perl6/doc/builds/162151280 github.com/perl6/doc/compare/2061f...ce34172b89
lizmat well, actually, WrapHandle only exists *inside* of wrap 10:18
m: say WrapHandle
camelia rakudo-moar e12ebb: OUTPUT«5===SORRY!5=== Error while compiling <tmp>␤Undeclared name:␤ WrapHandle used at line 1␤␤»
lizmat so I guess you could argue it *is* anonymous 10:19
lizmat or at least not visible 10:19
it's just that instances of it *are* externally visible
dalek c: 8b3cd79 | gfldex++ | doc/Type/WrapHandle.pod6:
pod needs to be pod
 10:20
lizmat m: dd (sub { }).wrap: sub { }
camelia rakudo-moar e12ebb: OUTPUT«Routine::WrapHandle.new␤»
gfldex not sure what happends with the search index (and other stuff) if I add Routine:: to the pod 10:21
we may even want that class inside Routine.pod6 10:22
lizmat well, that's where I have doubts 10:28
lizmat I mean, are we documenting how to use, or are we documenting what exists ? 10:29
because if we're documenting what exists, then there are plenty more classes (e.g. many iterators) that you may run into: 10:30
many of them don't even have a name
gfldex we do both atm. We have exists-docs and howto/tutorial docs and we don't mark what is what 10:31
iterators a covered by roles
travis-ci Doc build passed. Wenzel P. P. Peppmeyer 'pod needs to be pod' 10:42
travis-ci.org/perl6/doc/builds/162154116 github.com/perl6/doc/compare/0bce3...3cd7913901
dalek c: 10def9d | (Zoffix Znet)++ | doc/Type/Any.pod6:
Include purpose of :$label and :$item .map arguments

  psch++ lizmat++ for explaining irclog.perlgeek.de/perl6-dev/2016-0...i_13262649		 10:57
pmurias El_Che: the problem with writing vim extensions is that vimscript is the worst programming language I have ever seen that's not purposefully designed to be horrible 11:03
Woodi pmurias: right :) maybe creating vi clone based on Perl6 compiler would be nicer ? :) 11:10
hi today :)
DrForr O gawd, don't tempt me :)
Woodi probably vi don't even use curses and we have Term:: lib ;) 11:11
nine pmurias: I thought one can write vim extensions in other languages, too. Perl being among them.
DrForr There's :perldo and :perl commands you can use. 11:12
Woodi todays HN: JITing PHP is better then compiling PHP to C++ :) or maybe just jitting is better ? somehow my brain *don't want* to accept that :) code.facebook.com/posts/1568350381...rformance/ 11:15
gfldex Woodi: a JIT can query runtime information, also writing fast C++ is a lot harder then it sounds (and it sounds quite hard) 11:16
Woodi gfldex: I just don't have middle level details on what is usually jitted in runtime... is it concrete string put into asm ? or type information or array size, such things... so hard to even think about that 11:18
Woodi btw. there was Perl6 benchmarks showing programs executing in 4-5 seconds and using *milion(s)* function calls... that is shocking... 11:20
DrForr Just in case it doesnt' make it here, opensource.com/life/16/9/perl-6-features 11:58
timotimo DrForr: the sentence about concurrenly doesn't really say that the "don't do that" thing is only for perl5 12:06
or maybe that's just because i don't know anything about perl5 users :) 12:07
Woodi (Jeff Goff)++ :)
RabidGravy Is the interface provided by HTTP::Server::Tiny supported by any other modules (I know it differs from some)? 12:19
Woodi Hard Real World story, somewhere in Africa: "5 reasons for kids absence in schools": 1) "he don't have a sweater..." - winter, less then +10C, and problems with completing school uniform *facedesk*; 2) "hi don't have boots...", .oO(WHAT? Yesterday he have!); 3) parents don't have money for a bus, price: 0.17 euro...; 4) mam is in hospital, she need to take care for younger sister; 5) kids are sick, 12:21
sometimes. rarely...
I'm selling one of my thinkpads...
Ulti the file encoding stuff is there a branch around for that or is it in the design thinking stage? I'm writing something that encodes and decodes files to DNA style sequences and it would be kind of cool if I could do that at the IO layer 12:33
timotimo design thinking stage at the moment 12:34
Ulti at the moment I'm working in Python but its all easily ported bitshift stuff
timotimo: k k thanks
Ulti will o____O
timotimo you will what? 12:35
gfldex m: my enum E1 <A B>; my enum E2 <C D>; sub g(@a) { say @a.all ~~ (E1|E2) }; g([A, C]); 12:41
camelia rakudo-moar e12ebb: OUTPUT«False␤»
gfldex i did expect True. Am I asking for to much? 12:41
timotimo don't smart match against junctions :) 12:44
gfldex is there an easy way to get what I want? 12:47
timotimo hmm
not so sure 12:48
gfldex: i know you can build a subset that has "where E1 | E2" and you can smart match against that 12:49
Xliff_ Does anyone know the best way to re-initialize a CArray (I'm using this for STORE) 12:53
timotimo i don't know what "re-initialize" means 12:58
Xliff timotimo: Empty, start over, clear out? 13:00
Woodi Xliff: assign defaults ? 13:01
Xliff Coz if @b is a CArray and you do: @b = Bool.pick(100), you want to make sure that whatever was previously in @b is properly disposed of.
timotimo i know you can assign Empty to an Array to empty it out 13:02
gfldex m: my enum E1 <A B>; my enum E2 <C D>; subset E1-or-E2 where * ~~ E1|E2; sub g(@a) { say @a.all ~~ {$_ ~~ E1|E2} }; g([A, C]);
camelia rakudo-moar e12ebb: OUTPUT«False␤»
Xliff And I don't see a handy method to do that.
timotimo don't we expose setelemspos somehow?
yeah, nqp::setelems could be what you need
Xliff That's an Array. CArrays are noticably different, internally.
Uh. OK. Thought I looked into that, but will check again. Thanks.
timotimo VMArray isn't
Xliff Yeah. nqp::setelems will work. 13:03
gfldex m: my enum E1 <A B>; my enum E2 <C D>; sub g(@a) { say @a.all ~~ subset :: where * ~~ E1|E2 }; g([A, C]); 13:04
camelia rakudo-moar e12ebb: OUTPUT«True␤»
gfldex i don't need no stinking names! 13:05
gfldex i better doc that, it's so obscure I will likely forget it within hours :-> 13:06
gfldex also, $idioms++ 13:06
Xliff OK. VERY simple implementation of CArray STORE is about done. I need to test it now. Not sure I will have time to do that before tomorrow. 13:07
gfldex m: my enum E1 <A B>; my enum E2 <C D>; sub g(@a where { .all ~~ subset where * ~~ E1|E2 } ) { say @a }; g([A, C]); 13:12
camelia rakudo-moar e12ebb: OUTPUT«5===SORRY!5=== Error while compiling <tmp>␤Expected a term, but found either infix ~~ or redundant prefix ~␤ (to suppress this message, please use a space like ~ ~)␤at <tmp>:1␤------> 3b g(@a where { .all ~~ subset where * ~~7⏏5 E1|E2 } )…»
gfldex m: my enum E1 <A B>; my enum E2 <C D>; sub g(@a where { .all ~~ subset :: where * ~~ E1|E2 } ) { say @a }; g([A, C]);
camelia rakudo-moar e12ebb: OUTPUT«[A C]␤»
dalek c: 53f32fd | gfldex++ | doc/Language/typesystem.pod6:
show anonymous subsets
 13:13
Woodi btw. there is new (for me) thing: nullable types - something that automatically allow to have types without NULL :) do we have something similiar ? 13:17
except subtypes :) 13:18
gfldex m: my Int $i = 42; dd $i; $i = Nil; dd $i; 13:22
camelia rakudo-moar e12ebb: OUTPUT«Int $i = 42␤Int $i = Int␤»
gfldex Woodi: ^^^ yes, we do
m: my int32 $i = 42; dd $i; $i = Nil; dd $i;
camelia rakudo-moar e12ebb: OUTPUT«42␤Cannot unbox a type object␤ in block <unit> at <tmp> line 1␤␤»
gfldex with that limitation
[Coke] nine: work happened, actually running the stresstest now 13:43
Woodi gfldex: int32 case is usefull to me. however it's not clear that we thing about that usecase as a positive feature, somewhat oficially :) 14:03
RabidGravy so I started this streaming server thingy before I worked out how to get am existing HTTP server module to do the input streaming partt 14:09
and now I find I got he abstraction horribly wrong
Ooops 14:11
==> Testing Pod::To::BigPage
===SORRY!===
Expected MAST::Frame, but didn't get one
that's unfortunate
arnsholt Well, that's a hilariously low-level error to get from user code =)
RabidGravy isn't it just 14:12
vcv m: my Int:D $i = 42; dd $i; $i = Nil; dd $i 14:13
camelia rakudo-moar e12ebb: OUTPUT«Int $i = 42␤Type check failed in assignment to $i; expected type Int:D cannot be itself (perhaps Nil was assigned to a :D which had no default?)␤ in block <unit> at <tmp> line 1␤␤»
vcv ^- does that count as a non-nullable type?
ilmari m: my Int:D $i; dd $i 14:14
camelia rakudo-moar e12ebb: OUTPUT«5===SORRY!5=== Error while compiling <tmp>␤Variable definition of type Int:D requires an initializer␤at <tmp>:1␤------> 3my Int:D $i7⏏5; dd $i␤ expecting any of:␤ constraint␤»
Woodi vcv: it count as feature I want :) vcv++ looks nullable types allow to add null to eg. plain int or bool :) 14:15
RabidGravy So that error from Pod::To::BigPage has been there for two months: github.com/gfldex/perl6-pod-to-bigpage/issues/1 14:30
nine jnthn: how bad is Str.^find_method("Stringy").wrap(sub ($self) { ... }) in terms of "oh please, don't ever do this in production code!"? 14:33
Woodi nine: Lisp and asm are used in production ;) 14:40
nine Woodi: I'm asking about rakudo's implementation specifically 14:41
Ok, now that I have this syntax actually work with DBIx::Class, I guess it's time to think about real complicated queries: my $homepages = select $articles where {"name=$name and active=$active"}; 14:45
mst oh, cool, you're prototyping the boring bits of that for me
nine: I have plans for modifying SQL::Abstract to accept a less-DWIM-more-explicit syntax 14:46
so later we should be able to get to 'SELECT *.articles WHERE *.name eq $name AND $.active eq $active'
we'll see though
(this is why I wanted to know if I could do .* as a postfix op ;) 14:47
RabidGravy nine, I certainly would be think twice before doing that in fairly high level production code
nine mst: it's from a lightning talk I gave yesterday. Born at yesterday's discussion over lunch: niner.name/talks/DBIC%20in%20Perl%2...revisited/
RabidGravy but if it was in something that was "infrastructural" then it would be fine
FWIW, I have something that passes nearly all of SQL::Abstract's tests for the DWIMmey syntax 14:48
mst nine: well worth discussing with #dbix-class
nine RabidGravy: is it online somewhere? 14:50
RabidGravy nine, github.com/jonathanstowe/Squirrel - haven't touched it for a while 14:52
RabidGravy my medium term plan is to actually use a functional syntax primarily and make the SQLA syntax a facade 14:54
nine Thinking a bit more about this, with enough type-ing we may be able to define all the infix operators without even having to hijack string interpolation. prefix:<select> (ResultSet) is the entry point. All the infixes just have to take an appropriate type for the left hand argument and return the type needed for the next operator 14:55
mst nine: this is why I was planning to use uppercase keywords 14:57
mst also, 'select $rs' makes no sense at all, did you mean 'from' ? 14:57
nine now that you mention that, indeed I did 14:59
mst RabidGravy: functional syntax? 15:05
mst (I inherited SQLA's syntax a decade ago, I'm always interested in better ways) 15:05
RabidGravy functional? syntax? 15:06
mst < RabidGravy> my medium term plan is to actually use a functional syntax
you're the one who said those words
I can't tell you what you meant
that's why I'm asking
RabidGravy like "SELECT(<list of stuff>, FROM(<stuff>), WHERE(<etc>))"
mst right 15:07
so more like Data::Query than SQL::Abstract
RabidGravy yes, but I don't know which part you were having difficulty with ;-)
mst (I have a version of SQLA that runs on top of DQ)
well, honestly, I was more interested in your thoughts about operators and parameterization
but apparently by 'functional syntax' you just meant the obvious boring part :P 15:08
anyway, I'd be interested to see any sketches of that with the <stffu> and <etc> filled out
RabidGravy I basically see it as being a bunch of Term objects under the hood, the actual syntax isn't much fun 15:09
the DWIM thing with SQLA is waaaay over-generous 15:10
RabidGravy so I think for the second cut of this I would start at the bottom and find the types that would be composed into a complete SQL statement and add e.g. the "functional syntax" over that 15:13
mst right, Data::Query provides fairly low level stuff
but is slightly more complicated than it needs to be
my plan is basically to do it again with a more explicit SQLAish syntax
i.e.
[ -op, '=', [ -ident, 'foo' ], [ -value, $bar ] ]
have the current DWIM syntax expand to that and thhen get rendered 15:14
and then build a better top level atop that
vcv m: 'abc'.comb.join 15:15
camelia ( no output )
nine The idea behind the string interpolation trick is that I'm just sick of trying to fit working SQL statements into my ORM's special snowflake syntax. Everything people really want is not having to type lists of field names and join conditions. So just provide shortcuts for those on top of otherwise standard SQL. 15:17
mst sadly, you can't entirely do cross-platform LIMIT without being able to introspect the WHERE clause 15:19
other than that though 15:20
mst the key thing you really need is some way to do alias management 15:20
consider e.g. an EAV table where you want to LEFT JOIN attributes a1 ON thing.id = a1.id AND a1.key = 'foo' LEFT JOIN atttributes a2 ON thing.id = a2.id AND a2.key = 'bar' WHERE a2.value = 'baz' 15:21
you'll get quite a long way with "just feed it SQL", but not as far as you might hope
(one of the many things I've learned the hard way ;) 15:22
mst basically, you'll get a very nice 80% solution that way, but there's things people do with DBIC that would be ... tricky ... in such a situation 15:25
(of course the answer for perl6 there may be 'yeah, and we can parse the SQL and transform it')
[Coke] (ORM) I don't think I've ever worked on a project with a DB and thought "ORM will make this easier." 15:26
mst most ORMs are terrible. DBIx::Class is significant less terrible than average, because most of the developers actually like databases 15:27
vcv ORM can make things easier to start. once your project using it starts to scale, then it can all fall apart quickly 15:28
nine mst: introspection of the where clause is not an issue when I parse the whole SQL thing into an AST.
Or I just don't understand what the problem is 15:29
mst nine: right, using it as another surface syntax is fine 15:30
I'm just saying that you're still going to need an AQT underneath
nine Absolutely. I have no illusions about the size of such a project. Otherwise I'd have started it long ago :) Even the lightning talk was more an answer to "why would you even want to combine Perl 5 and 6?" than anything else. 15:32
mst heh, yeah 15:34
nine Instead of quoting the SQLValue, it would also be better to just replace it by ? and stash it somewhere so we don't lose the type information. And because of all the other benefits of using placeholders. 15:43
mst anyway, if I get a chance to hack on SQLA I suspect I can give you a much easier set of primitives to use under the hood once you've parsed the SQL 15:44
I was going to do this earlier this year but ribasushi was insistent that he had offline work he needed to push, but wouldn't tell us what or when :( 15:45
dalek c: 39b1226 | coke++ | doc/Type/WrapHandle.pod6:
fix whitespace
 15:53
RabidGravy gfldex, I'm going to make a rakudobug for the github.com/gfldex/perl6-pod-to-bigpage/issues/1 as that is just not right at all 16:39
RabidGravy not sure where to start golfing it, however it appears that it is related to the number of multi sub handle 16:45
RabidGravy ah no, talking bullshit here, Pod::To::BigPage *does* use LWP::Simple, commenting out the sub where it does that causes it to load fine 16:54
hackedNODE RabidGravy: there's an Issue for it in LWP::Simple: github.com/perl6/perl6-lwp-simple/issues/3 16:59
RabidGravy: and the issue is due to its trying to require in mainline: github.com/perl6/perl6-lwp-simple/...mple.pm#L8 17:00
hackedNODE I think if it's changed to sub {try require IO::Socket::SSL;}() it might be fixed 17:01
RabidGravy Oh man
hackedNODE (though the MAST::Frame error is very LTA)
RabidGravy (I fixed the same problem in HTTP::UserAgent about a year ago _
RabidGravy goes after that rather than dicking around with the symptoms 17:07
stmuk_ I think all module installation on all BSD variants is broken 17:12
post ac1987
nine stmuk_: odd considering ac1987 is fairly high level 17:17
stmuk_ it may be a Moar bug 17:19
github.com/MoarVM/MoarVM/issues/410 17:20
RabidGravy right, fixed the LWP::Simple it would appear 17:23
hackedNODE \o/ 17:26
hackedNODE It's worth rakudobugging the issue, fixing the LTA error, and adding a roast test for it. 17:26
captain-adequate Oooooo. I just found perl mogrify. 17:28
github.com/drforr/Perl-Mogrify
ugexe stmuk_: do the modules Test/NativeCall/etc get installed at the end of `make install` rakudo?
hackedNODE That sounds like a bad idea :) Or rather a recipe for receiving awful code :) 17:30
RabidGravy though there does appear to be a problem with parsing the response from gitthub
bioduds_ hi guys, acessing sqlite and trying to retrieve info from it also the same problem as loading a custom module 17:39
I seem to lack the ability to track the cause of it
harmil_wk bioduds_: do you have some context? 17:50
bioduds_ oh, sorry, it was a problem I'm having that I reported yesterday
it is a server call I'm doing from Meteor 17:51
there is a gist, I just don't know where it is, sorry
RabidGravy there 17:53
RabidGravy the LWP::Simple and all related problems should be fixed now 17:54
gfldex RabidGravy: thanks 17:56
RabidGravy I can't believe that it was left like that for so long 17:59
El_Che good evening 18:02
stmuk_ ugexe: yes those are installed OK .. its more an issue with panda and zef 18:04
I've investigated zef less
[Coke] wasn't the meteor problem meteor?
timotimo what was wrong with it? everything? :) 18:07
[Coke] didn't like the precompile step, IIRC
RabidGravy [Coke], can you check your github.com/gfldex/perl6-pod-to-bigpage/issues/1 with the latest LWP::Simple? I think I fixed it 18:14
dmaestro rakudo: say "Hello" 18:33
camelia rakudo-moar 76d585: OUTPUT«Hello␤»
dmaestro p6: say "Hello" 18:36
camelia rakudo-moar 76d585: OUTPUT«Hello␤»
hackedNODE What exactly is the difference between .categorize-list and .classify-list? 19:34
m: dd BagHash.new.classify-list: { $_ %% 2 ?? 'even' !! 'odd' }, ^10
camelia rakudo-moar b3c92b: OUTPUT«("even"=>5,"odd"=>5).BagHash␤»
hackedNODE m: dd BagHash.new.categorize-list: { $_ %% 2 ?? 'even' !! 'odd' }, ^10
camelia rakudo-moar b3c92b: OUTPUT«("even"=>5,"odd"=>5).BagHash␤»
cowens Is it really true that Perl 6 is intentionally designed such that it can't roundtrip Unicode? perl -CO -E 'say "e\x{301}"' | perl6 -ne '.say' | perl -CI -ne 'printf "U+%04x\n", ord for split //' 19:41
hackedNODE cowens: that's a bit of a loaded question. It uses graphemes and normal whatever form. You're giving a character and receive normalized form and then say "this is broken; is it true Perl 6 was designed to be broken" 19:42
m: say "e\x[301]".chars
camelia rakudo-moar b3c92b: OUTPUT«1␤»
ugexe but why cant it automatically know what i want?? 19:43
hackedNODE :)
m: say "\x[E9]" eq "e\x[301]" 19:44
camelia rakudo-moar b3c92b: OUTPUT«True␤»
harmil_wk cowens: are you just eavesdropping? :-)
hackedNODE cowens: ^ see. It normalized them into a single representation, which is what a human would expect when seeing a é character. If you want to preseve the details of combinations and such there are .NFG .NFC .NFK or something like that methods 19:45
We still kinda lack decent user docs for that area
harmil_wk cowens: You can preserve an ordered list of bytes if that's what you want (Buf does this) but if you wanted a high-level string object, then you cannot assume that it's ordering the bytes the way you assumed. 19:46
cowens Sorry, had to deal with work stuff, reading stuff now 19:49
hackedNODE If you read bytes from $*IN and write them to $*OUT, you'll "roundtrip" Unicode 19:50
cowens So, the only way to preserve a document that is being read in is to use a buf
timotimo right, it'll do normalization if you treat it as strings
cowens But all of the high-level string functions won't work?
timotimo you can also read it as a latin1 string
cowens or do some of them work on bufs?
timotimo latin1 strings will act just like a buf8, but it'll let you do string functions 19:51
but you'll be prone to composing characters being broken apart and stuff like that
cowens Say I want to replace a person's name, but leave a document in the state it was found otherwise, I would I do that? 19:51
ugexe open with the proper encoding? 19:52
cowens whoops, that should have been "How would I do that?"
timotimo that could work, but you might want to be careful at the end
cowens UTF-8
timotimo ugexe: that'll cause normalization on the way
AlexDaniel cowens: it is unrelated to your question, but I'm still curious why. What's the reason to keep unnormalized data? 19:54
cowens Basically, what I want is something like cat file | perl -CIO -pe 's/name/newname/' that doesn't trash the rest of the document WRT what form it is in (ie if it is in NFD, it stays NFD, if it is in NFC, it stays in NFC, if it isn't in a normal form, then it stays in its form) 19:56
I don't want to have to add metadata to the system to tell me which files are in which form and I don't want them changing form 19:57
AlexDaniel cowens: I got that. But why? It's not trashing it, it is fixing it.
cowens How is changing an NFD file into NFC "fixing" it? 19:57
geekosaur isn't this the usecase for a Buf? 20:00
AlexDaniel well, if your *goal* is to have data in NFD, then yeah, it does not help.
geekosaur basically, encodings are a nightmare no matter what; if you want to treat it as binary data, use Buf instead of Str
cowens My *goal* is not to have to worry about what form it was in or mucking it up for whatever is going to read it next 20:01
pmurias cowens: if you don't want to change the orginal encoding you can treat it as binary data
cowens Can I still do regexes and string operations on Bufs? I haven't really looked into them.
timotimo we'll be able to - in the future - keep mixed-normalization-files roundtrippable
and still use string operations on them 20:02
cowens Okay, so this is a temporary bug then?
timotimo it'll take a few months for that
geekosaur (note, you are not treating your data as UTF-8 because UTF-8 has things to say about normalization --- specifically, it recommends the normalization that perl6 is doinh)
timotimo i.e. it's not a priority at the moment
AlexDaniel m: say Buf.new(104, 101, 108, 108, 111) ~~ /hello/
camelia rakudo-moar b3c92b: OUTPUT«Cannot use a Buf as a string, but you called the Str method on it␤ in block <unit> at <tmp> line 1␤␤»
timotimo what, utf-8 suggests things about normalization?
i didn't know that
geekosaur they even recommend specific normalization schemes for specific use cases 20:03
cowens Yeah, NFD for doing work and NFC for storing
But that is a very loose recommendation
pmurias cowens: it's more a missing feature than a temporary bug
cowens Eh, I consider it bug that you can't implement cat unless you drop down to the binary level 20:04
timotimo or use latin1 encoding
cowens I try to pretend like latin1 doesn't exist anymore 20:05
Are there any docs on NFG? 20:07
Like how NFG differs from NFC?
timotimo latin1 is just "use the buf8 as a Str" 20:12
if you know what you're doing, you can handle simple substitutions, i'd say
ugexe can always use unpack("A*") if the word "latin1" is a personal trigger 20:13
cowens What I really want is a language that lets me treat "e\x[301]" and "\xe9" as the being string equivalent without them being the codepoints being changed. 20:16
cowens Here is a perfect example of why roundtripping is important 20:24
cowens Say I have a DB that is broken WRT Unicode 20:24
it has name columns that are stored in UTF-8, but it knows nothing about NFC, NFD, etc.
there is a DB dump file that needs to be tweaked 20:25
In order to use Perl 6, I would either need to fix the DB and all of the related systems
cowens or use Buf, which appears to be a second class citizen data type 20:26
Or, I could just use Perl 5 and not worry about it.
[Coke] sure. 20:27
we like Perl 5 here. Have fun.
cowens I want to use Perl 6.
ugexe you are offering to implement this in perl6 for us then?
cowens Heh.
[Coke] cowens: so use Inline::Perl5 (or Inline::Perl6 if you want to go the other way). pick and choose, sure.
[Coke] My recommendation for your "only change those bits" would be to treat the file as a whole as a Buf, and the bits you care about as strings as Strings. Then you can write them back out in whatever encoding you want, leaving the rest behind. 20:28
pmurias cowens: we agree that being to work on data in a way where the exact way characters is preserved is important 20:29
[Coke] You'll have to treat different things differently, though.
cowens How do you propose finding those bits if you are using Bufs instead of Str?
pmurias cowens: it's just that other things are important too so it hasn't been implemented yet
cowens I am not sure how it can be implemented based on what I am reading in the docs 20:30
[Coke] cowens: i don't know what your proposed bits look like. You're the one who said you wanted to change them, I assumed you could find them. :)
cowens With a regex, sure, but I can't use a regex. 20:30
Given what I am hearing about Str, it sounds like NFC/NFG is baked into the type. 20:31
Is the right answer a third type?
something between Buf and Str?
[Coke] Each of the NF*'s has a type.
cowens Yeah, but only the normal forms 20:32
there is no unnormalized string format
[Coke] if it's not normal, it's bytes, no?
right, that's a Buf.
cowens which is what I guess I am looking for
No, unnormalized is not bytes
"e\x[301]\xe9" is not bytes
it is a perfectly valid string 20:33
Unless my understanding of Unicode is deeply wrong 20:34
Which is a possibility.
[Coke] well, don't think I know what I'm talking about. :)
pmurias [Coke]: wouldn't unnormalized be bytes+encoding 20:35
[Coke] I'm sure our unicode/string expert will weigh in in backlog.
AlexDaniel m: ‘⚧’.uniname.say
camelia rakudo-moar b3c92b: OUTPUT«MALE WITH STROKE AND MALE AND FEMALE SIGN␤»
[Coke] pmurias: yah, don't listen to me. workweek is nearly over, I'm checked out. :)
AlexDaniel male with stroke huh 20:36
cowens Also, can you use regexes and stuff on the NF* types? I didn't see anything about that when I was glancing through the docs 20:37
timotimo so how would we go about getting a Uni out of a file without any normalization applied at all? 20:43
cowens Is Uni the type I am looking for? 20:44
basically just codepoints without normalization? 20:45
pmurias cowens: yes 20:47
harmil_wk cowens: I'm confused by your premise. It seems like you're interpreting normalization of strings as "damage" but you haven't clarified why that is.
timotimo it exists, but you mostly get Uni objects with the .NORMFORM methods 20:48
cowens Applying normalization when it isn't asked for makes changes.
The DB example I gave is a good one 20:49
harmil_wk cowens: okay... so does reading a value into an integer.
cowens Yes, it is broken that the DB doesn't store in NFC, but I don't have time to fix that and every other system touching it
ugexe m: my $buf = Buf.new(1); say $buf.^find_method("chars"); say $buf.chars; # it'd be nice if method chars wasn't exposed via .^methods if its just there to throw an exception telling you that you cant
camelia rakudo-moar b3c92b: OUTPUT«chars␤Cannot use a Buf as a string, but you called the chars method on it␤ in block <unit> at <tmp> line 1␤␤»
cowens In what way does turning the string "123" into the number 123 and then back to the string "123" remove or change information? 20:50
whereas reading in "e\x[301]" from a file and then outputting it changes it into "\xe9" currently 20:51
That is damage
harmil_wk cowens: I don't think your DB example makes any sense. The DB doesn't care about composition does it? Why would this be an issue? Also, if you're operating on binary data that happens to have string in it, then that's not the same as a unicode string, and you should expect failure.
cowens Perl 6 wasn't asked to do that
it cares about it when it goes to compare the strings
harmil_wk It most certainly was. You asked for a string, not a blob of bits
cowens because it is broken WRT to Unicode and doesn't know "e\[301]" and "\xe9" should compare as the same 20:52
AlexDaniel m: say ‘２５’.Int.Str # Oops
camelia rakudo-moar b3c92b: OUTPUT«25␤»
harmil_wk If you have a blob of bits that you don't want to coerce into a string, then don't coerce them into a string. If there are little bits of that binary blob that you want to treat as if they were strings, do so, but don't expect that interface to be clean and simple, because Unicode isn't clean or simple
Perl 6 just happens to clean up that interface at a different level of abstraction that some languages. 20:53
cowens Coming from other languages, in particular Perl 5, there is a certain expectation that reading a file into a string doesn't change the bits
harmil_wk That's not a valid assumption in most modern, high level, Unicode-aware languages. Stop doing that.
AlexDaniel cowens: I agree with you that there should be a way to do what you want, but this particular expectation is just wrong 20:54
harmil_wk Bits are bits. Strings are strings. You can't just mash the two into each other and hope. 20:54
cowens What is the raison d'être of Perl 6? 20:55
I had assumed it was string processing like Perl 5.
ugexe m: say "e\x[301]">>.ord ~~ "\x[e9]">>.ord 20:56
camelia rakudo-moar b3c92b: OUTPUT«True␤»
harmil_wk cowens: there is no one answer to that question. it's certainly not limited to string processing.
lizmat cowens: it's the programming language for the next 100 years :-)
harmil_wk Compilation is really the first and most critical target (since it's self-hosting) of course.
After that, all the things is pretty accurate.
cowens It isn't limited to string processing, but Perl has historically been the goto language for string processing 20:57
cowens Should I not look to Perl 6 for string processing? 20:58
AlexDaniel
.oO( string processing! Not byte processing, right? )
cowens Should I not expect to be able to easily roundtrip a file?
harmil_wk cowens: You're not describing a string processing use case, though. You're describing a binary data use case that you wish to seamlessly treat as a string processing use case under certain circumstances.
pmurias AlexDaniel: what cowens wants to do is code points processing
cowens Yeah, pretty much codepoint processing 20:59
cowens I am having a hard time understanding why the codepoints have to change 20:59
cowens Why Str is forcing a normalization on me 20:59
harmil_wk cowens: because Unicode is a mess, essentially. And in order to make strings more reasonable, we de-messify it as much as possible. 21:00
harmil_wk There was a great talk about this at a recent YAPC 21:00
harmil_wk looks for the link...
cowens Yeah, but it is a mess and I can't always normalize for that reason
and I don't want to have to turn into a second class citizen because I can't normalize
I understand I can't do it now 21:01
AlexDaniel m: say so ‘hello world’.ords ~~ (**, |‘world’.ords, **)
camelia rakudo-moar b3c92b: OUTPUT«True␤»
AlexDaniel m: say so ‘hello world’.ords ~~ (**, |‘foo’.ords, **)
camelia rakudo-moar b3c92b: OUTPUT«False␤»
cowens And I here people saying "you will be able to do it in the future" and people saying "why do you want that, you should do byte level stuff"
harmil_wk cowens: oh, you can do just about anything. But reading a blob of binary data as if it were a string and doing string-like processing on it, while carefully preserving its binary representation... that's just a bit harder. 21:02
harmil_wk You could certainly write your own class that managed data that way, based on buf, implementing Cool and otherwise doing the things you might expect. 21:02
cowens I am not even talking about binary representation
harmil_wk cowens: yes you are, you just don't think you are.
cowens I am talking about codepoint level representation 21:03
timotimo cowens: AFAIK, Uni doesn't give you a lot of stringy functions, so it's similar to Buf, too. but i'm not 100% on that
in the near future we're going to decouple encoding/decoding and normalization
so your use case will become a bit more easily doable then, i expect
cowens I can re-encode it to UTF-16le or whatever and the same codepoints will be there
cowens but the byte level will change 21:04
pmurias cowens: the people asking "why do you want that" seem to be the ones who hate codepoints ;)
cowens It seems like Perl6 has byte level (Buf) and string level (Str) but no middle layer
pmurias Uni is the middle layer 21:05
it's just not implemented yet
cowens Well, they aren't alone, I would love to live in a perfect world where I didn't have to care about codepoints, but they matter to heck of a lot of broken legacy code
timotimo pmurias: it is implemented. we just don't have a way to get directly from file to Uni without normalization 21:06
i think.
cowens So, if Uni is the right type, how would you read them in? As a Buf and then convert?
timotimo you just have to write your own utf8 decoder right now
timotimo read the file contents into a 32bit buf, then feed it directly into a Uni 21:07
pmurias timotimo: what I meant is that operations on Uni are not implemented yet 21:07
timotimo oh
what are we going to get to be used on Uni? everything that Str has?
pmurias timotimo: I'm not the language designer 21:09
timotimo right 21:10
pmurias timotimo: I assume we will want equivalents of most of the things that Str has 21:11
timotimo regexes on Uni will be interesting
regexes on Cat will be ... amazing 21:12
thundergnat \o #perl6 21:18
timotimo yo 21:20
long time no see, or am i imagining things? 21:21
thundergnat Hi timotimo, I lurk daily but rarely sign on.
timotimo ah
thundergnat My employer doesn't allow IRC but I read the logs. 21:22
I'm having an issue with what seems to be "my" variables leaking in a recursing subroutine. It may be that I need to adjust my expectations though.
timotimo hopefully you're not using the REPL?
thundergnat Nope. Let me put up a gist real quick. 21:23
timotimo k
thundergnat m: gist.github.com/thundergnat/cfbdee...af93eca564
camelia rakudo-moar b3c92b: OUTPUT«gist not found»
thundergnat err..
m: gist.github.com/thundergnat/cfbdee...f93eca5649
camelia rakudo-moar b3c92b: OUTPUT«1) 9␤2) 8␤ 1) a␤ 2) b␤3) 7␤4) 6␤ 1) a␤ 2) b␤3) 15␤4) 11␤5) 0␤»
thundergnat hard to tell in here, but I would expect the $count variable of the outer sub not to be incremented by the inner. 21:24
timotimo that's what we call a closure 21:25
the inner subs close over the variable, so they get access to it 21:26
thundergnat even though it recurses and declares its own $count variable?
timotimo oh, you mean the call to list() 21:27
right, let me re-read :)
indeed, that ought to get its own $count
perlpilot it would be easier to read if it didn't use subs called "item" and "list" ;) 21:28
AlexDaniel haha, yes
timotimo m: say item
camelia rakudo-moar b3c92b: OUTPUT«()␤»
timotimo it might be problematic that a sub "item" already exists outside
AlexDaniel committable6: releases gist.githubusercontent.com/thunder...8/leaky.p6
committable6 AlexDaniel, Successfully fetched the code from the provided URL.
AlexDaniel, ¦«2015.10»: ===SORRY!=== Error while compiling /tmp/SgrNtWbw4J␤Undeclared routine:␤ put used at line 13␤ «exit code = 1»␤¦«2015.11,2015.12,2016.02,2016.03,2016.04,2016.05,2016.06,2016.07.1,2016.08.1,HEAD»: 1) 9␤2) 8␤ 1) a␤ 2) b␤3) 7␤4) 6␤ 1) a␤ 2) b␤3) 15␤4) 11␤5) 0
timotimo this is a long shot, but what if you declare a proto sub item inside your list sub?
timotimo also, having the other sub called list is also ... :) 21:28
cowens regexes on Uni shouldn't be anymore interesting that Perl 5 regexes are currently 21:29
thundergnat sorry, piece of a larger program, the names are actually different, I was trying to make a minimal example and failed at naming :-/
cowens The interesting thing is will . match a code point or grapheme
timotimo at some point we had speculated about lexical modifiers for that decision 21:30
cowens Perl 5 is codepoint with \X matching grapheme
AlexDaniel wow I think I forgot that “put” is so new
bisect: old=2015.10 put()
bisectable6 AlexDaniel, Bisecting by exit code (old=2015.10 new=c9b18c6). Old exit code: 1
AlexDaniel, bisect log: gist.github.com/cdfdc71974d4c05ba3...5bdc5bb527
AlexDaniel, (2016-02-15) github.com/rakudo/rakudo/commit/b5...f21bde4316
AlexDaniel bisect: old=2015.10 put() # oh come on 21:31
bisectable6 AlexDaniel, Bisecting by exit code (old=2015.10 new=c9b18c6). Old exit code: 1
AlexDaniel, bisect log: gist.github.com/dc72a55558025f0cd1...314109fb84
AlexDaniel, (2015-11-12) github.com/rakudo/rakudo/commit/bc...24544082e6
AlexDaniel ok that seems right ;)
println! Nooooooo…
RabidGravy Hmm 21:36
perlpilot thundergnat, timotimo: did someone rakudobug this or look to see if it was already rakudobugged? 21:45
timotimo sorry, i'm completely out of heads right now 21:46
thundergnat perlpilot: I have not yet. I'm still trying to decide whether the problem is in me or Rakudo...
timotimo i couldn't even finish thinking about that gist
thundergnat I'm rather suspecting that the my var is leaking to the outer scope though.
perlpilot thundergnat: it doesn't hurt to rakudobug it even if you're unsure where the problem is. 21:48
thundergnat perlpilot: Ok, I'll file a bug report. At worst it is bogus or a repeat. 21:52
timotimo:, AlexDaniel, thanks for looking. 21:53
timotimo sorry for not actually looking
i have kind of an achey head
perlpilot thundergnat: fwiw, it looks like a bug to me too. 21:55
thundergnat Bug report filed : RT#129344 22:10
synopsebot6 Link: rt.perl.org/rt3//Public/Bug/Displa...?id=129344
jnthn .tell nine About your question about wrap of a core method in backlog, you'd better stick "no precompilation" on your code if you do that, since it's a monkey patch and those don't compose under precomp. 22:22
yoleaux jnthn: I'll pass your message to nine.
tailgate m: gist.github.com/ahalbert/0fe8a2eb0...27d8559f3c 22:25
camelia rakudo-moar b3c92b: OUTPUT«Cannot resolve caller formatted(List); none of these signatures match:␤ ($node, $ ())␤ ($node, List @codes)␤ in block <unit> at <tmp> line 7␤␤»
tailgate Why doesn't these method delcrations work?
jnthn 'cus you're passing them a single argument 22:28
Maybe you meant: say formatted("END", ('A', 'B', 'C')); 22:29
Or: say formatted "END", ('A', 'B', 'C');
AlexDaniel m: multi sub formatted($node, ()) { $node; }; multi sub formatted($node, @codes where {.elems > 0}) { @codes.head ~ formatted($node, @codes[1..*-1]); }; say formatted "END", <a b c>; 22:36
camelia rakudo-moar b3c92b: OUTPUT«abcEND␤»
tailgate m: gist.github.com/ahalbert/0fe8a2eb0...27d8559f3c
camelia rakudo-moar b3c92b: OUTPUT«Cannot resolve caller formatted(Str, List); none of these signatures match:␤ ($node, $ ())␤ ($node, List @codes)␤ in block <unit> at <tmp> line 7␤␤»
tailgate hmm
AlexDaniel m: multi sub formatted($node, @codes ()) { $node; }; multi sub formatted($node, @codes) { @codes.head ~ formatted($node, @codes[1..*-1]); }; say formatted "END", <a b c> 22:37
camelia rakudo-moar b3c92b: OUTPUT«abcEND␤»
tailgate ah. So should I still specify the type in @codes ())? 22:38
AlexDaniel tailgate: I have no idea actually. I just know that it works this way :)
jnthn sleep & 22:41
AlexDaniel disown 22:41
geekosaur &| 22:42
:p
grondilu m: sub infix:<choose>(UInt $n, UInt $k) { combinations($n, $k).elems }; say 10 choose 2 23:44
camelia rakudo-moar b3c92b: OUTPUT«45␤»
grondilu m: sub infix:<choose>(UInt $n, UInt $k) { combinations($n, $k).elems }; say 64 choose 6
camelia rakudo-moar b3c92b: OUTPUT«74974368␤»
stmuk_ 23:48
bioduds_ hi 23:51
is this here possible? sub MAIN( Str :%kv ) { 23:52
how would I call it on the command line?
--kv= ?

Powered by Cro and the Raku® Programming Language.

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

Thank you!