Challenge
Given a list of integers and a velocity, \$v\$, implement a sorting algorithm which simulates a program sorting the list from smallest to biggest at the given velocity.
Einstein's Theory of Special Relativity
What do I mean? Well assume your program takes a time, \$T\$, to sort a par...
you know how that 0 is the sum of 0 numbers, 1 is the product of 0 numbers and Infinity is the minimum of 0 numbers? is there a name of the term for the number that has that property for a given function?
@Pavel Isn't the identity the single value that leaves any other value unchanged? I took the current question to be what is the term for the result of passing the empty set to the function
@AdmBorkBork I had to look at that for several seconds before I could see why it's wrong...
I've lookes but it doesn't look like it has any differential geometry built ins. I was wondering if they were hidden or you could install a library (or whatever the Mathematica equivalent is)
@Pavel In (Dyalog) APL you definitely can (at least for some functions): it gives the element that when appended to a list will leave its reduction unchanged. +/⍬ is 0 because 0+n = n; ×/⍬ is 1 because 1×n = n; ⌊/⍬ is the maximum representable number, because everything else is going to be less than it; etc...
@Pavel Many languages define an output for min, max, and sum of zero arguments. It might not apply more generally but it seems that was what the original question was about
@mınxomaτ So in python, if you do import os, you can then call help(os) and it will print the docstring of the module. I want to recreate that in the most lua-idiomatic way
>>> help(print)
Help on built-in function print in module builtins:
print(...)
print(value, ..., sep=' ', end='\n', file=sys.stdout, flush=False)
Prints the values to a stream, or to sys.stdout by default.
Optional keyword arguments:
file: a file-like object (stream); defaults to the current sys.stdout.
sep: string inserted between values, default a space.
end: string appended after the last value, default a newline.
flush: whether to forcibly flush the stream.
It would also highly depend on the execution environment (JIT, PUC) and what libraries you consider "standard". There's also not really any LuaDoc mandated by the language.
Do we have a challenge for "create a basis for \$\mathbb{R}^n\$ where the matrix representing a blackbox linear operator over \$\mathbb{R}^n\$ is diagonal"? I can't find one but I don't want to draft an entire sandbox post if someone remebers seeing one.
If you want to see which atoms are unimplemented: you can look here, the ones without text below them are either unimplemented.
@Adám No, the ones on the left are all completely unimplemented (and there's more), only ~ has partial implementation (from the functionality I know it will have). So, yes I know what ⍺⍲⍵ will do, it will be exactly equivalent to ~⍺∧⍵ (~ is extended past booleans)
An office (let's call it "The Office") is going to cut down on wasted time in 2019 by consolidating office birthday parties. Any two people with a birthday between Monday and Friday (inclusive) of the same week will be celebrated with a Shared Birthday Party some time that week. People whose birt...
@Pavel It's ⍬. Because = will result in booleans, and both '' and ⍬ have 0≡≢, so the result will also have 0 length (numeric prototype because = results in 0s and 1s)
@Pavel In all APLs, = is a "scalar" function just like +, so it penetrates its arguments all the way to the leaf nodes and compares corresponding elements of the left and right arguments. So due to both arguments being empty vectors, the result is an empty (Boolean) vector.
Realized my tokenizer couldn't handle multiple statements in a dfn. That resulted in this: ArrayList<Pair<ArrayList<ArrayList<Token>>,Character>> everything = new ArrayList<Pair<ArrayList<ArrayList<Token>>,Character>>();
@Pavel Right, so ]display uses - or ─ to indicate character arrays and ` ` or ~ to indicate numeric arrays. And no frame to indicate scalars, and → to indicate the last axis, and ↓ to indicate preceding axes. Try it online!
That'd take way too long to type. Here's how RAD's code looks like when initializing any RAD value: Value x = ... (sometimes Value x = Value(...) as well)
@dzaima That is why I use D: Tuple!(Token[][], char)[] everything; (nothing like that appears in RAD's code, but that's just a port of what your type).
@Zacharý ok actually looking a bit more at the docs (which are annoyingly structured) maybe most of what I thought bad of D (well except the strange "foo".writeln;) is just your usage of it :p
@dzaima That's why I tend to use template functions more so than templates. T identity(T)(T arg) { return arg; } is very nice. And it's just called like identity(argument)
@Pavel I don't know why they did () instead of <>, but it doesn't really matter to me. At least it's better than having to write out typename or something.
Value is actually a wrapper around Value_ that overloads operators. Number is aliased as Complex!double, Semicolon is for ;-indexing, Function is a wrapper around a Value delegate(Value[]) (which is the type for all functions, monadic operators, and dyadic operators in RAD), and This refers back to Value_.
That allows for some neat tricks I have planned: like boxing a function by just changing its group property to "N"d (nilad)
@Pavel Originally I was using Variant (which is pretty much Object or dynamic), but I ran into problems that I still can't find the cause of.
@dzaima Nah, it's just a wrapper around a discriminated union.
@Pavel I implemented A[1;2] weirdly. 1;2 results in new Semicolon(Value(1), Value(2))
Rank doesn't exist in RAD, so how APL does it would be impossible. What RAD does is basically the same thing, except using depth. A[B;C] is {⍵[C]}¨A[B]
carmack just pissed off every Rust person on the planet
You might be marked down for it on an exam, but not explicitly cleaning up many classes of resources and just exiting the process to let the OS do it is often completely reasonable, and the high performance thing to do. Apps that don't exit instantly get a glare.
@Adám, that reminds me. The concept of "shape" that you came up with a while back (when I was asking how ⍴⍵ should work in RAD) seems to be pretty much the same as depth, except shape might have boxing of arrays into scalars.
The one thing that pisses me off about the .NET standard library is that Process.Start(name, args) takes args as a space-delimited string and not a string array
Make the super number hyper-pyramid
code-golf array-manipulation
Related
Challenge
Given \$n\$, output the \$n\$-dimensional pyramidal list.
Example
\$n = 1\$:
Blocks arranged in a 1D pyramid with side length 1 is just a block.
So, the output is {1}.
\$n = 2\$:
Blocks arranged in a ...
@quartata .NET argument quoting rules: foo bar is two arguments. "foo bar" is also two arguments. ""foo bar"" is one argument. """foo bar""" is one argument, and includes one set of quotes.
@dzaima I had a similar problem, and still have another one: I had to move step #7 to be step #1.5. To elaborate on it: the code that handled ⋄ was moved from the very end to just after parentheses and dfns/dops are handled: otherwise somethings would be activate'd that shouldn't be activate'd.
My biggest fear of RAD's development is side-effects being activated multiple times, in the incorrect order, not at all, ...
@BetaDecay Yeah, but depth isn't the same as rank: (1 2)(3 4)≢2 2⍴1 2 3 4. In other words, an N-dimensional array (N>=2) is not the same thing as nested 1-dimensional arrays/vectors.
Challenge
Given a list of integers and a velocity, \$v\$, implement a sorting algorithm which simulates a program sorting the list from smallest to biggest at the given velocity.
Einstein's Theory of Special Relativity
What do I mean? Well assume your program takes a time, \$T\$, to sort a par...
Make the super number hyper-pyramid
code-golf array-manipulation
Related
Challenge
Given \$n\$, output the \$n\$-dimensional pyramidal list.
Example
\$n = 1\$:
Blocks arranged in a 1D pyramid with side length 1 is just a block.
So, the output is {1}.
\$n = 2\$:
Blocks arranged in a ...
