The Nineteenth Byte

okie

07:43

I am thinking about an anti-account-spam bot

Wasif

sup

lyxal

the sky

Wasif

@okie you people are still continuing to spam?

okie

yes

two more new account were created

Wasif

what are they

I hope you aren't fake

Also this Lyxal is not fake too

lyxal

07:51

no I'm not

also, you may have noticed the new picture

Wasif

@lyxal yes i've noticed your username change too

Lyxal -> lyxal

lyxal

lowercase letters go brrr

okie

search "www" on Users

Wasif

@okie there is no such user named "www"

but there is a Www

okie

user starting with www

Wasif

07:55

@okie there are 7 such users

you mean two of them?

okie

4 of them now

2 of them are new

Wasif

bruh project

lyxal

*moment

Ftfy

hyper-neutrino

if you have a query you think will give a high amount of spam accounts you can let me know in my office and i can go through it privately with the mod search

though www is only useful in normal search

but i usually only do profile spam cleanup either by going through the new users page after i haven't touched it in a while, or by using queries shared in the TL

Wasif

08:23

wow i have got 16 upvotes for this dumb one liner answer: stackoverflow.com/questions/59613201/…

I can't believe it

Wheat Wizard

08:35

Could I get some feedback on this? I know it's long, but I want to make sure it is crystal clear.

1

A: Sandbox for Proposed Challenges

Challenge Statement The goal of this challenge is to build the 5 state Infinite Time Turing machine that takes the longest to halt. The rest of this challenge is some definitions to help you. Infinite Ordinals In this section I will introduce the concept of transfinite ordinals in a somewhat info...

Also suggestions on how to make it easier to approach are welcome.

Bubbler

08:50

