Sandbox posts last active a week ago: Simulate weathering

@hyper-neutrino Why my avatar is not changed on Chat stack Exchange but Stack Exchange?

caching

just reloaded it now

It's changed now

@hyper-neutrino How you reloaded me?

using the button that reloads your profile

Obligatory shouldiblamecaching.com

@Fmbalbuena Mod superpower

@user Mod superpower, thanks to JS it has reload() bulit-in

I uploaded PGM and PBM versions of the roboto mono characters

Any last minute feedback on Recognize a Roboto Mono character?

Looks good, and looks like you got another necromancer :P

(Or will when the script runs)

This is every color PSIF can represent (PSIF-24, at least)

What does the 24 stand for?

24 hues

PSIF-48

Here's a PSIF-48

You can see the variation in darkness/saturation isn't as good, but there's more colors to pick from

And here's a PSIF-12, which would give you very few colors to work with, but a large number of variants of them

PSIF-12

It's slightly more complicated than just PSIF-12 vs. 24 vs. 48, since you can also change the types of variations from saturation-heavy to darkness-heavy, but I went with a sensible default for these

I'm going to try to convert an image to PSIF-24 now, to see how bad (or good?) it looks

Convert Rick

Hmm, okay

Good

Is this a big-brain move to make Redwolf rickroll himself voluntarily or just you liking that meme?

It'll take me a little while to get the converter working though, so in the meantime you can listen to some music

@user the latter and accidentally the former

If I ever make a company, I'm gonna put that music on whenever someone's on hold :P

Cool language: Lobster. Looks a bit like Python, but it's statically typed and stuff

peeks

the colon blocks as lambdas thing is kind of weird to look at but also kinda neat

@sporeball hello there

hello there

sporeball in TNB?!

There is nothing wrong with your television set. Do not attempt to adjust the picture.

What if I adjust it anyway

(⌐▨_▨)

...that's a lot of builtins

Half of which are overloads

like most of this shouldn't even be in the standard library, much less the global namespace

(i'm assuming they aren't in contained namespaces from all of the prefixes...)

> any(xs:[any]) -> int returns wether any elements of the vector are true values

> wether

Hmm yes

Gosh dang it. It always look like you've sent two messages when it's just one with a newline

lmao

i think there's a subtle line spacing difference

I go to click on what looks like the second message and it selects the whole message

@UnrelatedString very very subtle

it's obvious when you have them to compare but i'm not sure it stands out in isolation

Can confirm

Hmm yes thank you SE for sending my edit as a new message

Very helpful

10/10 functionality

Couldn't have asked for anything better

Top notch quality right here on se chat

/s

Okay, after some testing, I've confirmed my expectation that PSIF does not work well with photos of real stuff

Comparing it to normal 8-bit color, it's actually hard to decide which is better

Normal rrrgggbb gives a very odd looking image because the color feels off, but in less saturated areas (which are, big surprise, common in photos of real stuff), it looks much better. The color feels much more vibrant (and correct) with PSIF, but in certain areas it defaults to grayscale or some other similarly bad choice of color, making some parts look quite unnatural

Basically, it's exactly what I'd expected. Great qualities for pixel art, where it's typically brightly colored and sudden changes in color/darkness are common, but not great for images, since things like faded greens/blues/reds, browns, and other colors PSIF isn't good at show up often.

If you look at this wheeled llama in 8-bit color, you can see what I mean:

8-bit llama

The sky especially feels really weird and unnatural. Compare that to the PSIF one:

PSIF llama

The sky looks bright and sky-like, whereas much of the ground becomes gray due to its low saturation, and the llama (which is brown) is badly colored since brown is a lower saturation color

@RedwolfPrograms haha wheeled llama go brrrrr

Oh hang on this is embarrassing

Saturation wasn't implemented right in the PSIF converter

ohmygod the llama is b e a u t i f u l

That's with 256 bit color, PSIF-12-6

Comparing it to the 8-bit llama, there is no competition. Maybe aside from the mountains in the background, but the 8-bit one's color is totally wack, while this one looks almost identical to the original color-wise

And this is PSIF-12, so the sky and ground color's nowhere near as accurate as it could be (I'm worried PSIF-16 or 24 will discolor the llama's fur)

14k!

gamer.

@UnrelatedString the point of the language seems to be making it easy to make games, so having lots of builtins makes sense (that said, some of those are…questionable)

ah

@Bubbler I look forward to it!

CMQ given a dict d, how can you compute the key, value pair with the max absolute value for the value in a golfy way in Python?

