The Nineteenth Byte

12:59 AM

@user HaCk ThAT sItE

OldSandboxPosts

Sandbox posts last active a week ago: Regex mask, What is the maximum value generated by interleaving?, Solve the halting problem for ^/ab*/ba*/[ab]*$ in /// [code-golf], Implement every dirname (1p)

@OldSandboxPosts what is the minimum value generated by uninterleaving?

Nov 18 at 1:03, by lyxal

Nov 9 at 1:01, by lyxal

New hobby idea: coming up with the opposite of old sandboxed challenges

1:15 AM

> email validation is very basic and only checks for ‘@’. Should also check for ‘.’ and that there is a ‘.’ after the @ character

Sep 10 at 11:04, by Adám

It does not match foobar@dk which is a valid and working email address (although probably most mail servers won't accept it or will add something.com.) — bortzmeyer Oct 14 '08 at 19:30

Idiots don't know that my email validation was actually better than what they suggested

(context: uni assignment)

1:43 AM

Is there a TIO clone/alternative that supports recent ES features? (specifically ES2020) All of the JavaScript-y languages on TIO balk at ?.

1:57 AM

@LeakyNun JS, 22 bytes: d=>e=>(d*d**e-1)/(d-1)

(was scrolling through old chat logs, and didn't see any responses to it)

2:23 AM

@LeakyNun Jelly, 4 bytes: take e and d, increment, to bijective base 1, from base d to integer (works with d=1 too)

2:58 AM

@OldSandboxPosts Unimplement some of the filenames (2x)

PyGamer0

@user well time to learn hacking and delete that site

@OldSandboxPosts @lyxal Don't solve the running problem for bit.ly/30Nyjnz in \\\ [code-bowling]

I used tjjfvi's regex inverter, and the result is... not small.

> The challenge was to golf the source, not the output ¯_(ツ)_/¯

What is codegolf.stackexchange.com/posts/221291/revisions (10k+)

They were clearly just sorry to late see that

Unrelated String

yeah

3:26 AM

@tjjfvi ( I have an answer to another high-voted unanswered question :) )

Ooh, nice! Which one?

Uh, use a stack snippet I guess?

@emanresuA The knot theory one (can’t link easily atm)

@emanresuA 👍

20

Q: Compare Dowker Knotation

Dowker notation is a common way of representing mathematical knots. Dowker notation can be derived from a knot diagram in the following way (based on the description from the wikipedium): We will label each of the \$n\$ intersections with two numbers whose absolute value is on the range \$1,...

The hardest part was figuring out how to pronounce Reidemeister :P

2

Don't forget the bounty

@tjjfvi CMQ: Have you ever used ?. on its own (not ?.[...] or simiilar, just ?.property)?

3:49 AM

Oh wow, someone seriously did some knot theory

PyGamer0

4:03 AM

is vim a programming language

cause its a text editor, (or am i wrong)

i would consider vimscript to be the language

@emanresuA In code golf? I don’t think so. In other contexts? Most definitely

5:22 AM

ok so I'm running into an issue (this is happening in windows 11 WSL ubuntu 20.04.2) - if i do print(input()) and input something longer than 4095 characters, it just gets cut off to that

can't bypass it with sys.stdin.read()

how can I get strings longer than that?

@hyper-neutrino it's not python problem or WSL problem

rip

i'll just copy paste into a file then lol. thanks

Apparently you can use this in python to bypass the limit (termios is part of stdlib) but idk if you really need it

oh interesting. well i'll take a look at it and decide what i want to do with it; thanks

8:32 AM

Filan beefdack?

Fime

hello pogger

Dog to poost?

Good to post?

I think it's dog enough

Ok. I have a couple more 'cos I've really been neglecting them lately, but I'll leave them for another day.

Q: Will one-cell brainfuck halt?

8:44 AM

0

Brainfuck is an esoteric programming language that is Turing Complete, meaning you can't tell whether a given program will halt without running it. It's cell-based and has an infinite tape of cells, values containing an unsigned integer from 0 to 255, but if you give it arbitrary-size cells, just...

code-golf brainfuck halting-problem

Have fun!

8:55 AM

@NewPosts I have a general idea of how to solve this problem, but I am most likely to copy the golfed brainfuck compiler lol

anyone learned stenography?

stenotyping looks so hype

i've looked at it a bit but nowhere close to enough to call it "learning" steno

Q: Tips for parsing Standard Input in JavaScript

10:01 AM

0

I've been doing quite a few code golf recently and I realised that a lot of times, I have to do something involving list. Most of the times lists are space-separated or comma-separated values in the first argument (argv[2]), and the return value should also be a space/comma-separated string. Are ...

array tips parsing javascript

I have no idea what to do with ^, it can be y'all's problem :P

Adám

@OldSandboxPosts Thanks for the reminder. Any final comments (e.g. missing edge cases)?

Maybe get rid of the \b testcase since it's not in the required spec?

I personally don't like the challenge idea, but it's well-written and otherwise ready to post.

o/ for now

Adám

@emanresuA Good call. Other tests are beyond spec too. Will fix.

code-golf string array regular-expression text-processing

10:25 AM

0

Q: Convert Regex to Mask

From my CMC. Given a regex and a non-empty printable ASCII text, return one bit per character in the text, indicating the positions of beginnings of non-overlapping matches, and also the positions of beginnings of sequences that are not part of any non-overlapping matches. You can: take the rege...

12:29 PM

0

Q: Convert codepoint to UTF-1

UTF-1 is one of the methods to transform ISO/IEC 10646 and Unicode into a sequence of bytes. It was originally for ISO 10646. The UTF-1 encodes every character with variable length of byte sequence, just like UTF-8 does. It was designed to avoid control codes. But it was not designed to avoid dup...

code-golf unicode

12:49 PM

@NewPosts Makes me want to implement UTF-69 where each character is represented as a string of 1s joined on 0s

and the length of each run of 1s is the character code for each character

the 69 in UTF-69 is just to make it extra confusing

because you'd expect it to use like 69 bits, but instead, it's just a horrible version of unary.

and so everything becomes either byte value 255, some number where just a single bit is 0 or where it's just less than 8 1s

so something like Hello, World! in UTF-69 assuming UTF-8 display becomes

ÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿÿÿÿÿÿÿÿÿÿÿïÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿÿûÿÿÿýÿÿÿÿÿÿÿÿÿÿýÿÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿÿÿÿÿÿÿÿÿÿÿÿ¿ÿÿÿÿÿÿÿÿÿÿÿÿýÿÿÿÿÿÿÿÿÿÿÿÿïÿÿÿ

anyhow, that concludes my TED talk

thank you for attending

allxy

@lyxal *claps*

thank you kind sir. many appreciations for the appreciation

very cool allxy

allxy

@lyxal too epic.