02:00 <FromGitter> <alexherbo2> what is the syntax for inner/outer variable name with rest?

02:00 <FromGitter> <Blacksmoke16> https://crystal-lang.org/reference/syntax_and_semantics/default_values_named_arguments_splats_tuples_and_overloading.html#external-names ?

02:00 <FromGitter> <alexherbo2> yes

02:01 <FromGitter> <alexherbo2> it seems not possible with rest

02:01 <FromGitter> <alexherbo2> I tried `*a *b` and the variants

02:03 <FromGitter> <alexherbo2> it could be possible to pass as an array with a named method?

02:03 <FromGitter> <alexherbo2> named argument*

02:03 <FromGitter> <Blacksmoke16> rest?

02:03 <FromGitter> <Blacksmoke16> you mean splats?

02:03 <FromGitter> <alexherbo2> yes

02:08 <FromGitter> <Blacksmoke16> guess not

02:09 <FromGitter> <Blacksmoke16> i cant see a reason to not support it via like `a *b` :shrug:

02:09 <FromGitter> <Blacksmoke16> maybe create an issue or it?

02:20 <FromGitter> <Blacksmoke16> raz you around?

04:29 <FromGitter> <HertzDevil> ~~better idea: add crystal support to godbolt's compiler explorer~~

04:30 <FromGitter> <HertzDevil> though i don't think their site is embeddable

04:34 <FromGitter> <HertzDevil> the union operator is partially commutative because `Crystal::Type#common_ancestor` isn't commutatively defined

04:34 <FromGitter> <HertzDevil> and that's what i'll work on today

04:38 <FromGitter> <HertzDevil> an example where this fails: https://play.crystal-lang.org/#/r/akf9

06:55 <FromGitter> <naqvis> 👍 👏

11:19 <jhass> @asterite @Blacksmoke16 @straight-shoota re. caching and "non-determinism", just consider "puts Time.local" :)

11:22 <jhass> so far we're at 2.5G DB size for 493k runs

12:06 <straight-> jhass, a simple solution would be to fix time like in the go playground :D

12:12 <jhass> puts [1, 2].shuffle

12:19 <straight-shoota> Random can be fixed, too ;)

12:20 <straight-shoota> I don't think it's a really good idea, but it could do if necessary

12:21 <jhass> puts Time.measure { File.read("/etc/passwd") }

13:00 <FromGitter> <oprypin:matrix.org> am i missing something -- ⏎ you need to deduplicate only exact inputs and exact outputs. not the combination thereof

13:00 <FromGitter> <oprypin:matrix.org> which a good database does but itself anyway

13:59 <straight-shoota> dedup helps reduce storage space. That should be relatively easy to implement without drawbacks because run results are immutable anyways.

14:00 <straight-shoota> The idea about caching is to reduce response time. If `puts "Hello World"` has been compiled and executed before, we could just return the previous result without doing that again

14:00 <straight-shoota> Only works for deterministic programs, though

14:01 <straight-shoota> Maybe caching the binary would be a middle ground. Takes more space, but chops off build time and works with non-deterministic runtime code

14:02 <straight-shoota> Still wouldn't work with `{{ `date` }}` but that might be acceptable

14:03 <straight-shoota> Or use AST with expanded macros as cache source. That would at least skip codegen.

14:24 <yxhuvud> heh. Signs the api you are working against may not be totally stable #1: You seriously consider upgading kernel version to see if the problem goes away. #2: It did go away after upgrading.

16:10 <FromGitter> <Blacksmoke16> gitter is not doing so great atm

22:25 <FromGitter> <asterite> Regarding carc.in, time and randomness:

22:30 <FromGitter> <asterite> You could consider initially consider an input as unknown regarding whether it will change over time. You keep a counter of how many times it gave the same result. If it reaches say, 10, you can consider that as always giving the same output. If it changes before that, you can consider it always needs to be run. It's not perfect, but it's a good approximation.

22:45 <straight-shoota> yeah, I thought about that, too. But it doesn't work for things like `puts "Happy New Year" if Time.local.month == 1 && Time.local.day == 1`

22:48 <FromGitter> <asterite> But I'd say it's pretty contrived to have someone write exactly that same code. And the tutorial site could try to avoid those things :-). Also maybe if the source has Time on it, never cache it.

22:49 <FromGitter> <jrei:matrix.org> just cache default code samples

22:50 <FromGitter> <jrei:matrix.org> and don't save others

22:52 <straight-shoota> @jrei That might actually be the most practical solution

22:54 <straight-shoota> We could just let the client decide if a cached response is acceptable. The embedded playground would accept cached result if the code is unmodified

22:56 <straight-shoota> And demand actually running it if the code was edited. In that case chances of having the same edited content in multiple requests are low, anyways.

22:57 <straight-shoota> Developing this idea further, the execution could be entirely simulated for unmodified code, with the expected output already embedded in the HTML :D

22:59 <FromGitter> <jrei:matrix.org> you could implement as follow: have a hash of the code sample (client or server made), match this with (static) cached results. If not, compile this

23:00 <FromGitter> <Blacksmoke16> I'd also include the crystal version in the code hash

23:00 <FromGitter> <jrei:matrix.org> of course we make sure cached code samples will always return the same result

23:00 <FromGitter> <jrei:matrix.org> Don't know, does it matter for the client?

23:01 <FromGitter> <jrei:matrix.org> I mean, the server decide the Crystal version for the interactive code

23:02 <FromGitter> <Blacksmoke16> Ah I meant more so for the actual site, as you can select the version

23:29 <FromGitter> <asterite> Then also introduce a small delay in the server when the cached output is known, just to make it look a bit more real :-)