Menu

lex

Hashing (1)
Bill Daly

Lex, a name-value store

  • lex∆init: Returns an empty store
  • lex∆assign: Returns a new lexicon with the supplied name--value
    inserted into the supplied lexicon.
    Syntax: result←lexicon lex∆assign name value
  • lex∆lookup: Returns the value of the supplied name.
    Syntax: value←lexicon lex∆lookup name
  • lex∆is: Predicate to return true if the supplied item is in fact a
    lexicon
  • lex∆keys: Returns the list of names in the supplied lexicon
  • lex∆values: Returns a list of values in the supplied lexiicon

At this writing we use and-dot-equals to do a sequential search of the
list of names. We plan to add a hashing algorithm so that larger data
set may be served.


Related

Wiki: Home

Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.