Container Data Structure
(Redirected from Collection Structure)
Jump to navigation
Jump to search
A Container Data Structure is a data structure that instantiates a collection abstract data type.
- AKA: Collections ADT.
- Context:
- It can range from being a Simple Container to being a Complex Container.
- It can (typically) be an Iterator Structure.
- It can (typically) support a Container Data Structure Operation.
- It can range from being an Immutable Container Data Structure to being a Mutable Container Data Structure.
- …
- Example(s):
- a Set Data Structure, such as a data record set.
- a Multiset Data Structure, such as a database table.
- a List Data Structure.
- an Associative Array, such as a Perl hash or a Scala Map.
- a Sequential Data Structure
- a Stack Data Structure.
- a Tree Data Structure.
- a Graph Data Structure.
- a Python Collection DS, Perl Collection DS, Scala Collection DS, Java Collection DS, ...
- …
- Counter-Example(s):
- See: Data Item, Relational Table, Data Record Set, Class (Computer Science).
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.
- ↑ 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.
- ↑ Entry data structure in the Encyclopædia Britannica (2009) Online entry Accessed on Oct 04, 2011.
2013
- (Wikipedia, 2013) ⇒ http://en.wikipedia.org/wiki/Collection_(abstract_data_type)#Implementations Retrieved:2013-12-1.
- Some collections may be primitive data types in a language, such as lists, while more complex collections are implemented as composite data types in libraries, sometimes in the standard library. Examples include:
- C++: known as Container (see article for details), implemented in C++ Standard Library and earlier Standard Template Library.
- Java: implemented in the Java collections framework.
- Python: some built-in, others implemented in the collections library
- Some collections may be primitive data types in a language, such as lists, while more complex collections are implemented as composite data types in libraries, sometimes in the standard library. Examples include:
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
- (Dextre Clarke et al., 2008) ⇒ Stella Dextre Clarke, Alan Gilchrist, Ron Davies and Leonard Will. (2008). “Glossary of Terms Relating to Thesauri and Other Forms of Structured Vocabulary for Information Retrieval." Willpower Information
- QUOTE:collection: the set of documents that may be accessed by a structured vocabulary, whether the items in it are collected in one place or distributed over a network