• Top
    • Documentation
    • Books
    • Recursion-and-induction
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
      • Std/lists
      • Std/alists
      • Obags
      • Std/util
      • Std/strings
      • Std/io
      • Std/osets
      • Std/system
      • Std/basic
      • Std/typed-lists
      • Std/bitsets
        • Bitsets
          • Bitset-members
          • Bitset-insert
          • Bitset-delete
          • Bitset-intersectp
          • Bitset-intersect
          • Bitset-difference
          • Bitset-subsetp
          • Bitset-memberp
          • Bitset-union
          • Bitset-singleton
          • Bitset-list
          • Bitset-cardinality
          • Bitset-list*
            • Utilities
          • Sbitsets
          • Reasoning
        • Std/testing
        • Std/typed-alists
        • Std/stobjs
        • Std-extensions
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Testing-utilities
      • Math
    • Bitsets

    Bitset-list*

    Macro to repeatedly insert into a bitset.

    Example: (bitset-list* a b c X) expands to:

    (bitset-insert a
     (bitset-insert b
      (bitset-insert c X)))

    This is much like the list* macro for constructing lists. See also bitset-list for a list-like version.

    NOTE: This is not very efficient. Inserting N elements into a set will require N calls of bitset-insert.

    Definitions and Theorems

    Function: bitset-list*-macro

    (defun bitset-list*-macro (lst)
           (declare (xargs :guard (and (true-listp lst) (consp lst))))
           (if (atom (cdr lst))
               (car lst)
               (list 'bitset-insert
                     (car lst)
                     (bitset-list*-macro (cdr lst)))))