[Coke] is github.com/croservices/cro-webapp the canon repo? 00:05
Geth rakudo/main: 83baac0d6a | (Elizabeth Mattijsen)++ | src/Raku/ast/name.rakumod
Use a lookup table for ::Name::Part::Simple.is-pseudo-package

Instead of repeated comparisons
00:23
rakudo/main: 4fa2be82f8 | (Elizabeth Mattijsen)++ | src/Raku/ast/name.rakumod
Make sure ::Name::Part::Simple returns a Bool
rakudo/main: 66c194ccb1 | (Will Coleda)++ (committed using GitHub Web editor) | src/Raku/ast/name.rakumod
Merge pull request #6770 from rakudo/lizmat-40

Use a lookup table for ::Name::Part::Simple.is-pseudo-package
rakudo/main: 5 commits pushed by (Nick Logan)++, (Will Coleda)++ 00:29
rakudo/main: 2202fa2992 | (Nick Logan)++ | 2 files
RakuAST: only take a listop invocant colon before any comma

Previously `comb sum 1000,2000: 2` failed to compile with "Only identical operators may be list associative" because the colon was parsed as part of the arguments to `sum`, even though `sum` had already seen a comma. The legacy grammar clears `$*INVOCANT_OK` when it parses a comma
  (4969e671ef), so the colon instead becomes the invocant colon of `comb`,
... (16 more lines)
00:35
rakudo/main: 30b42b2460 | (Nick Logan)++ | 3 files
RakuAST: keep the invocant of a semicolon separated argument list

Previously `f(A: 1, 2; 3)` called the sub `f` with `\(((1, 2),), (3,))` instead of calling the method `f` on `A` with `\((1, 2), (3,))`. The semiarglist action rebuilds the argument list from the args of each section, which lost the invocant of the first one. Those args were also a single comma list, because `ArgList.from-invocant-list` left unpacking ... (5 more lines)
rakudo/main: 8de7894122 | (Will Coleda)++ (committed using GitHub Web editor) | 4 files
Merge pull request #6773 from ugexe/ugexe/rakuast-invocant-colon-after-comma

RakuAST: give an invocant colon to the listop it belongs to
rakudo: ugexe++ created pull request #6776:
Optimize $x ** 2 and $x²
00:36
ugexe github.com/rakudo/rakudo/pull/6775/changes regresses ::("") to return False for .not-empty. also i suspect the code might be faster without the changes (adding nqp::hllbool) and just adding --> Bool to the return constraint instead 01:40
nqp::hllboolfor doesnt get inlined 01:41
s/not-empty/is-empty/ 02:02
Geth rakudo/revert-6775-lizmat-42: 1e88c7a0f7 | (Nick Logan)++ (committed using GitHub Web editor) | src/Raku/ast/name.rakumod
Revert "Make sure ::Name::Part.is-empty always returns a Bool (#6775)"

This reverts commit b22a0daf20825694b2e4c20e036b3fedee743c91.
02:15
rakudo: ugexe++ created pull request #6778:
Revert "Make sure ::Name::Part.is-empty always returns a Bool"
02:20
rakudo: ugexe++ created pull request #6779:
RakuAST: restore is-empty for an empty string name part and inline Bool return checks
02:50
ugexe so --> Bool wasn't faster, but with that ^ PR it is. i fixed the is-empty regression and switched the hllboolfor stuff out for the --> Bool stuff and it does benchmark faster 02:52
Geth rakudo/main: 4 commits pushed by (Nick Logan)++ 03:40
04:50 japhb left 05:05 japhb joined
lizmat ok, so if I understand this correctly, specifying --> Bool (in the RakuAST bootstrap) is enough to turn an int into a proper Bool on return ? 08:46
do we consider resolvers as implementation-detail or not? 09:01
I would tend to think they are implementation detail?
Geth rakudo/lizmat-43: 613f7bf2b1 | (Elizabeth Mattijsen)++ | 5 files
RakuAST: use more lookup tables and --> Bool

  - affects some "is-xxx" public methods
  - add lookup table in IMPL-THUNK-ARGUMENTS because it makes sense
10:22
rakudo: lizmat++ created pull request #6780:
RakuAST: use more lookup tables and --> Bool
rakudo/main: 4 commits pushed by (Nick Logan)++, (Elizabeth Mattijsen)++ 10:23
10:26 hankache joined
Geth rakudo/lizmat-44: c88ce28f66 | (Elizabeth Mattijsen)++ | 10 files
RakuAST: some more --> Bool for "is-" accessors

So that they properly return a Bool rather than a 0 or 1
11:10
rakudo: lizmat++ created pull request #6781:
RakuAST: some more --> Bool for "is-" accessors
11:11
11:17 hankache left 11:18 ShimmerFairy left