@WheatWizard One or two concrete examples of ITTMs (and how you'd calculate the halting time for those) would be great

And a joke question: Is halting problem solved for ITTMs (I guess it halts unless every state combination has a valid transition)? :P

Wheat Wizard

Non-joke answer: The ITTM halting problem cannot be computed by TMs, even ITTMs cannot solve their own Halting problem.

John Dvorak

CMC: prove in as few words as possible that the halting problem is undecidable

Wheat Wizard

@JohnDvorak A Turing machine that solves it could make the liar's paradox.

Bubbler

The challenge should be called Busy Beaver++ (or Omega Busy Beaver)

Unrelated String

@JohnDvorak I halt? No!

Bubbler

09:04

@UnrelatedString A better version would be "I halt? Yes and no!"

okie

09:26

@JohnDvorak If I halt,dont halt

Bubbler

Unrelated: I've been working on an interpreter for lambda calculus with combinators, and as a test case I managed to write add m n where m and n are Scott-encoded

It feels so good when it works (the interpreter AND the hand-written lambda code)

I decided to not bother with mul, though I'll probably try after the interpreter is complete and I get to solve some challenges in it

A username

09:59

Made myself a userscript to make everyone look like Lyxal.

This is going to be fun.

ophact

10:28

joke challenge: (never to be posted to main) create a function or program which takes in a value and outputs a truthy value if it is truthy and a falsy value if it is falsy. do not take it seriously.

this is [code-golf], so the shortest code wins!

Unrelated String

@ophact Brachylog, 1 byte: m

no values are truthy or falsy, so it always errors instead

A username

10:48

@ophact Javascript, 4 bytes: x=>x

@Neil It's day 8 now

New Main Posts

11:30

-1

Q: Shorter way to write the math.hypot (Python)

I have two points as a list in Python: a=[1,3], b=[5,6]. Using the math library, the hypot formula would be: math.hypot(b[0]-a[0],b[1]-a[1]) Is there any way to write this shorter? (I am using Python 3.6)

Razetime

@ophact Stax, 0 bytes

A username

@Razetime Isn't that "Hello, world!"

Razetime

no that's Stuck, not Stax

Adám

@ophact What if the given value isn't truthy or falsy?

Neil

11:45

@Ausername done

New Sandboxed Posts

12:08

0

A: Sandbox for Proposed Challenges

Implement OADD_MONTHS code-golfdate Introduction The concept of a function to add a month to a date, without overflowing if we reach the end of the month, is implemented in many languages/packages. In Teradata SQL it's ADD_MONTHS, here are some examples: ADD_MONTHS('2021-01-31', 1) => 2021-02-2...

Bubbler

12:44

@ophact You can find a thousand different solutions here :P

Redwolf Programs

Someone give this some upvotes, a new user managed to outgolf both Neil and Arnuald by more than 20%

Also I meant to type out a message last night to say I was going to go since I was tired and had a test today but I woke up at 4:30 in the morning with my face on my laptop keyboard so I guess that didn't work out lol

ngn

@RedwolfPrograms impressive

Razetime

@Bubbler even more here

@RedwolfPrograms wow there some math going on there

ah it borrows from level river St's thing

John Dvorak

13:35

@okie ✅

New Sandboxed Posts

13:50

0

A: Sandbox for Proposed Challenges

Radio station hopping You are listening to a car radio. You are pressing seek up/down, moving you to the next frequency some radio station broadcasts on, to avoid all this pointless music and listen to all the ads, or vice versa. But there is a tendency of these broadcasts to have your radio jump...

Gold Farmer Sprow

On a school laptop for a state biology test lol

When I opened it, the battery thing said it had 4:20 remaining, so I physically cannot fail

rak1507

means you have to try for 69%

Gold Farmer Sprow

(Oh this is a sock btw I don't want to log in on my main acct lol)

@rak1507 That'd be cool, but I'm planning on speedrunning this test

rak1507

who's your main account or do you not want to reveal it

Gold Farmer Sprow

It's a puzzle ;p

rak1507

13:53

I would guess redwolf

Wezl

@GoldFarmerSprow lowercase p!

Gold Farmer Sprow

Why's that?

hyper-neutrino

i feel like redwolf would be on his chromebook lol

Gold Farmer Sprow

It's me lol

Anagram

caird coinheringaahing

~~Is "Gold Farmer Sprow" an anagram of Redwolf~~ Frickin ninja'd

rak1507

13:55

lol it is

hyper-neutrino

nice

Gold Farmer Sprow

Gotta use a school laptop for this test, malware and all

caird coinheringaahing

That's a lot of rep for a sock

hyper-neutrino

+32 from 1 Q go brrr

Wezl

@GoldFarmerSprow ...which is why you don't want to reveal your account details?

Gold Farmer Sprow

13:56

Login details mostly

This thing's almost certainly root cert'd

hyper-neutrino

you love to see it

rak1507

      'Gold Farmer Sprow' ≡⍥{w[⍋w←⎕C⍵~' ']} 'Redwolf Programs'
1

it checks out

Gold Farmer Sprow

I should probably go now, see y'all o/

rak1507

bye and gl

caird coinheringaahing

@hyper-neutrino I've gotten +80 on MM today thanks to that bump :P

hyper-neutrino

14:01

lmao. nice :D

caird coinheringaahing

CMC: Given a unique list of pairs (natural number, non-empty string), output FizzBuzz from 1 to 100, but the divisible tests and the corresponding strings are defined by the input. For example, the standard FizzBuzz would be [(3, "Fizz"), (5, "Buzz")]. The output for [(2, "A"), (3, "B"), (5, "C"), (7, "D"), (11, "E")] would be:

Try it online!

~~Actually, forget that. Imma make that into a challenge~~ Nevermind, it'll just be a rehash of the FizzBuzz challenge

rak1507

tio.run/##SyzI0U2pTMzJT9dNrShJzUtJTfn/qG@qp/@jtgkG/… apl not particularly golfed

hyper-neutrino

14:17

20 bytes in Jelly

poorly golfed

wait hold on

@cairdcoinheringaahing it's not always a single character, is it?

caird coinheringaahing

@hyper-neutrino I have 11 bytes in Jelly, taking the numbers and strings as the left and right arguments

@hyper-neutrino No, any string

hyper-neutrino

@cairdcoinheringaahing oh right that would probably make more sense for io format lol

caird coinheringaahing

It's a CMC, so I'm not particularly fussed about the IO format tbh :P

hyper-neutrino

oh right i can use ȷ2 for 100

caird coinheringaahing

@hyper-neutrino I have 17 bytes to take it in the [(2, "A"), (3, "B"), (5, "C"), (7, "D"), (11, "E")] format, ew :/

hyper-neutrino

14:23

lol

caird coinheringaahing

Managed to get 16 through some register abuse :P

hyper-neutrino

still 20 lol

caird coinheringaahing

@hyper-neutrino Hint: try iterating over each integer, rather than working on the entire list

hyper-neutrino

16

caird coinheringaahing

I've got 11 for taking it as 2 lists, and 14 for taking it as a list of pairs

hyper-neutrino

14:31

is there a convenient built-in i'm missing somewhere lol

caird coinheringaahing

ḍ is quite helpful

hyper-neutrino

ah

another 16

Neil

@cairdcoinheringaahing Charcoal, 20 bytes: Ｅ…¹℅e∨⭆Φθ¬﹪ι§λ⁰§λ¹Ｉι

hyper-neutrino

but i think i know how i can shorten this now

Neil

would be 17 bytes if TIO was up-to-date: Ｅ…¹℅e∨⭆Φθ¬﹪ιＩμλＩι (takes input as a dictionary)

caird coinheringaahing

14:36

Charcoal has dictionaries now? Cool

hyper-neutrino

11, finally

took me long enough lol

caird coinheringaahing

@hyper-neutrino 12, if we're counting the Y :P

hyper-neutrino

;-;

caird coinheringaahing

If not, I've got 10 and 13 :P

hyper-neutrino

sadge

caird coinheringaahing

14:39

Python, 234 bytes :P

hyper-neutrino

i don't see a way to simply remove a byte from mine

does yours just follow a totally different idea

caird coinheringaahing

13 mins ago, by caird coinheringaahing

@hyper-neutrino Hint: try iterating over each integer, rather than working on the entire list

ZippyMagician

@cairdcoinheringaahing 19 bytes in Arn I believe

hyper-neutrino

surely you're not using registers and mutation

Neil

make that 16, I didn't realise that Charcoal's dict keys could be integers (too used to JS): Ｅ…¹℅e∨⭆Φθ¬﹪ιμλＩι

caird coinheringaahing

14:45

@hyper-neutrino No. I'm using ȷ2µ...)Y

hyper-neutrino

i can never figure out how to make ) do what i want

caird coinheringaahing

It basically just means µ€ (i.e. do the previous chain over each element)

hyper-neutrino

how does µ...) even work?

