Vyxal

« first day (4 days earlier) ← previous day next day → last day (1771 days later) »

Lyxal

00:27

@petStorm Sure, but my idea is to a) plan everything first (including the codepage) and b) incrementally implement everything once it's all planned

Because I don't want another codepage riddled by placeholders

And besides, if I plan everything first, I have a list to work through, meaning I always have a next thing to work on

petStorm

00:38

(If your codepage is already filled... you can't add instructions dynamically anymore.)

Lyxal

@petStorm Sure, but then backwards compatibility goes out the window.

Because if there are different code pages, then things like string compression messes up

And the old characters no longer do their job

Sure, you could have two characters doing one thing...

But then you've got 2 pages.

There's a reason why I've moved on from Keg

And it's because of the flaws that existed.

The codepage being one of those flaws

So this time round, I'm creating the codepage first, then implementing it all

petStorm

Okay, I see.

2 hours later…

Lyxal

02:48

Ð?_ř multiply a number by a string 4 bytes

String Ðirection, Input and discard, řepeat each character in the string n times.

Ð will put the target string in the direction of the input. If the input is positive, nothing happens. If it is negative, it gets reversed. Otherwise, it gets nulled.

(Ð): Pop [x, n] Push (x in direction n)
(ř): Pop [x, n] Push (repeat(x, n))

3 hours later…

petStorm

05:59

@Lyxal It doesn't need to get nulled. It can just leave the string as-is.

Because, ř already does the job for you.

Wouldn't just Ðř work?

Lyxal

06:13

@petStorm no because the input cycles

But if it goes n then string, yes

Vyxal can beat jelly in Fizzbuzz by 2 bytes

I've got an 18 byter but I can't type it on my phone because Unicode

But you've already seen what it'll be like in the Keg room

petStorm

Nice!

Lyxal

Essentially, push a range 0-100

For each, multiply the string "fizz" by the divisibility of the number by 3

Multiply the string "buzz" by the divisibility of the number by 5

Add those two strings and short circuit or with the number

And voila: 18 bytes, which is 2 less than Jelly

With a flag of course

Flag less is 19 bytes

petStorm

Would it be any shorter if you auto-push character constants?

Like in Canvas, fizz pushes the string fizz as a whole onto the stack.

Lyxal

@petStorm no because the strings are already compressed

petStorm

Using dictionary compression, right?

Lyxal

06:24

@petStorm indeed

Subject to change once i finalise codepage and dictionary

Also the last character might be wrong because i can't remember if it goes up or down

Don't worry : i got it right

petStorm

@Lyxal Hmm, remember that the Fizzbuzz starts at 1.

Lyxal

06:41

@petStorm there'd be a range command to account for 1 through 100 inclusive

petStorm

Right.

@Lyxal Now I got a 16-byte NST version: Ｈ|35,÷┬Σθ#θ@,┘Ƥ∨

Lyxal

@petStorm we make a good golfing team.

We both beat Dennis today, so I'd say we did pretty well.

Good job!

petStorm

(Set theory is already a very high-level and concise language, therefore I expect an extension of it to beat Jelly.)

petStorm

07:07

A: 1, 2, Fizz, 4, Buzz

Jelly, 24 20 bytes ³µ3,5ḍTị“¡Ṭ4“Ụp»ȯµ€G Try it online! How it works ³µ3,5ḍTị“¡Ṭ4“Ụp»ȯµ€G Main link. No input. ³ Yield 100. µ Begin a new, monadic chain. µ€ Apply the preceding chain to all integers n in [1, ..., 100]. 3,5ḍ ...

2 hours later…

Lyxal

08:46

17 bytes in vyxal if mapping things to integers auto generates a range

But I can't crack 16 bytes

petStorm

09:03

@Lyxal Which means that you need to adapt the old one-digit pushing behavior of good ol' Keg.

Lyxal

@petStorm no. That won't help at all

All numbers are already a single byte

petStorm

@Lyxal Do you want me to explain my program?

Ｈ                Push 100
 |               For every item in 1 .. 100:
  3              Push 3
   5             Push 5
    ,            Pair. {3, 5}
     ÷           Is divisible          . {i%3, i%5}
      ┬          Get all truthy indices. {} for none, {1} for fizz,
                 {2} for buzz, {1, 2} for fizzbuzz.
       Σ         Sum the list. (0, 1, 2, or 3)
        θ#       Push fizz.
          θ@     Push buzz.
            ,    Pair, {fizz,buzz}
             ┘   Capitalize. {Fizz, Buzz}

Just realized that fetching at corr. indices is shorter.

« first day (4 days earlier) ← previous day next day → last day (1771 days later) »

Transcript for