• 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
          • Jenkins-hash
          • Binary-tree
            • Binary-tree-p
            • Bst<
              • Bst<-with-hashes
            • Tree-node-with-hint
            • Bst-p
            • Tree-node
            • Tree-right
            • Tree-pre-order
            • Tree-post-order
            • Tree-in-order
            • Tree-equiv
            • Heapp
            • Tree-left
            • Tree-fix
            • Bst<-all-r
            • Bst<-all-l
            • Heap<-all-l
            • Tree-head
            • Tree-emptyp
            • Binary-tree-listp
            • Tree-induct
          • Tree-split
          • Heap<
          • Tree-join
          • Tree-delete
          • Rotations
          • Tree-insert
          • Tree-intersect
          • Tree-join-at
          • Tree-union
          • Hash
          • Tree-in
          • Tree-diff
          • Tree-nodes-count
        • 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

• Binary-tree

Bst<

The total order used by bst-p.

Signature

(bst< x y) → *

This is just a wrapper around <<. It is provided so that we may easily switch the total order to experiment with performance.

Definitions and Theorems

Function: bst<$inline

(defun bst<$inline (x y)
  (declare (xargs :type-prescription (booleanp (bst< x y))))
  (declare (xargs :guard t))
  (<< x y))

Subtopics

Bst<-with-hashes

Variant of bst< which may use pre-computed hashes.