oh wait do you use ³/⁴

caird coinheringaahing

Yes

Full programs ftw :P

hyper-neutrino

that's very nice

is this what you had?

caird coinheringaahing

14:48

Yes :P

hyper-neutrino

nice :P

rak1507

witchcraft

caird coinheringaahing

My 14 byte version is just disgusting: Try it online!

hyper-neutrino

^^ that's just jelly for ya :D

> +/

caird coinheringaahing

Summing strings :P

hyper-neutrino

14:49

on strings? what is this heresy

doesn't that break jelly's type system

caird coinheringaahing

Nope :P

hyper-neutrino

oh wait it just sums the lists together doesn't it

caird coinheringaahing

Jelly has tons of bugs with strings, cause it's implemented in Python

hyper-neutrino

you can use things like unhalve to get multi-character strings which can sometimes result in... interesting behavior

caird coinheringaahing

Try it online!

hyper-neutrino

14:50

i think dennis or someone exploited that for a clever golf at some point

caird coinheringaahing

Try it online!

2 character long Jelly strings have a length of 1 :P

hyper-neutrino

wtf :P

caird coinheringaahing

Another, better one :P

hyper-neutrino

jelly strings are certainly cursed :P

05ab1e's always been overall better with string manipulation lol

i think vyxal easily beats jelly too

which i'm sure has nothing to do with being essentially legal metagolfscript

caird coinheringaahing

> Ṁ Equivalent to having both m and M flags

We heard you like flags, so we put flags in your flags

hyper-neutrino

14:58

what's even the point of that if flags aren't counted lol

i think i'm only going to add flags for I/O-related things. i dislike flag abuse but i hate inflexible/silly I/O requirements more so i'll allow flags to avoid wasting bytes on unnecessary and trivial format-related issues lol

caird coinheringaahing

Is this for a new language?

hyper-neutrino

yes, if i decide to actually make it :P

caird coinheringaahing

Add++ has a large number of flags, but all of them are "separate" and don't really affect functionality in a golfy way. So to use the e, f, i and o flags, you have to do ./add++ -f -e -i -o file.add, rather than ./add++ feio file.add

