File: hasht.el.html

Featureful set of hash table operators for use in personal programs.

  hash-make creates a hash table from an association list, hash-add
  adds a value-key pair to a hash table, and hash-lookup finds the value
  associated with a given key in a hash table, if any.

  hash-map does the same thing as mapcar but operates on hash tables
  instead.

  For a list of 300 items, these hash tables improve lookup times by a
  factor of between 8 and 10 to 1 over those for an unsorted list.

  Public and private function names are alphabetized for easy location.

Defined variables (1)

hash-merge-values-functionHash-merge function to merge values from 2 hash tables with the same key.

Defined functions (20)

hash-add(VALUE KEY HASH-TABLE)
hash-copy(HASH-TABLE)
hash-count(HASH-TABLE)
hash-deep-copy(OBJ)
hash-delete(KEY HASH-TABLE)
hash-empty-p(HASH-TABLE)
hash-get(KEY HASH-TABLE)
hash-key-p(KEY HASH-TABLE)
hash-length(HASH-TABLE)
hash-lookup(KEY HASH-TABLE)
hash-make(INITIALIZER &optional REVERSE)
hash-make-prepend(INITIALIZER &optional REVERSE)
hash-map(FUNC HASH-TABLE)
hash-merge(&rest HASH-TABLES)
hash-merge-first-value(VALUE1 VALUE2)
hash-merge-values(VALUE1 VALUE2)
hash-prepend(VALUE KEY HASH-TABLE)
hash-prin1(HASH-TABLE &optional STREAM REVERSE)
hash-set-of-strings(SORTED-STRINGS &optional COUNT)
hash-size(HASH-TABLE)

Defined faces (0)