| disbot7 | <antononcube> @liznat I am wrapping up the first version-- I will schedule it / publish it within 1 hour. | 00:04 | |
| <antononcube> I will post the final version by midnight ET. | |||
| <antononcube> I.e. within 5 hours. | 00:05 | ||
| <aruniecrisps> lizmat: what is the general timeline for 6.e's release? | 01:04 | ||
| [Coke] | "when it's ready" | 01:12 | |
| We have a list of items that need doing, and a limited base of core developers to hack | 01:13 | ||
| disbot7 | <aruniecrisps> gotcha so there's no tight deadline | 01:22 | |
|
01:40
arkiuat left
01:48
arkiuat joined
02:15
notable6 left,
notable6 joined,
bisectable6 left,
shareable6 left
02:16
evalable6 left,
committable6 left,
quotable6 left,
greppable6 left,
nativecallable6 left,
releasable6 left,
coverable6 joined
02:17
committable6 joined
02:18
unicodable6 joined,
evalable6 joined,
bloatable6 joined,
notable6__ joined,
linkable6 left,
nativecallable6 joined,
greppable6 joined
02:19
quotable6 joined,
sourceable6 left,
shareable6 joined,
benchable6 joined,
notable6 left,
sourceable6 joined
02:20
releasable6 joined,
linkable6 joined,
bisectable6 joined
02:21
tellable6 joined
02:34
hulk joined,
kylese left
|
|||
| disbot7 | <antononcube> @lizmat Published. (I forgot to add "Day 24 -- " initially.) | 02:40 | |
|
03:15
hulk left,
kylese joined
04:17
lichtkind__ joined
04:20
lichtkind_ left
04:39
arkiuat left
04:40
arkiuat joined
04:46
arkiuat left
04:47
arkiuat joined
05:16
Aedil left
05:26
Aedil joined
05:49
human-blip left
05:51
human-blip joined
07:31
arkiuat left
07:44
arkiuat joined
07:50
arkiuat left
07:53
arkiuat joined
07:57
arkiuat left
08:33
librasteve_ joined
08:42
arkiuat joined
08:47
arkiuat left
08:48
arkiuat joined
08:53
arkiuat left
08:59
Sgeo left
09:05
arkiuat joined
09:09
arkiuat left
09:29
arkiuat joined
09:34
arkiuat left
10:00
ShimmerFairy left
10:03
arkiuat joined
10:08
arkiuat left
10:31
arkiuat joined
10:36
arkiuat left
10:42
ShimmerFairy joined
|
|||
| Geth | raku.org: librasteve++ created pull request #285: Vendor the Butterfly image, Pin to Air:ver<0.0.2> |
10:52 | |
| disbot7 | <librasteve> NB: that's Air:ver<0.1.2> | 10:58 | |
| lizmat | yeah, I checked :-) | 11:00 | |
|
11:06
arkiuat joined
11:11
arkiuat left
11:15
arkiuat joined
11:19
arkiuat left
|
|||
| librasteve_ | Umami stats for new raku.org usercontent.irccloud-cdn.com/file/....33.32.png | 11:34 | |
| Same - but daily view (showing early peak driven by HN announcement) usercontent.irccloud-cdn.com/file/....32.49.png | |||
| lizmat: maybe some visuals for your state of the onion post | 11:35 | ||
| lizmat | why the country is not Singapore? | 11:45 | |
| perhaps better next year, so we can do comparison ? | 11:47 | ||
| as we don't have a comparison with the old site ? | |||
|
11:49
arkiuat joined
11:54
arkiuat left
|
|||
| librasteve_ | I don’t know if we have stats for old site - sorry | 11:55 | |
| lizmat | we don't afaik | ||
| librasteve_ | on SG - I am sceptical that we get the reported number of visitors from there … in sample I am looking at Singapore is 1.32k, US 996, China 294, Germany 242 … it is known as wild west for site scammers | 12:01 | |
| and SG is all concentrated into certain dates (seems to have subsided now) | 12:03 | ||
| it’s quite interesting to see that the site gets about 100 unique visitors / day on average and that about 6% go to the Install page … wonder if there’s a way to get rakubrew download stats to correlate? | 12:10 | ||
| and 5% to community | |||
| lizmat | patrickb might be able ? | 12:11 | |
| Geth | raku.org/main: 9 commits pushed by librasteve++ | 12:13 | |
|
12:16
arkiuat joined
12:20
arkiuat left
12:48
arkiuat joined
12:53
arkiuat left
13:17
arkiuat joined
13:22
arkiuat left
13:51
arkiuat joined
14:00
arkiuat left
14:18
arkiuat joined
14:23
arkiuat left
14:29
arkiuat joined
14:37
arkiuat left
14:50
arkiuat joined
14:56
arkiuat left
15:15
arkiuat joined
15:17
Aedil left
15:23
arkiuat left,
itaipu left
15:27
itaipu joined
15:52
arkiuat joined
15:57
arkiuat left
16:05
arkiuat joined
16:12
arkiuat left
16:23
arkiuat joined
16:28
arkiuat left
16:31
arkiuat joined
16:36
arkiuat left
|
|||
| tbrowder | ok, | 16:38 | |
|
16:40
arkiuat joined
|
|||
| tbrowder | that last advent post by antononcube is something that would help to attract new coders--as they say | 16:42 | |
| good job!! | |||
| disbot7 | <antononcube> Thank you! I was considering inscribing "2026" or snowflake(s) onto the mazes but that is too much work. (Both to program and to explain.) | 16:44 | |
|
16:45
arkiuat left
|
|||
| disbot7 | <antononcube> So, I opted to just generate an image of a raccoon in snow-covered maze. | 16:45 | |
| tbrowder | anyone know how to do that with Python? a comparison of the two methods would make a good pitch for Raku | ||
|
16:46
arkiuat joined
|
|||
| tbrowder | using more that | 16:46 | |
| *than core packages | 16:47 | ||
| disbot7 | <antononcube> Well, Python has interfaces to powerful graph librararies written in C and C++. So programming the core ideas is not that hard. What would be hard it the graph plotting and finding geometric nearest neighbors. For the latter, most likely some of the big Machine Learning (ML) libraries have to be used. | 16:49 | |
| tbrowder | maybe when i get the PS snow flake code public it can help-your pic is very nice as is is | ||
| disbot7 | <antononcube> The problem is making a large enough maze over the vertices on which to project a word or a snowflake. | 16:50 | |
| <antononcube> Even if that is done the maze itself might too hard to solve or too messy to look at. | |||
| <antononcube> Meaning, a fair amount of experimentation has to be done in order to produces good results. | 16:51 | ||
| <antononcube> (Which I decided, is too time consuming.) | |||
| tbrowder | oh, i see, i was thinking you meant snowflakes falling...but still, mine may be useful--lizmat and librasteve and jmerelo see them on our Christmas poem | 16:55 | |
| korvo | tbrowder: Finding spanning trees isn't in Python's stdlib, but everything else is. Graphs are usually represented as an adjacency structure. | 16:57 | |
| tbrowder | only equal hexagonal pieces of filled traiangular and rectangular areas, no curved lines | 16:58 | |
|
16:58
arkiuat left
|
|||
| disbot7 | <antononcube> I have plans to hook igraph (igraph.org) to Raku. That C-library has interfaces Python, R, and Wolfram Language. | 16:59 | |
| <antononcube> @korvo It is not just the spanning tree finding. There are fair amount of "convinience" functions that have to be in place too. (The maze making.) | 17:00 | ||
| korvo | antononcube: Sure, precisely reproducing that blog post with Python would be a chore. However, I don't think that that's a good comparison of languages. | 17:01 | |
| disbot7 | <antononcube> For example, subgraph, graph union, finding neighborhood graphs, etc. | ||
| korvo | TBH if y'all were to invest into a fast Raku then you could handily beat Python just by advertising speed. CPython is notoriously slow and its maintainers aren't interested in making it structurally faster. | ||
|
17:01
arkiuat joined
|
|||
| korvo | ...To be *too* honest, I'm mostly blocked on thinking up a good name for Raku in RPython, or NQP in RPython, but I'm willing to do the JIT parts. | 17:02 | |
| disbot7 | <antononcube> The maze making blog post can be more or less precisely translated to Wolfram Language (WL). | ||
| <antononcube> I was planning to do that today, but I started doing some surface fitting with WL... | 17:03 | ||
| <antononcube> @korvo Related to your language comparsion point -- that is a good reason to "igraph"-based implementations. They can transfered easily between Python, R, and WL. | 17:04 | ||
| korvo | I suppose. That sounds completely uninteresting to me, but I can understand why people would want it. FWIW as one of the igraph maintainers for nixpkgs I would recommend against it; it works but it's brittle and unsafe. | 17:05 | |
| Similarly, basic operations like subgraphs or unions are done with one-liners. Python has comprehensions (from Setl, I think) and it's not hard to build a new adjacency structure from old ones. | 17:06 | ||