ಠ_ಠ

hyper-neutrino

./add++ -fe -fi -fo -fum file.add

caird coinheringaahing

CMM: Should reopening also be applicable to questions about the Reopen Votes review queue (used alongside reviewing)?

flawr

16:02

@cairdcoinheringaahing regarding this edit

caird coinheringaahing

@flawr What about it?

flawr

is it a new rule that the tag is not enough?

(to specify the challenge type)

I just would prefer the challenge without that comment

caird coinheringaahing

Sort of. I added it mainly because I noticed the wrong tags while writing up an answer and edited it all together, but if you don't want it, the tag should be clear enough

flawr

hm I updooted ngns answer

while martin's answer has a greater upvote-downvote difference, the ngn answer has a greater upvote/downvote ratio

caird coinheringaahing

I've updooted both tbh :P If the poster is a high rep user and is familiar with the site, then Martin's answer is less applicable. As I said, I mainly just added it in while removing the irrelevant tags

Feel free to edit it out if you want :)

flawr

16:09

well the removed tags would be the second gripe I have with that edit:)

caird coinheringaahing

functional-programming doesn't really apply here

Wezl

I agree with removing those tags

caird coinheringaahing

Just because it was inspired by a common builtin in functional languages, doesn't make it a functional-programming challenge. function is just a bad tag as well, so I thought I'd take advantage of the "bump" from my answer and remove them

flawr

ok I see the point regarding function

but I would say I'd still keep functional-programming as functions like inits are very characteristic of FP

Redwolf Programs

Finished the test in 20m lol

rak1507

16:16

how'd it go

easy I assume :P

Redwolf Programs

Yep

Everyone was done within an hour, I just now realized I'm allowed to be on my laptop now :p

caird coinheringaahing

@flawr I disagree. Pretty much every functional-programming challenge involves black box functions, it's basically a different tag for black-box-functions

Redwolf Programs

I think tonight I'll get my NMetaP and NSP (or NP and SP) bots working, then write a meta post on moving them here

caird coinheringaahing

@RedwolfPrograms While you were gone, this weird "Gold Farmer Sprow" user showed up and started claiming they were a sock. Very weird :P

Redwolf Programs

Hmm, I say we nuke their account :p

hyper-neutrino

16:20

alright, will do /s

Redwolf Programs

CMP: Should NMP and NMetaP be combined into a single bot?

caird coinheringaahing

I don't think Meta is active enough for two bots to be an issue tbh

Maybe if we were getting multiple posts a day there, then it might be better to combine them. But, rn, we haven't had a post on Meta for 3 days, I don't think it'll have so much activity as to overwhelm the chat room with 2 bots

Redwolf Programs

Next CMP: New Sandboxed Posts, Sandboxed Posts, or Sandbox Posts?

flawr

@cairdcoinheringaahing I would absolutely not equate these tags

black-box-functions has a very specific meaning, in that you're not allowed peek inside the function, you may only observe and use input/output

(disclaimer: I created that tag:)

It seems to me that you would like to reserve functional-programming for challenges involving higher-level-functions

is that the case?

(And I don't agree with that either.)

caird coinheringaahing

It's less that "I would like to reserve it" and more "that;s how it's used on the site"

I think pretty much every functional-programming challenge involves higher-level functions in some way, so, even if the meanings are different, that's what it's become to mean

flawr

16:29

Then we should discuss renaming the tag or retagging the questions appropriately

caird coinheringaahing

@hyper-neutrino You also have a Github account called James Smith :P

@flawr Yeah, that seems better than a chat discussion tbh :)

hyper-neutrino

@cairdcoinheringaahing how the hell did you find that :p

caird coinheringaahing

@hyper-neutrino Positron

hyper-neutrino

ah, lol

flawr

I mean higher-level functions are frequently a part of functional programming but they don't have to be, and at the same time they are not exclusive to functional programming, so it seems that these two concepts are orthogonal.

Redwolf Programs

16:30

Apparently James Smith is a very mysterious person, there's a file called about_me.html that's been completely empty since 2016 :p

caird coinheringaahing

@flawr I'm happy to hold off on any more retagging if you'd like to start a meta discussion. You're clearly more knowledgeable about the topic than I am; I'm just going by site usage, rather than what the terms actually mean

