The Nineteenth Byte

12:31 AM

yes it is

@RadvylfPrograms i think it's sensible in a vacuum for Result to support any type for Err, for general Either-y use, but it's definitely a mistake for Error to exist and be usable for top-level errors

Oh man I still haven't posted the Lotm. I guess I will now

like if you want it to be possible for internal structured representations of errors to be punted arbitrarily far up, then just convert them to a string or such when you do that instead of encouraging fucking existential types

and yeah i think your idea of an identifier-description pair for the default/canonical representation of an error is hard to beat

Q: Language of the Month for November 2022: J

0

In accordance with our meta agreement, since one candidate received more votes than the others, we have a new featured language! Throughout November 2022, our Language of the Month will be: J What's a Language of the Month? See the meta post for nominations. In short, during November, those who...

Feeds

12:53 AM

FEED ME WEEK OLD BUTTER

6

petition to make the past tense of "screenshot" be "screenshite"

caird coinheringaahing

screenshot is the past tense, of to screenshoot

what? no

screenshot is present tense

caird coinheringaahing

Think you're misremembering, screenshot is the past tense

screenshot is the past form of screenshink

12:56 AM

screenshink is the past form of scroonshilpk

OldSandboxPosts

Sandbox posts last active a week ago: Longest Total Distance Cyclic Quine Chain code-challengequinebusy-beaver

1:13 AM

isn't the plural of screenshot also screenshot?

code-golf string ascii-art

no

Newly Featured Posts

21

Q: Indexize a number

Given a string of digits or an integer as input, you will have to indexize it. This is how you modify the input. We will use 30043376111 as an example: First, find the sum of the indices of each occurrence of the respective digits: 0: 1 + 2 = 3 1: 8 + 9 + 10 = 27 3: 0 + 4 + 5 = 9 4: 3 6: 7 7...

code-golf string number

22

Q: The Art of Word Shaping

The Art of Word Shaping Given a binary matrix and a string of letters, replace all 1's in the matrix, moving from top to bottom and from left to right within each row, with the letters of the string. Once the letters have been formed into the shape of the matrix, print the matrix, replacing 0's w...

1:57 AM

@Sʨɠɠan yes to lyxal or me lol

2:43 AM

am i missing something in this quine in J cuz idk how to get 17 bytes

