lispdoc - results for map

(map result-type function first-sequence &rest more-sequences)
Undocumented
Example:
(defun vector-map (fn vec)
  "useful for me when I am lazy.."
  (map 'vector fn vec))
Mentioned in:
CLtL2 - 14.2. Concatenating, Mapping, and Reducing Sequences
CLtL2 - 20.1. Run-Time Evaluation of Forms
CLtL2 - 4.9. Determining the Type of an Object
CLtL2 - 7.8.4. Mapping
CLtL2 - 7.9. Structure Traversal and Side Effects
CLtL2 - 8. Macros
HyperSpec - Function MAP
PCL - hash table iteration
PCL - mapping
PCL - querying the database
PCL - sequence mapping functions
Successful Lisp - chapter10
Successful Lisp - chapter12
(map-into result-sequence function &rest sequences)
Undocumented
Example:
(defun xform (fn seq) (map-into seq fn seq))
Mentioned in:
CLtL2 - 14.2. Concatenating, Mapping, and Reducing Sequences
HyperSpec - Function MAP-INTO
PCL - sequence mapping functions
Successful Lisp - chapter12
(asdf:map-systems fn)
Function: Apply FN to each defined system. FN should be a function of one argument. It will be called with an object of type asdf:system.
  
(alexandria.0.dev:map-iota function n &key (start 0) (step 1))
Function: Calls FUNCTION with N numbers, starting from START (with numeric contagion from STEP applied), each consequtive number being the sum of the previous one and STEP. START defaults to 0 and STEP to 1. Returns N. Examples: (map-iota #'print 3 :start 1 :step 1.0) => 3 ;;; 1.0 ;;; 2.0 ;;; 3.0
  
(alexandria.0.dev:map-product function list &rest more-lists)
Function: Returns a list containing the results of calling FUNCTION with one argument from LIST, and one from each of MORE-LISTS for each combination of arguments. In other words, returns the product of LIST and MORE-LISTS using FUNCTION. Example: (map-product 'list '(1 2) '(3 4) '(5 6)) => ((1 3 5) (1 3 6) (1 4 5) (1 4 6) (2 3 5) (2 3 6) (2 4 5) (2 4 6))
  
(alexandria.0.dev:map-derangements function sequence &key (start 0) end
 (copy t))
Function: Calls FUNCTION with each derangement of the subsequence of SEQUENCE denoted by the bounding index designators START and END. Derangement is a permutation of the sequence where no element remains in place. SEQUENCE is not modified, but individual derangements are EQ to each other. Consequences are unspecified if calling FUNCTION modifies either the derangement or SEQUENCE.
  
(alexandria.0.dev:map-combinations function sequence &key (start 0) end length
 (copy t))
Function: Calls FUNCTION with each combination of LENGTH constructable from the elements of the subsequence of SEQUENCE delimited by START and END. START defaults to 0, END to length of SEQUENCE, and LENGTH to the length of the delimited subsequence. (So unless LENGTH is specified there is only a single combination, which has the same elements as the delimited subsequence.) If COPY is true (the default) each combination is freshly allocated. If COPY is false all combinations are EQ to each other, in which case consequences are specified if a combination is modified by FUNCTION.
  
(alexandria.0.dev:map-permutations function sequence &key (start 0) end length
 (copy t))
Function: Calls function with each permutation of LENGTH constructable from the subsequence of SEQUENCE delimited by START and END. START defaults to 0, END to length of the sequence, and LENGTH to the length of the delimited subsequence.
  
(trivial-backtrace:map-backtrace function)
Undocumented