flawr

@cairdcoinheringaahing then you're ust exacerbating the problem :P

caird coinheringaahing

@flawr Not intentionally; I thought I was tagging appropriately until this discussion :P

And I'm always in favour of cleaning up the tagging system

flawr

well I first would need to survey the question in that tag a little bit

there aren't even that many questions

caird coinheringaahing

There is also the new open-ended-function tag, "For challenges where an exact output is not required but some property must still be fulfilled."

flawr

16:43

@cairdcoinheringaahing So I just went through all the functional-programming questions, and I think all but two of them actually fit to the topic of FP. There are two that I'd retag to black-box-function instead.

caird coinheringaahing

@flawr Which 2?

flawr

wait we don't actually have a black-box-function tag

or do we?

caird coinheringaahing

No, we don't

But we can create it if no other tag applies

flawr

it might have more uses that the FP-tag

caird coinheringaahing

TBH my biggest hang up is: I'm sure most of the ones tagged with functional-programming relate somewhat to the topic of FP. However, there's clearly a difference between how the tag is used here and the actual topic of FP, as shown by the edit that started this discussion. So it's more, are there questions on the site that relate to FP, but don't fall under the current usage of the tag? If so, what should be done?

For example, the current usage is definitely more "this challenge uses higher order functions", rather than "this challenge relates to FP". Those two overlap significantly, but they aren't the same

flawr

16:48

I have to leave right now but I hope we can pick up the discussion again later!

caird coinheringaahing

Yeah, it'll be a good thing to clear up. o/

Redwolf Programs

27 mins ago, by Redwolf Programs

Next CMP: New Sandboxed Posts, Sandboxed Posts, or Sandbox Posts?

caird coinheringaahing

New Sandboxed Posts

Redwolf Programs

I like the other two more, for two reasons:

1. I can reuse it for the Guild of Reviewers

2. It makes Sandbox(ed) what shows up on smaller screens instead of New for both

caird coinheringaahing

Isn't the current feed called New Sandboxed Posts?

Redwolf Programs

16:54

Yes

caird coinheringaahing

If you're basically replacing the feeds, why not stick with their names?

Redwolf Programs

Well if we're merging the NMPs we'd have change that one's name anyway

ngn

17:20

@WheatWizard tbh, i think it would be lucky if that challenge gets any answers at all

Wheat Wizard

It's definitely not hard to make a valid answer.

ngn

17:35

people of tnb, behold the power of being stupid but persistent:

Wezl

java

ngn

Congratulations, the answer you gave to problem 756 is correct.
You are the 155th person to have solved this problem.

rak1507

nice

ngn

(something wrong with imgur or the "upload" button?)

rak1507

solved in k?

ngn

17:40

@rak1507 no, c

rak1507

aw

ngn

language doesn't matter much here

@rak1507 i did the previous one in k

rak1507

755?

ngn

yes

Wezl

how do you prounouce "tnb" btw

rak1507

17:41

@Wezl tee en bee

ngn

@Wezl ^

Wezl

Hi pajonk

caird coinheringaahing

18:00

> TypeScript, as you may have guessed from the name, is a superset of JavaScript - SE Blog

JavaScript, as you may have guessed from the name, is a superset of Java

hyper-neutrino

ಠ_ಠ carpets, as you may have guessed from the name, are pets owned by cars

Redwolf Programs

Pencils, as you may have guessed from the name, are a superset of pens

Actually I guess that's sort of true, they can both write and erase

flawr

functions, as you may have guessed from the name, are fun

Wheat Wizard

> Typescript, as you may have guessed from the name, is a superset of Purescript
> Purescript, as you may have guessed from the name, is a superset of Applescript
> Applescript, as you may have guessed from the name, is a superset of Actionscript
> Actionscript, as you may have guessed from the name, is a superset of Clojurescript
...

caird coinheringaahing

Just one > at the start of the message for a quote

Wheat Wizard

18:06

Yeah but I wanted to start multiple quotes not 1.

caird coinheringaahing

Don't think SE allows that in a single message :/

Wezl

> Wezl, as you may have guessed from the name, is a superset of Lyxal

Wheat Wizard

Yeah that's why I left it that way.