echo(,2#{:),~'echo(,2#{:),~'''

3:14 AM

@DialFrost J is a cheating quine

@JoKing yes i agree XD

but how lmao

3:33 AM

@JoKing i suck at J :(

ARGV stores the args to the program

@JoKing wut?

you just read the source code

{:ARGV will give you the filename

then you just read it

PyGamer0

3:49 AM

@DialFrost do you know apl?

@PyGamer0 no

@Sʨɠɠan read it? errrr searches google

PyGamer0

@DialFrost i just wanted to say that j is apl's sibling :P

ah

i just got 17 myself thanks to the hint

you just read the file and then output it

@Sʨɠɠan noice

@Sʨɠɠan but. wait gimme a sec

I just tried it out

its not working lmao

the output and expected are the same tho im so confused

4:02 AM

There's a newline you have to mess with

Basically you have to add a newline to the end of your code, then when you echo, strip it out

@Sʨɠɠan nani???

nani????

basically your current code outputs a newline at the end, but the code doesn't have a newline at the end

oh

breh

@Sʨɠɠan why doesnt putting a newline work

because now you're outputting two newlines :)

you have to strip it out when you echo

@Sʨɠɠan oh uve got to be kidding

4:04 AM

just use }: to save you the docs lookup

that removes the last char

@Sʨɠɠan i get an error :/

@DialFrost i just looked that up and apparently it's japanese for what. is that what you mean?

@DialFrost add it before the 1!:1

@Sʨɠɠan yes ofc lmao ;#

はい

@Sʨɠɠan oh breh i put it after

4:06 AM

lmao it's not reverse polish notation

@Sʨɠɠan lol tysm

eyyy J is lotm, nice

apparently im stupid enough to not get the 25 byte ruby quine

you have to find it on the anagol post-mortem

golf.shinh.org/p.rb?Quine

copy and paste :)

huh

wow thats a weird program

4:16 AM

%% in an escaped % in for sprintf, and %p is arg.inspect

pretty much same as the 32-byte python quine

and the 26 byte ruby quine minus the %%

now do the 31-python

@JoKing who me?

sure, step out of the 350 people tied at 32 lol

4:21 AM

but idk :((

only 29 ppl with 31 bytes? hmm strange

how do bounties work? is there a FAQ or smthn on this?

FryAmTheEggman

@south codegolf.stackexchange.com/help/bounty

4:42 AM

@JoKing no can do sir

4:56 AM

@FryAmTheEggman ty

5:09 AM

@Razetime Sorry for the late reply. It's not anything in the standard library, where did you find it? It's probably a user-defined method, but most people don't make operators over 3 characters

If you know what library it is, they'll probably link to the docs for it. If you want the standard library, here's the 2.13 API and the 3.2.1 API

Newly Featured Posts

12

Q: How long until this date?

The idea is this: Write a function to print the length of time from now/today's date (at the time the function is called) until a date supplied as an argument. Assumptions: Input date will always be tomorrow or later, in the future. Input date will never be more than 10 years in the future. ...

code-golf date

@RadvylfPrograms That seems unlikely, comparing functions doesn't really work in Scala (probably not most languages)

@RadvylfPrograms It's actually just def +(b: B) = ... to do a + b. You actually can't overload == though, since it's a final method that everything inherits (it's treated specially so that stuff like null == foo works)

ScalaTest does have ===, but the way they use it is absolutely abominable and would make even a Groovy programmer recoil in disgust

lyxal

5:34 AM

@user ~~time to go implement 69 character operators in Vyxal 3 for the lols~~

5:50 AM

@mousetail for the conway rgb converter i've figured out a way to receive input, but now my challenge is to figure out how to modulo the input by 16

@JoKing got any useless hints? :p

everyone who has got it immediately facepalms

@JoKing that aint a hint lmao but good to know :3

@JoKing ?

it's a decently known trick that isn't usually used on code.golf

first non cheating quine i could think of in python happens to be 31 but not accounting for a newline

5:58 AM

@mousetail?

so i assume this isn't anywhere near it :P

@JoKing hint on what that trick is? :p

no

@JoKing if its decently known why isnt it used?

@JoKing :(

oh i also got a cheating 31 but only through modification of a cheating 29 so

6:01 AM

Okay now I'm assuming mousetail probably collapsed on a 100m track and won't get up

6:13 AM

It's 7 AM here

6:56 AM

Concept: ~= as a “Roughly equal to” operator. Checks equality to the most significant digit of either input.

@UnrelatedString lmao

anyone have an idea of how to make a quine in K

even a long one is fine

@mousetail It's 11:00 here

Why are you awake at 111 AM wtf

Study day for exams

not to mention my school is stupid at realising we need only 1 hour to revise for exams

not a day

@ATaco Raku has =~=, which is equality within a specified tolerance

thejonymyster

7:06 AM

woah

a~=b kinda looks like a=a~b (though this is also a problem with != and >=/<=)

do you mean 11 am or 1:11 am
because neither should be surprising

@UnrelatedString 11:06 AM

also speaking of 11 am i have an appointment at 11 am so i need to get to fucking sleep

considering it is 2 am here

which kinda makes sense because of chat.stackexchange.com/transcript/message/62334509#62334509

7:08 AM

@UnrelatedString I mean exactly 1 hunderd and 11 hours after midnight

Sounds too far

In any case the reason I pinged you was because I was having trouble with the "convert to hex" part of doing my own challenge in CGoL yesterday

I've figured how to input, but not to modulo 16

Adám

@Ginger How do all those multiples of 10s add up to +4?

@JoKing if Unicode or an custom charset is used then a ≈ b could work instead

Strings could match ignoring case and consolidated white space, lists could match ignoring order

7:25 AM

Is there a challenge yet to recover words with letters removed?

@ATaco raku uses ≅ lol

@mousetail sounds similar to Court Transcriber

That's the opposite of what I want to do

@mousetail nod

hey I've been poking around in __future__'s source code

there is a comment explaining all the future statements

except for Barry_as_FLUFL

what is that

It's great

peps.python.org/pep-0401

7:37 AM

<> sounds dumb

or maybe its because Im used to !=

that looks like an easter egg

hmm... perhaps in the future braces might be implemented

lets use future to check

Why do you think it's named bary_as_FLUFL if it's not a easter egg

@mousetail because 401 = 4/01 = april fool = easter egg

wtf is this

from __future__ import braces
SyntaxError: not a chance

does SyntaxError have a mind of its own

That's the entire joke

what no fair

I love braces

code-golfy

I'll try something witty

from __future__ import Python_farts
SyntaxError: future feature Python_farts is not defined

@JoKing is it related at all to the 32 byte solution? or issit something new

7:44 AM

trivial modification

from __future__ import code_golf_version
SyntaxError: yeah right

@py3_and_c_programmer from __future__ import antigravity ?

codegolf.meta.stackexchange.com/a/25310/91213 Anyway this is the challenge, let me know what you think

9:40 AM

@Sʨɠɠan howd you get 52 bytes awk quine? i only got 56 and see no way to golf

lol

10:09 AM

@JoKing quick question is there a way to print in golfscript without using puts?

10:25 AM

@DialFrost golfscript just prints the stack at the end of the program anyway

Adám

Is it just me or is GitHub slow today?

What're y'all's thoughts on Nim? Been messing with it lately and I like the Syntax, even though it's taking me a bit to learn.

@ATaco i dont really like it lol

Any particular gripes?

@ATaco not rly, just the overall syntax and stuf

10:35 AM

Reasonable.

@JoKing eh then why doesnt the 8 byte quine work

> Implicit output is disabled for this hole.

i mean, that would allow just a one byte quine lol

Oooh, quine challenge? Which one?

@JoKing then you have to use puts!

or am i wrong again :3

this is the code.golf one

@DialFrost you can also use p

10:37 AM

im assuming p only works for numbers not strings?

same rules as ruby

ah okey

wow even you didnt get 10 bytes XD

11:39 AM

I added a visualizer

nani

how'd you make that fast?

mice live at a higher frequency

ngl i kinda like the website design

good job

TY

mathcat

11:54 AM

@DLosc 3 ofc

@mousetail Your page has a minor typo

where?

"Fbonacci"

:3

in "Load a example"

Also, when the stack gets too big, it starts to push the register and input queue box to the right

can you make so that the stack just continues to the next line and not start breaking the other stuff :P

Your output is also bugged

If it goes past the box it never "scrolls" down but continues and goes over the text at the bottom of your page

@mousetail u there?lol

12:12 PM

Thanks

I'm technically working so occasionally I need to pause golfing to do something useful

@mousetail oh sorry

@mousetail "ocassionally" pause golfing = occasionally working = slacking work :3

12:50 PM

@DialFrost Should be fixed

1:38 PM

nice

Fatalize

@Ginger Not a palindrome, 1/10

¯\_(ಠ_ಠ)_/¯

Fatalize

You should donate 4000 rep bounties to fix that

that’s easier than getting 44 silver badges or 444 bronze badges :p

but I like my rep :b

Neil

nah he just needs 4 inbox notifications

1:54 PM

oh yeah, that'd fix it

~~quick, mention me in a room I'm not in!~~

mathcat

Is there a symbol that implies a and b are relatively prime?

what do you think of this question? codegolf.meta.stackexchange.com/a/25271/46901

2:09 PM

It doesn't seem to have an objective winning criterion

its [code-golf]

I don't think that challenge is very well suited for code golf

also, the requirements feel too general

What do you mean by too general?

It's going to be really difficult to objectively determine if a graphical representation is correct enough

I'd really recommend leaving out the graphical output aspect

Or possibly allowing the program to take images of the building blocks as input

Actually I think the latter would probably be the best option

That way nobody needs to hardcode a font (or depend on an external one), no subjective judgements about the correctness of the output needs to be made, since it would conform to a strict spec given the same input images, and the challenge keeps its core challenge

2:26 PM

That's a great idea

2:42 PM

Wtf was 2021 Radvylf thinking, I just came across this: .reduce((a, b) => ... ? a.concat(b) : a, [])

Literally just .filter lol

._.

pfft

2:53 PM

hello all!

grettings

I am planning on posing a fastest-code challenge to output a near repunit prime of every number of digits n starting at n = 2. So the highest n you can get to in 1 minute is your score

interesting

but there are two things that I am not clear about . a) I could ask for the primes to be outputted but that might be a lot of output

i offer a bounty for fastest-code challenges btw

2:56 PM

b) some primality tests are randomised so there is a chance they give the wrong answer

@Sʨɠɠan I like you very much !

any ideas how I should deal with a and b?

@graffe just make the challenge require 1/10000 chance or smth

@Sʨɠɠan That's really difficult to prove

I'd just require that the result is correct, no random prime testing

@Sʨɠɠan that's ok for the miller rabin test. For others it is less clear

IMO this will not make a good FC question though

@RadvylfPrograms java's miller rabin test has that option

2:58 PM

@RadvylfPrograms how come?

@Sʨɠɠan snap :)

