A LiFo dynamic dictionary

Details A LiFo dynamic dictionary A LiFo dynamic dictionary

1995-03-15

arxiv.org/abs/math/9503207v1

Mathematics

Logic

Scientific paper

Data structures that realize a dictionary are characterized by three basic instructions: (1) Insert (a new entry ). (2) Search by a key, returning the associated value. (3) Delete an entry. Known realizations are hashing schemes and various types of search trees. Time complexity of the fundamental operations is measured as a function of the number of entries $n$, the (binary) size of a key $s$ is usually not considered. For search trees the expected time as well as the upper limit of time is $O(\log n)$. "LiFo Dynamic Dictionary" (for short "LiFo Dictionary") is a new implementation, the time limits for "Insert" and for "Search" both are a linear function of the length $s$ of the used key, that is $O(s)$. "LiFo Dictionary" furthermore provides two additional basic operations: (4) "open environment" and (5) "close environment" with a constant time for performing. "Close environment" needs only one assignment by which it restores exactly the same internal situation as before the last call of "open environment". This feature cannot be realized by any of the data structures mentioned above, therefore the prefix LiFo (=last in first out), another name for STACK. This ability is highly suitable for software applications that frequently perform local symbol to value binding throughout multiple levels of environments. E.g. Lisp-Interpreters or D. Knuth's \TeX programm are such applications.

Affiliated with

Also associated with

No associations

Rating

A LiFo dynamic dictionary does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A LiFo dynamic dictionary, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A LiFo dynamic dictionary will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-230874