flawr

@cairdcoinheringaahing I feel the tag is used appropriately, in my opintion the challenges that use that tag seem to relate to FP. The fact that some of them use higher-order-functions is ... a side effect.

pajonk

@Wezl Hi Wezl

flawr

18:23

@cairdcoinheringaahing I would propose keeping the FP tag as it is, and maybe consider creating a new higher-order-funciton-tag

Wheat Wizard

Yeah, I think FP may be a bit overused but it is still a useful tag.

Redwolf Programs

18:51

Ash would have gotten 9 bytes on this, beating 05AB1E by 3. No Jelly answers for me to compare against.

Wait no

11 bytes because it's sequence

hyper-neutrino

FTFY

jelly, 11 bytes

one of the few answers where an RTL jelly explanation could make sense

LTR would be equally valid. maybe more understandable, idk.

caird coinheringaahing

@RedwolfPrograms Jelly answer

It's longer than HN's tho :P

Redwolf Programs

Oh I missed that lol

hyper-neutrino

wait how does that work

Redwolf Programs

Also for some reason my Ash program causes an infinite loop in the interpreter despite...not using loops (?)

hyper-neutrino

18:58

oh he used dyadic chain

am I using features not existent in 2016?

i find it unlikely i could so easily outgolf jonathan allan, though granted it was 4+ years ago and he's definitely improved a ton since then too

caird coinheringaahing

It looks like the chaining bit was the problem

hyper-neutrino

oh wait, Ɗ is new (although $$ works)

caird coinheringaahing

The 1 is completely extraneous, and the only reason he used Ç is because the helper link is broken into chains

hyper-neutrino

rip no chain nesting, lol

New Main Posts

19:13

0

Q: Output the Bee Movie script

I know, it's an old meme, but I wanna see y'all try anyway. Output all of the text at this Pastebin link. Use as few bytes as possible. https://pastebin.com/raw/Z9WHGMr5

code-golf kolmogorov-complexity

caird coinheringaahing

19:28

@hyper-neutrino $$ doesn't work. 1,2,1 monadic links (grouped by Ɗ) is different to a 1,(2,1) monadic link, where the (2,1) link is monadic

hyper-neutrino

oh

wait why lol

does Ɗ do grouping/chaining differently from the regular monad chaining rules

caird coinheringaahing

Because S,PƊ is parsed as one link (S,P), but S,P$$ is parsed as (S(,P))

hyper-neutrino

would 1,2,1 not chain as 1 - 2,1 under monadic rules normally?

caird coinheringaahing

No, it chains as S(v) , P(v) with Ɗ, but S(v) , P(S(v)) with $$

hyper-neutrino

never mind

i'm stupid

caird coinheringaahing

19:31

Before Ɗ and Ʋ, understanding chains was so much more important to good golfing :P

hyper-neutrino

it chains as v = S(v); v = ,(v, P(a)) normally but v = S(v); v = (,P)(v) = ,(v, P(v)) with $$

pxeger

fun fact:

hyper-neutrino

forgot that 2,1 calls on the left argument in a normal link but grouping it with $ makes the "left argument" the active value

caird coinheringaahing

That is a fun fact :P

hyper-neutrino

well.. . . ¯\_(ツ)_/¯

caird coinheringaahing

19:33

Also, pxeger left before telling us the actual fun fact :P

pxeger

I thought it would be funny to leave you all in horrible suspense

Please tell me whether it was actually funny

hyper-neutrino

same energy :p but slightly shorter time frame

ZippyMagician

"featured on ifunny.com"

pxeger

btw there is no fun fact

...or is there?

no

jk

unless...?

hyper-neutrino

there is surely a fact, in which case whether or not it is fun is subjective

pxeger

19:35

Nope. There are no facts whatsoever. And that's a fact!

caird coinheringaahing

@hyper-neutrino The very first tweet should've been something like this, and then, just before the site dies, the final tweet should complete it :P

Redwolf Programs

Gonna go take my math final now o/

pxeger

\o

caird coinheringaahing

gl, have fun \o

hyper-neutrino

gl don't fail

caird coinheringaahing

19:37

Remember, 2+2=5

2

hyper-neutrino

in the definition of "exponent" in google translate ಠ_ಠ

it works fine in google itself but not under translate

