Press the flag to start, then choose the options you want to see.
Options:
1. Secret number guessing game
2. Alonzo clicking game
3. Costume switcher (literally just random images I had on my computer)
The program is really slow and glitchy outside of the editor for some reason, so press edit and run it from there (it's especially noticeable in the alonzo game)data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAKAAAAB4CAYAAAB1ovlvAAADOUlEQVR4Xu3XQUpjYRCF0V9RcOIW3I8bEHSgBtyJ28kmsh5x4iQEB6/BWQ+U5nLpAjkZp6rIeR88crZt27Z8CAwJnAlwSN7ZLwEBCmFUQICj/I4LUAOjAgIc5XdcgBoYFRDgKL/jAtTAqIAAR/kdF6AGRgUEOMrvuAA1MCogwFF+xwWogVEBAY7yOy5ADYwKCHCU33EBamBUQICj/I4LUAOjAgIc5XdcgBoYFRDgKL/jAtTAqIAAR/kdF6AGRgUEOMrvuAA1MCogwFF+xwWogVEBAY7yOy5ADYwKCHCU33EBamBUQICj/I4LUAOjAgIc5XdcgBoYFRDgKL/jAtTAqIAAR/kdF6AGRgUEOMrvuAA1MCogwFF+xwWogVEBAY7yOy5ADYwKCHCU33EBamBUQICj/I4LUAOjAgIc5XdcgBoYFRDgKL/jAtTAqIAAv+Hf7/fr/f193d7erpubm9GH9JuPC/Cbp/vx8bFeXl7W5+fnent7W/f39+vi4mI9PT2tq6ur39zEf/1tAvyB+3A4rNfX13V9ff3Xt47H43p+fl7btn2F6ZMLCDAI8HQ6rcfHx3V+fr7u7u5yfZNLgP/4Cn54ePh6Be92u3V5eSmdkoAA/QkppZStEWDmZqokIMASpDWZgAAzN1MlAQGWIK3JBASYuZkqCQiwBGlNJiDAzM1USUCAJUhrMgEBZm6mSgICLEFakwkIMHMzVRIQYAnSmkxAgJmbqZKAAEuQ1mQCAszcTJUEBFiCtCYTEGDmZqokIMASpDWZgAAzN1MlAQGWIK3JBASYuZkqCQiwBGlNJiDAzM1USUCAJUhrMgEBZm6mSgICLEFakwkIMHMzVRIQYAnSmkxAgJmbqZKAAEuQ1mQCAszcTJUEBFiCtCYTEGDmZqokIMASpDWZgAAzN1MlAQGWIK3JBASYuZkqCQiwBGlNJiDAzM1USUCAJUhrMgEBZm6mSgICLEFakwkIMHMzVRIQYAnSmkxAgJmbqZKAAEuQ1mQCAszcTJUEBFiCtCYTEGDmZqokIMASpDWZgAAzN1MlAQGWIK3JBASYuZkqCQiwBGlNJiDAzM1USUCAJUhrMgEBZm6mSgJ/AE38F7dMeMlrAAAAAElFTkSuQmCCdata:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAeAAAAFoCAYAAACPNyggAAAOhUlEQVR4Xu3VwQkAAAjEMN1/abewn7jAQRC64wgQIECAAIF3gX1fNEiAAAECBAiMAHsCAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQICLAfIECAAAECgYAAB+gmCRAgQICAAPsBAgQIECAQCAhwgG6SAAECBAgIsB8gQIAAAQKBgAAH6CYJECBAgIAA+wECBAgQIBAICHCAbpIAAQIECAiwHyBAgAABAoGAAAfoJgkQIECAgAD7AQIECBAgEAgIcIBukgABAgQIHLFxAWmhEwHPAAAAAElFTkSuQmCCquestiontoo bigsmallquestion. Guess againguesses1Congrats, you guessed it with guesses! The secret number was 3de:fange _ _
ca:agafa _ _
es:atrapar _ _
fr:attrape _ _
pt:captura _ _
contde:wirf _
ca:llança _
es:lanzar _
fr:lance _
pt:lança _
catchtagde:fange _ _
ca:agafa _ _
es:atrapar _ _
fr:attrape _ _
pt:captura _ _
contde:wirf _ _
ca:llança _ _
es:lanzar _ _
fr:lance _ _
pt:lança _ _
catchtagThis is a breakpoint block, to be used in debugging.
The Boolean input specifies the condition under which
the program should pause. (Use True for an unconditional breakpoint.) The intent is that the script should have
SHOW VARIABLE blocks for the process's local variables.
After the pause, this block automatically hides all temporary variables.de:falls _ dann _ und pause $pause-1-255-220-0
ca:si _ fes _ i atura-ho tot $pause-1-255-220-0
es:si _ haz _ y páralo todo $pause-1-255-220-0
fr:si _ faire _ et mettre tout en pause $pause-1-255-220-0
pt:se _ , então _ e faz pausa em tudo $pause-1-255-220-0
This block does nothing.
Use it when you are calling a reporter
for its side effect and don't care about
its return value.de:ignoriere _
ca:ignora _
es:ignorar _
fr:ignore _
pt:ignora _
Call f(f(f(...(f(x))))) n times where the three input slots are n, f, and x from left to right. The # variable can be used inside f to represent how many times f has been called.pt:o resultado de _ invocações em cascata de _ com argumento inicial _ _
Call f(f(f(...(f(x))))) until condition is true, where the three input slots are condition, f, and x from left to right. The # variable can be used inside f or condition to indicate how many times f has been called.pt:o resultado da invocação em cascata até que _ de _ com argumento inicial _ _
Returns the function x↦f(g(x)) where f and g are the two inputs.pt:a composição de _ com _
Like the built-in REPEAT UNTIL block, except that the ending condition is not tested until the script has been run the first time. So the script is run at least once.pt:repete _ até que _ $loop-0.7
Run the script repeatedly, as long as the given condition is true. Runs the script at least once before testing the condition.pt:repete _ enquanto _ $loop-0.7
Runs the script repeatedly, as long as the condition is true. Tests the condition before the first time the script is run. Like the built in REPEAT UNTIL except that in this block the condition must be true, not false.pt:enquanto _ , repete _ $loop-0.7
Runs the script the specified number of times, like the built-in REPEAT block, but this one provides the # variable that can be used inside the script. Try
REPEAT (200)
MOVE (#) STEPS
RIGHT 92
with the pen down.pt:repete _ vezes _ _ $loop-0.7
The primitive FOR block uses an implicit step of ±1 depending on which of the starting and ending values is larger. This version allows you to provide an explicit step value. If the sign of the step input is incompatible with the ordering of the starting and ending values, the script will not be run at all.pt:para _ de _ com passo _ a _ _ $loop-0.7
1110Provides LOOP as a function of one input that runs
the body of the LET with A set to the function input,
so the body can run itself recursively.
See COPY block in Variables for an example of use.pt:tendo _ o valor inicial _ , executa _ definido como _
new valueThe inputs are a starting value and one or more monadic functions.
The first function is called with the starting value as its input.
The second function is called with the value reported by the first function as its input, and so on. PIPE reports the value reported by the last function. PIPE provides an alternative notation for function composition instead of the usual nesting.
nested acronym:
report (combine (keep items (capital-letter? ( )) from
(map (letter (1) of ( )) over
(sentence→list (phrase)))) using (join ( ) ( )))
piped acronym:
report (pipe (phrase) → (sentence→list ( ))
(map (letter (1) of ( )) over ( ))
(keep items (capital-letter? ( )) from ( ))
(combine ( ) using (join ( ) ( )))
Some people find PIPE easier to read because the functions are called in the same order in which you read them, whereas in nested composition the innermost function is called first. pt:a aplicação a _ de _
1was up,costumeAh!was upfalse11Takes any number of numbers as inputs (use the left and right arrowheads to adjust the number of input slots) and reports the result of adding them all, so
(SUM (4) (100) (8))
reports 112.pt:a soma de _
1Takes any number of numbers as inputs (use the left and right arrowheads to adjust the number of input slots) and reports the result of multiplying them all, so
(PRODUCT (4) (100) (8))
reports 3200.pt:o produto de _
1Takes any number of Boolean (true/false) inputs (use the left and right arrowheads to adjust the number of input slots) and reports TRUE only if all of the inputs are TRUE, otherwise FALSE. Like AND but for multiple inputs.pt:todas as afirmações _ são verdadeiras
1Takes any number of Boolean (true/false) inputs (use the left and right arrowheads to adjust the number of input slots) and reports TRUE if at least one input is TRUE, otherwise FALSE.pt:alguma das afirmações _ é verdadeira
1call with True to turn on the entire Scheme numeric tower, including infinite-precision integers, exact rationals, and complex numbers; call with False to restore native JavaScript arithmetic.pt:altera utilização de aritmética do Scheme para _
The factorial function, to make very large numbers, to demo bignums.Provides Scheme arithmetic functions not in JavaScriptpt:_ de _
number?
complex?
real?
rational?
integer?
exact?
inexact?
exact
inexact
finite?
infinite?
nan?
numerator
denominator
real-part
imag-part
magnitude
anglegenerate a list of samples representing a sine wave at the given frequency, duration and sample ratept:as amostras de som com _ Hz de _ s amostrado a _ Hz
440a 55=55
a 110=110
a 220=220
a 440=440
a 880=880
a 1760=1760
a 3520=352014410022.05 kHz=22050
44.1 kHz=44100
88.2 kHz=88200
96 kHz=96000pt:π
pt:_ radianos em graus
0.5pt:o som _
§_soundsMenuquickly plot the samples of a sound, a list of samples (single channel), or a list of lists (multiple channels) to the stage at a lower resolution.pt:desenha o gráfico do som _
§_soundsMenu1records an audio snippet and reports it as a new sound, or zero if the user cancelspt:$circleSolid-1-255-0-0 uma nova gravação
pt:a nota com _ Hz
440pt:a frequência da nota _
69pt:o nome da nota _
69The first input is a shape list as in
SHAPE OF. The output is an array with those dimensions containing the atomic items of the second input,
repeating values if more are needed.Reports a flat list of the maximum size of the input array along
each dimension: number of rows, number of columns, etc.
"Maximum" because it works even if the array isn't uniformly shaped.Reports the greater of its two inputs. Works on strings too.Reports a flat list of all the atomic elements
of sublists of the input list.Given two arrays A and B, reports an array whose dimensions are
APPEND(SHAPE OF (A), SHAPE OF (B))
in which each atomic item of the result is computed by applying the dyadic function input to an item of A and an item of B.1Reports its input.
This is useful to fit a value into a different-type input slot, e.g., number into list slot.Reports the number of dimensions of the input.111Takes a multidimensional array, and
reports an array whose dimensions
are reversed (as reported by
SHAPE OF). In the case of a
two-dimensional array, does the usual transposition of rows and columns.If there are no atomic data, we don't have any shape information, so we can't really transpose it. But an empty list is 0 rows of some number of columns, so the transpose should be 0 columns in some number of rows. We arbitrarily make it 0 columns of one row. This at least has one dimension of the shape correct.1The transpose of a vector is just the vector itself.1This is the opposite no-atomic-data situation from above. We know that there are (length array) rows of 0 columns, so the transpose is 0 rows, i.e., an empty list. But we lose the number of original rows, transpose columns.atomnodeThis is one row, n columns. So the transpose is n rows, one column.Reverses the order of the (toplevel) items of the input.
If the input is a matrix, this means it reverses the order of the rows, which is a reflection through a horizontal axis, as the ⦵ symbol suggests.1Recursively deep-inserts
the items of the first input
into the items of the second
input. If the first input is not
a list, then it is inserted with
IN FRONT OF in the second
unless the second also isn't
a list, in which case they are
combined with LIST.1Like MAP, but can take any number of lists
as inputs. The lists must all be the same size.
The function input must take a number of inputs
equal to the number of lists. MULTIMAP calls
the function with all the first items, then all the
second items, and so on.1Takes a (possibly deep) list as input,
and reports a human-readable text form
of the list (namely, Lisp notation).()Computes a generalized matrix multiplication.
In normal matrix multiplication, each cell of the result
is computed by multiplying individual numbers within
a row of the left input and a column of the right input,
and then adding those products. In APL terms this is
+.× ("plus dot times")
Any dyadic functions can replace addition and multiplication in this algorithm; a common case is
∨.∧ ("or dot and")111111Reports the smaller of its two inputs.Computes logarithms in any base.
The base is the left input. It's usual in APL that if there's a main data input and some sort of control input, the latter comes on the left. This is because APL syntax, unless you use parentheses, groups computations from right to left.
APL has a monadic version of this function that computes natural logs (log to the base e).Computes the number of combinations of right-input things taken left-input at a time, otherwise known as the elements of Pascal's triangle. This block shares the ! symbol with the monadic factorial function, because the formula for computing this function uses factorials.The factorial of a positive integer n is the product of the integers from 1 to n.
In real APL, the domain of this function is extended beyond integers to compute the gamma function.This function has two names because there are two ways
to understand it.
Lisp way: A matrix is a list of rows. This block combines the numbers in each row, producing one value for the entire row.
APL way: A matrix is made of vectors. This block takes each column as a vector, and does vector arithmetic on the columns, producing one column as the result.pt:lança o erro _
Acts just like the function selected from
the pulldown menu, but hyperized, so
comparing two equal-sized lists reports
a list of the same length as the inputs,
with the results of item-by-item comparisons.﹦﹦
≠
identical to
and
or
is _ a _?Report a list with left-input random integers in the range 1 to right-input.
No number appears more than once
in the result.choicechoice11Reports 1 if the input is positive,
0 if the input is zero,
or -1 if the input is negative.0falsereports 1 divided
by its input.This block reports a random integer between 1 and its input. To roll more than one die, use (for three dice)
roll (reshape as 3 items of 6)
APL: ?3⍴6
Don't use reshape as 3 items of roll 6, because that would roll one die and report 3 copies of the same random roll. Reports the greatest common divisor of its inputs.
If the inputs are values in {0,1} then this is equivalent to the logical OR of the values, with 0=False, 1=True. Hence the APL symbol ∨.
Also accepts Snap! Booleans as inputs.abTakes a dyadic scalar function as input, and
hyperizes it, so that it can take lists as inputs.abReports True if the input is an APL scalar,
i.e., either an atomic (non-list) value, or
an array (list of lists) of any depth with only
one atomic item, e.g., (list (list (list (3)))).1The input must be a value for which SCALAR? reports true, i.e., either an atom or a list of any depth but only one scalar item of item of... etc. This function returns the underlying scalar (number, etc.).1Reports the least common multiple of its inputs.
If the inputs are values in {0,1} then this is equivalent to the logical AND of the values, with 0=False, 1=True. Hence the APL symbol ∧.
Also accepts Snap! Booleans as inputs.abReports the not-and of its inputs, in the form
0 for false, 1 for true.Reports 1 if the input is False or 0;
otherwise reports 0.Reports the not-and of its inputs, in the form
0 for false, 1 for true.Reports True if the left input is
less than or equal to the right input.
Reports a Snap! Boolean, not an integer 0 or 1.Reports True if the left input is
greater than than or equal to
the right input.
Reports a Snap! Boolean, not an integer 0 or 1.Reports 0 if its inputs are equal;
reports 1 if its inputs are not equal.
The inputs can have any non-list values.
(Lists are hyperized.) If the inputs are
Booleans (True/False or 1/0), this is
also the exclusive-or function.reports True iff the input is 0 or False.Reports a Snap! Boolean False if the input
is False or 0; reports True otherwise.Make scalar called with non-singleton input If the input is a positive integer, reports a list of the numbers
from 1 to that input. (If the input is 0, reports an empty list.)
If the input is a list of positive integers, reports an array with
the shape specified by the input (as in ⍴ reshape) in which
each item is a list of the indices of that item in the array
(so technically the shape has one more dimension
than the input, whose size is the size of the input).If the rank of the left input is one more than the rank of the right input,
reports the index of the right input in the left input, or if not found,
reports one more than the length of the left input.
If the rank of the left input is equal to the rank of the right input,
reports a vector of the indices of the items of the right input
in the left input (mapping this function over the right input).
If the rank of the left input is more than that of the right input by 2 or more,
reports a vector, the location of the right input in the left in each dimension.
It is an error if the rank of the left input is less than that of the right input.1resultThis isn't an APL function, although it's related to the outer product.
It takes any number of lists, and reports a list of all possible tuples with one item from each of the lists. The length of the result is the product of the lengths of the inputs.Reports an array of Booleans the same shape
as the left input, indicating which of the atoms
in the left input appear anywhere in the right
input.
(The structure of the right input doesn't matter.)Like append, but:
A scalar input is treated as an array the same shape as the other input except that the last item of the shape is 1.
If the two inputs are of different ranks,
the function is mapped over the larger ranked input.
Catenate adds new columns, by appending to each row.If the input is a nesting of length=1 lists, which
APL treats as a scalar (the innermost item)
for many purposes, report that innermost scalar.
Otherwise, report the input as is.
Exposing this block for users is important because Snap! /does not/ treat such a nesting
as a scalar, so you might need to use this in
translating an APL program to Snap!.
(But the functions in the APL library already use
this block as needed.)Reports a vector of indices of the items of the input, in order of the values of the items, so that
item (grade up (foo)) of (foo)
reports the items in sorted order, smallest to largest. For a matrix, sorts the rows based on their first items, or if those are equal, based on their second items, etc.Reports a sorted version of the list in its first input slot, using the comparison function in the second input slot. For a list of numbers, using < as the comparison function will sort from low to high; using > will sort from high to low.ca:ordena _ segons criteri _
copy of datasplitmerge11#1#2Compares two vectors for sorting.
Compare first items; if those are equal compare second items; etc.1111Reports a vector of indices of the items of the input, in order of the values of the items, so that
item (grade down (foo)) of (foo)
reports the items in sorted order, largest to smallest. For a matrix, sorts the rows based on their first items, or if those are equal, based on their second items, etc.The left input must be a vector of Booleans
(either Snap! form or APL form); the right input must be an array whose first dimension is equal to the length of the left input. The block reports an array of the same rank as the right input, containing only those items (rows, for a matrix) for which the corresponding Boolean is True (or 1).The left input must be a vector of Booleans
(either Snap! form or APL form); the right input must be an array whose last dimension is equal to the length of the left input. The block reports an array of the same rank as the right input, containing only those items (columns, for a matrix) for which the corresponding Boolean is True (or 1).Turns a row-wise (in Lisp terminology) function
into a column-wise one.Reverses the order of the columns of the input, which is a reflection through a vertical axis, as the ⏀ symbol suggests.This function has two names because there are two ways
to understand it.
Lisp way: A matrix is a list of rows. This block turns it into a list of columns, and combines the numbers in each column, producing one value for the entire column.
APL way: A matrix is made of vectors. This block takes each row as a vector, and does vector arithmetic on the rows, producing one row as the result.Like append, but:
A scalar input is treated as a vector
of length 1.
If the two inputs are of different ranks,
the function is mapped over the larger ranked input.
Catenate vertically adds new rows, by appending to each column.A hyperblock version of JOIN. The regular JOIN isn't hyperized because it can accept a list as input, representing it as text.A positive left input selects the first n items of the right input.
A negative left input selects the last abs(n) items
of the right input.
If the right input is a matrix, a numeric left input selects rows;
the left input may also be a two-item vector, in which case
the first number is applied to the rows
and the second number is applied to the columns.
Similarly for higher-dimension arrays. 10valueindexA positive left input selects all but the first n items of the right input.
A negative left input selects all but the last abs(n) items
of the right input.
If the right input is a matrix, a numeric left input selects rows;
the left input may also be a two-item vector, in which case
the first number is applied to the rows
and the second number is applied to the columns.
Similarly for higher-dimension arrays. 0valueindex0partialpartialApplies the function to each "atom" of the data. What's an atom?
Something for which the predicate input reports true.11costumes10