[00:22] *** perlnewbee joined [00:23] hello :) [00:24] i want to write a parser for some markup language i defined, and i want to try grammars for this. But i dont want to install perl6 in my production env. Can i compile this later to an executable binary? [00:33] there's different ways to get a perl6 program deployed [00:33] one of which is docker, another is making an installer for windows that contains a custom-compiled rakudo in it [00:33] but creating a single executable file from a program isn't yet a thing we have, sadly [00:34] oh, ok. Thanks :) [00:35] *** test2 joined [00:37] *** mr_ron left [00:42] *** zachk left [00:44] *** mr_ron joined [00:45] *** test2 left [00:47] hm, can't you use flatpack or appimage (i forget which one samcv got working) for that? [00:51] we do have an appimage of rakudo itself, i think maybe even rakudo star including dependencies? maybe you can use that for a full program [00:52] *** Kaiepi left [00:56] New CPAN upload: Font-FreeType-0.0.8.tar.gz by WARRINGD http://modules.perl6.org/dist/Font::FreeType:cpan:WARRINGD [01:08] *** mcmillhj joined [01:20] *** mcmillhj left [01:23] *** espadrine left [01:29] *** comborico1611 left [01:31] *** Herby_ left [01:32] *** BenGoldberg joined [01:41] *** FROGGS_ joined [01:44] *** FROGGS left [01:49] *** ilbot3 left [01:56] *** ilbot3 joined [01:56] *** ChanServ sets mode: +v ilbot3 [01:57] *** mcmillhj joined [02:01] *** mr_ron left [02:03] *** Kaiepi joined [02:08] *** mcmillhj left [02:18] ¦ doc: 4f3459fcf6 | 陈梓立++ (committed using GitHub Web editor) | doc/Language/variables.pod6 [02:18] ¦ doc: Fix broken link [02:18] ¦ doc: [02:18] ¦ doc: No very sure if it works. [02:18] ¦ doc: [02:18] Link: https://doc.perl6.org/language/variables [02:18] ¦ doc: Co #1972. If works, close this issue. [02:18] ¦ doc: review: https://github.com/perl6/doc/commit/4f3459fcf6 [02:50] *** mr_ron joined [02:52] *** Herby_ joined [02:54] *** mr_ron left [02:58] ¦ doc: coke self-assigned /tmp files don't get cleaned up properly https://github.com/perl6/doc/issues/1973 [03:00] ¦ doc: 101a710ccb | 陈梓立++ (committed using GitHub Web editor) | README.zh.md [03:00] ¦ doc: Sync [03:00] ¦ doc: review: https://github.com/perl6/doc/commit/101a710ccb [03:03] *** comborico1611 joined [03:03] M: if 'ac' ~~ m/ a.c / { say "Match";} [03:04] m: if 'ac' ~~ m/ a.c / { say "Match";} [03:04] rakudo-moar 40d887c8e: ( no output ) [03:06] m: if 'ac' ~~ m/ a?c / { say "Match"; } [03:06] rakudo-moar 40d887c8e: OUTPUT: «Match␤» [03:07] m: if 'c' ~~ m/ a?c / { say "Match"; } [03:07] rakudo-moar 40d887c8e: OUTPUT: «Match␤» [03:11] m: if 'c' ~~ / a?c / { say "Match"; } [03:11] rakudo-moar 40d887c8e: OUTPUT: «Match␤» [03:16] m: if 'aaz' ~~ m/ a*z / { say "Match"; } [03:16] rakudo-moar 40d887c8e: OUTPUT: «Match␤» [03:16] m: if 'z' ~~ m/ a*z / { say "Match"; } [03:16] rakudo-moar 40d887c8e: OUTPUT: «Match␤» [03:17] m: if 'azzz' ~~ m/ a*z / { say "Match"; } [03:17] rakudo-moar 40d887c8e: OUTPUT: «Match␤» [03:19] m: if 'z' ~~ m/ a+z / { say "Match"; } [03:19] rakudo-moar 40d887c8e: ( no output ) [03:20] ¦ doc: 65f77f515a | (Zoffix Znet)++ | app.pl [03:20] ¦ doc: Make dev app clean up its temp files [03:20] ¦ doc: review: https://github.com/perl6/doc/commit/65f77f515a [03:21] m: if 'Rakudo is a Perl 6 compiler' ~~ m/:s Perl 6/ {say "The matching string starts at position: " ~ $/.from} [03:21] rakudo-moar 40d887c8e: OUTPUT: «The matching string starts at position: 12␤» [03:22] ¦ doc: f437917457 | 陈梓立++ (committed using GitHub Web editor) | doc/Language/variables.pod6 [03:22] ¦ doc: Fix link [03:22] ¦ doc: review: https://github.com/perl6/doc/commit/f437917457 [03:22] Link: https://doc.perl6.org/language/variables [03:23] *** ryn1x joined [03:26] m: .polymod(2, 4, 8 ... *).say for 1, 2, 4 ... 16 [03:26] rakudo-moar 40d887c8e: OUTPUT: «(1)␤(0 1)␤(0 2)␤(0 0 1)␤(0 0 2)␤» [03:26] I hoped this would give me the popcount, but why doesn't it work on 4 and 16? [03:27] Actually, I just want to know reliably if an integer is a power of 2. [03:43] *** Zoffix joined [03:43] tobs: is log too flimsy? [03:43] m: say (2¹⁰⁰).log: 2 [03:43] rakudo-moar 40d887c8e: OUTPUT: «100␤» [03:43] m: say (2¹⁰⁰+1).log: 2 [03:43] rakudo-moar 40d887c8e: OUTPUT: «100␤» [03:43] I guess that answers that... [03:45] The 8 and 16 polymoded with divisor 8, don't they? (0 0 1)␤(0 0 2) [03:48] Zoffix: I just read the code of Int.polymod and now the results make sense to me [03:48] *** comborico1611 left [03:51] m: sub pow2 { not $^x +& ($x - 1) }; say pow2 2¹⁰⁰ [03:51] rakudo-moar 40d887c8e: OUTPUT: «True␤» [03:51] m: sub pow2 { not $^x +& ($x - 1) }; say pow2 2¹⁰⁰+1 [03:51] rakudo-moar 40d887c8e: OUTPUT: «False␤» [03:51] *** BenGoldberg left [03:52] Neat. [03:53] m: sub pow2 {$x.lsb == $x}; say pow2 2¹⁰⁰ [03:53] rakudo-moar 40d887c8e: OUTPUT: «5===SORRY!5=== Error while compiling ␤Variable '$x' is not declared␤at :1␤------> 3sub pow2 {7⏏5$x.lsb == $x}; say pow2 2¹⁰⁰␤» [03:53] m: sub pow2 { $^x.lsb == $x}; say pow2 2¹⁰⁰ [03:53] rakudo-moar 40d887c8e: OUTPUT: «False␤» [03:53] Any power of two is 1 followed by zeros and it minus 1 is 01111111…, so anding that gives zero for powers of 2 [03:53] TIL [03:54] m: sub pow2 { $^x.lsb }; say pow2 2¹⁰⁰ [03:54] rakudo-moar 40d887c8e: OUTPUT: «100␤» [03:54] ohhh [03:55] m: sub pow2 { $^x ^ $x.lsb == $x }; say pow2 2¹⁰⁰ [03:55] rakudo-moar 40d887c8e: OUTPUT: «one(True, False)␤» [03:55] m: sub pow2 { $^x +^ $x.lsb == $x }; say pow2 2¹⁰⁰ [03:55] rakudo-moar 40d887c8e: OUTPUT: «False␤» [03:55] hm [03:55] exponent op is? [03:55] ^ is junction +^ is bit op [03:55] Oh, that's ** [03:55] m: sub pow2 { $^x ** $x.lsb == $x }; say pow2 2¹⁰⁰ [03:55] rakudo-moar 40d887c8e: OUTPUT: «False␤» [03:55] oh heh, nvm [03:56] m: sub pow2 { $^x ** $x.lsb }; say pow2 2¹⁰⁰ [03:56] rakudo-moar 40d887c8e: OUTPUT: «19950631168807583848837421626835850838234968318861924548520089498529438830221946631919961684036194597899331129423209124271556491349413781117593785932096323957855730046793794526765246551266059895520550086918193311542508608460618104685509074866089624888…» [03:56] m: sub pow2 { 2 $^x.lsb == $x }; say pow2 2¹⁰⁰ [03:56] rakudo-moar 40d887c8e: OUTPUT: «5===SORRY!5=== Error while compiling ␤Two terms in a row␤at :1␤------> 3sub pow2 { 27⏏5 $^x.lsb == $x }; say pow2 2¹⁰⁰␤ expecting any of:␤ infix␤ infix stopper␤ statement end␤ sta…» [03:56] ah [03:56] m: sub pow2 { 2 **$^x.lsb == $x }; say pow2 2¹⁰⁰ [03:56] rakudo-moar 40d887c8e: OUTPUT: «True␤» [03:56] \o// [03:56] m: sub pow2 { 2 **$^x.lsb == $x }; say pow2 2¹⁰⁰ + 1 [03:56] rakudo-moar 40d887c8e: OUTPUT: «False␤» [03:56] hooray [03:56] hooray for lsb [03:57] m: my $p = 2¹⁰⁰; sub pow2 { 2 **$^x.lsb == $x }; { for ^1000_000 { my $ = pow2 $p }; say now - ENTER now } [03:57] rakudo-moar 40d887c8e: OUTPUT: «(timeout)» [03:57] m: my $p = 2¹⁰⁰; sub pow2 { 2 **$^x.lsb == $x }; { for ^1000 { my $ = pow2 $p }; say now - ENTER now } [03:57] rakudo-moar 40d887c8e: OUTPUT: «0.0476687␤» [03:58] m: my $p = 2¹⁰⁰; sub pow2 { 2 **$^x.lsb == $x }; { for ^50000 { my $ = pow2 $p }; say now - ENTER now } [03:58] rakudo-moar 40d887c8e: OUTPUT: «1.48259542␤» [03:58] m: my $p = 2¹⁰⁰; sub pow2 { not $^x +& ($x - 1) }; { for ^50000 { my $ = pow2 $p }; say now - ENTER now } [03:58] rakudo-moar 40d887c8e: OUTPUT: «0.0874599␤» [03:58] :) anding's faster :) [03:59] oh, thanks TEttinger++ and Zoffix++. I was still busy .map'ing sequences to get my popcount. [03:59] I wonder if there's a popcount built in [04:00] *** Tison joined [04:00] is this it? https://en.wikipedia.org/wiki/Hamming_weight [04:01] good noon! [04:01] \o [04:01] Zoffix: if you have a list of bits, yes [04:01] https://rosettacode.org/wiki/Population_count#Perl_6 [04:01] hmmm [04:02] m: sub pow2 (Int $n) { so (2, 4, 8 ...^ * >= $n).map(* Rmod $n).all == 0 } ; { for ^1000 { my $ = pow2 $p }; say now - ENTER now } # assuming it's correct [04:02] rakudo-moar 40d887c8e: OUTPUT: «5===SORRY!5=== Error while compiling ␤Variable '$p' is not declared␤at :1␤------> 3.all == 0 } ; { for ^1000 { my $ = pow2 7⏏5$p }; say now - ENTER now } # assuming i␤» [04:02] that shit's over my head [04:03] m: my $p = 2**100; sub pow2 (Int $n) { so (2, 4, 8 ...^ * >= $n).map(* Rmod $n).all == 0 } ; { for ^1000 { my $ = pow2 $p }; say now - ENTER now } # assuming it's correct [04:03] rakudo-moar 40d887c8e: OUTPUT: «5.3492947␤» [04:04] m: say +StrDistance.new(:before('0' x .chars), :after($_)) with 2¹⁰⁰.base: 2 [04:04] rakudo-moar 40d887c8e: OUTPUT: «1␤» [04:05] m: say +StrDistance.new(:before('0' x .chars), :after($_)) with (2¹⁰⁰+1).base: 2 [04:05] rakudo-moar 40d887c8e: OUTPUT: «2␤» [04:05] m: say +StrDistance.new(:before('0' x .chars), :after($_)) with (2¹⁰⁰-1).base: 2 [04:05] rakudo-moar 40d887c8e: OUTPUT: «100␤» [04:05] ¯\_(ツ)_/¯ [04:06] well, now I have at least 3 ways to do it which shorter than mine. Mission accomplished \o/ [04:09] *** Zoffix left [04:10] m: sub pow2 ($n) { .elems == 1 with $n.base(2) ~~ m:g/1/ }; say pow2($_) for ^10; [04:10] rakudo-moar 40d887c8e: OUTPUT: «False␤True␤True␤False␤True␤False␤False␤False␤True␤False␤» [04:13] ¦ perl6-pod-to-bigpage: 9fe402be40 | 陈梓立++ (committed using GitHub Web editor) | lib/Pod/To/BigPage.pm6 [04:13] ¦ perl6-pod-to-bigpage: Fix over escape [04:13] ¦ perl6-pod-to-bigpage: [04:13] ¦ perl6-pod-to-bigpage: though there is remaining issue of X<> tags [04:13] ¦ perl6-pod-to-bigpage: review: https://github.com/perl6/perl6-pod-to-bigpage/commit/9fe402be40 [04:13] ¦ perl6-pod-to-bigpage: 4518ca3599 | 陈梓立++ (committed using GitHub Web editor) | META6.json [04:13] ¦ perl6-pod-to-bigpage: Bump version [04:13] ¦ perl6-pod-to-bigpage: review: https://github.com/perl6/perl6-pod-to-bigpage/commit/4518ca3599 [04:14] ¦ doc: 1bc12e6ec7 | 陈梓立++ (committed using GitHub Web editor) | util/trigger-rebuild.txt [04:14] ¦ doc: Update trigger-rebuild.txt [04:14] ¦ doc: review: https://github.com/perl6/doc/commit/1bc12e6ec7 [04:18] .ask AlexDaniel how can I figure out which libs depend on a special lib? say for URI, Pod::To::HTML depends on URI [04:18] Tison: I'll pass your message to AlexDaniel. [04:22] *** Herby_ left [04:23] The problem I works on is, Pod::To::BigPage does not support X<> tags well, it just renders a strange list in sidebar, with all links fail. I'd like to clear its logic, but afraid making some damaging changes. [04:29] *** khw left [04:30] .ask [Coke] could you please take a look at this build fail on doc? I just trigger rebuild and it fails unexpectedly. [04:30] Tison: I'll pass your message to [Coke]. [04:30] https://travis-ci.org/perl6/doc/builds/372591653?utm_source=github_status&utm_medium=notification [04:30] [travis build above] ☠ Did not recognize some failures. Check results manually. [04:45] my subconscious came up with how I should have used polymod: [04:45] m: say .polymod(2 xx *).sum == 1 for ^10 [04:45] rakudo-moar 40d887c8e: OUTPUT: «False␤True␤True␤False␤True␤False␤False␤False␤True␤False␤» [04:50] *** thowe left [04:56] New CPAN upload: HTTP-Tinyish-0.1.1.tar.gz by SKAJI http://modules.perl6.org/dist/HTTP::Tinyish:cpan:SKAJI [04:58] *** ryn1x left [05:29] *** sauvin left [05:31] *** sauvin joined [05:39] *** perlnewbee left [05:48] *** eliasr left [05:49] *** espadrine joined [06:02] *** kurahaupo left [06:02] *** kurahaupo joined [06:10] *** ufobat joined [06:21] *** jmerelo joined [06:40] ¦ doc/car-grant-midrat: fd50cdfe77 | (Zoffix Znet)++ | doc/Type/Str.pod6 [06:40] ¦ doc/car-grant-midrat: [CaR Grant] Document Str.Rat [06:40] ¦ doc/car-grant-midrat: review: https://github.com/perl6/doc/commit/fd50cdfe77 [06:44] jmerelo, https://docs.perl6.org/type/Buf#method_subbuf-rw doesn't mention what $length is, if it isn't provided. if means that you replace everything till the end. but one could think that you just change the abount of data you're acctually providing [06:46] like $large-buf.subbuf-rw(10) = Buf.new(10,11) # whoul'd set the $lange-buf to 12 bytes [06:48] where is the documentation on github? [06:54] ¦ doc: 5076e57b99 | (JJ Merelo)++ | htmlify.p6 [06:54] ¦ doc: Eliminates Any and Mu from pages [06:54] ¦ doc: [06:54] ¦ doc: Leaving Cool, which is not common for all pages, and Exception, which [06:54] ¦ doc: is the mother of all X::*. Closes #1916. [06:54] ¦ doc: review: https://github.com/perl6/doc/commit/5076e57b99 [06:54] ufobat: let me check [06:55] ufobat: right here https://github.com/perl6/doc/blob/master/doc/Type/Buf.pod6#L16 [06:56] ufobat: it does say "C<$length> specifies how many elements are to be replaced". Is that what you mean? [07:04] *** kurahaupo_ joined [07:04] *** kurahaupo left [07:11] ¦ doc/car-grant-midrat: cf74874249 | (Zoffix Znet)++ | doc/Language/numerics.pod6 [07:11] ¦ doc/car-grant-midrat: [CaR Grant] Document the rest of primary numerics [07:11] ¦ doc/car-grant-midrat: review: https://github.com/perl6/doc/commit/cf74874249 [07:11] *** Tison left [07:26] ¦ doc: cbc50baf02 | (JJ Merelo)++ | 16 files [07:26] ¦ doc: Renames test files to give them a logical order [07:26] ¦ doc: [07:26] ¦ doc: Closes #1966. It might also help #1951. Or at least help debug it. [07:26] ¦ doc: review: https://github.com/perl6/doc/commit/cbc50baf02 [07:29] jmerelo, aye, but $length is optional, what if you leave it out [07:30] ufobat: OK, right. Does not say anything about that. Can you please create an issue for that? [07:30] do you replace from $start to $end or do you replace just n bytes if you say .subbuf-rw($start) = $buf-with-n-elems [07:31] of course :) [07:31] *** kurahaupo_ left [07:32] *** kurahaupo joined [07:32] ufobat: no idea right now. Would have to check code from roast, probably. Thanks! [07:33] jup it replaces everthing: https://github.com/rakudo/rakudo/blob/master/src/core/Buf.pm6#L650 [07:35] issue created [07:39] ufobat: thanks! [07:40] thanks as well :-) [07:44] ¦ perl6-pod-to-bigpage: e57f16207d | (JJ Merelo)++ | t/P.t [07:44] ¦ perl6-pod-to-bigpage: Fixes test [07:44] ¦ perl6-pod-to-bigpage: review: https://github.com/perl6/perl6-pod-to-bigpage/commit/e57f16207d [07:45] ¦ doc: 025f28b5d5 | (JJ Merelo)++ | htmlify.p6 [07:45] ¦ doc: Eliminates debug code [07:45] ¦ doc: review: https://github.com/perl6/doc/commit/025f28b5d5 [07:48] As a consequence of eliminating Any and Mu from all type pages, testing is now between 2 and 4 minutes faster... The docker test is now down to ~8 minutes [07:49] Also, now tests have some kind of "logical" order. They should fail faster, since most frequent errors are in front. [07:51] *** DataLinkDroid joined [07:51] *** rindolf joined [07:54] *** wamba joined [07:55] ¦ doc/car-grant-midrat: fd0161a2f4 | (JJ Merelo)++ | doc/Language/numerics.pod6 [07:55] ¦ doc/car-grant-midrat: Fixes pod [07:55] ¦ doc/car-grant-midrat: review: https://github.com/perl6/doc/commit/fd0161a2f4 [07:57] ¦ doc: 7942e679bd | (Zoffix Znet)++ (committed using GitHub Web editor) | util/trigger-rebuild.txt [07:57] ¦ doc: Update trigger-rebuild.txt [07:57] ¦ doc: review: https://github.com/perl6/doc/commit/7942e679bd [07:59] 1000 closed issues already in perl6/doc https://github.com/perl6/doc/issues?q=is%3Aissue+is%3Aclosed [07:59] *** darutoko joined [08:05] *** sjoshi joined [08:08] *** sjoshi left [08:11] *** domidumont joined [08:14] *** sjoshi joined [08:15] *** sjoshi left [08:17] *** domidumont left [08:17] *** domidumont joined [08:18] *** TEttinger left [08:23] ¦ doc: Kaiepi++ created pull request #1975: Add Node.js to Perl 6 nutshell page [08:23] ¦ doc: review: https://github.com/perl6/doc/pull/1975 [08:31] .seen nkh [08:31] I haven't seen nkh around. [08:39] Data::Dump::Tree seems kind of abandoned... https://github.com/nkh/P6-Data-Dump-Tree [09:05] *** athenot joined [09:09] *** athenot_ joined [09:10] *** athenot left [09:21] *** Zartant joined [09:21] *** irco joined [09:21] *** Zartant left [09:21] *** athenot_ left [09:46] *** Kaiepi left [09:57] Apparently, new JS is getting the // and ==> operators from Perl 6... https://medium.freecodecamp.org/here-are-three-upcoming-changes-to-javascript-that-youll-love-387bce1bfb0b [10:05] squashable6: status [10:05] jmerelo, ⚠🍕 Next SQUASHathon in 4 days and ≈23 hours (2018-05-05 UTC-12⌁UTC+14). See https://github.com/rakudo/rakudo/wiki/Monthly-Bug-Squash-Day [10:09] ¦ doc: 25d32fe58f | (Elizabeth Mattijsen)++ | doc/Language/5to6-perlfunc.pod6 [10:09] ¦ doc: Add mention of P5 functions added by P5opendir [10:09] ¦ doc: review: https://github.com/perl6/doc/commit/25d32fe58f [10:09] Link: https://doc.perl6.org/language/5to6-perlfunc [10:16] New CPAN upload: P5built-ins-0.0.11.tar.gz by ELIZABETH https://cpan.metacpan.org/authors/id/E/EL/ELIZABETH/Perl6/P5built-ins-0.0.11.tar.gz [10:18] *** Kaiepi joined [10:36] New CPAN upload: P5opendir-0.0.2.tar.gz by ELIZABETH http://modules.perl6.org/dist/P5opendir:cpan:ELIZABETH [10:40] Initial analysis on the Perl 6 documentarion repository https://www.researchgate.net/publication/324829397_Perl_6_documentation_repository_through_time_An_initial_report?_iepl%5BviewId%5D=r0ZU4Jm7jlhdDpI1jb0ux9pC&_iepl%5Bcontexts%5D%5B0%5D=publicationCreationEOT&_iepl%5BtargetEntityId%5D=PB%3A324829397&_iepl%5BinteractionType%5D=publicationCTA [10:42] Apart from the curious power-law behavior in issue solution time, it's got nice and colorful charts. Also it's allowed me to create some report-generation and statistical analysis tools, all of them in Perl 6 [10:43] If you'd like to see more metrics done, well, raise an issue :-) It's open science, so pull requests are admitted and encouraged. [10:43] how could i create a $float if i just have the bits? [10:44] Maybe the best take-home message is that 50% of the issues are solved in 1 day, but a quarter of them take more than 16 days to process [10:44] ufobat: bits in IEEE754 representation? [10:44] yes [10:45] ufobat: maybe through a Buf? Let me see... [10:45] (meanwhile, posting it in StackOverflow will also get a number of high-quality responses... :-) ) [10:46] with unpack() maybe, but that's experimental [10:46] ufobat: right. And buf is only for strings, apparently... [10:47] pack seems to be only for integers... [10:47] ufobat: maybe stuff it into some Native data structure? [10:48] ufobat: right, that might be it... [10:48] how does this work? [10:49] jmerelo: trying to find the way... [10:49] ufobat: right, something like this https://stackoverflow.com/questions/26310249/converting-4-raw-bytes-into-32-bit-floating-point [10:49] using the NativeCall API in Perl 6. [10:54] i was looking through lizmat http://modules.perl6.org/dist/P5pack:cpan:ELIZABETH/lib/P5pack.pm6 but apparently it doesn't implement 'f' and 'd'. or am i mistaken [10:55] because i thought perl5 unpack/pack would do this [10:56] ufobat: not, sure, it's been a while since I really looked at that [10:57] ufobat: I think we don't have an equivalent for f/d in Perl 6 ? [11:01] we do have num32 which chould be a IEEE float? [11:03] not sure... I believe you [11:03] *** markong joined [11:04] possibly my work on pack/unpack predates the availability of num32 [11:04] i just know num32 from the NativeCall documentation [11:07] I believe num32 is a float and Num is a double [11:09] I'm not sure though, but I'd just use Num for both of them [11:15] i'll ask stackoverflow :) [11:16] ufobat: posted my (failing) solution to that problem in StackOverflow https://stackoverflow.com/questions/50085953/converting-from-raw-bytes-to-floating-point-representation-in-perl-6-using-the-n [11:16] m: my num32 $x = 1/3.Num; my $y = $x * $x; $x = $y; say $x - $y [11:16] rakudo-moar 775a42eeb: OUTPUT: «1.655684478407693e-09␤» [11:16] What I was trying to do is to just use memcpy through NativeCall to turn one into another. [11:16] yeah, every operation gets turned into 64-bit one anyway [11:17] jmerelo, i think memcopy needs pointers? [11:19] is rw, maybe [11:20] Can possibly do it with a NativeCall union or something [11:25] https://stackoverflow.com/questions/50086033/perl6-converting-data-in-a-blob-into-a-num [11:28] weekly: https://www.researchgate.net/publication/324829397_Perl_6_documentation_repository_through_time_An_initial_report [11:28] lizmat, Noted! [11:29] *** ufobat left [11:30] ufobat: theoretically they are pointers. [11:34] ufobat: I have pointed to your question from mine. [11:36] New CPAN upload: HTTP-Tinyish-0.1.2.tar.gz by SKAJI http://modules.perl6.org/dist/HTTP::Tinyish:cpan:SKAJI [11:38] m: class Memory is repr('CUnion') { has int32 $.int; has num32 $.float }; say Memory.new(:float(1.Num)).int; [11:38] rakudo-moar 775a42eeb: OUTPUT: «1065353216␤» [11:38] jmerelo: ^ [11:39] you don't really need memcpy for it [11:39] .tell Tison you can try `zef rdepends URI` [11:39] AlexDaniel: I'll pass your message to Tison. [11:40] *** Kaiepi left [11:41] Voldenet: thanks! [11:41] *** jmerelo left [11:55] *** InstallPerl6 joined [11:56] Huh, I do wonder how to use Pointer[T] [11:57] m: use NativeCall; say nativecast(uint32, Pointer.new(1.Num)) [11:57] rakudo-moar 775a42eeb: OUTPUT: «Default constructor for 'NativeCall::Types::Pointer' only takes named arguments␤ in block at line 1␤␤» [11:57] m: use NativeCall; say nativecast(uint32, CArray[num32].new(1.Num)) [11:57] rakudo-moar 775a42eeb: OUTPUT: «1065353216␤» [12:18] *** Kaiepi joined [12:20] m: use NativeCall; say nativecast(uint32, CArray[num32].new(1e0)) # more idiomatic way to make literal nums [12:20] rakudo-moar 775a42eeb: OUTPUT: «1065353216␤» [12:22] Are you sure that isn't 32 bits of the pointer to the array? [12:22] use NativeCall; say nativecast(uint32, CArray[num32].new(0e0)) [12:22] jnthn, rakudo-moar 775a42eeb: OUTPUT: «0␤» [12:22] m: use NativeCall; say nativecast(uint32, CArray[num32].new(0e0)) [12:22] rakudo-moar 775a42eeb: OUTPUT: «0␤» [12:23] Hm, apparently not. [12:23] I'm still unsure if this can be made into Pointer[num32] somehow [12:24] it can [12:25] m: use NativeCall; my $ptr = nativecast(uint32, CArray[uint32].new(1e0)); say nativecast(Pointer[num32], $ptr) [12:25] rakudo-moar 775a42eeb: OUTPUT: «This type cannot unbox to a native integer: P6opaque, Num␤ in method new at /home/camelia/rakudo-m-inst-2/share/perl6/sources/51E302443A2C8FF185ABC10CA1E5520EFEE885A1 (NativeCall::Types) line 198␤ in method new at /home/camelia/rakudo-m-inst-2/s…» [12:25] m: use NativeCall; my $ptr = nativecast(num32, CArray[num32].new(1e0)); say nativecast(Pointer[num32], $ptr) [12:25] rakudo-moar 775a42eeb: OUTPUT: «Native call expected return type with CPointer, CStruct, CArray, or VMArray representation, but got a P6opaque (Num)␤ in sub nativecast at /home/camelia/rakudo-m-inst-2/share/perl6/sources/24DD121B5B4774C04A7084827BFAD92199756E03 (NativeCall) line …» [12:25] oh [12:26] Ah, what I meant was this [12:26] use NativeCall; say nativecast(uint32, Pointer[num32].new(0e0)) [12:26] m: use NativeCall; say nativecast(uint32, Pointer[num32].new(0e0)) [12:26] rakudo-moar 775a42eeb: OUTPUT: «Default constructor for 'NativeCall::Types::Pointer[num32]' only takes named arguments␤ in block at line 1␤␤» [12:28] it would make more sense to be able to use Pointer in this context, because CArray is, well, an array :) [12:28] *** cono joined [12:29] hello all. Q: Is there a way to make tail-recursion? [12:29] m: use NativeCall; my $ptr = nativecast(CArray[num32], CArray[num32].new(1e0)); say $ptr [12:29] rakudo-moar 775a42eeb: OUTPUT: «NativeCall::Types::CArray[num32].new␤» [12:29] m: use NativeCall; my $ptr = nativecast(Pointer[num32], CArray[num32].new(1e0)); say $ptr [12:29] rakudo-moar 775a42eeb: OUTPUT: «NativeCall::Types::Pointer[num32]<0x52882f0>␤» [12:30] *** Ven`` joined [12:30] probably shouldn't try to code with little sleep but that's a way to get it [12:32] m: use NativeCall; my $ptr = nativecast(Pointer[num32], CArray[num32].new(1e0)); say $ptr.deref [12:32] rakudo-moar 775a42eeb: OUTPUT: «1␤» [12:32] But in the end you still end up creating an array [12:33] *** InstallPerl6 left [12:33] cono: short answer is no: OOC, what are you trying to achieve? [13:08] wrote small recursive algorithm for tree traversing, and was thinking change it to loop or nextwith/samewith provides tail recursion. Will rewrite it to loop, not a big deal [13:16] New CPAN upload: P5pack-0.0.3.tar.gz by ELIZABETH http://modules.perl6.org/dist/P5pack:cpan:ELIZABETH [13:33] *** evalable6 left [13:33] *** evalable6 joined [13:33] *** mscha joined [13:36] New CPAN upload: P5chomp-0.0.4.tar.gz by ELIZABETH http://modules.perl6.org/dist/P5chomp:cpan:ELIZABETH [13:47] *** Ven`` left [13:50] *** Ven`` joined [14:27] *** HaraldJoerg joined [14:42] *** cognominal left [14:42] *** cognominal joined [14:51] *** siigl joined [14:51] *** siigl left [14:56] I thought: let's try the SO way: https://stackoverflow.com/questions/50087913/native-localtime-segfaults [15:06] *** stmuk_ joined [15:09] *** stmuk left [15:17] ¦ doc: 5d54953626 | cfa++ | doc/Language/5to6-perlfunc.pod6 [15:17] ¦ doc: nbsp [15:17] ¦ doc: review: https://github.com/perl6/doc/commit/5d54953626 [15:17] Link: https://doc.perl6.org/language/5to6-perlfunc [15:28] lizmat: and already an answer [15:29] *** zakharyas joined [15:30] *** zakharyas left [15:31] *** zakharyas joined [15:36] *** zakharyas left [15:36] *** zakharyas joined [15:39] *** thowe joined [15:41] *** Zoffix joined [15:42] Is "Perl 6" trademarked? [15:42] 07:46Z Zoffix: lsb (lowest-set-bit?) can be implemented better by the underlying architecture [15:43] Oh cool. There's a "PERL" medical device: http://tmsearch.uspto.gov/bin/showfield?f=doc&state=4809:wtxng9.2.3 [15:45] K, found it http://tmsearch.uspto.gov/bin/showfield?f=doc&state=4809:wtxng9.2.30 [15:45] Thinking of buying a new car and gonna put a "♥ Perl 6" license plate on it :) But law says I can't infringe on trademarks :) [15:46] * Zoffix emails TPF's legal department [15:49] is a merge usage as endorsement a potential infringement? [15:49] "merge usage"? [15:49] *** kaare_ joined [15:50] Oh you mean, like I'm basically gonna be like a walking ad. It probably is. What if the trademark owner doesn't want to be associated with me? [15:51] *mere [15:52] I have no idea how copyright works [15:52] don't you live in Canada? [15:52] Are us trademarks valid there? [15:52] (without a legal presence?) [15:55] I don't know. [15:56] Which isn't the answer I want to give if the license plate people ask me if I have permission to use it :P [15:57] *** stmuk joined [15:59] understandable :-) [15:59] Slightly irksome that all the letters are capitalized :) https://www.services.gov.on.ca/wps85/s2i/S2I_Plp/genImage?symbolId=11&plateText=PERL%206 [16:00] *** stmuk_ left [16:00] *** khw joined [16:03] *** HaraldJoerg1 joined [16:05] *** HaraldJoerg left [16:05] Zoffix: I don't think they care [16:05] the lawsuite for you ;) [16:21] *** zakharyas1 joined [16:21] *** zakharyas left [16:24] *** jmerelo joined [16:26] *** Ven`` left [16:34] I answered another: https://rosettacode.org/wiki/Simple_database#Perl_6 [16:34] *** zakharyas1 left [16:36] *** zakharyas joined [16:40] ¦ gtk-simple: 391ed3cada | (Nick Logan)++ (committed using GitHub Web editor) | Build.pm [16:40] ¦ gtk-simple: Fix Build.pm to exit 0 on success [16:40] ¦ gtk-simple: review: https://github.com/perl6/gtk-simple/commit/391ed3cada [16:40] ¦ gtk-simple: 4707622d9f | (Nick Logan)++ (committed using GitHub Web editor) | META6.json [16:40] ¦ gtk-simple: Bump version 0.1.9 [16:40] ¦ gtk-simple: review: https://github.com/perl6/gtk-simple/commit/4707622d9f [16:41] kt_++ [16:41] *** jmerelo left [16:42] *** jmerelo joined [16:49] *** Ven`` joined [16:50] *** TEttinger joined [16:52] Can I run by you my understanding of what "Normal Form Grapheme" is to see if I got it right? [16:53] Basically, it's a, well, normalized form of implementing graphemes so that they can be easily compared to each other. [16:53] Since graphemes might include several codepoints, you could put those codepoints in principle in any possible order. [16:54] that's already in NFC [16:55] OK, but although it's not too clear to me how to do it (I have found only references by presentations by jnthn), the clearest possible explanation I've read is this one: [16:55] NFG needs NFC, and NFC needs NFD [16:55] i don't think NFC needs NFD actually [16:55] (from https://6guts.wordpress.com/2015/04/12/this-week-unicode-normalization-many-rts/) [16:56] or maybe it does [16:56] NFC is a nice idea, but it only works for comparisons and constant-time string accesses if there is a pre-composed character in unicode [16:57] NFG lifts that limitation [16:57] OK, then two questions. [16:57] 1. Is NFG a Perl 6 thing? [16:57] yes [16:57] 2. what does it do exactly? I know it's not NFC, NFD or KFC [16:58] But it's not clear what it exactly *is* [16:59] it's a Little Unicode Consortium built into perl6 itself [16:59] incoming strings are eaten up and whenever there's a grapheme that isn't defined yet, the Little Unicode Consortium defines a codepoint for it [16:59] for example, someone posts a zalgo string which has LATIN A WITH FIFTY DOTS ABOVE AND THIRTY TILDES BELOW [16:59] then the Little Unicode Consortium goes to work: [17:00] "clearly there's a people out there who have this character in their native language [17:00] we should define a codepoint so we can properly handle texts in that language" [17:00] timotimo so far, I *love* this description. [17:01] and the rest of it is just NFC [17:01] it has the benefit that there are no longer any multi-codepoint graphemes in existence anywhere [17:01] That is why it's constant time, because you use a single codepoint for every new grapheme, instead of several codepoints [17:01] yes [17:01] plus the overhead of Little Unicode Consortium meetings [17:02] The Little Unicode Consortion (let's calle it LUC, or Luke), is that part of the Precomp store, or is it a runtime-only thing? [17:02] runtime-only [17:03] it gets unceremoneously discarded at the end of the program [17:03] Poor Luke. He was a good Luke. [17:03] *** zakharyas left [17:03] basically it's the Phoenix Little Unicode Consortium [17:03] or PLUC [17:04] So we use the Phoenix Little Unicode Consortium to represent any new Texas-form operator that comes our way? [17:04] It's a Route 66 thing. [17:05] But I love the explanation, and I kinda understand it. Thanks! [17:05] cool [17:06] *** zakharyas joined [17:11] how many codepoints are possible for the LUC to define? [17:11] 2^31 perhaps - 1 [17:11] i mean 2^31 or 2^31 - 1 [17:12] because we use negative codepoint numbers for LUC's own codepoints [17:17] Is the 2^31-1 limitation perl VM or are these synthetic code points recycled? [17:17] we do not yet garbage-collect synthetic codepoints, but it is possible [17:17] *** rindolf left [17:20] ok [17:20] ¦ doc: 076bee114a | (JJ Merelo)++ | 2 files [17:20] ¦ doc: Deduped NFG and whenever [17:20] ¦ doc: [17:20] ¦ doc: And added a little explanation for NFG thanks to @timo. Refs @1912, [17:20] ¦ doc: two down, 6 to go. [17:20] ¦ doc: review: https://github.com/perl6/doc/commit/076bee114a [17:20] ¦ doc: 3cbc96deba | (JJ Merelo)++ | doc/Language/operators.pod6 [17:20] Link: https://doc.perl6.org/language/operators [17:20] ¦ doc: dedups ++, refs #1912 [17:20] ¦ doc: review: https://github.com/perl6/doc/commit/3cbc96deba [17:20] ¦ doc: 7a409a432a | (JJ Merelo)++ | doc/Language/operators.pod6 [17:20]