CMS: Given a number and a list of numbers, add that number to each element of that list, then find the product of the resulting list. The numbers be Doubles or Ints, whatever you want. The catch is that you have to use underscores instead of explicit parameters
You basically write it in a form where each parameter is only used once and isn't used within parentheses (well, you can use it in parentheses, but only if it's (_), not in another expression like (_+2))
@user To make it easier, actually, you can forget the product part at the end and just add the number to every element of the list and return a new List[Int]
Basically, whenever you see code like ... _ ... _ ... _, you turn that into (x, y, z) => ... x ... y ... z (e.g. _ + _ turns into (a, b) => a + b)
If the underscore is inside parentheses but it's the only thing inside those parentheses, then it's still held as part of that "outer" function (e.g. _.bar(_) becomes (a, b) => a.bar(b), nota => a.bar(b => b))
_.bar(_,_) also becomes (a, b, c) => a.bar(b, c) because those last two underscores are not in the outermost part of the expression, but there's nothing accompanying them inside those parentheses
However, if there is something else inside those parentheses, those parens basically turn into a new function (e.g. _.bar(_+2) becomes a => a.bar(b => b + 2), not (a, b) => a.bar(b))
@lyxal See ^
Because the _ + 3 is inside parentheses, it's held as a new function. That's more useful most of the time
writing things like that should be a criminal felony and carry a sentence of life imprisonment
throw the key to the prison cell into the nearest volcano and let them sit in shame, eternally reflecting on how much of a horrible person they are for writing +.+ in Scala
@PyGamer0 x f.g y ←→ f/¨ (⊂[⍴⍴x]x)∘.g ⊂[1]y so ∘.f is kind of like omitting the reductions, meaning the expression has no f, and so the f.g notation was used with f replaced by a "nil"; ∘
do you think that its possible to make an esolang which makes the programmer make ascii art as the programs source code, and isnt just a bunch of abstract shapes
id ask in the tarpit but famously that chat seems to be un-unfreezable
Well, I'm thinking it's about time to replace my chromebook.
Its battery life is less than half of what it used to be, and it's not in the best condition due to being hit with large objects at relatively high speeds a relatively large number of times
It's got like 4000 hours of uptime, been charged and discharged twice a day for the last two years, been taken back and forth to school and back in my backpack through heavy rain, etc.
If I steal two, they lose the full amount for both laptops. If I return a laptop, they'll just have to spend a little to get it looking new or sell it a lower price
Given an integer \$N\$, print or return integers \$a\$, \$b\$, and \$c\$ that satisfy all of the following conditions, if such integers exist:
\$a \times b + c = N\$
\$a\$, \$b\$, and \$c\$ are all prime
\$a > b > c\$
If no valid combination of integers exist, you should return nothing, 0, None...
I can't think of any good CMC's, so here's a basic one anyway: CMS: Reduce a matrix along its columns by a function. You can assume the function is associative. Type signature would be something like List[List[Int]] => ((Int, Int) => Int) => List[Int] or ((Int, Int) => Int, List[List[Int]]) => List[Int]
Output N for N inputs
Write a program or function that takes input and outputs a positive integer N, such that there are N possible inputs for which your program will output N.
Shortest code in bytes wins.
open-ended-function code-golf
Given an integer \$N\$, print or return integers \$a\$, \$b\$, and \$c\$ that satisfy all of the following conditions, if such integers exist:
\$a \times b + c = N\$
\$a\$, \$b\$, and \$c\$ are all prime
\$a > b > c\$
If no valid combination of integers exist, you should return nothing, 0, None...
Output N for N inputs
Write a program or function that takes input and outputs a positive integer N, such that there are N possible inputs for which your program will output N.
Shortest code in bytes wins.
open-ended-function code-golf
