AWL functors list
Alphabetical functor list
Total: 113
NAME
with
CLASS
[Object]
PROTOTYPE
with (Object: Class, Body: Any) => Any
DESCRIPTION
Evaluates Body with instance of Object.
NAME
class_of
CLASS
[Object]
PROTOTYPE
class_of (Object: Class) => Func
DESCRIPTION
Evaluates Object and returns its class (or undef, if result is not object).
NAME
self
CLASS
[Object]
PROTOTYPE
self (Class: Func) => Object
DESCRIPTION
Evaluates Class as functoral, and returns its current instance (or undef, if Class is not functoral expression). By default, returns current instance of default class.
NAME
include
CLASS
[System]
PROTOTYPE
include (Filename: String) => Int
DESCRIPTION
Includes file Filename.
NAME
neg
CLASS
[Scalar unary / Numeric]
PROTOTYPE
neg (A: Num) => Num
DESCRIPTION
Arithmetic negation of numeric argument: -A.
NAME
not
CLASS
[Scalar unary / Numeric]
PROTOTYPE
not (I: Int) => Int
DESCRIPTION
Bitwise complement of integer argument: ~I.
NAME
abs
CLASS
[Scalar unary / Numeric]
PROTOTYPE
abs (A: Num) => Num
DESCRIPTION
Arithmetic absolute value of numeric argument. (Same as (A >= 0 ? A : -A), but A evaluated once).
NAME
sgn
CLASS
[Scalar unary / Numeric]
PROTOTYPE
sgn (A: Num) => Sign
DESCRIPTION
Arithmetic sign of numeric argument. (Same as (A > 0 ? 1 : A < 0 ? -1 : 0), but A evaluated once).
NAME
floor
CLASS
[Scalar unary / Numeric]
PROTOTYPE
floor (X: Float) => Float
DESCRIPTION
Arithmetic "floor" value (round X down to nearest integer).
NAME
ceil
CLASS
[Scalar unary / Numeric]
PROTOTYPE
ceil (X: Float) => Float
DESCRIPTION
Arithmetic "ceiling" value (round X up to nearest integer).
NAME
sqr
CLASS
[Scalar unary / Numeric]
PROTOTYPE
sqr (X: Float) => Float
DESCRIPTION
Square root of X (NAN, if X < 0).
NAME
exp
CLASS
[Scalar unary / Numeric]
PROTOTYPE
exp (X: Float) => Float
DESCRIPTION
Exponent of X (e raised to power X).
NAME
log
CLASS
[Scalar unary / Numeric]
PROTOTYPE
log (X: Float) => Float
DESCRIPTION
Natural (base e) logarythm of X (NAN, if X <= 0).
NAME
pi
CLASS
[Scalar unary / Numeric]
PROTOTYPE
pi (X: Float) => Float
DESCRIPTION
Returns value of X multiplied by Pi.
NAME
sin
CLASS
[Scalar unary / Numeric]
PROTOTYPE
sin (X: Float) => Float
DESCRIPTION
Sine of X (argument in radians).
NAME
cos
CLASS
[Scalar unary / Numeric]
PROTOTYPE
cos (X: Float) => Float
DESCRIPTION
Cosine of X (argument in radians).
NAME
tan
CLASS
[Scalar unary / Numeric]
PROTOTYPE
tan (X: Float) => Float
DESCRIPTION
Tangent of X (argument in radians).
NAME
asin
CLASS
[Scalar unary / Numeric]
PROTOTYPE
asin (X: Float) => Float
DESCRIPTION
ArcSine of X (result in radians).
NAME
acos
CLASS
[Scalar unary / Numeric]
PROTOTYPE
acos (X: Float) => Float
DESCRIPTION
ArcCosine of X (result in radians).
NAME
atan
CLASS
[Scalar unary / Numeric]
PROTOTYPE
atan (X: Float) => Float
DESCRIPTION
ArcTangent of X (result in radians).
NAME
sinh
CLASS
[Scalar unary / Numeric]
PROTOTYPE
sinh (X: Float) => Float
DESCRIPTION
Hyperbolic Sine of X. (Same as: exp(X) - exp(-X) / 2).
NAME
cosh
CLASS
[Scalar unary / Numeric]
PROTOTYPE
cosh (X: Float) => Float
DESCRIPTION
Hyperbolic Cosine of X. (Same as: exp(X) + exp(-X) / 2).
NAME
tanh
CLASS
[Scalar unary / Numeric]
PROTOTYPE
tanh (X: Float) => Float
DESCRIPTION
Hyperbolic Tangent of X. (Same as: sinh(X) / cosh(X), or (exp(X) - exp(-X)) / (exp(X) + exp(-X))).
NAME
add
CLASS
[Scalar binary / Numeric]
PROTOTYPE
add (A: Num, B: Num) => Num
DESCRIPTION
Arithmetic addition of arguments: A + B.
NAME
sub
CLASS
[Scalar binary / Numeric]
PROTOTYPE
sub (A: Num, B: Num) => Num
DESCRIPTION
Arithmetic subtraction of arguments: A - B.
NAME
mul
CLASS
[Scalar binary / Numeric]
PROTOTYPE
mul (A: Num, B: Num) => Num
DESCRIPTION
Arithmetic multiplication of arguments: A * B.
NAME
div
CLASS
[Scalar binary / Numeric]
PROTOTYPE
div (X: Float, Y: Float) => Float
DESCRIPTION
Arithmetic division of arguments: X / Y.
NAME
idiv
CLASS
[Scalar binary / Numeric]
PROTOTYPE
idiv (I: Int, J: Int) => Int
DESCRIPTION
Integer division of arguments: I % J. (Same as int(I / J), with result rounded towards 0).
NAME
irem
CLASS
[Scalar binary / Numeric]
PROTOTYPE
irem (I: Int, J: Int) => Int
DESCRIPTION
Integer remainder of arguments: I %% J. (Same as I - J * idiv(I,J)).
NAME
min
CLASS
[Scalar binary / Numeric]
PROTOTYPE
min (A: Num, B: Num) => Num
DESCRIPTION
Arithmetic minimum (lesser of arguments): A ?< B. (Same as: A < B ? A : B, but evaluates arguments once).
NAME
max
CLASS
[Scalar binary / Numeric]
PROTOTYPE
max (A: Num, B: Num) => Num
DESCRIPTION
Arithmetic maximum (greater of arguments): A ?> B. (Same as: A > B ? A : B, but evaluates arguments once).
NAME
shl
CLASS
[Scalar binary / Numeric]
PROTOTYPE
shl (I: Int, J: Int) => Int
DESCRIPTION
Arithmetic left shift: returns I shifted left by J bits.
NAME
shr
CLASS
[Scalar binary / Numeric]
PROTOTYPE
shr (I: Int, J: Int) => Int
DESCRIPTION
Arithmetic right shift: returns I shifted right by J bits.
NAME
exp_by
CLASS
[Scalar binary / Numeric]
PROTOTYPE
exp_by (X: Float, Y: Float) => Float
DESCRIPTION
X raised to the power Y.
NAME
log_by
CLASS
[Scalar binary / Numeric]
PROTOTYPE
log_by (X: Float, Y: Float) => Float
DESCRIPTION
Logarythm of Y base X.
NAME
and
CLASS
[Scalar binary / Numeric]
PROTOTYPE
and (I: Int, J: Int) => Int
DESCRIPTION
Bitwise AND: I & J.
NAME
or
CLASS
[Scalar binary / Numeric]
PROTOTYPE
or (I: Int, J: Int) => Int
DESCRIPTION
Bitwise OR: I | J.
NAME
xor
CLASS
[Scalar binary / Numeric]
PROTOTYPE
xor (I: Int, J: Int) => Int
DESCRIPTION
Bitwise exclusive OR: I ~ J.
NAME
lt
CLASS
[Scalar compare / Numeric]
PROTOTYPE
lt (A: Num, B: Num) => Bool
DESCRIPTION
Arithmetic less than test: true, if A < B.
NAME
le
CLASS
[Scalar compare / Numeric]
PROTOTYPE
le (A: Num, B: Num) => Bool
DESCRIPTION
Arithmetic less than/equal test: true, if A <= B.
NAME
gt
CLASS
[Scalar compare / Numeric]
PROTOTYPE
gt (A: Num, B: Num) => Bool
DESCRIPTION
Arithmetic greater than test: true, if A > B.
NAME
ge
CLASS
[Scalar compare / Numeric]
PROTOTYPE
ge (A: Num, B: Num) => Bool
DESCRIPTION
Arithmetic greater than/equal test: true, if A >= B.
NAME
eq
CLASS
[Scalar compare / Numeric]
PROTOTYPE
eq (A: Num, B: Num) => Bool
DESCRIPTION
Arithmetic equality test: true, if A == B.
NAME
ne
CLASS
[Scalar compare / Numeric]
PROTOTYPE
ne (A: Num, B: Num) => Bool
DESCRIPTION
Arithmetic inequality test: true, if A <> B.
NAME
cmp
CLASS
[Scalar compare / Numeric]
PROTOTYPE
cmp (A: Num, B: Num) => Sign
DESCRIPTION
Arithmetic comparison: A < B ? -1 : A > B ? 1 : 0.
NAME
rad
CLASS
[Scalar binary / Numeric]
PROTOTYPE
rad (X: Num, Y: Num) => Num
DESCRIPTION
Polar radius of point (X, Y): same as sqr(X*X + Y*Y).
NAME
ang
CLASS
[Scalar binary / Numeric]
PROTOTYPE
ang (X: Num, Y: Num) => Num
DESCRIPTION
Polar angle of point (X, Y), in radians.
NAME
int
CLASS
[Scalar unary / Numeric]
PROTOTYPE
int (V: Scal) => Int
DESCRIPTION
Explicit integer coercion: scalar V to integer value (according to default coercion rules).
NAME
float
CLASS
[Scalar unary / Numeric]
PROTOTYPE
float (V: Scal) => Float
DESCRIPTION
Explicit float coercion: scalar V to float value (according to default coercion rules).
NAME
num
CLASS
[Scalar unary / Numeric]
PROTOTYPE
num (V: Scal) => Num
DESCRIPTION
Explicit numeric coercion: scalar V to integer or float value (according to default coercion rules).
NAME
s_empty
CLASS
[Scalar literal / String]
PROTOTYPE
s_empty () => ""
DESCRIPTION
Always returns empty string.
NAME
s_len
CLASS
[Scalar unary / String]
PROTOTYPE
s_len (S: Str) => Int
DESCRIPTION
Returns length of string S (0, if S is empty string).
NAME
s_cat
CLASS
[Scalar binary / String]
PROTOTYPE
s_cat (S: Str, T: Str) => Str
DESCRIPTION
String concatenation: returns strings S and T concatenated together.
NAME
s_rep
CLASS
[Scalar binary / String]
PROTOTYPE
s_rep (S: Str, N: Int) => Str
DESCRIPTION
String repetition: returns S repeated N times. (returns S, if N == 1; empty string, if N == 0)
NAME
s_min
CLASS
[Scalar binary / String]
PROTOTYPE
s_min (S: Str, T: Str) => Str
DESCRIPTION
String minimum: returns either S or T, whichever comes first alphabetically.
NAME
s_max
CLASS
[Scalar binary / String]
PROTOTYPE
s_max (S: Str, T: Str) => Str
DESCRIPTION
String maximum: returns either S or T, whichever comes last alphabetically.
NAME
s_lt
CLASS
[Scalar compare / String]
PROTOTYPE
s_lt (S: Str, T: Str) => Bool
DESCRIPTION
String less than test: true, if S is alphabetically before T.
NAME
s_le
CLASS
[Scalar compare / String]
PROTOTYPE
s_le (S: Str, T: Str) => Bool
DESCRIPTION
String less than/equal test: true, if S is alphabetically before or equal to T.
NAME
s_gt
CLASS
[Scalar compare / String]
PROTOTYPE
s_gt (S: Str, T: Str) => Bool
DESCRIPTION
String greater than test: true, if S is alphabetically after T.
NAME
s_ge
CLASS
[Scalar compare / String]
PROTOTYPE
s_ge (S: Str, T: Str) => Bool
DESCRIPTION
String greater than/equal test: true, if S is alphabetically after or equal to T.
NAME
s_eq
CLASS
[Scalar compare / String]
PROTOTYPE
s_eq (S: Str, T: Str) => Bool
DESCRIPTION
String equality test: true, if S is identical to T.
NAME
s_ne
CLASS
[Scalar compare / String]
PROTOTYPE
s_ne (S: Str, T: Str) => Bool
DESCRIPTION
String inequality test: true, if S is different from T.
NAME
s_cmp
CLASS
[Scalar compare / String]
PROTOTYPE
s_cmp (S: Str, T: Str) => Sign
DESCRIPTION
String comparison: returns -1, if S is alphabetically before T; 1, if S alphabetically after T; 0 if S is equal to T.
NAME
s_slice
CLASS
[Scalar binary / String]
PROTOTYPE
s_slice (R: Range, S: Str) => Str
DESCRIPTION
String slice: returns fragment of string S sliced by range R. R defaults to whole string (0..s_len(S)). Length of result is always R.end - R.start. If R exceeds limits (R.start < 0 or R.end > s_len(S)), return is padded with spaces in beginning and/or end.
NAME
s_findfirst
CLASS
[Scalar binary / String]
PROTOTYPE
s_findfirst (S: Str, Ctx: Str) => Int
DESCRIPTION
Find first substring: searches forward string S for the first occurence of context Ctx. Returns offset of Ctx in S (starting from 0), or -1, if Ctx is not found.
NAME
s_findlast
CLASS
[Scalar binary / String]
PROTOTYPE
s_findlast (S: Str, Ctx: Str) => Int
DESCRIPTION
Find last substring: searches backward string S for the last occurence of context Ctx. Returns offset of Ctx in S (starting from 0), or -1, if Ctx is not found.
NAME
string
CLASS
[Scalar unary / String]
PROTOTYPE
string (V: Scal) => String
DESCRIPTION
Explicit string coercion: scalar V to string value (according to default coercion rules).
NAME
false
CLASS
[Scalar literal / Numeric]
PROTOTYPE
false () => 0
DESCRIPTION
Returns false value (0).
NAME
true
CLASS
[Scalar literal / Numeric]
PROTOTYPE
true () => 1
DESCRIPTION
Returns true value (1).
NAME
c_and
CLASS
[Conditional binary]
PROTOTYPE
c_and (Cond: Bool, Body: Any) => 0 | Any
DESCRIPTION
"Short-circuit" conditional AND operation: if boolean condition Cond is true, evaluates and returns Body; otherwise returns false (0).
NAME
c_or
CLASS
[Conditional binary]
PROTOTYPE
c_or (Cond: Bool, Body: Any) => 1 | Any
DESCRIPTION
"Short-circuit" conditional OR operation: if boolean condition Cond is false, evaluates and returns Body; otherwise returns true (1).
NAME
if
CLASS
[Conditional ternary]
PROTOTYPE
if (Cond: Bool, PBody: Any1, NBody: Any2) => Any1 | Any2
DESCRIPTION
Conditional "positive" operation: if boolean Cond is true, evaluates and returns PBody; otherwise evaluates and returns NBody.
NAME
unless
CLASS
[Conditional ternary]
PROTOTYPE
unless (Cond: Bool, NBody: Any1, PBody: Any2) => Any2 | Any1
DESCRIPTION
Conditional "negative" operation: if boolean Cond is false, evaluates and returns NBody; otherwise evaluates and returns PBody.
NAME
while
CLASS
[Iterator binary]
PROTOTYPE
while (Cond: Bool, Body: Any) => Any
DESCRIPTION
Iterative operation (with "positive" precondition). While boolean Cond remains true, evaluates Body. Returns final value of Body (or undef, if Body never was evaluated).
NAME
until
CLASS
[Iterator binary]
PROTOTYPE
until (Cond: Bool, Body: Any) => Any
DESCRIPTION
Iterative operation (with "negative" precondition). While boolean Cond remains false, evaluates Body. Returns final value of Body (or undef, if Body never was evaluated).
NAME
do_while
CLASS
[Iterator binary]
PROTOTYPE
do_while (Cond: Bool, Body: Any) => Any
DESCRIPTION
Iterative operation (with "positive" postcondition). Pre-evaluates Body, while Cond remains true. Returns final value of Body (which is always evaluated at least once).
NAME
do_until
CLASS
[Iterator binary]
PROTOTYPE
do_until (Cond: Bool, Body: Any) => Any
DESCRIPTION
Iterative operation (with "negative" postcondition). Pre-evaluates Body, while Cond remains false. Returns final value of Body (which is always evaluated at least once).
NAME
for_inc
CLASS
[Iterator]
PROTOTYPE
for_inc (Index: Mut, R: Range, Body: Any) => Any
DESCRIPTION
Incremental iterator: increments value of mutable Index, from (including) start of R to (excluding) end of R. Om each iteration Body is evaluated. Returns final value of Body (or undef, if Body never was evaluated).
NAME
for_dec
CLASS
[Iterator]
PROTOTYPE
for_dec (Index: Mut, R: Range, Body: Any) => Any
DESCRIPTION
Decremental iterator: decrements value of mutable Index, from (excluding) end of R to (including) start of R. Om each iteration Body is evaluated. Returns final value of Body (or undef, if Body never was evaluated).
NAME
times
CLASS
[Iterator]
PROTOTYPE
times (Count: Int, Body: Any) => Any
DESCRIPTION
Evaluates Body exactly Count times. Returns final value of Body (or undef, if Body never was evaluated).
NAME
l_len
CLASS
[List]
PROTOTYPE
l_len (L: List) => Int
DESCRIPTION
Returns length of list L (total # of list items). (Returns 1 for scalars and 0 for undef.)
NAME
l_cat
CLASS
[List]
PROTOTYPE
l_cat (L: List, M: List) => List
DESCRIPTION
List concatenation: concatenates L and M (evaluated as lists).
NAME
l_rep
CLASS
[List]
PROTOTYPE
l_rep (N: Int, L: List) => List
DESCRIPTION
List replication: concatenates L (evaluated as list) N times with itself. (Returns undef, if N <= 0.)
NAME
l_rev
CLASS
[List]
PROTOTYPE
l_rev (L: List) => List
DESCRIPTION
List reversion: returns L with reversed elements order .
NAME
l_ref
CLASS
[List]
PROTOTYPE
l_ref (L: List) => List
DESCRIPTION
Return shared reference to list L.
NAME
l_item
CLASS
[List]
PROTOTYPE
l_item (I: Int, L: List) => Mut
DESCRIPTION
Returns mutable reference to item #I (count starts at 0) of L (evaluated as list).
NAME
l_head
CLASS
[List]
PROTOTYPE
l_head (L: List) => Mut
DESCRIPTION
Returns mutable reference to head (first item) of list L. (Same as l_item (0, L)).
NAME
l_tail
CLASS
[List]
PROTOTYPE
l_tail (L: List) => Mut
DESCRIPTION
Returns mutable reference to tail (all items except first) of list L.
NAME
l_head_by
CLASS
[List]
PROTOTYPE
l_head_by (N: Int, L: List) => Mut
DESCRIPTION
Returns result of l_head(L) repeated N times. (Returns L, if N is zero.)
NAME
l_tail_by
CLASS
[List]
PROTOTYPE
l_tail_by (N: Int, L: List) => Mut
DESCRIPTION
Returns result of l_tail(L) repeated N times. (Returns L, if N is zero.)
NAME
l_loop
CLASS
[List]
PROTOTYPE
l_loop (V: Mut, L: List, Body: Any) => Any
DESCRIPTION
List iterator: evaluates Body for all items in list L (from first to last). On each iteration reference to current list item is assigned to mutable V. Return result of evaluation of last list item.
NAME
l_loop_r
CLASS
[List]
PROTOTYPE
l_loop_r (V: Mut, L: List, Body: Any) => Any
DESCRIPTION
List iterator: evaluates Body for all items in list L (from last to first). On each iteration reference to current list item is assigned to mutable V. Return result of evaluation of first list item.
NAME
l_map
CLASS
[List]
PROTOTYPE
l_map (F: Func, L: List) => List
DESCRIPTION
Constructs and returns new list by applying functoral F to all elements of list L.
NAME
l_range
CLASS
[List]
PROTOTYPE
l_range (R: Range, F: Func) => List
DESCRIPTION
Constructs and returns new list from range R (in ascending order). If functoral F specified, it is applied to all elements during construction.
NAME
l_range_r
CLASS
[List]
PROTOTYPE
l_range_r (R: Range, F: Func) => List
DESCRIPTION
Constructs and returns new list from range R (in descending order). If functoral F specified, it is applied to all elements during construction.
NAME
l_sort_index
CLASS
[List]
PROTOTYPE
l_sort_index (Comparator: Func, R: Range) => List
DESCRIPTION
Sort range R using Comparator to compare elements, and returns list of indexes as result.
NAME
l_push
CLASS
[List]
PROTOTYPE
l_push (L: Mut, V: Any) => Mut
DESCRIPTION
Evaluates V (as list) and inserts elements of V into L (in reverse order).
NAME
l_pop
CLASS
[List]
PROTOTYPE
l_pop (L: Mut, V: Mut) => Any
DESCRIPTION
Pops elements from list L to list of mutables V.
NAME
apply
CLASS
PROTOTYPE
apply (F: Func, V: Any) => Any
DESCRIPTION
Calls functor F with argument(s) V.
NAME
is_mut
CLASS
[Tests]
PROTOTYPE
is_mut (X: Any) => bool
DESCRIPTION
Mutability test: return true if X is mutable, false otherwise.
NAME
let
CLASS
[Mutation]
PROTOTYPE
let (V: Mut, X: Any) => Any
DESCRIPTION
Lazy assignment: assigns expression X (which is NOT evaluated) to mutable V. Returns X.
NAME
set
CLASS
[Mutation]
PROTOTYPE
set (V: Mut, X: Any) => Any
DESCRIPTION
Value assignment: evaluates expression X, then assigns result to mutable V. Returns result of evaluation.
NAME
inc
CLASS
[Mutation]
PROTOTYPE
inc (V: Mut) => Num
DESCRIPTION
Preincrement: increments value of mutable V (which must belong to numeric type) by 1. Returns value of V after increment.
NAME
dec
CLASS
[Mutation]
PROTOTYPE
dec (V: Mut) => Num
DESCRIPTION
Predecrement: decrements value of mutable V (which must belong to numeric type) by 1. Returns value of V after decrement.
NAME
inc_p
CLASS
[Mutation]
PROTOTYPE
inc_p (V: Mut) => Num
DESCRIPTION
Postincrement: increments value of mutable V (which must belong to numeric type) by 1. Returns value of V before increment.
NAME
dec_p
CLASS
[Mutation]
PROTOTYPE
dec_p (V: Mut) => Num
DESCRIPTION
Postdecrement: decrements value of mutable V (which must belong to numeric type) by 1. Returns value of V before decrement.
NAME
swap
CLASS
[Mutation]
PROTOTYPE
swap (V: Mut, W: Mut) => undef
DESCRIPTION
Excahnges values of mutables V and W.
NAME
deval
CLASS
[Misc]
PROTOTYPE
deval (X: Any) => Any
DESCRIPTION
Suppress evaluation of expression X.
NAME
f_get
CLASS
[I/O operations]
PROTOTYPE
f_get (In: Stream, M1: Mut, M2: Mut, ... Mn: Mut) => Int
DESCRIPTION
Reads lines from input stream In (default input, if omitted). Assigns them (as strings) to mutables M1 .. Mn. Returns number of lines successfully read.
NAME
f_put
CLASS
[I/O operations]
PROTOTYPE
f_put (Out: Stream, X1: Any, X2: Any, ... Xn: Any) => Int
DESCRIPTION
Evaluates and writes values of expressions X1 .. Xn to the output stream Out (default output, if omitted). Returns number of arguments successfully written.
NAME
f_in
CLASS
[I/O operations]
PROTOTYPE
f_in () => Stream
DESCRIPTION
Returns system default input stream.
NAME
f_out
CLASS
[I/O operations]
PROTOTYPE
f_out () => Stream
DESCRIPTION
Returns system default output stream.
NAME
f_err
CLASS
[I/O operations]
PROTOTYPE
f_err () => Stream
DESCRIPTION
Returns system default error output stream.
(Meta)type list
TYPE
Int
DESCRIPTION
Integer value. As input, any scalar value is coerced to integer.
TYPE
Float
DESCRIPTION
Floating point value. As input, any scalar value is coerced to float.
TYPE
Num
DESCRIPTION
Numeric (integer or float) value. As input, any scalar value is coerced to numeric.
TYPE
Str
DESCRIPTION
String value. As inout, any scalar value is coerced to string.
TYPE
Bool
DESCRIPTION
Boolean value: true or false. As input: 0, empty string and undef considered as false; anything different considered true. As output, either 0 (false) or 1 (true) is returned.
TYPE
Sign
DESCRIPTION
Sign value: negative, positive or zero. As input, any scalar value coerced to numeric (only sign is relevant). As output, -1, 0 or 1 is returned.
TYPE
Scal
DESCRIPTION
Any scalar type (numeric or string).
TYPE
List
DESCRIPTION
List of values, or any expression evaluated as list. Can be any scalar or undef.
TYPE
Range
DESCRIPTION
Integer range: list of two integer values. First item defines start of range (inclusive), second item defines end of range (exclusive). If scalar N is supplied, range 0..N is assumed.
TYPE
Mut
DESCRIPTION
Any mutable expression.
TYPE
Any
DESCRIPTION
Any type allowed without constrains.
