[top][index]
search for:
HashTable -- the class of all hash tables

The type HashTable is a member of the class Type.

Types of HashTable :

  • CoherentSheaf -- the class of all coherent sheaves
  • Entity -- the class of all entities
  • Ideal -- the class of all ideals
  • IndeterminateNumber -- the class of all indeterminate numbers
  • InfiniteNumber -- the class of all infinite numbers
  • ModuleMap -- the class of all maps between modules
  • MutableHashTable -- the class of all mutable hash tables
  • OptionTable -- the class of hash tables for optional arguments
  • ProjectiveHilbertPolynomial -- the class of all Hilbert polynomials
  • RingElement -- the class of all ring elements handled by the engine
  • RingMap -- the class of all ring maps
  • SheafOfRings
  • SumOfTwists
  • SymbolTable -- the class of all symbol tables
  • Tally -- the class of all tally results

    • A hash table consists of: a class type, a parent type, and a set of key-value pairs. The keys and values can be anything. The access functions below accept a key and return the corresponding value. For details of the mechanism underlying this, see hashing.

    One important feature of hash tables that when the keys are consecutive integers starting at 0, the keys are scanned in the natural order.

    There is a subclass of HashTable called MutableHashTable which consists of those hash tables whose entries can be changed.

    Access functions:

  • # -- length, or access to elements
  • . -- access to elements whose key is a symbol

    • Query functions:

  • #? -- check for presence of elements
  • .? -- check for presence of elements whose key is a symbol

    • Functions and methods returning a an object of class HashTable :

  • apply(HashTable,Function) -- apply function to each value
  • applyKeys(HashTable,Function)
  • applyPairs(HashTable,Function)
  • applyValues(HashTable,Function)
  • hashTable List
  • merge(HashTable,HashTable,Function)
  • new HashTable from {...} -- make a hash table from a list
  • select(HashTable,Function) -- select pairs from a hash table
  • select(ZZ,HashTable,Function) -- select a limited number of pairs from a hash table

    • Methods for using an object of class HashTable :

  • # HashTable -- length
  • all(HashTable,Function)
  • any(HashTable,Function)
  • documentation HashTable
  • expression HashTable
  • ggPush HashTable
  • handle HashTable
  • HashTable # Thing -- get value from hash table
  • HashTable #? Thing -- check for value in hash table
  • keys HashTable -- keys used in a hash table
  • net HashTable
  • pairs HashTable
  • peek2(HashTable,ZZ)
  • precedence HashTable
  • remove(HashTable,Thing)
  • scanKeys(HashTable,Function)
  • scanPairs(HashTable,Function) -- apply a function to pairs in a hash table
  • scanValues(HashTable,Function)
  • see HashTable
  • tex HashTable
  • texMath HashTable
  • toExternalString HashTable
  • toList HashTable -- convert to list
  • toString HashTable
  • use HashTable
  • values HashTable -- values in a hash table

    • Fixed objects of class HashTable :

  • version -- information about this version of the program

    • [top][index]
    search for: