Documentation

Std.Data.DHashMap.Iterator

Iterators on DHashMap and DHashMap.Raw #

@[inline]
def Std.DHashMap.Raw.iter {α : Type u} {β : αType v} (m : Raw α β) :
Iter ((a : α) × β a)

Returns a finite iterator over the entries of a dependent hash map. The iterator yields the elements of the map in order and then terminates.

Termination properties:

  • Finite instance: always
  • Productive instance: always
Equations
    Instances For
      @[inline]
      def Std.DHashMap.Raw.keysIter {α : Type u} {β : αType u} (m : Raw α β) :
      Iter α

      Returns a finite iterator over the keys of a dependent hash map. The iterator yields the keys in order and then terminates.

      The key and value types must live in the same universe.

      Termination properties:

      • Finite instance: always
      • Productive instance: always
      Equations
        Instances For
          @[inline]
          def Std.DHashMap.Raw.valuesIter {α β : Type u} (m : Raw α fun (x : α) => β) :
          Iter β

          Returns a finite iterator over the values of a hash map. The iterator yields the values in order and then terminates.

          The key and value types must live in the same universe.

          Termination properties:

          • Finite instance: always
          • Productive instance: always
          Equations
            Instances For
              @[inline]
              def Std.DHashMap.iter {α : Type u} {β : αType v} [BEq α] [Hashable α] (m : DHashMap α β) :
              Iter ((a : α) × β a)

              Returns a finite iterator over the entries of a dependent hash map. The iterator yields the elements of the map in order and then terminates.

              Termination properties:

              • Finite instance: always
              • Productive instance: always
              Equations
                Instances For
                  @[inline]
                  def Std.DHashMap.keysIter {α : Type u} {β : αType u} [BEq α] [Hashable α] (m : DHashMap α β) :
                  Iter α

                  Returns a finite iterator over the keys of a dependent hash map. The iterator yields the keys in order and then terminates.

                  The key and value types must live in the same universe.

                  Termination properties:

                  • Finite instance: always
                  • Productive instance: always
                  Equations
                    Instances For
                      @[inline]
                      def Std.DHashMap.valuesIter {α β : Type u} [BEq α] [Hashable α] (m : DHashMap α fun (x : α) => β) :
                      Iter β

                      Returns a finite iterator over the values of a hash map. The iterator yields the values in order and then terminates.

                      The key and value types must live in the same universe.

                      Termination properties:

                      • Finite instance: always
                      • Productive instance: always
                      Equations
                        Instances For