Container Data Structure

From GM-RKB
(Redirected from Container (data structure))
Jump to navigation Jump to search

A Container Data Structure is a data structure that instantiates a collection abstract data type.



References

2016

  • (Wikipedia, 2016) ⇒ https://en.wikipedia.org/wiki/Container_(abstract_data_type) Retrieved:2016-9-27.
    • In computer science, a container is a class, a data structure, [1] [2] or an abstract data type (ADT) whose instances are collections of other objects. In other words, they store objects in an organized way that follows specific access rules. The size of the container depends on the number of objects (elements) it contains. Underlying (inherited) implementations of various container types may vary in size and complexity, and provide flexibility in choosing the right implementation for any given scenario.
  1. Paul E. Black (ed.), entry for data structure in Dictionary of Algorithms and Data Structures. US National Institute of Standards and Technology.15 December 2004. Accessed on Oct 04, 2011.
  2. Entry data structure in the Encyclopædia Britannica (2009) Online entry Accessed on Oct 04, 2011.

2013

2010

  • http://docs.oracle.com/javase/tutorial/collections/intro/index.html
    • QUOTE:A collection — sometimes called a container — is simply an object that groups multiple elements into a single unit. Collections are used to store, retrieve, manipulate, and communicate aggregate data. Typically, they represent data items that form a natural group, such as a poker hand (a collection of cards), a mail folder (a collection of letters), or a telephone directory (a mapping of names to phone numbers).

2008