The Nineteenth Byte

Ginger Industries

00:43

The Machine is being turned on in 3

2

1

ON

DialFrost

is this ready? codegolf.meta.stackexchange.com/questions/2140/…

lyxal

I think so

DialFrost

wait how come @GingerIndustries and @emanresuA both have ukranian flags

and lyxal as well lmao

lyxal

because it's support for Ukraine given the recent Russian invasion

DialFrost

thx lyxal

Ginger Industries

00:56

@DialFrost looks good

DialFrost

@lyxal thx guys ah ic

New Posts

0

Q: Lexicographical sum

For a given number n, output an strictly decreasing array whose sum is n and its lexicographical order is the smallest for any possible outputs Smallest lexicographical order means that for or sum n=9 the following strictly decreasing arrays are possible: [[9],[8,1],[7,2],[6,3],[5,4],[6,2,1],[5,3...

DialFrost

@lyxal ok ur cheating

OldSandboxPosts

Sandbox posts last active a week ago: Flipping Burnt Pancakes, but Optimally!

DialFrost

lmao

lyxal

01:00

@DialFrost no, I'm just fast

DialFrost

XD

lyxal

it helps that there exists an integer partition element in vyxal

DialFrost

+1 for insane speed

ah ic

lyxal

Ṅ does most of the work. The rest is just filtering

excellent ad:

I do love searching for {KeyWord:More Results}

just like I love searching for [hyperlink blocked]

DialFrost

lmao

allxy

01:05

document.appendChild= forced adoption

Unrelated String

@lyxal think it also helps that your integer partitions are nonincreasing to begin with

lyxal

@UnrelatedString probably lol

Ginger Industries

The Machine is working very well

DialFrost

wat machine?

Ginger Industries

2 hours ago, by Ginger Industries

26 mins ago, by Ginger Industries

DialFrost

01:09

uhhhhhh

interesting

nice scissors btw

:D

Ginger Industries

Ginger scissor reveal

DialFrost

nice table too

issit like evening for u rn?

Ginger Industries

maybe

DialFrost

bruh wat time lol

the only problem is im out of ideas for challanges

:(

i have an idea

but its crappy

about binomial theorem

so like given an integer n, print this

wikimedia.org/api/rest_v1/media/math/render/svg/…

my bad idk how to make it an image

issit a good idea but needs improvement or its dumb and prob get rejected?

Ginger Industries

the Machine in operation

DialFrost

01:23

huh wat issit doing

Ginger Industries

things

Unrelated String

would be a borderline dupe of our existing pascal's triangle challenges

DialFrost

i like how the scissors is in the eaxct same place

@UnrelatedString aw

Ginger Industries

You can probably figure it out if you look at the two images side by side

DialFrost

theres a nail there which i have no idea wats it doing

Ginger Industries

01:24

that's a screwdriver

DialFrost

@UnrelatedString wat does borderline dupe mean?

Ginger Industries

It's being tested

DialFrost

oh lmaooo

how bout Series for e as an challenge

wikimedia.org/api/rest_v1/media/math/render/svg/…

or something along the lines of that

Ginger Industries

biya

lyxal

@DialFrost Vyxal, 14 bytes: `(x + y)^%`%∆E

because Vyxal has algebra built-ins

DialFrost

01:29

? for which one the e one or the other one

yay 2700 is reached

lyxal

@DialFrost binomial

DialFrost

oh

Sandbox Posts

02:09

0

A: Sandbox for Proposed Challenges

Randomly Rounding code-golf math integer random Input a decimal number, round it to integer. It randomly round up or round down based on its fractional part. For input 2.4, it has 60% probability round to 2, and 40% probability round to 3. For input 3.9, it has 10% probability round to 3, and 90...

lyxal

02:24

okay which one of you nerds accessed the vyxal repo from facebook?

Newly Featured Posts

03:16

20

Q: Is it a pure word?

Introduction A pure word (or perfect word), as defined by me, is a word where the sum of the position in the alphabet of each letter in the word is perfectly divisible by the total length of the word. For example, abcb is a perfect word because 1 + 2 + 3 + 2 = 8, and 8 / 4 = 2. Your task Given a ...

code-golf string decision-problem

Newly Featured Posts

03:41

21

Q: Implement the hyperfactorial

The objective Given the non-negative integer \$n\$, output the value of the hyperfactorial \$H(n)\$. You don't have to worry about outputs exceeding your language's integer limit. Background The hyperfactorial is a variant of the factorial function. is defined as $$ H(n) = 1^{1} \cdot 2^{2} \cdot...

code-golf math combinatorics

ATaco

CMQ: How juic avocad?

Radvylf Programs

You gotta try for at least thirtee minut

If you get no juic, just juic harder

emanresu A

Eventually you will get some juic

lyxal

Radvylf Programs

Try threatening it with a knife

lyxal

03:47

Am I doing it right?

I have avocad and I have juic

Radvylf Programs

Dissolve the adovacad in acid

emanresu A

You're peer pressuring it, nice job

DialFrost

YES i beat @mathcat in rep

Radvylf Programs

Swallow ir whole and then do situps

To juic an avdocado, you gotta think like an advocado. Ask yourself, WWAAD?

And then do that

lyxal

@RadvylfPrograms Wheat Wizard Asked About Dave?

emanresu A

03:52

why was an apple dead?

New Posts

05:03

0

Q: NxM List Combination Closest to Target

Given a list of N lists, each containing M integers, and a separate list of M integers (target values), return a list of N scalars (integers with a value of 0 or more) that correspond to each list in the lists of lists, such that when each value in a list is multiplied by it's scalar, and the val...

matrix fastest-code fastest-algorithm linear-algebra algorithm

emanresu A

05:38

Gahh I hate the ender dragon

Turns out I can't mlg water to save my life

Radvylf Programs

Literally, I'm guessing? :p

emanresu A

Yep :P

And it's so much more aggro than people make it appear.

Radvylf Programs

Yeah. In videos it always looks so easy and then you're there and it's destroying your towers every 10s and stuff

emanresu A

Also, turns out it can destroy water source blocks

Which is why I'm currently punching through iron bars to get a new water bucket

Radvylf Programs

Wait really? TIL

emanresu A

05:45

(set up an ender chest)

This is bedrock, might not be able to in java

Radvylf Programs

Ah, okay. Probably is a bedrock thing.

Hopefully Mojang manages to fix all these weird incompatibilities in the next like, decade.

emanresu A

Both ways :P

Radvylf Programs

Crossplay but with Java-style servers and datapacks and redstone would be so nice

emanresu A

I want underwater redstone and easy speedbridging on Java

Radvylf Programs

Both editions have a lot to learn from each other

emanresu A

05:48

Yeah

At least there was a portal room this time...

In hindsight, I really should've put that feather falling IV book I can trade for on my boots

hyper-neutrino

06:17

i believe the enderdragon can delete everything except bedrock, obsidian, end stone, and maybe iron bars

emanresu A

@lyxal For this challenge, can we assume a smallish number of pages of tags?

mathcat

06:33

@DialFrost wth no

Aiden Chow

idk how many of you play online tetris here but i just got 3 back to back PC's in a live game (i got real lucky with the pieces, but still): jstris.jezevec10.com/replay/live/229328541

New Posts

0

Q: Fill in the next numbers

Given a list of integers, output a list where the \$ i \$th element of the list equals the first number in the input list which is \$ \ge i \$, until there are no such numbers. For example, if the input is: 2 3 5 7 11 then we "expand" the sequence out to show where the gaps are: _ 2 3 _ 5 _ 7 _ ...

code-golf number array

lyxal

06:48

@emanresuA you can assume as many tags as would be on a regular request to a tags page

emanresu A

07:47

As in, can you assume finite tag pages?

lyxal

Yes

But you can't assume a set limit of tag pages

emanresu A

That's what I meant, oh well :P

ophact

Surprisingly there were no python answers when I answered.

pxeger

@emanresuA @UnrelatedString I wouldn't often do this, but I downvoted both your answers because I don't think preparing answers to sandboxed challenges is a good idea

Jan 1, 2021 at 20:37, by pxeger

Is it considered bad form to prepare an answer to a challenge that's still in the Sandbox?

emanresu A

Sorry

ophact

08:03

@pxeger I actually tried solving it while it was sandboxed, but I then used a different approach on your challenge that I hadn't come up with when it was still sandboxed

New Posts

0

Q: Random Point from a 2D Donut Distribution

A donut distribution (for lack of a better term) is a random distribution of points in a 2-dimensional plane, forming a donut-like shape. The distribution is defined by two parameters: the radius r and spread s, in which the distance to the origin follows a normal (Gaussian) distribution around r...

code-golf math arithmetic geometry random

emanresu A

Trying to answer pxeger's thing in halfwit and I'm regretting making it so minimalistic

pxeger

Is it just me, or when I click "an edit has been made to this post, click to reload", does the post not reload?

ophact

Click to reload?

pxeger

oh, I guess it's intended, because it no longer says "click to reload"?

what's the point in that then

emanresu A

08:22

Ugh I'm patching halfwit bugs and DSO's taking a couple of minutes to load

TIL that JS Array(number) doesn't work on bigints

pxeger

it is pretty inconsistent that Array(x) makes [x], unless x is a number

emanresu A

Yeah

ಠ_ಠ I completely forgot to compile while loops

And pad the stack with zeroes

Imagine a language without syntax sugar

[3, 5] -> Array(Increment(Increment(Increment(Zero))),Increment(Increment(Increment(Increment(Increment(Zero))))))

Bubbler

08:42

No, that would be

Cons(Succ(Succ(Succ(Zero))),Cons(Succ(Succ(Succ(Succ(Succ(Zero))))),Nil))

emanresu A

0

A: Fill in the next numbers

Halfwit, 7.5 bytes MZ;RZMR[$ Try It Online! I think I made it too minimalistic... Explanation M ; # Map over each value... Z # Fill an array of length (itself) with (itself) R # Reduce by (taking two lists) Z # Zip M # For each pair... R # Reduce by...

3

PyGamer0

09:12

~~im back~~ i have arrived from school

@emanresuA bedrock ender dragon is the worst

you cant one cycle it ...

emanresu A

Thankfully I bought Infinity

emanresu A

09:26

o/

SegFaultPlus4

@emanresuA Infinity of what

@emanresuA this just reminded me i'm making a lang

emanresu A

Infinity enchantment in minecraft

@UnrelatedString @RadvylfPrograms @GingerIndustries Are y'all ever going to reveal the answers to these?

Actually o/ now

PyGamer0

09:44

o/

SegFaultPlus4

@emanresuA what is an o/

lyxal

10:25

@SegFaultPlus4 it's a person waving

AviFS

I think tabl is finally online with a working lang-- APL is back!

Adám

@AviFS You might want to have a look at /home/ec2-user/warning.txt

AviFS

@Adám Haha, let me guess. You noticed that there's absolutely zero security?

Adám

Yeah.

AviFS

It's a nice souvenir.

I think I'll keep it :p

Adám

10:39

I can easily make your EC2 bill go up.

AviFS

I checked and supposedly it doesn't go up. The worst thing that happens is that it crashes, as far as I understand. And then I have to go in and restart it.

So I was putting off the security for now.

It's charged per hour the instance is running, as far as I understand. Regardless of the load it runs.

Adám

@AviFS How about now?

AviFS

@Adám How about now what?

Adám

I'm hammering the (virtual) processor.

AviFS

I should add a logger to see what mischief you're up to.

That would have been fun.

I can check the AWS account.

You can't be hammering it too badly because the site is still running instantly for me.

Adám

10:42

I'm also spilling infinite output into stderr…

AviFS

When Vyxal was up and they messed around with that, it started going wayyy slower. But I don't even see a performance hit on my end.

I can log on though and see.

Yeah, I see you in the usage metrics, but the cost doesn't change. (It's still free.) I'm moving to DO asap though, because AWS scares me re: surprise bills.

Adám

Huh, my browser is getting hammered.

AviFS

Interesting, mine isn't even a little bit. Can't tell you're doing anything.

Must be specific to your websocket.

I don't know how it compartmentalizes that well, but it must be. I'm unaffected. If you restart the page, you'll start a new connection and it should be speedy.

(And hopefully your damage will be undone when you close the connection, haha)

Adám

@AviFS But you can see my warning.txt, so I can clearly take over your machine and mine bitcoin, right?

AviFS

Correct. And I can kill all running processes, or restart the instance, when I notice.

That's the plan, at least.

Security stuff is in the works.

Adám

10:55

Oops. Does the site still work for you?

AviFS

@Adám Did you notice the neat features, though? I'm adding langs to this interface, the idea being that the output (or relevant state) gets displayed on the right of the respective line, and gets updated dynamically as you write. APL is not quite as unique like this as others langs are, because it's a bit of a glorified repl in APL's case.

Adám

Yeah, it is a similar to bqnpad.mechanize.systems

AviFS

But after defining variables and functions, and using them, if you change the variable/function, the output is instantly updated dynamically everywhere that the variable is used.

(The instant feedback alone is kinda fun.)

Adám

@AviFS How do you detect that?

AviFS

But the main feature here for APL is the output being updated as relevant state is changed.

Adám

10:57

var←'hi'
{var}¨1 2 3
var←'hello'

I'd love to experiment with it, but the site seems unresponsive.

AviFS

@Adám Well, so... I don't. Not yet. For now, it's just brute force. But the interface is set up for it, and flexible enough to do it for any language, with a few lang-specific functions. It's so fast that the brute force doesn't seem to matter for demo-ing purposes.

@Adám Wait, actually?

You're right, you must have killed it after all.

Just a sec.

Adám

@AviFS Oh, you mean that you re-execute everything upon every keystroke?

AviFS

Huh. That didn't work. Is it possible you really did break it?

Adám

I hope you have backups of your files.

AviFS

Haha, did you do that on purpose?

I think you deleted the script that was running.

Alright, she's back up.

@Adám Right now, yes. But it's not just running it as one big file. Each line is sent over in a JSON object and run individually, with relevant metadata attached.

And when it gets a result back, only the output for the line it sent over is updated.

So every line is already being run and updated individually.

Adám

11:06

Heh, you can create fun animations with

v←1
v←v+≢⎕dl.1
v←v+≢⎕dl.1
v←v+≢⎕dl.1
v←v+≢⎕dl.1

then change the 1 on the first line.

AviFS

And it has a state key attached that it's sending over each time, though APL doesn't use it yet.

So, right now, it's just looping over every line, sending each individual line, and updating each individual line when it gets a response.

But if I changed the logic to only send over the current line, it would still work perfectly for APL.

PyGamer0

@Adám that looks cool

lyxal

@Adám delete all lines at once to have it loop infinitely with no text

AviFS

So on every keystroke, it would only be running the current line.

Adám

What if the current line affects something that was defined above it?

AviFS

11:09

And only the output for the current line would change. (The output on the right is actually a list of divs, which are accessed individually.)

@Adám I want the logic to work so that everything only affects the stuff below it.

Adám

@AviFS ahem:

AviFS

So the order matters, it's supposed to simulate actually running every line in a repl one by one.

Adám

a←2
(a←3),a

AviFS

But then if you go back up and change a line above, then it'll trickle down to the lines below.

@Adám Um, I think you broke it again.

@Adám That's working as intended for me.

Adám

What result do you get?

AviFS

11:13

If you run each of those lines in the repl, you get the same thing.

2 ⋄ 3 2

But that's the same as you get in the repl.

Each line only affects the lines below.

But if you go up and change the value of a: a←42

Then you get 3 42 below

If you just mash the keyboard, you'll see them both changing in real time.

So you could also do:

f←{...}

f 3 4 5
f 1 0 0 1 0
f 45

And as you changed the function f, you'd see the outputs below change.

Adám

@AviFS Sure, but if you begin only re-running the second line, it'll result in 2 2

AviFS

@Adám You mean 3 3?

Adám

Yes, sorry.

Because, as you type, (a←3) is executed, then adding ,a has a already set to 3.

AviFS

@Adám True. That's a consequence of my lazy looping through every line, just for this first version.

Adám

Well, your lazy looping is correct. Line-and-downward execution would be confusing.

AviFS

11:21

@Adám Hmm, I'd have to think about it. I made this with simpler languages and constructs in mind.

SegFaultPlus4

guys

you know how there was a 2016, 2018, and 2020 mod election

Adám

So you're extrapolating to 2022?

ophact

I've never voted before

:(

AviFS

For example, if I run:

a←3
a+1
2×a

I get 3 ⋄ 4 ⋄ 6

If I then change that to:

a←3
a+←1
2×a

I get 3 4 8

ophact

@SegFaultPlus4 In the years 1, 2, 3, 4, 5, 6, 7, ..., 1878, there were no lightbulbs. You can't just say that there will be no lightbulbs in 1879 because of past trends.

AviFS

11:24

Which is exactly the behavior I wanted.

Adám

@AviFS Sure, but how about:

a←1
a+←2
a×←3

This gives 9. Now change the a+←2 to a+←20

AviFS

I should get 1⋄2⋄9 right?

lyxal

@SegFaultPlus4 I think mod elections only happen if there's a need for new mods. 2016 was the first official mod election to establish moderacy, 2018 had 2 mod positions available because of resignations and 2020 had 3 mod positions available also because of resignations

AviFS

@Adám That should work.

It gives 63.

Adám

Will the last line now give 21×3 or (9+20)×3?

AviFS

11:26

@Adám 21×3 is what I would want.

But you're right, that does mean I have to be a bit careful with how I implement the dynamic bit.

Adám

Yeah, I don't see how you can avoid re-executing from the very top.

AviFS

I think that would just mean I have to run every line that modifies a when a is changed.

Adám

How do you know if a line modifies a?

AviFS

The line that initializes a counts as modifying here.

Adám

Sure, but how do you detect if any other line modifies a?

AviFS

11:28

But I still wouldn't have to re-run any lines that just printed a/observed it, so long as they were above the modified line.

@Adám Yeah. TC makes that a bit hard, doesn't it :p

Adám

Not sure it is TC specifically, but it sounds hard.

AviFS

But, in the case of APL, isn't it safe to do everything that matches a(.)?←.*

SegFaultPlus4

@lyxal oh ok

i was going to run

Adám

@AviFS And ⎕EX⎕C⊃⎕A

AviFS

Yeah, that! I knew there'd be quad functions.

SegFaultPlus4

11:30

@AviFS what even is a quad function

AviFS

But by and large, for most langs I want to add, and most use cases, I wasn't expecting that part to be too hard.

Adám

@AviFS No quads in ⍎'a←0'

SegFaultPlus4

a function that takes (a, b, c, x) and returns ax^2 + bx + c

Adám

@SegFaultPlus4 apl.wiki/Quad_name

AviFS

The lang-specific function would be one that took the modified line as input, and returned a list of regexes.

And every line that matched the regex would be re-run.

Adám

11:31

@AviFS Uh, many languages will be hard to parse using regexes.

AviFS

Wasn't planning on including such languages and expecting them to be full-featured.

For the most part, the langs that are hard to parse are the ones that are pretty efficient.

So I may never change them away from the brute force.

But this is really nice for a lot of slower esolang interpreters.

But I do think APL variable stuff is doable with regex. You don't lose anything by running too many lines. Only by running too few.

SegFaultPlus4

@Adám ok

AviFS

So overeager patterns (false positives) are fine.

Adám

Of course. Just re-evaluate any line that matches ^.*$

AviFS

Haha, or more like any line that contains, as a substring, the name of the variable.

Adám

11:35

That, or any ⎕ or ⍎ or ⌶

AviFS

It's pretty easy to tell if something is a user-defined name, or a primitive, in APL :p

PyGamer0

in around 20 mins, i made a simple non TC stack based language that can add and subtract numbers only lol

AviFS

@Adám Also an option.

Adám

@AviFS No, you need both. But how do you avoid changes to things that shouldn't be changed?

AviFS

@Adám Did you ever put multiple of the same variable/func, and then mash buttons at the top to watch them all instantly change?

It's quite satisfying, and shockingly instantaneous.

Adám

11:38

Not mash, but I did do that animation thing.

AviFS

... Assuming being in Europe doesn't make your connection to a US West server noticeably slower.

@Adám Oh yeah, I have to check that out.

But please mash!

Just once :p

Adám

@AviFS What will you do if I change the a←2 line in:

b←3
a←2
a b+←1

AviFS

@Adám Woahhhh, that's super neat!!

Adám

If you don't execute a b+←1 then the a part will be wrong. If you do execute it, the b part will be wrong.

So you have to detect that the line also modifies b, then go back and include all lines that affect b.

AviFS

@Adám Given Dyalog's speed, the line-based approach doesn't seem necessary any time soon, but when I do, it seems like it fits in the same boat, no?

Adám

11:41

@AviFS What do you mean by "the same boat"?

AviFS

@Adám Right, so this is where the first step would be to just rerun all lines that include "a" or "b" on the left hand side of a ←

Adám

And which variable does ⎕EX⎕UCS 64+?26 affect?

AviFS

... that I have no idea.

Got some reading up to do.

Adám

@AviFS ← isn't the only way to assign.

AviFS

I know, that was a short hand.

Adám

11:43

@AviFS That's correct. It erases a random variable from among A–Z

AviFS

@Adám The step before that is to rerun all lines that include the name of the variable anywhere as a substring.

But that approach doesn't work for randomness.

Adám

Or indeed from computed names.

AviFS

So, assuming one wants to optimize this, it should fit within the same framework. The function you define has an additional case (if statement) and anything like that with unpredictable effects would return your fave ^.*$

I'd actually give that functions access to the lines as well, and I'd return a list of line numbers to re-run.

That's how I think I'd do it.

So they could use regexes for some parts, substrings for others, or whatever they wanted. I'd just expect a list of numbers to loop over.

So in this case, it'd just return the list [0 .. input.length-1]

Which is what I'm doing every time for now in APL. (Other langs are much easier and more important to do this for, like slow interpreted stack-based esolangs with a short list, often only one, of easily parseable assignment primitives.)

Or in brainfuck, where the state is just a tape and a pointer index, so that gets passed back and forth each time.

And a representation of the state gets printed on each line to the right.

SegFaultPlus4

wait, when was APL invented

AviFS

We'll see if this is still up in the morning, haha

And we'll take another look at my bill :p

l4m2

11:51

Which is shorter, 256-wrap or 257-wrap brainfuck Hello World?

AviFS

@SegFaultPlus4 Before computers.

As a mathematical notation devised by Ken Iverson.

Adám

@SegFaultPlus4 It was a gradual process throughout the '50s and '60s.

AviFS

It turns out 1957 is not before computers...

Oh just one other thing. Incidentally, it turns out to be a delightful interface for mobile. It's the first time I've ever been able to play with APL on my iPhone.

Adám

How do you type APL glyphs?

AviFS

(Not because the iPhone bit matters, but because I know there's lots of neat stuff for Android.)

@Adám I found an app that lets you make custom iOS keyboards, so I'm playing with that. And you also have the in-browser bookmark thing, which is a start.

Ginger Industries

11:58

•ᴗ•

Adám

@AviFS Ooh custom iOS kbds sounds interesting.

lyxal

@GingerIndustries ••o

Ginger Industries

@lyxal birdo

lyxal

I do not like birds

do not mention them

AviFS

@Adám Right?! I'll be happy to share as I go.

Transcript for