56 template<
class T>
class Pair;
80 void front() =
delete;
95 inline Pair(
const std::pair<T,T>& vals);
98 inline Pair(std::pair<T,T>&& vals);
104 inline Pair(
const T&
f,
const T&
s,
const bool doSort);
118 const T&
first() const
noexcept {
return this->
template get<0>(); }
130 inline const T&
other(
const T& a)
const;
164 unsigned operator()(
const Pair<T>& obj,
unsigned seed=0)
const 191 struct is_contiguous<Pair<T>> : is_contiguous<T> {};
195 struct is_contiguous_label<Pair<
T>> : is_contiguous_label<T> {};
199 struct is_contiguous_scalar<Pair<
T>> : is_contiguous_scalar<T> {};
206 template<
class T1,
class T2>
209 unsigned operator()(
const std::pair<T1, T2>& obj,
unsigned seed=0)
const 222 return Pair<T>(
p.second(),
p.
first());
243 bool operator<(const Pair<T>& a,
const Pair<T>&
b)
247 a.first() <
b.first()
248 || (!(
b.first() < a.first()) && a.second() <
b.second())
254 bool operator<=(const Pair<T>& a,
const Pair<T>&
b)
277 template<
class T1,
class T2>
281 is >> t.first >> t.second;
290 template<
class T1,
class T2>
291 inline Ostream& operator<<(Ostream& os, const std::pair<T1,T2>& t)
bool is_sorted() const
True if first() is less-than-equal second()
const T & first() const noexcept
Access the first element.
void back()=delete
The back() accessor (from FixedList) has no purpose.
void sort()
Sort so that first() is less-than second()
A 1D vector of objects of type <T> with a fixed length <N>.
virtual bool check(const char *operation) const
Check IOstream status for given operation.
bool readBegin(const char *funcName)
Begin read of data chunk, starts with '('.
An Istream is an abstract base class for all input systems (streams, files, token lists etc)...
void flip()
Flip the Pair in-place.
T & first()
Access first element of the list, position [0].
bool operator>(const IOstreamOption::versionNumber &a, const IOstreamOption::versionNumber &b) noexcept
Version A newer than B.
Begin list [isseparator].
bool operator>=(const IOstreamOption::versionNumber &a, const IOstreamOption::versionNumber &b) noexcept
Version A same or newer than B.
const T & other(const T &a) const
Return other element.
Pair()=default
Default construct.
An ordered pair of two objects of type <T> with first() and second() elements.
void front()=delete
The front() accessor (from FixedList) has no purpose.
static int compare(const Pair< T > &a, const Pair< T > &b)
Compare Pairs.
const dimensionedScalar b
Wien displacement law constant: default SI units: [m.K].
Istream & operator>>(Istream &, directionInfo &)
Pair< word > wordPair
A pair of words.
void reverse(UList< T > &list, const label n)
Reverse the first n elements of the list.
unsigned operator()(const T &obj, unsigned seed=0) const
An Ostream is an abstract base class for all output systems (streams, files, token lists...
Pair< label > labelPair
A pair of labels.
bool sorted() const
Deprecated(2023-07) Use is_sorted() method.
bool readEnd(const char *funcName)
End read of data chunk, ends with ')'.
OBJstream os(runTime.globalPath()/outputName)
void T(FieldField< Field, Type > &f1, const FieldField< Field, Type > &f2)
Hash function class. The default definition is for primitives. Non-primitives used to hash entries on...
bool operator!=(const eddy &a, const eddy &b)
tmp< faMatrix< Type > > operator==(const faMatrix< Type > &, const faMatrix< Type > &)
const T & second() const noexcept
Access the second element.
gmvFile<< "tracers "<< particles.size()<< nl;for(const passiveParticle &p :particles){ gmvFile<< p.position().x()<< " ";}gmvFile<< nl;for(const passiveParticle &p :particles){ gmvFile<< p.position().y()<< " ";}gmvFile<< nl;for(const passiveParticle &p :particles){ gmvFile<< p.position().z()<< " ";}gmvFile<< nl;forAll(lagrangianScalarNames, i){ word name=lagrangianScalarNames[i];IOField< scalar > s(IOobject(name, runTime.timeName(), cloud::prefix, mesh, IOobject::MUST_READ, IOobject::NO_WRITE))