33 inline int P()
const {
return P_; }
44 for (
unsigned int i = 0; i <
number; ++i) {
45 os <<
"p(" << i <<
") = " <<
o.p_[i] <<
", ";
68 inline int p(
const uint i)
const {
69 if (i <
number)
return p_[i];
77 equal &= (p_[i] ==
o.p_[i]);
84 if (p_[i] <
o.p_[i])
return true;
100 struct hash<
concepts::Orders<number> > {
162 template<
int type,
int mode>
180 const int Q = 0,
const int R = 0,
const bool cache =
true);
197 const int Q = 0,
const int R = 0);
204 static void clearCache() { principal_H.clear(); }
208 virtual std::ostream&
info(std::ostream&
os)
const;
217 static typename std::unordered_map<Orders<type>,
Real*,
218 std::hash<Orders<type> >,
219 std::OrdersEqual<type> > principal_H;
Karniadakis(const int P, const Real *xP, const int NxP, const int Q=0, const int R=0, const bool cache=true)
virtual std::ostream & info(std::ostream &os) const
Returns information in an output stream.
Karniadakis(const Karniadakis< type, mode > &arg)
Copy constructor.
Karniadakis(const int P, int NxP, const Real *values, const int Q=0, const int R=0)
OrdersBase()
Default constructor.
int P_
Number of quadrature points.
int P() const
Returns number of quadrature points.
OrdersBase(const int P)
Constructor.
int p(const uint i) const
Returns ith polynomial degree.
bool operator<(const Orders< number > &o) const
< operator
Orders(const int p0, const int P, const int p1=0, const int p2=0)
Constructor.
bool operator==(const Orders< number > &o) const
Equality operator.
Orders()
Default constructor.
const Real * values() const
Returns the values of the shape functions.
size_t hash_value(const concepts::Index &i)
Computes a hash for i.
Set< F > makeSet(uint n, const F &first,...)