« first day (4811 days earlier)      last day (328 days later) » 

01:14
We just released Vyxal 42.0 with a huge amount of new features
7
Woah
Is that version system akin to GNOME?
(check the date lol)
Dang it.
01:28
@emanresuA my name is Lyxal golfing and I approve of this message
woah
I haven't even thought of a prancc yet
01:54
i'm going to prank everyone by actually doing anything at all
they;ll never see it coming
I also have a language announcement. After years of losing golfing contests, I've decided it's time to give up on my principles and bring Pip into the modern golf meta. To that end, I'm adding compressed string syntax and switching to the log-bytes scoring system of Fig. The combined language will be known as "Pig."
02:24
Pig must be the name of a lang that is Python but with builtin names in Pig Latin
02:37
orfay iway inway angeray(enlay(amesnay)):
    intpray(iway + 1, amesnay[iway])
I hate it already
think of some way to pig latinize the structure of the syntax too
function calls are postfix
operators are prefix
iway inway ((amesnay)enlay): orfay
    (+ iway 1, [iway]amesnay])intpray
maybe the for keyword should delimit the end of the entire block lmao
But if you move something to the end, you have to add -ay to it. So would it be orfayway?
Operator precedence depends on whether its name starts with a vowel or not
02:53
Pig latin reminds me of Korean 도깨비말.
Care to suggest an example input?
→ Cabare tubu subugebest aban ibixabampble ibinpubut?
...Yeah, not quite compatible to English phonotactics.
Why arguments isn't sparse?
att
att
03:32
probably because it's not an array?
 
2 hours later…
05:49
0
A: Sandbox for Proposed Challenges

Dannyu NDosVending Machine Simulator code-golfinteractiverandom Alternate title: Linear Logic Simulator Objective Write an interactive program that asks you to design a vending machine, and then simulate the vending machine. The fuss is, the vending machine is designed for simulation of linear logic. Design...

 
2 hours later…
07:37
CMC How high can you reach in Minecraft given n oak planks? You're in a 1x1, height=inf hole, so e.g. slab can be used to increase 1b height
 
2 hours later…
09:19
@l4m2 If n ≥ 8 (= crafting table + 3 ladders) you can in theory climb arbitrarily high, although doing so requires dreamluck
@emanresuA Recycling ladder?
Picking up a ladder while standing on the one above yes
But the chance that you'll pick it up is small
 
5 hours later…
13:55
LMAO so there's this AP test review site called Fiveable (5 is the highest score you can get), and they just sent out an email that they're rebranding to "fourable"
witj this link: fourable.me
What a way to be reminded it's April fools lol
 
2 hours later…
15:33
I have code that uses divide and conquer. It works on a 2d numpy array. It splits the array into two halves, solves the problem for each half and then merges the result . I want to speed it up using parallelism by solving both halves in parallel recursively. Is that plausible in python?
This is really a hole in my coding skills
It's possible but because of the GIL you likely won't get much of a speedup
unless you use multiprocessing (multiple separate Python processes) instead of just multithreading, which would allow proper parallelism
but that has higher overhead and is more difficult to use
Hmm... Can numba or cython release the GIL?
or unless the majority of your time is spent in numpy functions which release the GIL
numba and cython are alternative runtimes and they don't even have a GIL, I believe
The computation in each half is currently in numba wrapped numpy code
ah I see what you mean
I have no idea whether numba releases the GIL, you could do a test to find out
15:39
"Numba will release the GIL when entering such a compiled function if you passed nogil=True . Code running with the GIL released runs concurrently with other threads executing Python or Numba code (either the same compiled function, or another one), allowing you to take advantage of multi-core systems"
This might be too hard for me sadly. At least I don't know what to do
running code in multiple threads isn't too hard
@pxeger I am worried about the overheads
how long does your code take to run?
@pxeger about 1 second. The problem is that I run it thousands of times
the overhead of starting threads won't be more than a few ms so you'll still see most of the benefit
15:44
Those thousands of times can't be done in parallel. So I want to speed up the 1 second
alternatively if you use a threadpool (admittedly more complex) that should reduce the overhead
@pxeger I think I would need help with that
you could try ChatGPT, it's pretty good at Python
yours doesn't seem like too tricky a use-case
@pxeger interesting! My experience is that it always gives incorrect code :)
I can describe the problem/solution if you have the time?
import concurrent.futures