@RedwolfPrograms I'm much potat, I meant 8-bit color lol

256-bit color seems a little much lol

oh yeah the :: dump-properties-into-scope thing seems kinda questionable as implemented there but i feel like it might not be a bad idea to have something similar to it

like how rust lets you use enums

Help please :)

@Anush Not a python golfer, but I'd imagine sorting the entries in the dict and taking the first is shortest

sorted(d.items(),key=lambda x:abs(x[1]))[-1]

@hyper-neutrino thanks!

@RedwolfPrograms just like you said :)

I was trying to do it with max, maybe that is possible

Y;all python users must think you're so great, with your "reasonable sorting function" and "reasonable array indexing" :p

max(d.items(), key=….) ?

oh wait yeah i'm dumb

there is literally never a reason to do sorted(a,key=b)[-1] because that is just max(a,key=b)

or sorted(a,key=b)[0] because that's just min(a,key=b)

Emoticon proposal: ._o/

Throwing either a ball or a grenade

got caught up with redwolf's idea and for whatever reason i just thought max/min wouldn't be able to do that

Your answer made me realise what to do so thank you

It's tired here, and I'm late. See y'all tomorrow ._o/

imagine sleeping at a reasonable time

anyway i'm tired abnormally early today so i'm going to sleep too o/

o/

No one should sleep here! Bring on the robots :)

@cairdcoinheringaahing For this answer, is it allowed to post another 7-byte solution as by current rules that one is 5 bytes?

No

Ok :P. Is there an easy way to find untaken bytecounts?

Yeah, the snippet in the question

ಠ_ಠ I did not see that :P

@emanresuA Think, how would that even work with the idea that each byte count and sequence must be unique?

¯\_(ツ)_/¯ Just asking

I believe 163 bytes is the lowest untaken byte count btw :P

Ok, time to recursively implement exponentiation in Vyxal :P

@emanresuA I have a 13 byte lambda which does x**n where n >= 0 and n is an integer

Also, 0**0 is 0 with that implementation

Try it Online!

@lyxal No it isn't :P

ಠ_ಠ

Also what I meant was to recursively implement exponentiation, based on multiplication, based on addition, based on incrementation.

And I was thinking about doing the whole thing with Church Numerals :P

Why does this show 24 hours ago, and not 1 day ago?

Because timezones = bleh

hold on wait a fuckin minute

now it says 23 hours, on the starboard

Maybe they moved their servers to somewhere in the middle of the Atlantic?

and it's back to 24

@cairdcoinheringaahing Wrong, it's 0 bytes. Too bad Add++ already took A000004 :P

Would a 0-byter be valid anyway?

When vscode tries to parse base64 as CSS

@pxeger Are you against freehand circles?

Do ccgc people understand charcoal well enough to port codegolf.stackexchange.com/a/237287/98590 ?

@emanresuA my screenshot app does not have sufficient variety in freehand drawing tools, so I am unfortunately forced to use rectangles

Linux doesn't have a paint like application available?

CMC: Given a regex and a string, return a Boolean vector with one bit per character in the string, indicating which characters form part of a non-overlapping match.

E.g. \d+ and Hello4the42 gives 0 0 0 0 0 1 0 0 0 1 1

@lyxal gimp?

@Adám what does f("aaa", "baaaab") return, as the match overlaps?

0 1 1 1 0 0

>>> ".".isdecimal()
False

Thank you python very cool

and before you say that "isdecimal is supposed to check for decimal numbers", yes.

>>> "3".isdecimal()
True

I know that.

but here's the thing

>>> "3".isnumeric()
True

so then why tf do we have isdecimal if it doesn't actually tell you if it's a decimal

and just for reference:

>>> "3.4".isdecimal()
False

also

>>> "3.4".isnumeric()
False

truly a wonderful language

even though there's a SO question that details the differences, I still think it's kinda stupid

hmm yes thank you pytest very cool

okay so I'm running testing and using print inside my testing functions right

and I have something that looks like this:

 x = simplify(x)
 print(x, type(x))

now for some reason (and this is fine btw) it's erroring in simplify

that's what I'm trying to work on finding out

but for some reason, it still decides to execute the line after the error

and it gets better

the output from the print that really shouldn't be executing is:

-1 <class 'int'>

which is just the data being passed through the test case and its type

now here's the fun part

TypeError: 'cos' object is not iterable

that's being thrown from inside simplify

even though it's told me that x is of type int, it's saying it's also of type cos (sympy objects, but ignore that for now)

