Linear Data Structures
The first phase of the Ada Generic Library, Linear Data Structures, can be described in terms of the different data structures that are implemented or planned, most of which are relatively simple and familiar structures such as linked lists, vectors (one dimensional arrays), stacks, queues, deques, etc. However, a highly unifying way to organize one’s understanding of these structures and the algorithms associated with them is in terms of the mathematical notion of (finite) sequences. A future version may include a Sequences package of generic algorithms, but for now we discuss sequences just as a way of understanding many aspects of linked-list and vector representations.
KeywordsMutative Operation Access Type Linked List Package Body Package Description
Unable to display preview. Download preview PDF.