Codish Lexicon

transitive function — concept: a unary function that consistently returns the corresponding value in a range for a given key in a domain.   distinct: relation, binary relation, transitive relation ✍

relation — a "finitary relation".   a function of a particular number of arguments that returns whether the arguments have a particular relationship.   related: binary relation, transitive relation   distinct: transitive function   classes: binary relation   aka: mapping   mentioned: bound, complexity function, dict, each, range, ternary relation ✍

binary relation — concept: a binary function that returns whether the parameters have a given relationship (source to target), useful for map and for constructing graphs.   is: binary function, relation   distinct: boolean function   includes: eq, ne, lt, gt, le, ge   distinct: transitive function   classes: eq, ge, gt, le, lt, ne, transitive relation   related: relation   mentioned: equivalence relation, inherits, is, judge, normal, orthogonal, skew ✍

transitive relation — concept: a binary relation that returns whether there is an edge from the former to the latter for a particular acyclic graph.   is: binary relation   includes: lt, gt   classes: ancestor, gt, lt   related: relation   distinct: transitive function   mentioned: descendant, domain, pertains, stable, transitive ✍

unary — describes functions that take one parameter.   related: unit   mentioned: boolean function, negative, positive, transitive function, transitive, unary function ✍

function — related: scope, frame, closure   includes: apply   classes: binary function, boolean function ✍

value — data of any class.   see: def, variable   aka: datum   related: dict ✍

range — a lazy collection of values between a beginning and an ending with a step between each value.   a range can have either an inclusive or exclusive end, with exclusive being default in index contexts, and inclusive default in counting contexts.   attrs: begin, begon, step   concept: in math, a range is the set of all possible output values of a relation given a particular domain of input values.   python: range([start,] stop[, step]) -> list of integers Return a list containing an arithmetic progression of integers. range(i, j) returns [i, i+1, i+2, ..., j-1]; start (!) defaults to 0. When step is given, it specifies the increment (or decrement). For example, range(4) returns [0, 1, 2, 3]. The end point is omitted! These are exactly the valid indices for a list of 4 elements.†   php: create an array containing a range of elements &dagger.   mentioned: dict, slice, transitive function ✍

key — an object that one can index into a collection to retrieve a value.   php: fetch a key from an array &dagger.   related: dict   aka: id   distinct: pos ✍

domain — math: the set of all possible parameters of a transitive relation or keys of a dict.   distinct: space ✍

abs — absolute value.   returns the positive reflection of negative integers, returning positive numbers as they were.   a transitive function that maps integers into the natural number line.   distinct: absolute   is: stateless, idempotent   related: neg   python: abs(number) -> number Return the absolute value of the argument.†   perl: [number]: absolute value function†   php: absolute value &dagger.   distinct: pos   related: positive ✍

bool — a class that includes the values of true and false.   a transitive function that returns a corresponding boolean value.   a boolean value can be stored in a single bit.   distinct: binary   aka: boolean   python: bool(x) -> bool Returns True when the argument x is true, False otherwise. The builtins True and False are the only two instances of the class bool. The class bool is a subclass of the class int, and cannot be subclassed.†   related: bit ✍

by — a higher order function that accepts a transitive function and returns a comparator that can be used by sort to order objects by their respective results on that transitive function. ✍

canonize — concept: to convert a path to a canonical path, usually with the canonical transitive function.   aka: canonicalize ✍

char — a character in text, associated with a codepoint number of arbitrary precision, albeit from the ascii, unicode, or any other charset.   a transitive function that coerces numbers and chars to chars.   c: often stored in a wchar_t int class.   aka: character, chr   distinct: byte, character   classes: letter ✍

Length of chars in bits for some charsets

charset	bit length
ascii	7
eascii	8
ucs2	16
ucs4	32
utf8	8-32
utf16	16-32

charset — a transitive function of codepoint numbers to corresponding glyphs.   aka: encoding   mentioned: char ✍

codepoint — a number that corresponds to a glyph in the unicode table.   a transitive function that converts a character to its corresponding codepoint.   aka: ord   aka: code   related: unicode   mentioned: charset, font ✍

equivalence relation — concept: a binary relation that returns whether two values are equivalent for some notion of equivalence, like having the same value (eq), identical ref (is), some common attribute, or maping to the same value with a transitive function, like len.   see: eq, is   aka: same   mentioned: group, unique ✍

every — returns whether all values in an iterable produce a truthy value when passed through a given transitive function.   short circuits on the first falsy value.   related: all, some   pertains: iterable   mentioned: complete ✍

group — a collection of equivalent objects for a given equivalence relation.   a function that groups values into bags keyed by the results of a transitive function on each value. the returned object is a dict of sets.   aka: equivalence class   distinct: class   pertains: iterable   mentioned: duck, genericity, interface, unit, zero ✍

int — a magnitude-limited integer.   a constructor or transitive function for an integer type that may convert strings to integers in a given radix or default to 10, or round floating point or decimal numbers with floor.   a linear ordered collection of bits of fixed length. if iterating an integer as a bit vector is supported by a language, it starts from the little end, the lowest magnitude, bit 0.   related: floor, ceil   classes: nyble, byte, signed, unsigned, int16, int32, int64, uint16, uint32, uint64   python: int(x[, base]) -> integer Convert a string or number to an integer, if possible. A floating point argument will be truncated towards zero (this does not include a string representation of a floating point number!) When converting a string, use the optional base. It is an error to supply a base when converting a non-string. If the argument is outside the integer range a long object will be returned instead.†   perl: [number]: get the integer portion of a number†   distinct: integer   aka: word   mentioned: char, long, short, symbol, uint ✍

