List.H File Reference

Include dependency graph for List.H:

Go to the source code of this file.

Classes
class	List< T >
	A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bounds checking, etc. More...
class	FixedList< T, N >
	A 1D vector of objects of type <T> with a fixed length <N>. More...
class	DynamicList< T, SizeMin >
	A 1D vector of objects of type <T> that resizes itself as necessary to accept the new objects. More...
class	PtrList< T >
	A list of pointers to objects of type <T>, with allocation/deallocation management of the pointers. The operator[] returns a reference to the object, not the pointer. More...
class	List< T >
	A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bounds checking, etc. More...
struct	Hash< List< T > >
	Hashing for List data. More...

Namespaces
	Foam
	Namespace for OpenFOAM.

Typedefs
typedef List< bool >	boolList
	A List of bools. More...
typedef List< char >	charList
	A List of chars. More...
typedef List< label >	labelList
	A List of labels. More...

Functions
template<class T >
Istream &	operator>> (Istream &is, List< T > &list)
	Read List contents from Istream. More...
labelList	identity (const label len, label start=0)
	Return an identity map of the given length with (map[i] == i) More...
template<class T >
labelList	sortedOrder (const UList< T > &input)
	Return the (stable) sort order for the list. More...
template<class T >
void	sortedOrder (const UList< T > &input, labelList &order)
	Generate the (stable) sort order for the list. More...
template<class T , class ListComparePredicate >
void	sortedOrder (const UList< T > &input, labelList &order, const ListComparePredicate &comp)
	Sort using specified list compare predicate. More...

Detailed Description

Original source file List.H

Definition in file List.H.