• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
    • Kestrel-books
      • Crypto-hdwallet
      • Apt
      • Error-checking
      • Fty-extensions
      • Isar
      • Kestrel-utilities
      • Set
        • Implementation
        • Setp
        • Right
        • Left
        • Head
        • Double-containment
        • Subset
        • Intersect
        • Insert
        • In
        • Delete
        • Union
        • Diff
        • From-list
        • To-list
        • Set-equiv
        • Sfix
        • Pick-a-point
        • Cardinality
        • Set-induct
        • Set-bi-induct
        • Emptyp
      • Soft
      • C
      • Bv
      • Imp-language
      • Event-macros
      • Java
      • Bitcoin
      • Ethereum
      • Yul
      • Zcash
      • ACL2-programming-language
      • Prime-fields
      • Json
      • Syntheto
      • File-io-light
      • Cryptography
      • Number-theory
      • Lists-light
      • Builtins
      • Axe
      • Solidity
      • Helpers
      • Htclient
      • Typed-lists-light
      • Arithmetic-light
    • X86isa
    • Axe
    • Execloader
  • Math
  • Testing-utilities

• Set

Cardinality

The number of elements in a set.

Signature

(cardinality set) → *

Arguments

set — Guard (setp set).

Time complexity: O(n).

Definitions and Theorems

Function: cardinality

(defun cardinality (set)
  (declare (xargs :guard (setp set)))
  (declare (xargs :type-prescription (natp (cardinality set))))
  (let ((__function__ 'cardinality))
    (declare (ignorable __function__))
    (tree-nodes-count (sfix set))))