[Coke] afee7d8d3197b7a093 01:05
linkable6 (2026-10-20) github.com/rakudo/rakudo/commit/afee7d8d31 Relax return constraint on .sort (#6851)
02:40 apogee_ntv left 02:42 apogee_ntv joined
[Coke] afee7d8d3197b7a093355d98a9 broken 8 modules in the blin run 03:12
linkable6 (2026-10-20) github.com/rakudo/rakudo/commit/afee7d8d31 Relax return constraint on .sort (#6851)
[Coke] github.com/coke/raku-blin-release-results 03:14
03:59 ShimmerFairy left 04:02 ShimmerFairy joined 08:25 iwuvmika left
lizmat looks 08:43
ah, I see it 08:46
08:46 iwuvmika joined
Geth rakudo/main: 549c222397 | (Elizabeth Mattijsen)++ | 7 files
Revert "Relax return constraint on .sort (#6851)"

This reverts commit afee7d8d3197b7a093355d98a90f6f86d8bda32a.
I have no energy to go after this anymore.
09:39
12:13 [Tux] left 12:19 [Tux] joined
Geth setup-raku/dependabot/npm_and_yarn/vite-8.3.5: c19d37e515 | dependabot[bot]++ (committed using GitHub Web editor) | package-lock.json
Bump vite from 8.2.2 to 8.3.5

Bumps [vite](github.com/vitejs/vite/tree/HEAD/packages/vite) from 8.2.2 to 8.3.5.
  - [Release notes](github.com/vitejs/vite/releases)
  - [Changelog](github.com/vitejs/vite/blob/main/p...NGELOG.md)
  - [Commits](github.com/vitejs/vite/commits/v8....ages/vite)
... (8 more lines)
14:02
setup-raku: dependabot[bot]++ created pull request #65:
Bump vite from 8.2.2 to 8.3.5
setup-raku: 4c17ceee54 | dependabot[bot]++ (committed using GitHub Web editor) | package-lock.json
Bump vite from 8.2.2 to 8.3.5 (#65)

Bumps [vite](github.com/vitejs/vite/tree/HEAD/packages/vite) from 8.2.2 to 8.3.5.
  - [Release notes](github.com/vitejs/vite/releases)
  - [Changelog](github.com/vitejs/vite/blob/main/p...NGELOG.md)
  - [Commits](github.com/vitejs/vite/commits/v8....ages/vite)
... (9 more lines)
14:13
rakudo/lizmat-91: 430264d6a4 | (Elizabeth Mattijsen)++ | 2 files
Create Int/Str/Num sorting workers from a script

These private methods only differ in some minor nuances, so it makes sense to make these easily updatable in a builder script.
This also adds sorting logic for Num values only, as that was missing.
15:49
rakudo: lizmat++ created pull request #6871:
Create Int/Str/Num sorting workers from a script
16:02
lizmat wow, github heving hiccups :-)
pushed that about 20 mins earlier 16:07
16:18 vrurg joined 16:20 vrurg_ left 16:57 lucs left, lucs joined 17:36 japhb left 17:42 japhb joined 18:06 coleman left 18:07 coleman joined
Geth rakudo/lizmat-91: 022aec15b6 | (Elizabeth Mattijsen)++ | 4 files
Further optimizations on sorting

Take the idea from 4e974d0a9dc and expand it to typed arrays and some further simplifications and optimizations
1. Make List!deep-clone create the same type as the invocant, to
   ensure that typed arrays pass on their "of" value for later
... (12 more lines)
19:09
lizmat preliminary benchmarks show sorting of typed arrays at least 2% faster 19:13
preliminary benchmarks show sorting of typed arrays at least about 2% faster 19:14
more benchmarks later 19:16
19:59 iwuvmika left 20:00 iwuvmika joined
japhb lizmat++ 20:18
[Coke] Can we get a repo that has benchmarks for devs? 20:52
(so when someone tests the speed of something, we have a record of the code that was tested)? 20:53
japhb Well this is ancient, but it exists: github.com/raku-community-modules/raku-bench 21:07
Would be nice if we could get the benchmarks used by Raku++ and Mutsu into a common place too.
Geth rakudo/main: e98da4e062 | (Elizabeth Mattijsen)++ (committed using GitHub Web editor) | src/core.c/allomorphs.rakumod
Remove return statement from "parse_win" in val processing (#6862)

Since all of the choices in "parse_win" contained either a return or a die statement, and "parse_win" was in one case called at the end of the val() sub, it felt like a good idea to remove the return statements from the "parse_win" Callable, and add a return statement to the one case where "parse_win" needed it.
22:16