map — a function that returns the respective values for an linear collection of keys and a transitive function.   commute: each   python: map(function, sequence[, sequence, ...]) -> list Return a list of the results of applying the function to the items of the argument sequence(s). If more than one sequence is given, the function is called with an argument list consisting of the corresponding item of each sequence, substituting None for missing values when not all sequences have the same length. If the function is None, return a list of the items of the sequence (or a list of tuples if more than one sequence).†   perl: [list]: apply a change to a list to get back a new list with the changes†   aka: array map   pertains: iterable   related: pair   mentioned: abs, binary relation, enumerate, equivalence relation, font, zip with ✍

number — concept: a whole, natural, integer, real, or complex numeric value.   a transitive function that returns the corresponding number, usually limited to a subset of the real domain like int or float. ✍

some — returns whether any value in an iterable is produces a truthy value when passed through a given transitive function.   short circuits on the first truthy value.   related: any, every   pertains: iterable ✍

transitive — going consistently from a source to a target, as a directed edge in a graph or as a stateless unary function.   see: transitive function, transitive relation   mentioned: ancestors, descendants ✍

mapping — see: relation   mentioned: linear collection ✍

arg — a variable sent to a function when it is called or program when it is executed.   plural: args   distinct: param   aka: argument   mentioned: apply, overload, pattern matching, relation, ternary relation, zip ✍

whether — indicates a boolean expression, particularly that a function returns a boolean expression.   related: if, iff ✍

bound — accepts an iterable and returns the value closest to a boundary given a judge, an optional relation, and an optional base value from which to start.   mentioned: bounder, greater, less ✍

complexity function — a relation pertaining to collection algorithms that has the character of the relation from the number of values a collection has to the amount of time the algorithm will run. complexity relations are normalized for quick comparison of the character of algorithms as the size of their collection increases by reducing all additive constants and multiplicative factors to 1, and omitting logarithmic bases since all logarimic bases create curves that vary only by a multiplicative factor.   mentioned: constant time, cube time, exponential time, linear logarithmic time, linear time, logarithmic time, non polynomial time, square time ✍

dict — an unordered linear collection (particularly a set) of items that expresses a relation of keys (domain) to values (range).   in systems where dict inherits bag, it overrides the hash and eq attr functions.   is: collection, bag   attrs: keys, values, items, update, complete   related: item, key, value   distinct: object   perl: hash   seuss: a saque of items.   python: dict() -> new empty dictionary.; dict(mapping) -> new dictionary initialized from a mapping object's (key, value) pairs.† ✍

each — to return an ordered linear collection corresponding to the respective values from a given linear collection and a relation.   commute: map   perl: [hash]: retrieve the next key/value pair from a hash†   php: return the current key and value pair from an array and advance the array cursor &dagger.   mentioned: group, transpose ✍

ternary relation — a relation on three arguments.   aka: triadic relation ✍

binary function — concept: a function that takes two parameters.   is: function   classes: binary relation   distinct: boolean function   mentioned: idempotent, identity ✍

eq — equal to.   a binary relation that notes whether two objects are mutually equivalent.   opposite: ne   is: binary relation   distinct: is   aka: equal, equals, equivalence relation, is same as, is same, same   mentioned: dict, idempotent, nxor, radix64, unique ✍

ge — greater than or equal to.   gt(a, b) is equivalent to not(lt(a, b)).   is: binary relation   invsere: lt   aka: gte   inverse: lt   mentioned: long, positive ✍

gt — greater than.   gt(a, b) is equivalent to not(le(a, b)).   is: transitive relation, binary relation   inverse: le   aka: larger   related: max   distinct: more   mentioned: great, greater ✍

le — less than or equal to.   le(a, b) is equivalent to or(eq(a, b), lt(a, b)). or may short circuit the lt apply.   is: binary relation   inverse: gt   aka: lte   mentioned: short ✍

lt — less than.   is: transitive relation, binary relation   inverse: ge   related: min   aka: smaller   mentioned: le, less, negative ✍

ne — not equal.   ne(a, b) is equivalent to not(eq(a, b)).   logical xor.   is: binary relation   opposite: eq   mentioned: ordinal ✍

boolean function — a unary function that returns whether a value passes or fails a particular criterion or condition.   is: function   distinct: binary function   distinct: binary relation   mentioned: empty, filter, negative, positive ✍

param — a variable received by a function when it's called.   distinct: argument   distinct: arg   aka: parameter ✍

source — a place to acquire values.   opposite: target   mentioned: binary relation, complete, message, stream, transitive, update ✍

target — a place to put values.   opposite: source   aka: dest, destination   mentioned: binary relation, complete, message, stream, transitive, update ✍

graph — a unique of nodes and edges among those nodes.   graphs can be directed or undirected.   graphs can be cyclic or acyclic.   some graphs are trees.   distinct: chart ✍

inherits — a binary relation that returns whether a child class inherits a parent class.   see: inherit   aka: is a, is instance, isa   mentioned: beget ✍

is — a binary relation that returns whether two objects are identical by their refs.   distinct: eq, identity   aka: equivalence relation, is same as, is same, same   mentioned: in place ✍

judge — a binary relation that returns whether the former is closer than the latter to a particular bound.   mentioned: bounder ✍

normal — file system: returns the one equivalent path that does not include parent ("..") and self (".") path components.   is: idempotent   distinct: canonical, absolute   geometry: a binary relation between a line and a plane that returns whether the line is perpendicular with every intersecting line in the plane.   distinct: perpendicular, orthogonal ✍

orthogonal — a binary relation between two lines that denotes that a point moving along one line, projected on the other line, would not move.   all perpendicular lines are orthogonal.   some skew lines are orthogonal but not perpendicular.   distinct: normal, perpendicular   mentioned: axis ✍