@DLosc there's no label--ᶠ works over choice points and has no special relationship with constraint logic
@Seggan absolutely; it's very useful in and of itself, doubles as and over a list of booleans, and isn't necessarily the same as reduce by multiplication depending on how your reduce handles empty lists (product of an empty list should be 1)
i certainly hope they don't, it'd be such a waste of space to have every chinese and japanese character separate when there's at least a few thousand overlapping (i think) :P
Challenge Given an array in any suitable format, create a frequency table for it. i.e: Pair each unique element with the number of times it appears in the array. You can return...
dude when i type in a backslash into GeoGebra it works, but when i go and paste in a backslash, it doesnt work, so annoying cuz im writing geogebra code that use backslash and now idk if my answer is valid anymore cuz the backslashes arent pasting in correctly
So I have the situation where I have one boolean value a and if that one is true and b<c I want it to end up as true, if a is false and b>c I want it to resolve as true as well. If b=c I want it to me always false, no matter the value b and c are both numbers. My best approach so far is a?b<c:b>c...
In this challenge you will receive a list of pairs of non-negative integers representing a mushroom forest. Each pair represents a mushroom whose center is at that horizontal coordinate. The only part of the mushroom we care about is the cap (the flat bit at the top).
The first integer in each p...
What is the R version? It's Peanuts!
code-golfrstring
This challenge will be based on an R language trivia: every release is named and it's a reference to Peanuts comic strips (see here and here).
Your task will be, given a release name, output it's number.
For reference, use the below list:
Gre...
theres plenty with lists that arent just one integer repeated the entire length
e.g. [1, 1, 2, 1, 1] works
but i haven't found one yet that uses more than one number
i am doing it by hand though :P
another way to phrase the challenge: does the input list contain substrings of each length (up to the input length) such that the first element = the last element
This of course doesn't take into account things other than language's expected growth; you might actually be looking to learn the opposite, a language that's somewhat niche or pays well since experienced devs are rare
@RadvylfPrograms I may be biased but I've seen a lot of articles saying Scala has "arcane syntax" and a "steep learning curve," so people who don't know Scala may dread it a lot
@user besides, Vyxal requires a bit of loose typing for overloads and other kinda wack stuff it does. Rust might not like some of the things we need to do
@user Could be people just moving away from the JVM or having to use it for work. If you absolutely love a language but don't want to use it regularly next year that still gets counted as you "dreading" it
It's possible Scala 3 is also driving people away. They added optional significant indentation which is pretty controversial and also haven't added macro annotations like in Scala 2
Yeah, that's part of the issue with using those stats to estimate language's growth. I'm going to try to use the past years' surveys to include an "acceleration" component too, which will maybe be more accurate
@RadvylfPrograms do you know of Jyxal/Myxal (our JVM ports of version 2) and Symvy (our attempt at making a CAS transpiler of sorts because frick sympy)? Because those are the only other things you'd have missed news wise
Also I was hoping I could optimize the Jelly compressor I'm working on by making it not bother checking the dictionary for things longer than the longest word in it, but that word is Llanfairpwllgwyngyllgogerychwyrndrobwllllantysiliogogogoch so not a very useful optimization :|
This experiment is now live! You may start seeing the new updated visuals on vote arrows. The experiment will run for about two weeks (or until we've collected enough data).
This week, we're rolling out a test to update the appearance of voting arrows for both questions and answers, which will b...
simply run gsettings set org.gtk.Settings.Debug enable-inspector-keybinding true in a terminal and then you can use the keybind Ctrl-Shift-D in any GTK+ application to launch the debugger!
@cairdcoinheringaahing it takes about 24 bits to encode three characters individually, but only around 17 for a word
And it's not even just "all 2 letter words have been removed" or something like that, because there's plenty of uncommon 2 letter words and abbreviations, but also some longer words like "not" missing