@thejonymyster no, != is. ^=, at least in Poetry versioning, means "any package with a version number that is not different from the left-most non-zero digit in the selector" and is used to, say, select only versions of a package with a major version of 1. The selector in the example would allow foo versions 1.1, 1.0.1, 1.1.2, and so on but not 2.0 or 2.1.0.
An alphadrome is a word in which each letter in the first half of the word "reflects" its alphabetical "opposite" in the second half of the word. Write a program or function that returns truthy if the given word is an alphadrome and falsey otherwise.
For example, BEEB is a palindrome. Its first l...
@Seggan Okay, so this works (prepend the product of a list plus 1 to the list), but then when I try to use it with G I get weird results. Am I doing something wrong with G maybe?
Ohh, I think I know
The function as written has arity 2, not arity 1
Hmm, but adding explicit x at the end didn't solve anything.
A Night at the Flip-Flopera
code-golf
Ruby has a strange operator, .., called flip-flop (not to be confused with the range operator, which looks the same). Used in a loop, flip-flop takes two conditions as operands and will return false until the first operand is truthy, then return true until th...
If I use x twice, does it refer to two different inputs? I tried 'J}rxx thinking it would coerce the function to only have one input, but it didn't work.
@py3programmer nibbles: a nibble is half a byte, each command is stored as four bits rather than the full 8 bits (which would be a byte)
same goes for HBL and risky, i believe
fig is more complicated
i dont remember why it works the way it does, but the gist of it is that instead of there being 256 possible bytes, theres... 96? so the amount of data needed to store each is a fraction of that. which is determined by... math
its a little over my head
in general: if each token has a lower number of possible values, the amount of information needed to store the specific value of that token is less as well. In a language that only works with 1 and 0, you only need 1 bit per command, rather than full bytes.
@py3programmer Relevant meta post. Although some of the implications weren't discussed very fully there, I think, and maybe we need more meta discussion on the subject.
@Steffan Iterate is G (but see my conversation with Seggan above for some caveats)
Hello people in the future, I see LYAL has started. As I am probably not here, I'll quickly explain scoring to you. You see, Fig only uses the 96 printable ASCII characters (not including tab). How is it that it is so golfy, you ask? Well, on the basis that you can theoretically make a computer architecture using any log_256(n) bytes, Fig is actually scored in irrational bytes. A Fig "byte" is just big enough to contain the 96 characters. Therefore, any Fig score is nlog_256(96).
"steffan" and "seggan" have a Levenshtein distance of 3, which is definitely less than 0.05 and therefore significant, which therefore means that they are one and the same
because my models of computation professor just cited it as an example of a programming language that isn’t best described with a context free grammar but it seems like a weird choice because of that lmao
i actually mentioned “probably some forth derivatives” and i’m not entirely sure he knew what i was talking about
also he seemed to think it was made by google when it is literally five years older than google
@UnrelatedString I don't remember the details, but I believe so. Something about a token parsing differently depending on whether it has previously been declared as a function or not.
Prime factor power sorting
Background
We will introduce a new way of writing numbers where the digits represent powers of primes starting with the largest prime factor of the number, and ending with the power of 2 in the prime factorization. As an example, 2 = 21, so it would be written as 1. Sli...
We have a number of tasks involving this sort of encoding scheme for integers, and we likely already have a task for this sort of list comparison. It's not a dupe, but I'm not sure how interesting a mashup of two already done ideas is.
also reminds me a while back my operating systems professor was on an aside about the naming of the elf binary format, and when i mentioned ais working on nethack4… it turned out he’d never heard of nethack
This is cheating, but we can use $\dfrac{z+\bar{z}}{2}$ for the real part, and
$\dfrac{z-\bar{z}}{2i}$ for the imaginary part.
Here $\bar{z}$ is as usual the complex conjugate of $z$.
The function that takes $z$ to $\bar{z}$ is not differentiable. That puts some limitations on the kind of aux...
You could stringify the underlying symbols (sum(pow(-2, 1 / 2), pow(2, 1 / 2))), or get an approximation of the real and complex parts (1.141 + 1.141i)
But neither of those lets you find the real part as a symbol
I'll just include complex conjugate as one of the basic operations
I currently have: sum, product, pow, log, some trig stuff, factorial, and complex conjugate
Every other operator I can think of can be implemented either using those, or loses enough information that you no longer need to keep track of the origin of the number (e.g., rounding)
I was working on a challenge which I split in half. 10 minutes ago I thought to myself "Phew, at least that was the hard half, now I just have to do the easy part", and now I'm starting to think that not only was that not the "hard" half it wasn't nearly half of the total challenge. ;__;
My parents noticed that shell scripting had a distinct lack of innovation circa 2005, so they invented ryantosh, short for ReallY AdvaNced Totally Ordinary SHell
Fig, \$19\log_{256}(96)\approx\$ 15.639 bytes
#jej/ #GWW1O'+Jx0J0
Try it online!
This is cheating, but we can use $\dfrac{z+\bar{z}}{2}$ for the real part, and
$\dfrac{z-\bar{z}}{2i}$ for the imaginary part.
Here $\bar{z}$ is as usual the complex conjugate of $z$.
The function that takes $z$ to $\bar{z}$ is not differentiable. That puts some limitations on the kind of aux...
