ListOps.H File Reference

Various functions to operate on Lists. More...

Include dependency graph for ListOps.H:

Go to the source code of this file.

Classes
struct	appendEqOp< T >
struct	uniqueEqOp< T >
struct	unionEqOp
struct	less< ListType >
struct	greater< ListType >

Namespaces
	Foam::ListOps
	Various utility functions to work on Lists.
	Foam

Functions
template<class IntListType >
IntListType	renumber (const labelUList &oldToNew, const IntListType &input)
template<class IntListType >
void	inplaceRenumber (const labelUList &oldToNew, IntListType &input)
template<class ListType >
ListType	reorder (const labelUList &oldToNew, const ListType &input, const bool prune=false)
template<class ListType >
void	inplaceReorder (const labelUList &oldToNew, ListType &input, const bool prune=false)
template<unsigned Width>
PackedList< Width >	reorder (const labelUList &oldToNew, const PackedList< Width > &input, const bool prune=false)
template<unsigned Width>
void	inplaceReorder (const labelUList &oldToNew, PackedList< Width > &input, const bool prune=false)
bitSet	reorder (const labelUList &oldToNew, const bitSet &input, const bool prune=false)
void	inplaceReorder (const labelUList &oldToNew, bitSet &input, const bool prune=false)
template<class Container >
void	inplaceMapKey (const labelUList &oldToNew, Container &input)
template<class Container >
label	inplaceMapValue (const labelUList &oldToNew, Container &input)
template<class Container >
label	inplaceMapValue (const Map< label > &mapper, Container &input)
template<class T >
labelList	sortedOrder (const UList< T > &input)
template<class T >
void	sortedOrder (const UList< T > &input, labelList &order)
template<class T , class ListComparePredicate >
void	sortedOrder (const UList< T > &input, labelList &order, const ListComparePredicate &comp)
template<class T >
labelList	duplicateOrder (const UList< T > &input)
template<class T >
void	duplicateOrder (const UList< T > &input, labelList &order)
template<class T , class ListComparePredicate >
void	duplicateOrder (const UList< T > &input, labelList &order, const ListComparePredicate &comp)
template<class T >
labelList	uniqueOrder (const UList< T > &input)
template<class T >
void	uniqueOrder (const UList< T > &input, labelList &order)
template<class T , class ListComparePredicate >
void	uniqueOrder (const UList< T > &input, labelList &order, const ListComparePredicate &comp)
template<class ListType >
void	inplaceUniqueSort (ListType &input)
template<class ListType , class ListComparePredicate >
void	inplaceUniqueSort (ListType &input, const ListComparePredicate &comp)
template<class BoolListType , class T >
List< T >	subset (const BoolListType &select, const UList< T > &input, const bool invert=false)
template<class T >
List< T >	subset (const bitSet &select, const UList< T > &input, const bool invert=false)
template<class BoolListType , class ListType >
void	inplaceSubset (const BoolListType &select, ListType &input, const bool invert=false)
template<class ListType >
void	inplaceSubset (const bitSet &select, ListType &input, const bool invert=false)
template<class T , class UnaryPredicate >
List< T >	subsetList (const UList< T > &input, const UnaryPredicate &pred, const bool invert=false)
template<class ListType , class UnaryPredicate >
void	inplaceSubsetList (ListType &input, const UnaryPredicate &pred, const bool invert=false)
labelList	invert (const label len, const labelUList &map)
labelList	invert (const label len, const bitSet &map)
labelList	invert (const bitSet &map)
labelListList	invertOneToMany (const label len, const labelUList &map)
template<class InputIntListType , class OutputIntListType >
void	invertManyToMany (const label len, const UList< InputIntListType > &input, List< OutputIntListType > &output)
template<class InputIntListType , class OutputIntListType >
List< OutputIntListType >	invertManyToMany (const label len, const UList< InputIntListType > &input)
template<class ListType >
label	findIndex (const ListType &input, typename ListType::const_reference val, const label start=0)
template<class ListType >
labelList	findIndices (const ListType &input, typename ListType::const_reference val, label start=0)
template<class ListType >
label	findMin (const ListType &input, label start=0)
template<class ListType >
label	findMax (const ListType &input, label start=0)
template<class ListType >
labelPair	findMinMax (const ListType &input, label start=0)
template<class ListType >
label	findSortedIndex (const ListType &input, typename ListType::const_reference val, const label start=0)
template<class ListType , class T , class ComparePredicate >
label	findLower (const ListType &input, const T &val, const label start, const ComparePredicate &comp)
template<class ListType , class T >
label	findLower (const ListType &input, const T &val, const label start=0)
template<class ListType >
ListType	reverseList (const ListType &input)
template<class ListType >
void	inplaceReverseList (ListType &input)
template<class ListType >
ListType	rotateList (const ListType &list, const label n)
template<template< typename > class ListType, class DataType >
void	inplaceRotateList (ListType< DataType > &list, label n)
void	identity (labelUList &map, label start=0)
template<class ListType , class UnaryPredicate >
label	find (const ListType &input, const UnaryPredicate &pred, const label start=0)
template<class ListType , class UnaryPredicate >
bool	found (const ListType &input, const UnaryPredicate &pred, const label start=0)
template<class ListType , class UnaryPredicate >
labelList	findIndices (const ListType &input, const UnaryPredicate &pred, label start=0)
template<class T >
void	setValue (UList< T > &list, const labelUList &locations, const T &val)
template<class T >
void	setValue (UList< T > &list, const labelHashSet &locations, const T &val)
template<class T >
void	setValue (UList< T > &list, const UList< bool > &locations, const T &val)
template<class T >
void	setValue (UList< T > &list, const bitSet &locations, const T &val)
template<class T , class T2 , class UnaryOperation >
List< T >	create (const UList< T2 > &input, const UnaryOperation &op)
template<class T , class InputIterator , class UnaryOperation >
List< T >	create (InputIterator first, InputIterator last, const UnaryOperation &op)
template<class T >
List< T >	createWithValue (const label len, const labelUList &locations, const T &val, const T &deflt=T())
template<class T >
List< T >	createWithValue (const label len, const labelHashSet &locations, const T &val, const T &deflt=T())
template<class T >
List< T >	createWithValue (const label len, const UList< bool > &locations, const T &val, const T &deflt=T())
template<class T >
List< T >	createWithValue (const label len, const bitSet &locations, const T &val, const T &deflt=T())
template<class T >
List< T >	createWithValue (const label len, const label index, const T &val, const T &deflt=T())
template<class T >
List< T >	createWithValue (const label len, const label index, T &&val, const T &deflt=T())

Detailed Description

Various functions to operate on Lists.

Original source file ListOps.H

InNamespace Foam

Definition in file ListOps.H.