@graffe Primes are extremely overdone. There is no creativity possible.

this option could have some shortcuts

@RadvylfPrograms in this case there is search and speed to take into account

This is just going to be a bunch of fast prime checking, with some easily-optimizable algorithm for finding one near a repunit

@RadvylfPrograms that's the negative way of looking at it :)

there is a lot of choice over which primality test you use

3:00 PM

@graffe And what's the positive?

do we have a fastest-code primality test already?

yep

@graffe Yeah but you're literally just reimplementing someone else's algorithm

@RadvylfPrograms it's a fun way to explore an open question

Q: High throughput prime numbers

11

This challenge is inspired by the High throughput Fizz Buzz challenge. The goal Generate a list of prime numbers up to 10,000,000,000,000,000. The output of primes should be in decimal digits followed by a newline character '\n' in ascending order starting from the lowest prime 2. You may not ski...

number-theory primes fastest-code optimization

@graffe :upvote:

3:00 PM

those are not primality tests

@graffe There will be no exploration done, we (CGCC) cannot make any advancements in primality testing

that's sieving

i actually beat C with Jyxal there ^^^^^ :P

@RadvylfPrograms you have to search for the near repunit. It's not that obvious how to do that

@graffe And I'd also definitely question the "fun" part of that

3:01 PM

