The Nineteenth Byte

c--

12:31 AM

@Simd nvm, 7,6 has 3 connected components, grouped by popcount they would be [0, 2, 6], [3, 4] and [1, 5, 7]

wait that's wrong

it's still 2 connected components with even and odd popcount

OldSandboxPosts

1:00 AM

Sandbox posts last active a week ago: Tic-Tac-Toe: Maintain the Draw!, Continuously Count Consecutive Cases, Sum of Two Intervals

lyxal

CMC: Given a list of strings, find the longest common prefix among them. There will always be at least 1 string in the list. The longest common prefix is the empty string if there's no shared prefixes.

Bubbler

reduce (prefixes of two strings; intersection; max)

Unrelated String

a very funny broken solution in jelly

`f"/ȧ` fixes the part where it doesn't actually discriminate prefixes at all but i feel like i can still construct an input that breaks it

there's a backslash in ther

f"/ȧ\

yeah it breaks on "a", "ab" lmao

plain ¹Ƥ€f/Ṁ probably is shortest

though it does give 0 for the empty case lmao

Rydwolf Programs

1:57 AM

CMQ: Do you think MathJax scraped from main would be a representative sample of MathJax that would be used in chat?

Trying to get a sort of MathJax corpus so that I can design CIMJ to be as compact as possible

Bbrk24

2:13 AM

How should I approach writing a quine in Trilangle? I have no idea where to begin

noodle man

2:24 AM

@Bbrk24 does Trilangle have string literals?

Bbrk24

Nope, no string mode. Unlike most other 2D languages, " only quotes a single character

emanresu A

General approach for a quine is: Have some way to represent arbitrary text, then write a piece of code that decodes that and prepends the encoded text formatted somehow

Then compress the decoder and pass that into the decoder

Bbrk24

A string of n characters takes 2 n characters to express without tricks

That's why Hello, World is so long, it's just push H print push e print push l print print...

emanresu A

Yeah, so figure out a way to convert that string into the code that generates it

Then print the string

Bbrk24

> figure out a way to convert that string into the code that generates it

r/restofthefuckingowl

Bubbler

2:32 AM

think of the simplest, repetitive way to store some chunk of data into your storage

Bbrk24

IP direction is also less like Befunge and more like Hexagony

Note that I said "without tricks". There are for example dupe and 2-dupe instructions

Bubbler

and then print it in two ways, one will be the code section and the other will be the data section

noodle man

@Bbrk24 can you do something similar to the Hexagony quine?

Bbrk24

The Hexagony quine I remember seeing starts by pushing a big number and then feeding it into a decoder. No, I can't, for a number of reasons:

1. Single-digit numbers take two characters to push if you can't get them by manipulating what's already there ('0). 11 and up also take 2, but you use push-char rather than push-int. 10 is fun because the interpreter ignores newlines.

2. There is no "numbers are automatically concatenated as in decimal" functionality that Hexagony has

Bubbler

yeah, hexagony kinda cheats

Bbrk24

2:36 AM

3. Hexagony uses bigints. Trilangle uses 24-bit signed integers.

The big number decoded by the hexagony quine wouldn't even fit in a single stack slot in Trilangle

noodle man

alright

Bubbler

j exists, so you can push a bunch of numbers and then loop over them twice

Bbrk24

true! Also, the only way to edit the middle of the stack is to do multithreading

Okay so the basic plan is
1. Push a bunch of things in a clever way
2. Iterate over them twice

mm, but you see, trilangle codegen is tricky

Because you can't just output the cells in order. When you're going left-to-right, wrapping goes bottom-to-top

and the default IP direction is southwest

Bubbler

I think if you put a ^ at the top then the IP will essentially move linearly backwards? like

?

Bbrk24

Bubbler

2:42 AM

huh

Bbrk24

None of those work with spaces removed. .13245, <21543, |31542, \45123, _25314, ^53421

So the first pass can't just be "print ", print character" or "print ', print digit"

Bubbler

hmm wow, the control flow is actively against quining

Bbrk24

That was totally by coincidence!

Bubbler

still one way to do this is to stuff the whole data pushing code in one horizontal line

this should make it a bit easier though the code size will be squared

Bbrk24

...I suppose

Bubbler

2:52 AM

lol

Bbrk24

So then the general structure of the program would look like this:

A pair of very deliberate decisions makes everything slightly more difficult:
1. There is no "stack depth" instruction
2. Indexing past the bottom of the stack is UB

I might not be able to figure this out tonight but I have direction at least

I could even split the "bunch of data" section into two rows if I need to, and print the top half of the stack before the bottom half. This works because the last row can omit trailing NOPs; more than two rows will be difficult.

Bubbler

3:27 AM

I'd hardcode the stack depth

Bbrk24

Yeah that’s what I’ll do

Bubbler

also just thought about making the data section a tilted rectangle

Bbrk24

I’ll probably encode it as base-96 so I get 3 instructions per stack element

lots of multibyte characters but oh well

I am going to bed now but I will certainly try this tomorrow

Bubbler

.      .
      . .
     . . .
    . . . .
   \ 1 2 3 \
  \ 4 5 6 \ .
 \ 7 8 9 \ . .
\ a b c \ . . .

Bbrk24

one last thought before I go: if I have to pad the decoder with NOPs I could hardcode the nop count

@Bubbler Hm, that is an idea

Transcript for