Concept of a distributed one-dimensional list container. More...

Collaboration diagram for List Concept:

Classes
class	dash::GlobListIter< ElementType, GlobMemType, PointerType, ReferenceType >
	Bi-directional global iterator on elements of a `dash::List` instance. More...

class	dash::ListRef< ElementType, LMemSpace >
	Proxy type referencing a `dash::List`. More...

class	dash::LocalListRef< T, LMemSpace >
	Proxy type representing a local view on a referenced `dash::List`. More...

class	dash::List< ElementType, LocalMemorySpace >
	Usage examples: More...

Detailed Description

Concept of a distributed one-dimensional list container.

A dynamic double-linked list.

Type	Definition
STL
`value_type`	First template parameter `ElementType`
`allocator_type`	Second template parameter `AllocatorType`
`reference`	`value_type &`
`const_reference`	`const value_type &`
`pointer`	`allocator_traits<allocator_type>::pointer`
`const_pointer`	`allocator_traits<allocator_type>::const_pointer`
`iterator`	A bidirectional iterator to `value_type`
`const_iterator`	A bidirectional iterator to `const value_type`
`reverse_iterator`	`reverse_iterator<iterator>`
`const_reverse_iterator`	`reverse_iterator<const_iterator>`
`difference_type`	A signed integral type, identical to `iterator_traits<iterator>::difference_type`
`size_type`	Unsigned integral type to represent any non-negative value of `difference_type`
DASH-specific
`index_type`	A signed integgral type to represent positions in global index space
`view_type`	Proxy type for views on list elements, implements `DashListConcept`
`local_type`	Proxy type for views on list elements that are local to the calling unit

Function	Return type	Definition
Initialization
`operator=`	`self &`	Assignment operator
Iterators
`begin`	`iterator`	Iterator to first element in the list
`end`	`iterator`	Iterator past last element in the list
Capacity
`size`	`size_type`	Number of elements in the list
`max_size`	`size_type`	Maximum number of elements the list can hold
`empty`	`bool`	Whether the list is empty, i.e. size is 0
Element access
`front`	`reference`	Access the first element in the list
`back`	`reference`	Access the last element in the list
Modifiers
`push_front`	`void`	Insert element at beginning
`pop_front`	`void`	Delete first element
`push_back`	`void`	Insert element at the end
`pop_back`	`void`	Delete last element
`emplace`	`iterator`	Construct and insert element at given position
`emplace_front`	`void`	Construct and insert element at beginning
`emplace_back`	`void`	Construct and insert element at the end
`insert`	`iterator`	Insert elements before given position
`erase`	`iterator`	Erase elements at position or in range
`swap`	`void`	Swap content
`resize`	`void`	Cbange the list's size
`clear`	`void`	Clear the list's content
Operations
`splice`	`void`	Transfer elements from one list to another
`remove`	`void`	`Remove elements with a given value`
`remove_if`	`void`	`Remove elements fulfilling a given condition`
`unique`	`void`	`Remove duplicate elements`
`sort`	`void`	`Sort list elements`
`merge`	`void`	`Merge sorted lists`
`reverse`	`void`	`Reverse the order of list elements`
`Views (DASH specific)`
`local`	`local_type`	`View on list elements local to calling unit`

Classes