Added -each-indexed and -each-indexed.
2) (-cons* 1 2 3) ;.
Note: binding is done according to -let.
Alias: -any (-some 'even?This is useful if you want to destructure source recursively but also want to name the intermediate structures.Each source can refer to the symbols already bound by this varlist.In types: a - b - a (funcall (-const 2) 1 3 "foo ; 2 (-map (-const 1) a" "b" "c" "d ; 1 1 1 1) (-sum (-map (-const 1) a" "b" "c" "d ; 4 -cut concours aide soignante chru strasbourg ( rest params) Take n-ary function and.Elements are compared using equal.See -reduce-from for explanation of the arguments.See also combinator -on which can transform the values before comparing them.The wrapper methods that are not chainable by default are: concours d'équitation western add, attempt, camelCase, capitalize, ceil, clamp, clone, cloneDeep, cloneDeepWith, cloneWith, conformsTo, deburr, defaultTo, divide, each, eachRight, endsWith, eq, escape, escapeRegExp, every, find, findIndex, findKey, findLast, findLastIndex, findLastKey, first, floor, forEach, forEachRight, forIn, forInRight, forOwn, forOwnRight.Nic Ferrier contributed -cons.Predicates, partitioning, functions partitioning the input list into a list of lists.(funcall (-juxt ' '-) 3 5) ; 8 -2) (-map (-juxt 'identity 'square) 1 2 3) ; 1 1) (2 4) (3 9) -compose ( rest fns) Takes a list of functions and returns a fn that is the composition of those fns.
(- 1 2 3) (-map 'square) ; 1 4 9) (- 1 2 3) (-map 'square) (-remove 'even?) ; 1 9) (- 1 2 3) (-map 'square) (-reduce ; 14 - (x rest forms) Starting with the value of x, thread each expression through forms.
If pred returns non-nil, apply fun to this node and do not descend further.
B) - bind car of cons to a and cdr to b (a b) - bind car of list to a and cadr to b (a1.) - bind 0th car of list to a1, 1st to a2, 2nd.
The results are flattened, ignoring the tensor structure of the result.