cpp/named req/SequenceContainer

A SequenceContainer is a Template:concept 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	Template:concepts 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 Template:concept	std::distance(begin(),end()) == n
X(i,j)		Constructs a SequenceContainer equivalent to the range [i,j)	T Template:concept (only for std::vector) If the iterators are not Template:concepts, T must be Template:concept	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 Template:concept and Template:concept	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 Template:concept (for std::vector and std::deque) T Template:concept and Template:concept
a.emplace(p,t)	iterator	Inserts a copy of t before i	T Template:concept (for std::vector and std::deque) T Template:concept or Template:concept
a.insert(p,n,t)	iterator	Inserts n copies of t before i	T Template:concept and Template:concept
a.insert(p,i,j)	iterator	Inserts copies of elements in [i, j) before p	T Template:concept (only for std::vector) If the iterators are not Template:concepts, T must be Template:concept and Template:concept 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 Template:concept
a.erase(p,q)	iterator	Erases elements in [p,q)	(std::deque, std::vector) T Template:concept
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 Template:concept (std::vector) If not Template:concept T Template:concept 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 Template:concept and Template:concept

SequenceContainers in the standard library

array (C++11)	fixed-sized inplace contiguous array (class template)
vector	dynamic contiguous array (class template)
deque	double-ended queue (class template)
forward_list (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