@mikuroxina/mini-fn
    Preparing search index...

    Namespace Hash

    This modules provides an implementation of hash table.

    Methods here can be categorized to map methods and set methods.

    • Construct
      • newMap
      • newMapWith
      • fromIterable
      • fromIterableWith
    • Query
      • len
      • isEmpty
      • get
      • contains
      • entries
      • keys
      • values
      • hasher
    • Modify
      • insert
      • remove
      • reserve
    • Memory cleanup
      • shrinkTo
      • shrinkToFit
    • Construct
      • newSet
      • newSetWith
      • setFromIterable
      • setFromIterableWith
    • Query
      • items
      • isDisjoint
      • isSubset
      • isSuperset
    • Modify
      • push
      • pop
    • Set operation
      • union
      • difference
      • symmetricDifference
      • intersection

    Also most of map methods can be applied to Set<T>.

    Type Aliases

    Hash
    Map
    Set

    Functions

    contains
    difference
    entries
    fromIterable
    fromIterableWith
    get
    hasher
    insert
    intersection
    isDisjoint
    isEmpty
    isSubset
    isSuperset
    items
    keys
    len
    newMap
    newMapWith
    newSet
    newSetWith
    pop
    push
    remove
    reserve
    setFromIterable
    setFromIterableWith
    shrinkTo
    shrinkToFit
    symmetricDifference
    union
    values