Include dependency graph for UList.H:

This graph shows which files directly or indirectly include this file:

Classes
class	UList< T >
	A 1D vector of objects of type <T>, where the size of the vector is known and can be used for subscript bounds checking, etc. More...
struct	UList< T >::less
	A list compare binary predicate for normal sort. More...
struct	UList< T >::greater
	A list compare binary predicate for reverse sort. More...
struct	UList< T >::hasher
	Hashing functor for UList. More...
struct	UList< T >::Hash< Unused >
	Deprecated(2021-04) hashing functor. Use hasher(). More...
struct	Hash< UList< T > >
	Hashing for List data. More...
struct	accessOp< T >
	Object access operator or list access operator (default is pass-through). More...
struct	emptyOp< T >
	Test if object is empty, typically using its empty() method. More...
struct	sizeOp< T >
	Extract size (as label) from an object, typically using its size() method. More...

Namespaces
namespace	Foam
	Namespace for OpenFOAM.
namespace	Foam::Expression
	A namespace for expression templates.

Functions
template<class T>
Istream &	operator>> (Istream &is, UList< T > &list)
	Read List contents from Istream, list must have the proper size!
template<class T>
Ostream &	operator<< (Ostream &os, const UList< T > &list)
	Write List to Ostream, as per UList::writeList() with default length.
template<class T>
Ostream &	operator<< (Ostream &os, const std::vector< T > &list)
	Write std::vector to Ostream. ASCII only, no line-breaks.
void	identity (UList< int32_t > &map, int32_t start=0)
	Fill an identity map with (map[i] == i), works like std::iota().
void	identity (UList< int64_t > &map, int64_t start=0)
	Fill an identity map with (map[i] == i), works like std::iota().
template<class T>
void	sort (UList< T > &list)
	Sort the list.
template<class T, class Compare>
void	sort (UList< T > &list, const Compare &comp)
	Sort the list with the specified comparator.
template<class T>
void	stableSort (UList< T > &list)
	Stable sort the list.
template<class T, class Compare>
void	stableSort (UList< T > &list, const Compare &comp)
	Stable sort the list with the specified comparator.
template<class T>
void	shuffle (UList< T > &list)
	Randomise the list order.
template<class T>
void	reverse (UList< T > &list, const label n)
	Reverse the first n elements of the list.
template<class T>
void	reverse (UList< T > &list)
	Reverse all elements of the list.

Detailed Description

Original source file UList.H

Definition in file UList.H.

Classes