- ADJUST-HEAP-ARRAY
- ADJUST-HEIGHT
- AFTER
- tests if x comes after y in the lst
- ANON-SYMB
- like symb, but doesn't intern new symbol
- APPEND1
- appends a new element to a list
- APPLY-LEFT-ROTATIONS
- APPLY-RIGHT-ROTATIONS
- ARRAY-SHIFT-LEFT
- - shifts all elements between start and end to the left - leftmost element (at :start) is removed from array - inserts a new value at end
- ARRAY-SHIFT-RIGHT
- - shifts all elements between start and end to the right - rightmost element (at :end) is removed from array - inserts a new value at start
- ARRAY-SWAP
- BEFORE
- tests if x comes before y in the specified list
- BEST
- finds the 'best' object in lst according to fn
- BREAK-LOOP
- very simple REPL
- BUILD-CALL
- BUILD-COMPARATOR
- BUILD-COMPOSE
- CALL-ADD-STRATEGIE
- CALL-NEXT-STRATEGIE
- CLEAR-MEMOIZE
- COMBINE-ALL
- COMP-=
- COMP-<
- COMP->
- COMPOSE
- composing a number of functions.
- COMPUTE-SIZE
- CONDLET-BINDS
- CONDLET-CLAUSE
- CREATE-ACCESSORS
- CROSS-LISTS
- CURRY
- DELAY-FUNCTION
- returns the function used by a delay
- (SETF DELAY-FUNCTION)
- DELAY-P
- DELAY-VALUE
- returns the value hold by a delay
- (SETF DELAY-VALUE)
- DELETE-TRIE
- DEQUEUE
- DOUBLE-ROTATE-LEFT
- DOUBLE-ROTATE-RIGHT
- DUPLICATE
- test, if obj is a duplicate in lst
- EMPTY-POOL-P
- EMPTY-QUEUE-P
- ENQUEUE
- FCHAIN
- uses fn-comb to a list of values returned by fns, where every fn in fns is called with x e.
- FIF
- returns new function evaluating 'if' to the applied arguments.
- FIND2
- finds the element and place in list where fn will not return nil
- FIND-ALL
- FIND-ALL-IF
- FIND-ANYWHERE
- FIND-ANYWHERE-IF
- FIND-MIN-NODE
- FIND-TRIE
- FINT
- intersection
- FLATTEN
- FOLLOW-ARC
- FORCE
- forecs a delay-object to be executed
- FRONT
- FUNION
- union
- FUNLESS
- FWHEN
- GEN-MEMO
- GET-TRIE
- GROUP
- groups every n elements together into new sublists.
- HEAD
- HEAP-DEQUEUE
- HEAP-EMPTY-P
- HEAP-FRONT
- HEAPIFY
- HEAP-INSERT
- HEIGHT-DIFF
- IN-QUEUE
- INTEGERS
- INTERACTIVE-INTERPRETER
- simple configurable REPL
- IS-IN-HEAP
- LAST1
- returns the last element in list
- LIST->PIPE
- LONGER
- returns t if length of 1st list is longer than length of the 2nd one
- LREC
- simplifies building a recursive functions over lists and finally returns evaluation of base.
- MAKE-AVL-TREE
- MAKE-BINARY-TREE
- MAKE-DELAY
- creates a new delay object
- MAKE-MAX-RESOURCE-POOL
- MAKE-MAX-SIZED-PRIORITY-POOL
- MAKE-PRIORITY-POOL
- MAKE-QUEUE
- MAP->
- maps all objects between start and test-fn with fn.
- MAPA-B
- maps numbers from a to b
- MAPCARS
- MAP1-N
- maps numbers from 1 to n
- MAP0-N
- maps numbers from 0 to n
- MAPPEND
- maps elements in list and finally appends all resulted lists.
- MEMO
- MEMOIZE
- MKLIST
- if not already a list, mklist will return a new list with its param as element
- MKSTR
- writes args into a string and returns that string
- MOST
- finds the 'highest' value in lst according to fn.
- MOSTN
- NCONC1
- destrucively appends a new element to a list
- NODE-HEIGHT
- ONE-OF
- randomly choose one element from list
- PARENT-INDEX
- PARITION
- PERMUTATIONS
- PIPE-APPEND
- PIPE-ELT
- PIPE-FILTER
- PIPE->LIST
- PIPE-MAP
- PIPE-MAPC
- PIPE-MAPPEND
- PIPE-NULL-P
- PIPE-PERMUTATIONS
- PIPE-REDUCE
- POOL-ADD
- returns the number of elements of pool or nil if obj wasn't added to pool
- POOL-MAKE-MAX-SIZED
- POOL-NEXT
- returns the next object from the pool
- PREPEND
- PRINT-NODES
- PRINT-TREE
- PROMPT
- prompts for args and reads answear
- PROMPT-GENERATOR
- PRUNE
- PUT-TRIE
- QUEUE-CONTENTS
- QUEUE-NCONC
- RANDOM-ELT
- RBUILD
- recursivle builds the final lambda for 'fn'
- RCURRY
- reverse curry
- READLIST
- REPLACE-WITH-MIN
- REREAD
- REUSE-CONS
- RMAPCAR
- recursively maps all objs in list and its sublists
- SELF-CONS
- SINGLE
- predicate which returns true, if list has exactly one element
- SINGLE-ROTATE-LEFT
- SINGLE-ROTATE-RIGHT
- SORTER
- SPLIT-IF
- splits the lst into 2 lists at the position where fn returns not nil
- STARTS-WITH
- SYMB
- creates a new symbol from args
- TAIL
- TMP-MEMOIZE
- TREE-BEAM-SEARCH
- TREE-BEST-FIRST-SEARCH
- TREE-BREATH-FIRST-SEARCH
- TREE-DEPTH-FIRST-SEARCH
- TREE-ITER-WIDE-SEARCH
- TREE-SEARCH
- TREE-WALK
- VECTOR-SEARCH
- - uses binary search to find the index of key in vector.