8#ifndef buildDofsBase2D_hh
9#define buildDofsBase2D_hh
49 const uint nn[2]) = 0;
69 inline std::map<uint, concepts::VertexData>::const_iterator
72 inline std::map<uint, concepts::VertexData>::const_iterator
75 inline std::map<uint, concepts::EdgeData>::const_iterator
78 inline std::map<uint, concepts::EdgeData>::const_iterator
95 return spc_->ctrl0_[idx];
100 return (*(
spc_->ctrl1_))[idx];
105 return spc_->ctrl2_[idx];
108 std::map<uint, concepts::VertexData>::const_iterator
111 return spc_->vertexList_.find(idx);
114 std::map<uint, concepts::VertexData>::const_iterator
117 return spc_->vertexList_.end();
120 std::map<uint, concepts::EdgeData>::const_iterator
123 return spc_->edgeList_.find(idx);
126 std::map<uint, concepts::EdgeData>::const_iterator
129 return spc_->edgeList_.end();
134 spc_->deactivate_(vtx);
139 spc_->deactivate_(edg);
143 ushort Pmax[2])
const {
145 spc_->computePmax_(cntr, Pmax);
concepts::AdaptiveControlP< 2 > & ctrl2_(uint idx)
Returns face tag of face with key idx.
void computePmax_(const concepts::Quad &cntr, ushort Pmax[2]) const
Computes maximal polynomial Pmax degree in cntr in tensor form.
void deactivate_(const concepts::Vertex &vtx)
Deactivates the children of the vertex vtx.
concepts::AdaptiveControl & ctrl0_(uint idx)
Returns vertex tag of vertex with key idx.
Space * spc_
Space to build the vertex degrees of freedom from.
concepts::AdaptiveControlP< 1 > & ctrl1_(uint idx)
Returns edge tag of edge with key idx.
std::map< uint, concepts::EdgeData >::const_iterator edgeListEnd() const
Returns the end of the list with edge data.
std::map< uint, concepts::VertexData >::const_iterator vertexListEnd() const
Returns the end of the list with vertex data.
virtual BuildDofsBase * clone(Space *spc=0) const =0
BuildDofsBase(Space &spc)
BuildDofsBase()
Default constructor.
virtual void operator()(concepts::Quad &cntr, concepts::TColumn< Real > *&T1, const uint nn[2])=0
std::map< uint, concepts::VertexData >::const_iterator vertexListFind(uint idx) const
Returns the iterator to the vertex data of the vertex with key idx.
uint & dim_()
Returns a reference to the dimension of the space.
std::map< uint, concepts::EdgeData >::const_iterator edgeListFind(uint idx) const
Returns the iterator to the edge data of the edge with key idx.
Space * space()
Returns the space.
#define conceptsAssert(cond, exc)