gosh dang python and its modules are weird sometimes

Would that make a fun challenge?

Add two numbers by adding two arrays?

@AncientSwordRage that's somewhat a duplicate of codegolf.stackexchange.com/q/20996/78850

Like a strict subset

@lyxal hah nice

@PyGamer0 Are you fan of Pygame or Python?

@hyper-neutrino Reload my profile picture, I fixed a little bug of my profile pic.

Works sorry.

Try it online!

@Fmbalbuena i never have used pygame

its too hard

i use pyglet

@PyGamer0 hey i suggest using only e, x, c, (, ", %, 1, + and )

@Fmbalbuena how?

i took the chars from this

so its TC

wait

its a converter

converts python programs to a limited charset

which is proven to be tc

like exec("%c%%c%%%%c"%1+1+1+1+1+1+1+1%1+1+1+1+1+1+1+1+1+1%1+1+1+1+1+1+1+1)

%c converts number to char

thats cool

can you recreate?

i see no reason why that would work

nvm, I just realized what you're doing, but you need brackets

get edit ninja'd myself

that's pretty clever

but yeah just add brackets but that's quite cool

why

whY

ok why did that message get short

cuz you're trying to exec for i in range(10): without something following it

CMC: Do nothing, ten times.

@hyper-neutrino oh i am dumb

@Adám yes, BF: ``

python: 0bytes, ``

I know it has unobservable requirements, hence a CMC. But you have to actually do nothing ten times. You can't just do ten times as much nothing and only do it once.

E.g. in APL: {}¨⍳10

Let's say like this: It is similar to a quine where there has to be a place one could in principle insert a payload (here: work), and if so, it'd be done 10 times.

for x in" "*10:0

Ah, there we go!

Try it online!

^there we go

tio.run/##K6gsycjPM/7/…

^ it woks

What is this, P*thonFuck?

that can be golfed a lot

@hyper-neutrino i am not golfing it lol

@PyGamer0 Try it online!

@hyper-neutrino that hurts my head

@Fmbalbuena no, no, NOOOO

recursion which doesnt halt, NOO

@PyGamer0 The max recursion is 999

in python

@Fmbalbuena lets increase it

to Infinity

According to sys

@Fmbalbuena why is your pfp Add++

just Add++

@PyGamer0 Nope Try it online!

@PyGamer0 Because i like Add++

@Fmbalbuena why not And++, or Or++ :p

@PyGamer0 Add++ is programming language

@PyGamer0 Maybe Sharp#

@Adám The more PythonF*** is Try it online!

CMQ: Why +[] evaluates to 0 in javascript

because unary + turns things into numbers and [] is converted to 0 because JS is weird

now, given that [] becomes 0, you'd think [] is falsy and ![] would give true, right? wrong - it gives false, because again, JS is weird

CMQ: Is there way to get "c" (lowercase) in jsfuck

@Fmbalbuena [][(![]+[])[+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[+!+[]]+(!![]+[])[+[]]][([][(![]+[])[+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[+!+[]]+(!![]+[])[+[]]]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[+!+[]]+(!![]+[])[+[]]])[+!+[]+[+[]]]+([][[]]+[])[+!+[]]+(![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[+!+[]]+([][[]]+[])[+[]]+([][(![]+[])[+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[+!+[]]+(!![]+[])[+[]]]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[+!+[]]+(!![]+[])[+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]]((!![]+[])[+!+[]]+(!![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+[]]+([][[]]+[])[+[]]+(!![]+[])[+!+[]]+([][[]]+[])[+!+[]]+(+[![]]+[][(![]+[])[+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[+!+[]]+(!![]+[])[+[]]])[+!+[]+[+!+[]]]+(!![]+[])[!+[]+!+[]+!+[]]+(+(!+[]+!+[]+!+[]+[+!+[]]))[(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[+!+[]]+(!![]+[])[+[]]])[+!+[]+[+[]]]+([]+[])[([][(![]+[])[+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[+!+[]]+(!![]+[])[+[]]]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[+!+[]]+(!![]+[])[+[]]])[+!+[]+[+[]]]+([][[]]+[])[+!+[]]+(![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[+!+[]]+([][[]]+[])[+[]]+([][(![]+[])[+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[+!+[]]+(!![]+[])[+[]]]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[+!+[]]+(!![]+[])[+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]][([][[]]+[])[+!+[]]+(![]+[])[+!+[]]+((+[])[([][(![]+[])[+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[+!+[]]+(!![]+[])[+[]]]+[])[!+[]+!+[]+!+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[+!+[]]+(!![]+[])[+[]]])[+!+[]+[+[]]]+([][[]]+[])[+!+[]]+(![]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[])[+!+[]]+([][[]]+[])[+[]]+([][(![]+[])[+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[+!+[]]+(!![]+[])[+[]]]+[])[!+[]+!+[]+!+[]]+(!![]+[])[+[]]+(!![]+[][(![]+[])[+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[+!+[]]+(!![]+[])[+[]]])[+!+[]+[+[]]]+(!![]+[])[+!+[]]]+[])[+!+[]+[+!+[]]]+(!![]+[])[!+[]+!+[]+!+[]]]](!+[]+!+[]+!+[]+[!+[]+!+[]])+(![]+[])[+!+[]]+(![]+[])[!+[]+!+[]])()(([][(![]+[])[+[]]+(![]+[])[!+[]+!+[]]+(![]+[])[+!+[]]+(!![]+[])[+[]]]+[])[!+[]+!+[]+!+[]])

@Adám tio.run/##7VTBCsIwDP2W3BqK/…

@Fmbalbuena That's a "c", no?

or this Try it online!

tio.run/##7VjLcsMgDPwWbjBMvkjDIZPm0B7aTtvJ7zu4NgSELSsudtxYF4/…

CMQ: Why []+[] evaluates empty string?

@Fmbalbuena + is overloaded to concatenate strings.

If something isn't a string, JS makes it a string first.

Why [] + [] = ""?

JS is too weird

Indeed.

@Adám is there division in jsfuck

[] gets converted to "" as a string so ""+"" is ""

similarly, [1,2] + [3,4] will be 1,23,4

I am tempted to ask a fastest-algorithm question which isn't too hard. Is that ok?

I mean maybe someone will just give the fastest possible algorithm quite quickly

hi @Fmbalbuena

hi @alephalpha

what a fun way to convert names to dates?

E.g what date is Mary?

what *is a

@Anush Sum of Unicode code points, mod 365 :P

I'm tempted to create a challenge that is the opposite of restricted-complexity: "Answers must not be any faster than O(f(x))" (for some function f to be decided at the challenge)

that is still restricted complexity, just bounded on the other side :P

Yeah, but there are too many challenges that require fast/efficient answers :P

"Opposite" meaning "opposite to the normal definition" :P

fair enough lol

@NewlyFeaturedPosts CMC: This, but without restricted-complexity

@cairdcoinheringaahing something you can do in your head with ascii names

@cairdcoinheringaahing how many are there??

I thought I was the only one :)

CMQ A method for converting simple names (e.g. mary, david) into dates that can be done in your head with a bit of effort, or at least quickly with a pencil and paper

@Anush IMO, one is too many. I'm not a fan of any of the restricted- classes of challenges

@cairdcoinheringaahing that's just mean :) I mean we could all say that about all the tags. Don't you believe in coding diversity??

It's not mean, I have nothing against people posting them, I just dislike the challenge concept as a whole

@cairdcoinheringaahing I have similar views about most tags here :) But why do you dislike it? I love them as they force more interesting answers than dumb brute force

you have to think of a clever solution that is e.g. both short and fast

@Fmbalbuena Not sure what exactly you're asking JSF is more an encoding than a language, no?

I believe that challenges should avoid unnecessary complications (e.g. requiring handling float inputs when integers, or even naturals doesn't change the challenge), mainly because they're done in an effort to make a "boring" challenge more interesting. To me, restrictions on time, speed, memory etc. are the same - challenge authors include them in an attempt to exclude "boring" solutions. If your challenge is only interesting by adding more complexity, it was never interesting

but speed == simplicity not complexity!

take a randomized linear time median finding algorithm

fast and simple

I have nothing against "boring" challenges (hell, I author a lot of them), but I dislike it when people invalidate languages/approaches/whatever in a futile effort to make their challenges less "boring"

what's your opinion on fastest algorithm

@Anush I have never seen a challenge where a faster solution is more "simple" than a slower one

@hyper-neutrino I don't have one, beyond "I don't compete in these"

@cairdcoinheringaahing I think I mean elegant not simple

@NewlyFeaturedPosts Such an Anushi chaallenge.

@Anush Personally, I think my two 9 byte Jelly answers to your rank/unrank challenge are more elegant than some hacked together approach that aims to meet the complexity restriction

@cairdcoinheringaahing each one to their own, said the woman as she kissed the cow :)

I don't know why you call elegant algorithms hacked together

I'll have you know, my bovine husband is very attractive :P

do you prefer "choose all permutations and check which one is sorted" over quicksort?

@cairdcoinheringaahing :)

@Anush elegance is simplicity for me, and "fast" programs are almost never as simple as short programs

@Anush I prefer to abstract that away into a builtin, because it's trivial

@cairdcoinheringaahing to me "choose all permutations and check which one is sorted" is immensely ugly

like going to a dance in a tank

@cairdcoinheringaahing someone has to make the builtins!

although if the tank is driven by a married cow... :)

@Anush Yes, but I reject the idea that "implement this function, that every modern language has as a builtin" makes for an interesting challenge

@Anush that is more complex, less efficient, longer, and less elegant, going again both of your ideals so i don't know what point you're trying to make here

@hyper-neutrino that quicksort is more elegant and more fun to implement than "choose all permutations and check which one is sorted"

A better option would be your most recent challenge. My Jelly approach (generate all lists, filter, index) leads to a much more elegant (in Jelly) approach than trying to meet the constraints on complexty

fair enough. i think both are uninteresting but to each their own

^

Sorting is no longer interesting, and hasn't been since the 80s

@cairdcoinheringaahing I don't mind that you love that. And it is fun that jelly exists. But it would be even cooler if you could make the code fast

@cairdcoinheringaahing not quite true.. see timsort

Fair enough. Sorting hasn't been interesting since I've been alive

epubs.siam.org/doi/abs/10.1137/…;

are you < 3 ? :)

No, I just don't find that interesting

well..

that's ok.. I respect you anyway

what did you say your view was about fastest-algorithm?

we should have a challenge for implementing adaptive shivers sort!

But, I feel like we're missing my key point: if you post a "create a fastest sorting algorithm" challenge, scored by fastest-algorithm, I'll just ignore it, because I don't find those interesting. If you post a "sort an array" code-golf challenge, with restricted-complexity, I'll be annoyed, because I can post a code golf answer to that, but it's immediately invalidated unless I can also demonstrate it meets some arbitrary complexity restriction, and that annoys me

Same as if a challenge requires me to handle weird edge cases (say "divide two inputs. If the second is zero, output Nope instead"), it annoys me, because it's made itself unnecessarily complicated

@cairdcoinheringaahing sorry about that. I guess I am in a reverse situation. If you post a fastest-algorithm question I am immediately interested. If you post a code-golf question I am annoyed as I can't code in jelly etc and I can't stand the dumb algorithms that will be used

this is why diversity is a wonderful thing :)

same for fastest-code

I think we do agree that challenges where every answer is just a port of another one are boring tho

I don't mind that too much. It's fun to see what you can do in each language. So if jelly is 5 bytes and python is 45 that's interesting

but if the method is interesting the person who did it first should get the credit

but not if it's a dumb brute force algorithm ;)

The best challenges are those where: the challenge doesn't just describe some transformational method, answers have to figure out their own methods; those methods can compete with each other - there isn't always a single best approach; multiple methods can lead to impressive breakthroughs, leading to insanely short answers

it's worse for fastest-code because people don't seem to take seriously that the competition is per language

I would love to see jelly answers for fastest-code competitions

@Anush Whenever I post a "dumb brute force" answer, I try to make the "clever" part of it be the golfing

Sometimes tho, that doesn't pan out

that's cool

But just because something is brute force, doesn't mean it can't use nice tricks

I am still trying to golf my python code!

I woke up this afternoon and saw this challenge, and got annoyed, cause I was literally about to write up and post a challenge about orders :/

hmm. I want to ask a fastest algorithm question now but it is very close to my current challenge :(

@cairdcoinheringaahing great minds!

maybe I can change my bounty to be for the answer with the best time complexity?

even though it's a code-golf question?

maybe that's naughty

You can award the bounty to whatever answer you want

thanks! I would have to add a note to the question to warn people

note added

no one answered since the bounty has been added so that should be ok

Good call not addding a description to the bounty, cause you can't edit those after the bounty starts :P

I learned that at some point :)

@Adám Jelly, 4 bytes ` µ⁵¡`. The leading space is significant

Alternatively, Jelly, 4 bytes ¶Ç⁵¡

wait, what does the space even do there o.O

Nothing, I guess.

Just like the empty chain.

Having an empty chain causes ¡ to think it only has one link (⁵), so it tried to read from STDIN for the iteration count and fails

So the space forces the chain to be non-empty

but just having a lone space doesn't count as an empty chain?

interesting

Try it online! nope