  
  [1X7 [33X[0;0YHashmaps[133X[101X
  
  [33X[0;0YA  hash  map  stores  key-value pairs and allows efficient lookup of keys by
  using a hash function.[133X
  
  [33X[0;0Y[5Xdatastructures[105X  currently  provides  a  reference implementation of hashmaps
  using a hashtable stored in a plain [5XGAP[105X list.[133X
  
  
  [1X7.1 [33X[0;0YAPI[133X[101X
  
  [1X7.1-1 IsHashMap[101X
  
  [33X[1;0Y[29X[2XIsHashMap[102X( [3Xarg[103X ) [32X filter[133X
  [6XReturns:[106X  [33X[0;10Y[9Xtrue[109X or [9Xfalse[109X[133X
  
  [33X[0;0YCategory of hash maps[133X
  
  [1X7.1-2 HashMap[101X
  
  [33X[1;0Y[29X[2XHashMap[102X( [[3Xvalues[103X][,] [[3Xhashfunc[103X[, [3Xeqfunc[103X]][,] [[3Xcapacity[103X] ) [32X function[133X
  
  [33X[0;0YCreate  a  new  hash  map.  The  optional  argument [3Xvalues[103X must be a list of
  key-value  pairs  which  will be inserted into the new hashmap in order. The
  optional  argument [3Xhashfunc[103X must be a hash-function, [3Xeqfunc[103X must be a binary
  equality  testing  function  that  returns  [9Xtrue[109X  if  the  two arguments are
  considered  equal,  and  [9Xfalse[109X if they are not. Refer to Chapter [14X6[114X about the
  requirements  for  hashfunctions and equality testers. The optional argument
  [3Xcapacity[103X determines the initial size of the hashmap.[133X
  
  [1X7.1-3 Keys[101X
  
  [33X[1;0Y[29X[2XKeys[102X( [3Xh[103X ) [32X operation[133X
  [6XReturns:[106X  [33X[0;10Ya list[133X
  
  [33X[0;0YReturns the list of keys of the hashmap [3Xh[103X.[133X
  
  [1X7.1-4 Values[101X
  
  [33X[1;0Y[29X[2XValues[102X( [3Xh[103X ) [32X operation[133X
  [6XReturns:[106X  [33X[0;10Ya list[133X
  
  [33X[0;0YReturns the set of values stored in the hashmap [3Xh[103X.[133X
  
  [1X7.1-5 KeyIterator[101X
  
  [33X[1;0Y[29X[2XKeyIterator[102X( [3Xh[103X ) [32X operation[133X
  [6XReturns:[106X  [33X[0;10Yan iterator[133X
  
  [33X[0;0YReturns an iterator for the keys stored in the hashmap [3Xh[103X.[133X
  
  [1X7.1-6 ValueIterator[101X
  
  [33X[1;0Y[29X[2XValueIterator[102X( [3Xh[103X ) [32X operation[133X
  [6XReturns:[106X  [33X[0;10Yan iterator[133X
  
  [33X[0;0YReturns an iterator for the values stored in the hashmap [3Xh[103X.[133X
  
  [1X7.1-7 KeyValueIterator[101X
  
  [33X[1;0Y[29X[2XKeyValueIterator[102X( [3Xh[103X ) [32X operation[133X
  [6XReturns:[106X  [33X[0;10Yan iterator[133X
  
  [33X[0;0YReturns an iterator for key-value-pairs stored in the hashmap [3Xh[103X.[133X
  
  [1X7.1-8 \[\][101X
  
  [33X[1;0Y[29X[2X\[\][102X( [3Xhashmap[103X, [3Xobject[103X ) [32X operation[133X
  
  [33X[0;0YList-style access for hashmaps.[133X
  
  [1X7.1-9 \[\]\:\=[101X
  
  [33X[1;0Y[29X[2X\[\]\:\=[102X( [3Xhashmap[103X, [3Xobject[103X, [3Xobject[103X ) [32X operation[133X
  
  [33X[0;0YList-style assignment for hashmaps.[133X
  
  [1X7.1-10 \in[101X
  
  [33X[1;0Y[29X[2X\in[102X( [3Xobject[103X, [3Xhashmap[103X ) [32X operation[133X
  
  [33X[0;0YTest whether a key is stored in the hashmap.[133X
  
  [1X7.1-11 IsBound\[\][101X
  
  [33X[1;0Y[29X[2XIsBound\[\][102X( [3Xobject[103X, [3Xhashmap[103X ) [32X operation[133X
  
  [33X[0;0YTest whether a key is stored in the hashmap.[133X
  
  [1X7.1-12 Unbind\[\][101X
  
  [33X[1;0Y[29X[2XUnbind\[\][102X( [3Xobject[103X, [3Xhashmap[103X ) [32X operation[133X
  
  [33X[0;0YDelete a key from a hashmap.[133X
  
  [1X7.1-13 Size[101X
  
  [33X[1;0Y[29X[2XSize[102X( [3Xhashmap[103X ) [32X operation[133X
  
  [33X[0;0YDetermine the number of keys stored in a hashmap.[133X
  
  [1X7.1-14 IsEmpty[101X
  
  [33X[1;0Y[29X[2XIsEmpty[102X( [3Xobject[103X, [3Xhashmap[103X ) [32X operation[133X
  
  [33X[0;0YTest whether a hashmap is empty.[133X
  
