C++ concepts: SequenceContainer

 

C++

Language

Standard library headers

Concepts

Utilities library

Strings library

Containers library

Algorithms library

Iterators library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

 

C++ concepts

Basic
DefaultConstructible CopyAssignable CopyConstructible	MoveAssignable (C++11) MoveConstructible (C++11) Destructible
Library-Wide
EqualityComparable LessThanComparable Swappable (C++11) ValueSwappable (C++11)	NullablePointer (C++11) Hash (C++11) Allocator
Container
Container SequenceContainer ReversibleContainer	AssociativeContainer AllocatorAwareContainer UnorderedAssociativeContainer (C++11)
Container Elements
CopyInsertable (C++11) MoveInsertable (C++11)	EmplaceConstructible (C++11)
Iterator
Iterator OutputIterator InputIterator	ForwardIterator BidirectionalIterator RandomAccessIterator
Stream I/O
FormattedInputFunction UnformattedInputFunction	FormattedOutputFunction UnformattedOutputFunction
Random Numbers
SeedSequence (C++11) RandomNumberEngine (C++11)	RandomNumberDistribution (C++11) UniformRandomNumberGenerator (C++11) RandomNumberEngineAdaptor (C++11)
Concurrency
BasicLockable (C++11) Lockable (C++11) TimedLockable (C++11)	Mutex (C++11) TimedMutex (C++11) SharedMutex (C++14)
Other
CharTraits pos_type off_type Clock (C++11) BitmaskType	UnaryTypeTrait (C++11) BinaryTypeTrait (C++11) TransformationTrait (C++11) TrivialClock (C++11) LiteralType (C++11)

 

A SequenceContainer is a Container that stores objects of the same type in a linear arrangement.

Requirements

Legend
X	Container type
T	Element type
a, b	Objects of type X
t	Object of type T
n	Positive integer
i, j	InputIterators denoting a valid range
il	std::initializer_list<T>
args	Parameter pack
p, q	const_iterators in a

expression	return type	effects	precondition	postcondition
X(n,t)		Constructs a SequenceContainer containing n copies of t	T CopyInsertable	std::distance(begin(),end()) == n
X(i,j)		Constructs a SequenceContainer equivalent to the range [i,j)	T EmplaceConstructible (only for std::vector) If the iterators are not ForwardIterators, T must be CopyInsertable	std::distance(begin(),end()) == std::distance(i,j)
X(il)		X(il.begin(),il.end())
a = il	X&	Assigns the range represented by il into a	T CopyInsertable and CopyAssignable	Existing elements of a are destroyed or assigned to
a.emplace(p,args)	iterator	Insert an object constructed with std::forward<Args>(args) before p	T CopyInsertable (for std::vector and std::deque) T MoveAssignable and MoveInsertable
a.insert(p,t)	iterator	Inserts a copy of t before p	T CopyInsertable (for std::vector and std::deque) T CopyAssignable or MoveAssignable
a.insert(p,n,t)	iterator	Inserts n copies of t before p	T CopyInsertable and CopyAssignable
a.insert(p,i,j)	iterator	Inserts copies of elements in [i, j) before p	T EmplaceConstructible (only for std::vector) If the iterators are not ForwardIterators, T must be MoveInsertable and MoveAssignable i and j are not in a	Each iterator in [i,j) is dereferenced once
a.insert(p, il)	iterator	a.insert(p,il.begin(),il.end())
a.erase(q)	iterator	Erases the element pointed to by q	(std::deque, std::vector) T MoveAssignable
a.erase(p,q)	iterator	Erases elements in [p,q)	(std::deque, std::vector) T MoveAssignable
a.clear()	void	Destroys all elements in a		All references are invalidated a.empty() == true
a.assign(i,j)	void	Replaces elements in a with a copy of [i, j)	T EmplaceConstructible (std::vector) If not ForwardIterator T MoveInsertable i, j not in a	Each iterator in [i,j) is dereferenced once
a.assign(il)	void	a.assign(il.begin(),il.end())
a.assign(n,t)	void	Replaces elements in a with n copies of t	T CopyInsertable and CopyAssignable

SequenceContainers in the standard library

array (since C++11)	static contiguous array (class template)
vector	dynamic contiguous array (class template)
deque	double-ended queue (class template)
forward_list (since C++11)	singly-linked list (class template)
list	doubly-linked list (class template)

Trade-offs / usage notes

std::array	Fast access but fixed number of elements
std::vector	Fast access but mostly inefficient insertions/deletions
std::list std::forward_list	Efficient insertion/deletion in the middle of the sequence
std::deque	Efficient insertion/deletion at the beginning and at the end of the sequence