• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
      • Std/lists
      • Std/alists
      • Obags
      • Std/util
      • Std/strings
      • Std/osets
        • Omaps
          • Defomap
          • Update
          • Mapp
          • Assoc
          • Update*
          • Size
          • Keys
          • From-lists
          • Update-induction-on-maps
          • Compatiblep
          • Tail
          • Head
          • Restrict
          • Submap
          • Map
          • Rlookup
            • Emptyp
            • Rlookup*
            • Lookup*
            • Delete*
            • Values
            • In*
            • Lookup
            • Delete
            • Mfix
            • Head-val
            • Head-key
            • Omap-induction2
            • Omap-order-rules
          • All-by-membership
          • Defset
          • In
          • Primitives
          • Subset
          • Mergesort
          • Intersect
          • Union
          • Pick-a-point-subset-strategy
          • Delete
          • Double-containment
          • Difference
          • Cardinality
          • Set
          • Intersectp
        • Std/io
        • Std/basic
        • Std/system
        • Std/typed-lists
        • Std/bitsets
        • Std/testing
        • Std/typed-alists
        • Std/stobjs
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Omaps

    Rlookup

    Set of keys to which a value is associated.

    Signature
    (rlookup val map) → keys
    Arguments
    map — Guard (mapp map).
    Returns
    keys — Type (setp keys).

    The resulting set is empty if the value is not in the omap. The resulting set is a singleton if the value is associated to exactly one key. Otherwise, the resulting set contains two or more keys.

    This is the ``reverse'' of lookup, which motivates the r in the name.

    Definitions and Theorems

    Function: rlookup

    (defun rlookup (val map)
      (declare (xargs :guard (mapp map)))
      (let ((__function__ 'rlookup))
        (declare (ignorable __function__))
        (cond ((emptyp map) nil)
              (t (mv-let (key0 val0)
                         (head map)
                   (if (equal val val0)
                       (insert key0 (rlookup val (tail map)))
                     (rlookup val (tail map))))))))

    Theorem: setp-of-rlookup

    (defthm setp-of-rlookup
      (b* ((keys (rlookup val map)))
        (setp keys))
      :rule-classes :rewrite)

    Theorem: rlookup-when-emptyp

    (defthm rlookup-when-emptyp
      (implies (emptyp map)
               (equal (rlookup val map) nil))
      :rule-classes (:rewrite :type-prescription))