lispdoc - results for if

(if test then &optional else)
Function: IF predicate then [else] If PREDICATE evaluates to true, evaluate THEN and return its values, otherwise evaluate ELSE and return its values. ELSE defaults to NIL.
Example:
(defun %get-cur-file ()
  (if *current-file*
      *current-file*
      "unknown.file"))
Mentioned in:
CLtL2 - 26.10. Conditional Execution
CLtL2 - 26.3.2. Kinds of Loop Clauses
CLtL2 - 5.1.3. Special Forms
CLtL2 - 5.3. Top-Level Forms
CLtL2 - 6. Predicates
CLtL2 - 6.4. Logical Operators
CLtL2 - 7. Control Structure
CLtL2 - 7.10.2. Rules Governing the Passing of Multiple Values
CLtL2 - 7.6. Conditionals
CLtL2 - 8.1. Macro Definition
CLtL2 - A.3.1. Basic Restrictions
HyperSpec - Special Operator IF
On Lisp - Adding Prolog Features
On Lisp - An ATN Compiler
On Lisp - Anaphoric Macros
On Lisp - Anaphoric Macros (Macro-Defining Macros)
On Lisp - Anaphoric Variants
On Lisp - Birth of a Utility
On Lisp - Chapter _25
On Lisp - Chapter _28
On Lisp - Classes and Instances
On Lisp - Code-Walkers and CPS Conversion
On Lisp - Common Lisp Evolves
On Lisp - Common Lisp Implementation
On Lisp - Composing Functions
On Lisp - Conditional Evaluation
On Lisp - Creating Context
On Lisp - Free Symbol Capture
On Lisp - Functional Arguments
On Lisp - Functional Design
On Lisp - Functions as Properties
On Lisp - How Macros Work
On Lisp - Iteration with Multiple Values
On Lisp - Local Functions
On Lisp - Macro Style
On Lisp - Macros as Programs
On Lisp - Need for Macros
On Lisp - New Utilities (Computation at Compile-Time)
On Lisp - Non-functional Expanders
On Lisp - Objects in Plain Lisp
On Lisp - Operations on Lists
On Lisp - Other Structures
On Lisp - Recursion on Cdrs
On Lisp - Recursion on Cdrs (Macros Returning Functions)
On Lisp - Recursion on Subtrees
On Lisp - Recursion on Subtrees (Macros Returning Functions)
On Lisp - Referential Transparency
On Lisp - Scheme Continuations
On Lisp - The Concept (Nondeterminism)
PCL - and or and not
PCL - cond
PCL - conditional execution
PCL - controlling evaluation
PCL - formatting lisp code
PCL - other special operators
PCL - special operators
PCL - the public api
PCL - when and unless
Successful Lisp - chapter09
Successful Lisp - chapter12
Successful Lisp - chapter30
Successful Lisp - lesson 3
Successful Lisp - tail recursion
f
 
 Mentioned in:
HyperSpec - F
(find-if predicate sequence &rest args &key from-end (start 0) end key)
Undocumented
Example:
(defun next-instr (code)
  (find-if (complement #'label-p) code))
Mentioned in:
CLtL2 - 14.4. Searching Sequences for Items
HyperSpec - Function FIND, FIND-IF, FIND-IF-NOT
On Lisp - Birth of a Utility
On Lisp - Chapter _28
On Lisp - Composing Functions
PCL - sets
Successful Lisp - chapter13
(subst-if new test tree &key key)
Function: Substitutes new for subtrees for which test is true.
 Mentioned in:
CLtL2 - 15.4. Substitution of Expressions
HyperSpec - Function SUBST, SUBST-IF, SUBST-IF-NOT, NSUBST, NSUBST-IF, NSUBST-IF-NOT
PCL - trees
(count-if pred sequence &rest args &key from-end (start 0) (end nil) (key nil))
Function: Return the number of elements in SEQUENCE satisfying PRED(el).
Example:
(defun length7 (list) (count-if #'true list))
Mentioned in:
HyperSpec - Function COUNT, COUNT-IF, COUNT-IF-NOT
Successful Lisp - chapter13
(assoc-if predicate alist &key key)
Function: Return the first cons in ALIST whose CAR satisfies PREDICATE. If KEY is supplied, apply it to the CAR of each cons before testing.
 Mentioned in:
CLtL2 - 15.6. Association Lists
HyperSpec - Function ASSOC, ASSOC-IF, ASSOC-IF-NOT
PCL - lookup tables alists and plists
(delete-if predicate sequence &rest args &key from-end (start 0) (key nil)
 (end nil) (count nil))
Function: Return a sequence formed by destructively removing the elements satisfying the specified PREDICATE from the given SEQUENCE.
 Mentioned in:
HyperSpec - Function REMOVE, REMOVE-IF, REMOVE-IF-NOT, DELETE, DELETE-IF, DELETE-IF-NOT
On Lisp - Common Lisp Evolves
PCL - destructive operations
Successful Lisp - chapter12
(nsubst-if new test tree &key key)
Function: Substitute NEW for subtrees of TREE for which TEST is true.
 Mentioned in:
CLtL2 - 15.4. Substitution of Expressions
HyperSpec - Function SUBST, SUBST-IF, SUBST-IF-NOT, NSUBST, NSUBST-IF, NSUBST-IF-NOT
PCL - trees
(remove-if predicate sequence &rest args &key from-end (start 0) (end nil)
 (count nil) (key nil))
Function: Return a copy of sequence with elements satisfying PREDICATE removed.
Example:
(defun delete-rows (selector-fn)
  (setf *db* (remove-if selector-fn *db*)))
Mentioned in:
CLtL2 - 14.3. Modifying Sequences
HyperSpec - Function REMOVE, REMOVE-IF, REMOVE-IF-NOT, DELETE, DELETE-IF, DELETE-IF-NOT
On Lisp - Common Lisp Evolves
On Lisp - When Capture Occurs
PCL - higher order function variants
PCL - updating existing records another use for where
Successful Lisp - chapter12
Successful Lisp - chapter13
(member-if test list &key key)
Function: Return tail of LIST beginning with first element satisfying TEST.
 Mentioned in:
CLtL2 - 15.5. Using Lists as Sets
HyperSpec - Function MEMBER, MEMBER-IF, MEMBER-IF-NOT
PCL - sets
(rassoc-if predicate alist &key key)
Function: Return the first cons in ALIST whose CDR satisfies PREDICATE. If KEY is supplied, apply it to the CDR of each cons before testing.
 Mentioned in:
CLtL2 - 15.6. Association Lists
HyperSpec - Function RASSOC, RASSOC-IF, RASSOC-IF-NOT
PCL - lookup tables alists and plists
-if-not
 
 Mentioned in:
PCL - higher order function variants
(position-if predicate sequence &rest args &key from-end (start 0) end key)
Undocumented
Example:
(defun length8 (list)
  (if (null list)
      0
      (+ 1
         (position-if #'true list :from-end t))))
Mentioned in:
CLtL2 - 14.4. Searching Sequences for Items
HyperSpec - Function POSITION, POSITION-IF, POSITION-IF-NOT
Successful Lisp - chapter13
(substitute-if new predicate sequence &rest args &key from-end (start 0)
 (end nil) (count nil) (key nil))
Function: Return a sequence of the same kind as SEQUENCE with the same elements except that all elements satisfying the PRED are replaced with NEW.
Example:
(defun remove-punctuation (string)
  "Replace punctuation with spaces in string."
  (substitute-if #\  #'punctuation-p string))
Mentioned in:
HyperSpec - Function SUBSTITUTE, SUBSTITUTE-IF, SUBSTITUTE-IF-NOT, NSUBSTITUTE, NSUBSTITUTE-IF, NSUBSTITUTE-IF-NOT
PCL - trees
Successful Lisp - chapter13
(nsubstitute-if new predicate sequence &rest args &key from-end (start 0)
 (end nil) (count nil) (key nil))
Function: Return a sequence of the same kind as SEQUENCE with the same elements except that all elements satisfying PREDICATE are replaced with NEW. SEQUENCE may be destructively modified.
 Mentioned in:
CLtL2 - 14.3. Modifying Sequences
HyperSpec - Function SUBSTITUTE, SUBSTITUTE-IF, SUBSTITUTE-IF-NOT, NSUBSTITUTE, NSUBSTITUTE-IF, NSUBSTITUTE-IF-NOT
(find-if-not predicate sequence &rest args &key from-end (start 0) end key)
Undocumented
 Mentioned in:
HyperSpec - Function FIND, FIND-IF, FIND-IF-NOT
PCL - sets
Successful Lisp - chapter13
(subst-if-not new test tree &key key)
Function: Substitutes new for subtrees for which test is false.
 Mentioned in:
CLtL2 - 15.4. Substitution of Expressions
HyperSpec - Function SUBST, SUBST-IF, SUBST-IF-NOT, NSUBST, NSUBST-IF, NSUBST-IF-NOT
PCL - trees
(assoc-if-not predicate alist &key key)
Function: Return the first cons in ALIST whose CAR does not satisfy PREDICATE. If KEY is supplied, apply it to the CAR of each cons before testing.
 Mentioned in:
CLtL2 - 15.6. Association Lists
HyperSpec - Function ASSOC, ASSOC-IF, ASSOC-IF-NOT
PCL - lookup tables alists and plists
(count-if-not pred sequence &rest args &key from-end (start 0) (end nil)
 (key nil))
Function: Return the number of elements in SEQUENCE not satisfying TEST(el).
 Mentioned in:
HyperSpec - Function COUNT, COUNT-IF, COUNT-IF-NOT
Successful Lisp - chapter13
(delete-if-not predicate sequence &rest args &key from-end (start 0) (end nil)
 (key nil) (count nil))
Function: Return a sequence formed by destructively removing the elements not satisfying the specified PREDICATE from the given SEQUENCE.
 Mentioned in:
HyperSpec - Function REMOVE, REMOVE-IF, REMOVE-IF-NOT, DELETE, DELETE-IF, DELETE-IF-NOT
PCL - destructive operations
Successful Lisp - chapter12
(member-if-not test list &key key)
Function: Return tail of LIST beginning with first element not satisfying TEST.
 Mentioned in:
CLtL2 - 15.5. Using Lists as Sets
HyperSpec - Function MEMBER, MEMBER-IF, MEMBER-IF-NOT
PCL - sets
(nsubst-if-not new test tree &key key)
Function: Substitute NEW for subtrees of TREE for which TEST is false.
 Mentioned in:
CLtL2 - 15.4. Substitution of Expressions
HyperSpec - Function SUBST, SUBST-IF, SUBST-IF-NOT, NSUBST, NSUBST-IF, NSUBST-IF-NOT
PCL - trees
(rassoc-if-not predicate alist &key key)
Function: Return the first cons in ALIST whose CDR does not satisfy PREDICATE. If KEY is supplied, apply it to the CDR of each cons before testing.
 Mentioned in:
CLtL2 - 15.6. Association Lists
HyperSpec - Function RASSOC, RASSOC-IF, RASSOC-IF-NOT
PCL - lookup tables alists and plists
(remove-if-not predicate sequence &rest args &key from-end (start 0) (end nil)
 (count nil) (key nil))
Function: Return a copy of sequence with elements not satisfying PREDICATE removed.
Example:
(defun select (selector-fn)
  (remove-if-not selector-fn *db*))
Mentioned in:
CLtL2 - 14.3. Modifying Sequences
CLtL2 - 7.8.4. Mapping
HyperSpec - Function REMOVE, REMOVE-IF, REMOVE-IF-NOT, DELETE, DELETE-IF, DELETE-IF-NOT
On Lisp - Common Lisp Evolves
PCL - higher order function variants
PCL - querying the database
PCL - updating existing records another use for where
Successful Lisp - chapter12
Successful Lisp - chapter13
(position-if-not predicate sequence &rest args &key from-end (start 0) end key)
Undocumented
 Mentioned in:
HyperSpec - Function POSITION, POSITION-IF, POSITION-IF-NOT
Successful Lisp - chapter13
(alexandria.0.dev:if-let bindings &body (then-form &optional else-form))
Function: Creates new variable bindings, and conditionally executes either THEN-FORM or ELSE-FORM. ELSE-FORM defaults to NIL. BINDINGS must be either single binding of the form: (variable initial-form) or a list of bindings of the form: ((variable-1 initial-form-1) (variable-2 initial-form-2) ... (variable-n initial-form-n)) All initial-forms are executed sequentially in the specified order. Then all the variables are bound to the corresponding values. If all variables were bound to true values, the THEN-FORM is executed with the bindings in effect, otherwise the ELSE-FORM is executed with the bindings in effect.
  
(substitute-if-not new predicate sequence &rest args &key from-end (start 0)
 (end nil) (count nil) (key nil))
Function: Return a sequence of the same kind as SEQUENCE with the same elements except that all elements not satisfying the PRED are replaced with NEW.
 Mentioned in:
HyperSpec - Function SUBSTITUTE, SUBSTITUTE-IF, SUBSTITUTE-IF-NOT, NSUBSTITUTE, NSUBSTITUTE-IF, NSUBSTITUTE-IF-NOT
Successful Lisp - chapter13
(nsubstitute-if-not new predicate sequence &rest args &key from-end (start 0)
 (end nil) (count nil) (key nil))
Function: Return a sequence of the same kind as SEQUENCE with the same elements except that all elements not satisfying PREDICATE are replaced with NEW. SEQUENCE may be destructively modified.
 Mentioned in:
HyperSpec - Function SUBSTITUTE, SUBSTITUTE-IF, SUBSTITUTE-IF-NOT, NSUBSTITUTE, NSUBSTITUTE-IF, NSUBSTITUTE-IF-NOT
f:
 
 Mentioned in:
HyperSpec - 22.3.3.1 Tilde F: Fixed-Format Floating-Point
(ql-util:delete-file-if-exists pathname)
Undocumented
  
(pprint-exit-if-list-exhausted)
Function: Cause the closest enclosing use of PPRINT-LOGICAL-BLOCK to return if its list argument is exhausted. Can only be used inside PPRINT-LOGICAL-BLOCK, and only when the LIST argument to PPRINT-LOGICAL-BLOCK is supplied.
 Mentioned in:
CLtL2 - 27.3. Dynamic Control of the Arrangement of Output
CLtL2 - 27.4. Format Directive Interface
HyperSpec - Local Macro PPRINT-EXIT-IF-LIST-EXHAUSTED
(hunchentoot:handle-if-modified-since time &optional (request *request*))
Function: Handles the 'If-Modified-Since' header of REQUEST. The date string is compared to the one generated from the supplied universal time TIME.
  
of
 
 Mentioned in:
HyperSpec - 1.2 Organization of the Document
HyperSpec - 1.4.1.4.3 Use of the Dot Character
HyperSpec - 1.4.3 Sections Not Formally Part Of This Standard
HyperSpec - 1.4.4.1 The ``Affected By'' Section of a Dictionary Entry
HyperSpec - 1.4.4.10 The ``Exceptional Situations'' Section of a Dictionary Entry
HyperSpec - 1.4.4.11 The ``Initial Value'' Section of a Dictionary Entry
HyperSpec - 1.4.4.12 The ``Argument Precedence Order'' Section of a Dictionary Entry
HyperSpec - 1.4.4.13 The ``Method Signature'' Section of a Dictionary Entry
HyperSpec - 1.4.4.14 The ``Name'' Section of a Dictionary Entry
HyperSpec - 1.4.4.15 The ``Notes'' Section of a Dictionary Entry
HyperSpec - 1.4.4.16 The ``Pronunciation'' Section of a Dictionary Entry
HyperSpec - 1.4.4.17 The ``See Also'' Section of a Dictionary Entry
HyperSpec - 1.4.4.18 The ``Side Effects'' Section of a Dictionary Entry
HyperSpec - 1.4.4.19 The ``Supertypes'' Section of a Dictionary Entry
HyperSpec - 1.4.4.2 The ``Arguments'' Section of a Dictionary Entry
HyperSpec - 1.4.4.20 The ``Syntax'' Section of a Dictionary Entry
HyperSpec - 1.4.4.20.4.2 Unconditional Transfer of Control in the ``Syntax'' Section
HyperSpec - 1.4.4.21 The ``Valid Context'' Section of a Dictionary Entry
HyperSpec - 1.4.4.22 The ``Value Type'' Section of a Dictionary Entry
HyperSpec - 1.4.4.3 The ``Arguments and Values'' Section of a Dictionary Entry
HyperSpec - 1.4.4.4 The ``Binding Types Affected'' Section of a Dictionary Entry
HyperSpec - 1.4.4.5 The ``Class Precedence List'' Section of a Dictionary Entry
HyperSpec - 1.4.4.6.1 The ``Compound Type Specifier Kind'' Section of a Dictionary Entry
HyperSpec - 1.4.4.6.2 The ``Compound Type Specifier Syntax'' Section of a Dictionary Entry
HyperSpec - 1.4.4.6.3 The ``Compound Type Specifier Arguments'' Section of a Dictionary Entry
HyperSpec - 1.4.4.6.4 The ``Compound Type Specifier Description'' Section of a Dictionary Entry
HyperSpec - 1.4.4.7 The ``Constant Value'' Section of a Dictionary Entry
HyperSpec - 1.4.4.8 The ``Description'' Section of a Dictionary Entry
HyperSpec - 1.4.4.9 The ``Examples'' Section of a Dictionary Entry
HyperSpec - 1.5.1.2 Documentation of Implementation-Dependent Features
HyperSpec - 1.5.1.3 Documentation of Extensions
HyperSpec - 1.5.1.4 Treatment of Exceptional Situations
HyperSpec - 1.5.1.4.1 Resolution of Apparent Conflicts in Exceptional Situations
HyperSpec - 1.5.1.4.1.1 Examples of Resolution of Apparent Conflicts in Exceptional Situations
HyperSpec - 1.5.2.1 Use of Implementation-Defined Language Features
HyperSpec - 1.5.2.1.1 Use of Read-Time Conditionals
HyperSpec - 11.1.1.2.3 Accessibility of Symbols in a Package
HyperSpec - 11.1.1.2.5 Prevention of Name Conflicts in Packages
HyperSpec - 12.1.1.1.1 Examples of Associativity and Commutativity in Numeric Operations
HyperSpec - 12.1.3.1 Rule of Unbounded Rational Precision
HyperSpec - 12.1.3.2 Rule of Canonical Representation for Rationals
HyperSpec - 12.1.3.3 Rule of Float Substitutability
HyperSpec - 12.1.4.1 Rule of Float and Rational Contagion
HyperSpec - 12.1.4.1.1 Examples of Rule of Float and Rational Contagion
HyperSpec - 12.1.4.2 Rule of Float Approximation
HyperSpec - 12.1.4.3 Rule of Float Underflow and Overflow
HyperSpec - 12.1.4.4 Rule of Float Precision Contagion
HyperSpec - 12.1.5.1 Rule of Complex Substitutability
HyperSpec - 12.1.5.2 Rule of Complex Contagion
HyperSpec - 12.1.5.3 Rule of Canonical Representation for Complex Rationals
HyperSpec - 12.1.5.3.1 Examples of Rule of Canonical Representation for Complex Rationals
HyperSpec - 13.1.10 Documentation of Implementation-Defined Scripts
HyperSpec - 13.1.4.3.4 Case of Implementation-Defined Characters
HyperSpec - 13.1.5 Identity of Characters
HyperSpec - 13.1.6 Ordering of Characters
HyperSpec - 13.1.8 Treatment of Newline during Input and Output
HyperSpec - 15.1.2.2 Required Kinds of Specialized Arrays
HyperSpec - 16.1.1 Implications of Strings Being Arrays
HyperSpec - 16.1.2 Subtypes of STRING
HyperSpec - 17.2.1.1 Examples of Satisfying a Two-Argument Test
HyperSpec - 17.2.2.1 Examples of Satisfying a One-Argument Test
HyperSpec - 18.1.2.1 Visible Modification of Objects with respect to EQ and EQL
HyperSpec - 18.1.2.2 Visible Modification of Objects with respect to EQUAL
HyperSpec - 18.1.2.2.1 Visible Modification of Conses with respect to EQUAL
HyperSpec - 18.1.2.2.2 Visible Modification of Bit Vectors and Strings with respect to EQUAL
HyperSpec - 18.1.2.3 Visible Modification of Objects with respect to EQUALP
HyperSpec - 18.1.2.3.1 Visible Modification of Structures with respect to EQUALP
HyperSpec - 18.1.2.3.2 Visible Modification of Arrays with respect to EQUALP
HyperSpec - 18.1.2.3.3 Visible Modification of Hash Tables with respect to EQUALP
HyperSpec - 19.1 Overview of Filenames
HyperSpec - 19.2.3.1 Examples of Merging Pathnames
HyperSpec - 19.3.1 Syntax of Logical Pathname Namestrings
HyperSpec - 19.3.1.1.1 The Host part of a Logical Pathname Namestring
HyperSpec - 19.3.1.1.2 The Device part of a Logical Pathname Namestring
HyperSpec - 19.3.1.1.3 The Directory part of a Logical Pathname Namestring
HyperSpec - 19.3.1.1.4 The Type part of a Logical Pathname Namestring
HyperSpec - 19.3.1.1.5 The Version part of a Logical Pathname Namestring
HyperSpec - 19.3.2.1 Unspecific Components of a Logical Pathname
HyperSpec - 19.3.2.2 Null Strings as Components of a Logical Pathname
HyperSpec - 2.1.4.5.1 Examples of Multiple Escape Characters
HyperSpec - 2.1.4.6.1 Examples of Single Escape Characters
HyperSpec - 2.1.4.7.1 Examples of Whitespace Characters
HyperSpec - 2.3 Interpretation of Tokens
HyperSpec - 2.3.1.1.2 Examples of Potential Numbers
HyperSpec - 2.3.2.1 Syntax of a Rational
HyperSpec - 2.3.2.1.1 Syntax of an Integer
HyperSpec - 2.3.2.1.2 Syntax of a Ratio
HyperSpec - 2.3.2.2 Syntax of a Float
HyperSpec - 2.3.2.3 Syntax of a Complex
HyperSpec - 2.4.3.1 Examples of Single-Quote
HyperSpec - 2.4.4.1 Examples of Semicolon
HyperSpec - 2.4.4.2.1 Use of Single Semicolon
HyperSpec - 2.4.4.2.2 Use of Double Semicolon
HyperSpec - 2.4.4.2.3 Use of Triple Semicolon
HyperSpec - 2.4.4.2.4 Use of Quadruple Semicolon
HyperSpec - 2.4.4.2.5 Examples of Style for Semicolon
HyperSpec - 2.4.8.19.1 Examples of Sharpsign Vertical-Bar
HyperSpec - 2.4.8.4.1 Examples of Sharpsign Asterisk
HyperSpec - 20.1.1 Coercion of Streams to Pathnames
HyperSpec - 20.1.3.1 Examples of Truenames
HyperSpec - 21.1.1.1 Abstract Classifications of Streams
HyperSpec - 21.1.1.2 Abstract Classifications of Streams
HyperSpec - 21.1.1.3 Other Subclasses of Stream
HyperSpec - 22.1.1 Overview of The Lisp Printer
HyperSpec - 22.1.3.3.2 Effect of Readtable Case on the Lisp Printer
HyperSpec - 22.1.3.3.2.1 Examples of Effect of Readtable Case on the Lisp Printer
HyperSpec - 22.1.3.9 Examples of Printing Arrays
HyperSpec - 22.1.4 Examples of Printer Behavior
HyperSpec - 22.2.1.1 Dynamic Control of the Arrangement of Output
HyperSpec - 22.2.2 Examples of using the Pretty Printer
HyperSpec - 22.3.10.1 Nesting of FORMAT Operations
HyperSpec - 22.3.11 Examples of FORMAT
HyperSpec - 22.3.6.3 Tilde Greater-Than-Sign: End of Justification
HyperSpec - 22.3.7.3 Tilde Right-Bracket: End of Conditional Expression
HyperSpec - 22.3.7.5 Tilde Right-Brace: End of Iteration
HyperSpec - 22.3.8.2 Tilde Right-Paren: End of Case Conversion
HyperSpec - 23.1.1 Dynamic Control of the Lisp Reader
HyperSpec - 23.1.2 Effect of Readtable Case on the Lisp Reader
HyperSpec - 23.1.2.1 Examples of Effect of Readtable Case on the Lisp Reader
HyperSpec - 23.1.3 Argument Conventions of Some Reader Functions
HyperSpec - 24.1.2.1.1 Examples of Feature Expressions
HyperSpec - 3.1.2.1.3.1 Examples of Self-Evaluating Objects
HyperSpec - 3.2.2.1.1 Purpose of Compiler Macros
HyperSpec - 3.2.2.1.2 Naming of Compiler Macros
HyperSpec - 3.2.2.1.3.1 Notes about the Implementation of Compiler Macros
HyperSpec - 3.2.3.1 Processing of Top Level Forms
HyperSpec - 3.2.3.1.1 Processing of Defining Macros
HyperSpec - 3.2.4.2 Similarity of Literal Objects
HyperSpec - 3.2.4.2.1 Similarity of Aggregate Objects
HyperSpec - 3.2.4.2.2 Definition of Similarity
HyperSpec - 3.3.4.1 Examples of Declaration Scope
HyperSpec - 3.4.1.4.1.1 Examples of Suppressing Keyword Argument Checking
HyperSpec - 3.4.1.6 Examples of Ordinary Lambda Lists
HyperSpec - 3.4.11 Syntactic Interaction of Documentation Strings and Declarations
HyperSpec - 3.4.4.1.1.1 Examples of Data-directed Destructuring by Lambda Lists
HyperSpec - 3.5.1.6 Odd Number of Keyword Arguments
HyperSpec - 3.7.1 Modification of Literal Objects
HyperSpec - 3.7.2 Transfer of Control during a Destructive Operation
HyperSpec - 3.7.2.1 Examples of Transfer of Control during a Destructive Operation
HyperSpec - 4.3.3 Creating Instances of Classes
HyperSpec - 4.3.4.1 Examples of Inheritance
HyperSpec - 4.3.4.2 Inheritance of Class Options
HyperSpec - 4.3.5.2 Examples of Class Precedence List Determination
HyperSpec - 4.3.6.1 Modifying the Structure of Instances
HyperSpec - 5.1.1 Overview of Places and Generalized Reference
HyperSpec - 5.1.1.1 Evaluation of Subforms to Places
HyperSpec - 5.1.1.1.1 Examples of Evaluation of Subforms to Places
HyperSpec - 5.1.1.2.1 Examples of Setf Expansions
HyperSpec - 5.1.2 Kinds of Places
HyperSpec - 5.1.3 Treatment of Other Macros Based on SETF
HyperSpec - 5.2 Transfer of Control to an Exit Point
HyperSpec - 6.1.1 Overview of the Loop Facility
HyperSpec - 6.1.1.5 Summary of Loop Clauses
HyperSpec - 6.1.1.5.1 Summary of Variable Initialization and Stepping Clauses
HyperSpec - 6.1.1.5.2 Summary of Value Accumulation Clauses
HyperSpec - 6.1.1.5.3 Summary of Termination Test Clauses
HyperSpec - 6.1.1.5.4 Summary of Unconditional Execution Clauses
HyperSpec - 6.1.1.5.5 Summary of Conditional Execution Clauses
HyperSpec - 6.1.1.5.6 Summary of Miscellaneous Clauses
HyperSpec - 6.1.1.6 Order of Execution
HyperSpec - 6.1.2.1.1.1 Examples of for-as-arithmetic subclause
HyperSpec - 6.1.2.1.2.1 Examples of for-as-in-list subclause
HyperSpec - 6.1.2.1.3.1 Examples of for-as-on-list subclause
HyperSpec - 6.1.2.1.4.1 Examples of for-as-equals-then subclause
HyperSpec - 6.1.2.1.5.1 Examples of for-as-across subclause
HyperSpec - 6.1.2.1.7.1 Examples of for-as-package subclause
HyperSpec - 6.1.2.2.1 Examples of WITH clause
HyperSpec - 6.1.3.1 Examples of COLLECT clause
HyperSpec - 6.1.3.2 Examples of APPEND and NCONC clauses
HyperSpec - 6.1.3.3 Examples of COUNT clause
HyperSpec - 6.1.3.4 Examples of MAXIMIZE and MINIMIZE clauses
HyperSpec - 6.1.3.5 Examples of SUM clause
HyperSpec - 6.1.4.1 Examples of REPEAT clause
HyperSpec - 6.1.4.2 Examples of ALWAYS, NEVER, and THEREIS clauses
HyperSpec - 6.1.4.3 Examples of WHILE and UNTIL clauses
HyperSpec - 6.1.5.1 Examples of unconditional execution
HyperSpec - 6.1.6.1 Examples of WHEN clause
HyperSpec - 6.1.7.1.1 Examples of NAMED clause
HyperSpec - 6.1.8 Examples of Miscellaneous Loop Features
HyperSpec - 6.1.8.1 Examples of clause grouping
HyperSpec - 7.1.2 Declaring the Validity of Initialization Arguments
HyperSpec - 7.1.3 Defaulting of Initialization Arguments
HyperSpec - 7.1.7 Definitions of Make-Instance and Initialize-Instance
HyperSpec - 7.2 Changing the Class of an Instance
HyperSpec - 7.2.1 Modifying the Structure of the Instance
HyperSpec - 7.2.3 Customizing the Change of Class of an Instance
HyperSpec - 7.5.3 Inheritance of Slots and Slot Options
HyperSpec - 7.6.4 Congruent Lambda-lists for all Methods of a Generic Function
HyperSpec - 7.6.5.1 Examples of Keyword Arguments in Generic Functions and Methods
HyperSpec - 7.6.6.1.3 Applying method combination to the sorted list of applicable methods
HyperSpec - 7.6.7 Inheritance of Methods
HyperSpec - 9.1.4.2.1 Interactive Use of Restarts
(phase number)
Function: Return the angle part of the polar representation of a complex number. For complex numbers, this is (atan (imagpart number) (realpart number)). For non-complex positive numbers, this is 0. For non-complex negative numbers this is PI.
 Mentioned in:
CLtL2 - 12.5.1. Exponential and Logarithmic Functions
CLtL2 - 12.5.2. Trigonometric and Related Functions
CLtL2 - 12.5.3. Branch Cuts, Principal Values, and Boundary Conditions in the Complex Plane
HyperSpec - Function PHASE
(type-of object)
Function: Return the type of OBJECT.
Example:
(defun expr-type-only (expr)
  (cond ((self-evaluating? expr) (type-of expr))
        ((the-expression? expr) (second expr))
        (t nil)))
Mentioned in:
CLtL2 - 19.7.1. Unnamed Structures
CLtL2 - 19.7.2. Named Structures
CLtL2 - 2. Data Types
CLtL2 - 4.9. Determining the Type of an Object
HyperSpec - Function TYPE-OF
On Lisp - Classes and Instances
Successful Lisp - structures