pxeger

"23 = 2×2×2" - Google, a $1.6Tn company

@hyper-neutrino missing matmul contains getitem setitem delitem getattr setattr delattr get set delete iter next len await aiter anext enter exit aenter aexit...

Would probably be better to generate them dynamically using members of the operator module

hyper-neutrino

what on earth are enter and exit

are the a-iter / a-whatever async version?

also lol there was definitely a smarter way to do it but i was too lazy

it was for the memes anyway

pxeger

enter / exit are for context managers, i.e. with ... as ...:

caird coinheringaahing

~~enter and exit are for with statements~~ Frickin' ninja'd

pxeger

19:50

a are async, yes

Python quiz: what do get set and delete do?

caird coinheringaahing

get sends a GET request, set creates an empty set and delete is fancy del

Wezl

@pxeger those are words you use when you say "get ready, get set, delete python"

3

pxeger

lmao

@cairdcoinheringaahing unfortunately no

caird coinheringaahing

@pxeger I'm shocked, shocked! Well, not that shocked

pxeger

Side note: currently listing to the SMM2 OST and I must say this is an absolute banger

caird coinheringaahing

19:53

1000! > 1000 ** 1000 right?

pxeger

no

1000! = 1000 * 999 * ... 1000 times but 1000 ** 1000 = 1000 * 1000 * ... 1000 times

Nobody answered properly, so I'll tell you: they're descriptors, and they're called when the object is looked up/assigned/deleted as a property of another object, and are used to implement methods, classmethods, staticmethods, properties, and ORMs

hyper-neutrino

python is too wack, i only understand like half or less of __ functions and how to actually use them lol

caird coinheringaahing

TBF most of the dunder methods are supposed to be for internal use

pxeger

Python is like if someone looked at Ruby, said "no that's too logical" and then had an epileptic fit

caird coinheringaahing

I remember reading an SO answer that basically said "If you're writing dunder methods, you're doing it wrong"

pxeger

19:59

@cairdcoinheringaahing no, not really

If you're calling them directly you're doing it wrong

Writing them is kind of the whole point of Python

How would you write classes without __init__?

ngn

@pxeger python is older than ruby

caird coinheringaahing

Well, obviously a couple are supposed to be used :P

A username

Tkinter is a pain.

caird coinheringaahing

__init__, __call__, __repr__ and __str__ are pretty much the only ones tho

hyper-neutrino

obviously using global make-instance functions

caird coinheringaahing

20:02

If you're using a dunder method to try to make CustomObject(*args) ^ CustomObject(*args) defined, your code is likely to be much more readable if you just use a .method call instead

In other news, I can't spell :/

Redwolf Programs

Finished my math final

caird coinheringaahing

How'd it go?

Redwolf Programs

I spent longer on that 11 question test than my entire 58 question state biology test lol

Hopefully well, I checked my work where possible

rak1507

20:16

what was the content

Redwolf Programs

Some trigonometry, one question about derivatives, a bit about polar and parametric graphing

Wezl

TIL wikipedia has keyboard shortcuts

caird coinheringaahing

I'm drafting an idea for an answer-chaining, but I don't think the style of answer-chaining has been done before, so I'd like some general feedback. Essentially, the answers each complete one isolated "step" in an overall process (e.g. outputting a text line-by-line). There are a finite number of steps, so the chain will always end after \$n\$ steps. Each answer has a score (e.g. code length) and the user at the end with the best combined score (sum, average, whatever) wins

The "task" of the \$x\$th answer will always be known beforehand, as it doesn't depend on the \$x-1\$th answer, but the answers individually are "meaningless" until you put them together to produce the final result

Wezl

20:31

sounds like some of the strategy would be choosing when to answer

caird coinheringaahing

Yes, it probably would

Is it a bad idea? Is it an answer-chaining challenge? The fact that they don't depend on each other makes me less sure

Redwolf Programs

You'd probably need to be more specific about the task and scoring, at the moment it doesn't seem like it'd work well on its own

caird coinheringaahing

I've got a task and scoring in mind, and I'm drafting it now. It's more "broad picture, could this work?"

If not, I'll just discard my draft

Redwolf Programs

Turns out building a (good) text editor from scratch in HTML is a lot harder than it seems

Transcript for