Sixth Barrel

Lyxal

02:25

Nah, just use a --reverserange flag

I'm language designing based upon patterns I've observed in challenges

a'_'

Are you interested in my new challenge (which attempts to disobey the common patterns)?

If so, here's the link: codegolf.meta.stackexchange.com/questions/2140/…

Lyxal

I think I like it.

∞£:∆™§˚$˚+™∂µ

A kind of solution

Infinite list of odd numbers, map (dup, increment), pairwise map (square, swap, square, add), sort, uniquify, print

a'_'

Wow... how (in the world) did you think of so insanely useful instructions like that?

Lyxal

Well, I've already covered the maps

And uniquify/print/sort is just standard practice.

a'_'

But wait, how are you going to deal with that infinite list? Lazy evaluatoin?

Lyxal

02:38

I'll see how 05AB1E does it.

I'd probably use a generator

And then when printing, it would just be print terms until a certain point

I'm yet to get to that though

Also, the symbols are subject to change

a'_'

A question: does ∞£:∆™ simply yield the list of positive integers?

Lyxal

∞

That's what does it

the £:∆™ dups and increments each item

a'_'

Hmm, can you give some items from that list? I am still not able to understand it.

Lyxal

Well, seeing as how it's all the odd numbers:

[1, 3, 5, 7, 9, 11, 13]

then

wait

perhaps I've misunderstood the challenge

a'_'

Hmm, I'll try to clarify the challenge. What is the thing that you have misunderstood?

a'_'

03:08

I realized that uniquifying is too trivial... the deltas for the sequence is `[2, 1, 1, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2]

Lyxal

03:34

How do we determine the middle number?

a'_'

04:27

Preventing the uniquifying doesn't help...

@Lyxal Simply pass through the given formula.

a'_'

04:41

But anyway, I don't want to complicate my challenge too much ... no it shouldn't, otherwise, it would be too trivial.

However, in the current challenge, it's just a blatant abuse of the formula, which is obviously boring.

However, I'm also interested in seeing how they would generate that formula. Anyway, rollback!

Lyxal

05:27

Aha

So then

My initial solution is wrong

Hmm

well

∞∫²▽½™§+™∂µ

There we go

that's better

inf list of odd numbers, zipmap (square, decrement, halve), pairwise map (add), sort, uniquify

a'_'

How did you do the increment of the third output of the map?

Lyxal

I forgot that the number generated by the formula needs to be included

Which means pairing everything

Hmm.

∞∫²▽½™§⊐™∫+™∂µ

∞∫²▽½™§⊐™∫+™…∂µ: Inf list, zipmap (square, decrement, halve), pairwise map (wrap in list), zipmap (add), flatten, sort, uniquify

There we go.

That should work

Please note that all symbols used are subject to change

As are the commands

But theoretically, that's what it'll look like

CMC: Given a string k, split that string on spaces.

a'_'

05:43

Keg definitely has a built-in for that. I'd take a look.

Lyxal

And output each item on a newline

Or seperated

Somehow.

I got 6 bytes

a'_'

What!? Keg doesn't have that? I guess I have to use a loop to do that.

Lyxal

Uh

It does

It's called division lol

You literally suggested it when I asked what string divison should do

a'_'

I only managed to write this. How do I do the printing section...

Lyxal

` /÷^(,` with -pn

Try it online!

Thanks for rendering properly markdown.

a'_'

05:51

Hmm. ` \/÷^(,`

Lyxal

` /÷^(,`

/÷^(,

Ah

MD don't like spaces

a'_'

What's the list after ` /? Why is ÷` neccecary?

Lyxal

@a'_' Because otherwise the list gets flattened and doesn't split individual items

Because string division returns a list

Yeah. I know

Inefficient isn't it

That's why I'm rewriting everything

a'_'

Ah, so ÷ is flatten onto the stack.

Lyxal

Mhmm

Indeed

÷ is item split

Strings -> individual characters

Numbers -> individual numbers

Characters -> individual numbers of ord code

a'_'

05:58

List -> dump onto stack

Lyxal

Lists -> every item

@a'_' Yeah. Y'all somehow sent that before mine went through

Lyxal

07:56

∞⟨²▽½™§⊐™⟨+™…𐊖𐊜

that's what it'll look like!

! Push the length of the stack
@ Start function
# Start a comment
$ Swap the top two items
% Pop x, y, push y % x
^ Reverse the stack
& Store/Push a value in/from the register
* Pop x, y, push y * x
() For loop
[] If statement
{} While loop
: Duplicate top
; End function
" Right shift
' Left shift
< Less than
> Greater than
, Print nice
. Print raw
? Take input
/ Pop x, y, push y / x
\ Escape next character
~ Push random number (-inf, +inf)
- Push x, y, push y - x

Lyxal

22:00

! Push the length of the stack
@ Start function
# Start a comment
$ Swap the top two items
% Pop x, y, push y % x
^ Reverse the stack
& Store/Push a value in/from the register
* Pop x, y, push y * x
() For loop
[] If statement
{} While loop
: Duplicate top
; End function
" Right shift
' Left shift
< Less than
> Greater than
, Print nice
. Print raw
? Take input
/ Pop x, y, push y / x
\ Escape next character
~ Push random number (-inf, +inf)
- Push x, y, push y - x

ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789)!@#$%^&*(`-=~_+[]\{}|;':",./<>?¡≠≤≥〚〛°¬£ƒ§™®©ß⟨⸤⸢𐊗𐊂∑∨∧∆▽ṘṚṙṛ⚁⊡¢§Ω²𐊖𐊜⊐…

Lyxal

23:07

def inf_list(item = 0):
yield item
while True:
item += 1
yield item

2

infinite list ftw

Transcript for