with concurrent.futures.ThreadPoolExecutor(max_workers=2) as executor:
    for i in range(1000):
        futures = executor.submit(conquer, left_half(data[i])), executor.submit(conquer, right_half(data[i]))
        results = concurrent.futures.wait(futures).done
        output[i] = combine(results)
something along those lines would work I think
15:55
Thanks. What do you think the overhead would be like?
I love anything with the word future in it :)
Or I could wait for python 3.13 :)
TIL: You can use your mobile phone as a security key.
@Simd I assume you start all your Python programs with from __future__ import barry_as_FLUFL, then?
16:13
@DLosc I will now!
@TheEmptyStringPhotographer ???
(TIL that everything that's ever been in __future__ is still in there, even if it has since been included in the core language. So you can also do stuff like from __future__ import print_function, unicode_literals, with_statement if you want.)
16:28
@DLosc that is pretty poor
I imagine it's done that way so that old code that imports stuff from __future__ won't break when the future arrives
right but given that everything else will break I am not sure it makes sense
bpa.st/RNUA is the code. The two lines that do the calls I want to parallelize are:
d_left = get_max(cusum_A, left_half, k, level_for_first_column=end_levels[0])
d_right = get_max(cusum_A, right_half, k, level_for_first_column=end_levels[1])[:, ::-1]
@pxeger ^
17:16
"This page with loading bar templates sure is taking a long time to load" - me, seconds before realization
17:40
does this look like a useful way to layout a debugger for my grid-with-values-traveling-across-it-2d-language? (still haven't found a name for this type of esolang)
annoying how i can't upload videos to se chat
18:25
@RubenVerg how about a link to a video?
19:04
@Simd that's what i put, isn't it?
19:31
I just had an AWESOME KotH idea
Gonna put the title here as a reminder to myself to flesh it out later: "Play tag on a lattice"
Okay basically here's the idea
Your bot starts at some point on a grid (its x and y are both integers). It's given a set of moves, which are pairs of relative coordinates. Think, e.g., chess pieces. So you might get (1, 0), (-1, -1), (2, 0), which would allow you to move anywhere on the grid, just somewhat awkwardly. Or maybe you'd get (-4, 4), (6, 0), (2, 8), which would limit the precise grid squares you can land on, but allow you to travel long distances rapidly.
Your goal is to hunt down other bots, but you don't know their movesets (until they've used any given move from it)
And the twist: you can unlock new moves by killing an opponent
20:24
@RubenVerg ah yes
20:51
1
A: Sandbox for Proposed Challenges

Wheat WizardConstructing the Irish possessive natural-language In this challenge you will take an Irish word and a personal pronoun and create the possessive pronoun construction combining the two. For example sé, madra becomes a mhadra. Translated to English he, dog becomes his dog. Rather than exhaustively...

I completed the spec here. Are there any edge cases I'm missing?
i.e. are there aspects of the spec that aren't covered by the test cases.
0
Q: How many cacti can I plant here?

CactusrootGiven a Minecraft terrain as a 2-dimensional array of integers or similar datastructure, determine the maximum number of cacti that can be planted on it. The integers represent the height (y) of the terrain at each location (x and z). A cactus cannot be planted next to higher terrain or next to a...

21:43
@WheatWizard I don't think you mentioned anywhere why mé, arán is m'arán and not mo arán
 
1 hour later…
22:53
@RydwolfPrograms sounds like there will a bunch of "targeting specific bots" abuse
The bots are assigned different moves at the start of each game
There's no way to know your opponents' moveset when writing a bot

« first day (4811 days earlier)      last day (328 days later) »