Question

The List package implements a classic list data-structure, and is analogous to the STL (Standard Template Library) List container that is popular with C++ programmers. The container is defined as a parameterized class, meaning that it can be customized to hold data of any type.

主题

主题	描述
D.1 List definitions	list—A list is a doubly linked list, where every element has a predecessor and successor. A list is a sequence that supports both forward and backward traversal, as well as amortized constant time insertion and removal of elements at the beginning, end, or middle. container—A container is a collection of data of the same type. Containers are objects that contain and manage other data. Containers provide an associated iterator that allows access to the contained data. iterator—Iterators are objects that represent positions of elements in a container. They play a role similar to that of an array subscript, and allow... more
D.2 List declaration	The List package supports lists of any arbitrary predefined type, such as integer, string, or class object. Any iterator that refers to the position of an element that is removed from a list becomes invalid, thus, unable to iterate over the list. To declare a specific list, users must first include the generic List class declaration from the standard include area and then declare the specialized list type: ‘include <List.vh> ... List#(type) dl; // dl is a List of 'type' elements
D.3 Linked list class prototypes	The following class prototypes describe the generic List and List_Iterator classes. Only the public interface is included here.
D.4 List_Iterator methods	The List_Iterator class provides methods to iterate over the elements of lists. These methods are described below.
D.5 List methods	The List class provides methods to query the size of the list, obtain iterators to the head or tail of the list,retrieve the data stored in the list, and methods to add, remove, and reorder the elements of the list.

链接 主题