@RadvylfPrograms how would you choose which numbers to test?

It feels like you just need someone to write code for you

is n = 5, say

@RadvylfPrograms no that really is negative

I have no practical for this at all

it's just for fun

Well yeah, but that's what it feels like

like searching for the largest known prime

it serves no purpose

or climbing mount everest

@graffe It depends on what you mean by "near" a repunit

3:03 PM

i.e. 323333

@RadvylfPrograms ok let me define it. A number is a near repdigit if all its digits except one are the same

That'd be a repdigit not repunit

Repunit is 1 only

so if you want to find near repdigit prime with 5 digits quickly you need to decide what order to search them in

@RadvylfPrograms yes, that was a typo

For an input n there are literally just 9n near-repunits

@RadvylfPrograms Some or more likely to be prime than others

3:05 PM

There's not a lot of room to optimize

And what if there is no near-repdigit prime?

@RadvylfPrograms then I award you a 500 point bonus

Award who a 500 point bonus? Me? Well thank you :p

or to the person proving it?

the person who finds an n such that there is no near repdigit prime with n digits

That'd just be whoever runs their code first

Or it would be nobody at all

I doubt there's going to be much of a difference between the best and worst answers

3:06 PM

first you have to write the code!

before you can run it :)

primes.utm.edu/top20/page.php?id=15

@Sʨɠɠan yes but that is a different question

in my challenge you have to find a near repdigit prime with n digits for all n from 2 upwards

that page doesn't say anything about that

we don't know if it is possible for all n or not

none of their numbers start with a 3! :)

@Sʨɠɠan thanks for the nice link

just a relevant source /shrug

it is very relevant, thank you

@RadvylfPrograms *81n

3:15 PM

@graffe how about you have to print the number of primes for n

instead of the primes themselves

@Sʨɠɠan another option is that a near repunit can be represented by three digits. The majority digit, the minority digit and the location of the minority (plus the number of digits if needed)

so at least that is less to output

nah

thats more to output

go on :)

lets 4 digits instead of the whole number

so it is less

also more work

assuming you only output one per n

it's no more work is it?

3:25 PM

CMP: Any objections to NPSP 2.0 being moved into here?

NPSP?

New Posts/Sandbox Posts

thx

They've been running in the Sandbox, and have only gone down due to a bug once, which was nearly a week ago

@RadvylfPrograms nope

id be glad

3:27 PM

^ ^^

3:46 PM

SELinux can go drop important little metal pieces on carpet

I hate it so much

SELinux is a bigger security flaw than the malware it tries to prevent. At least crypto miners have an interest in keeping my server running.

how is it a security flaw?

Yea I always disable SELinux

Because it gets in the way of me using my machine for what I want to use it for

I can set up my permissions well enough without it

took me so long to realize you didn't mean u&l se :P

4:03 PM

@SandboxPosts Ping?

okay, so I just found something pretty similar to (but not the same as) waterjet: Portage, the Gentoo package manager

it's even written in Python :p

@graffe it seems that for n >~ 22, all entries have a major digit of 1, 3, 7, or 9

actually nvm

beyond that, the majority follows that rule

@NewPosts welcome back!

wooooo

I'm not entirely sure they moved correctly, once someone posts something we'll see

4:08 PM

@Sʨɠɠan it seems that it does follow this rule for n >= 78

@Ginger Does the package have to be something that can be compiled by make or can it be anything?

Because if it can be anything, that'd be really cool

You might want to look into Nix too

@user for waterjet or portage?

Portage

oh wow chromeos uses portage

@user idk

4:32 PM

@Sʨɠɠan Are you Seggan or Steffan?

guess

Your chat and CGCC profiles don't say anything

Oh you're Seggan

howd you guess :P

associated accs?

also wb :)

Yeah, Stack Overflow

@Sʨɠɠan Thanks, I had to come back because I'm bored out of my mind and haven't made any friends so this is the only place I can get any social interaction :P

you only missed a bit :P

me and steffan are now one user

and i made a golflang

oh, and NPSP is back

4:44 PM

@user don't worry, we all feel the same way :b

Cool (the changes, not that y'all feel the same way, that's not cool D:)