31 template<
class T,
unsigned Size>
47 template<
class T,
unsigned Size>
63 template<
class T,
unsigned Size>
70 template<
class T,
unsigned Size>
76 vi < cend() && ai < a.
cend();
101 template<
class T,
unsigned Size>
108 template<
class T,
unsigned Size>
115 template<
class T,
unsigned Size>
#define List_CELEM(f, fp, i)
#define List_CONST_ACCESS(type, f, fp)
const_iterator cend() const
Return const_iterator to end traversing the constant FixedList.
A 1D vector of objects of type <T> with a fixed size <Size>.
bool operator<(const instant &, const instant &)
bool operator>=(const FixedList< T, Size > &) const
Return true if !(a < b). Takes linear time.
friend Ostream & operator(Ostream &, const FixedList< T, Size > &)
Write FixedList to Ostream.
bool operator<=(const FixedList< T, Size > &) const
Return true if !(a > b). Takes linear time.
bool operator!=(const FixedList< T, Size > &) const
The opposite of the equality operation. Takes linear time.
const Type * const_iterator
Random access iterator for traversing FixedList.
tmp< fvMatrix< Type > > operator==(const fvMatrix< Type > &, const fvMatrix< Type > &)
bool operator==(const FixedList< T, Size > &) const
Equality operation on FixedLists of the same type.
void swap(FixedList< T, Size > &)
Swap two FixedLists of the same type in constant time.
bool operator>(const instant &, const instant &)
List<T> is a 1D vector of objects of type T, where the size of the vector is known and used for subsc...
bool operator>(const FixedList< T, Size > &) const
Compare two FixedLists lexicographically. Takes linear time.
const_iterator cbegin() const
Return const_iterator to begin traversing the constant FixedList.
#define List_ELEM(f, fp, i)
#define List_ACCESS(type, f, fp)
#define List_FOR_ALL(f, i)
bool equal(const T &s1, const T &s2)
bool operator<(const FixedList< T, Size > &) const
Compare two FixedLists lexicographically. Takes linear time.
A class for managing temporary objects.