diff --git a/FunctionSpace/CMakeLists.txt b/FunctionSpace/CMakeLists.txt
index 4de8f2ce404986639338b9031713d860fab6f869..c930d90f37a5f151e79f503496fed76f5782128e 100644
--- a/FunctionSpace/CMakeLists.txt
+++ b/FunctionSpace/CMakeLists.txt
@@ -7,6 +7,10 @@ set(SRC
Polynomial.cpp
Legendre.cpp
+ ReferenceSpace.cpp
+ TriReferenceSpace.cpp
+ TetReferenceSpace.cpp
+
Basis.cpp
LagrangeBasis.cpp
BasisScalar.cpp
diff --git a/FunctionSpace/ReferenceSpace.cpp b/FunctionSpace/ReferenceSpace.cpp
index 8ef1f20a6c09d63cdf4fdbd5ab34ec2079dde2b6..2d23d4dd588b70c2ad2e3df01b9d33cea24fbd12 100644
--- a/FunctionSpace/ReferenceSpace.cpp
+++ b/FunctionSpace/ReferenceSpace.cpp
@@ -1,9 +1,15 @@
+#include <algorithm>
#include <sstream>
+
+#include "Exception.h"
#include "ReferenceSpace.h"
using namespace std;
ReferenceSpace::ReferenceSpace(void){
+ // Defining Ref Edge and Face in //
+ // Dervived Class //
+ // And CALL INIT() //
}
ReferenceSpace::~ReferenceSpace(void){
@@ -34,7 +40,8 @@ ReferenceSpace::~ReferenceSpace(void){
void ReferenceSpace::init(void){
// Init Root //
- nPerm = 0;
+ nPerm = 0;
+ nextLeafId = 0;
pTreeRoot.depth = 0;
pTreeRoot.last = NULL;
@@ -45,12 +52,15 @@ void ReferenceSpace::init(void){
for(unsigned int i = 0; i < pTreeRoot.number; i++)
pTreeRoot.possible[i] = i;
- // Generate Tree //
+ // Populate Tree //
lPerm = new list<unsigned int*>;
- generate(&pTreeRoot);
+ populate(&pTreeRoot);
+ // Get Permutations //
perm = new unsigned int*[nPerm];
for(unsigned int i = 0; i < nPerm; i++){
+ // Take Permutation for queue
+ // (AND IN ORDER)
perm[i] = lPerm->front();
lPerm->pop_front();
}
@@ -62,25 +72,43 @@ void ReferenceSpace::init(void){
getFace();
}
-void ReferenceSpace::generate(node* pTreeRoot){
- const unsigned int number = pTreeRoot->number;
- const unsigned int depth = pTreeRoot->depth;
+void ReferenceSpace::populate(node* pTreeRoot){
+ // Get Some Data on this Root //
+ const unsigned int number = pTreeRoot->number;
+ const unsigned int nextNumber = number - 1;
+ const unsigned int depth = pTreeRoot->depth;
+ const unsigned int nextDepth = pTreeRoot->depth + 1;
+
+ // Temp Data //
+ unsigned int nextLast;
+ unsigned int offset;
+ // If Leaf : a new permutation is found //
if(!number){
- pTreeRoot->next = NULL;
+ // Init Permutation
+ pTreeRoot->next = NULL;
+ pTreeRoot->leafId = nextLeafId;
+
+ // Value for Next Permutation
+ nextLeafId++;
nPerm++;
+
+ // Put this Permutation in queue
+ // (AND IN ORDER)
lPerm->push_back(pTreeRoot->last);
}
+ // Else: continue to build the tree //
else{
+ // We got 'number' child nodes
pTreeRoot->next = new node[number];
+ // Init each child node
for(unsigned int i = 0; i < number; i++){
- unsigned int nextDepth = pTreeRoot->depth + 1;
- unsigned int nextLast = pTreeRoot->possible[i];
- unsigned int nextNumber = number - 1;
- unsigned int offset = 0;
+ nextLast = pTreeRoot->possible[i];
+ offset = 0;
+ // Depth and Last Choices of child nodes
pTreeRoot->next[i].depth = nextDepth;
pTreeRoot->next[i].last = new unsigned int[nextDepth];
pTreeRoot->next[i].last[depth] = nextLast;
@@ -88,6 +116,7 @@ void ReferenceSpace::generate(node* pTreeRoot){
for(unsigned int j = 0; j < depth; j++)
pTreeRoot->next[i].last[j] = pTreeRoot->last[j];
+ // Possibilities of child node
pTreeRoot->next[i].number = nextNumber;
pTreeRoot->next[i].possible = new unsigned int[nextNumber];
@@ -98,7 +127,8 @@ void ReferenceSpace::generate(node* pTreeRoot){
pTreeRoot->next[i].possible[j] = pTreeRoot->possible[j + offset];
}
- generate(&pTreeRoot->next[i]);
+ // Populate each child node (until a leaf is found)
+ populate(&pTreeRoot->next[i]);
}
}
}
@@ -192,6 +222,64 @@ inOrder(unsigned int permutation,
return inorder;
}
+unsigned int ReferenceSpace::getReferenceSpace(const MElement& elem) const{
+ // Const_Cast //
+ MElement& element = const_cast<MElement&>(elem);
+
+ // Get Primary Vertices //
+ const int nVertex = element.getNumPrimaryVertices();
+ vector<pair<unsigned int, MVertex*> > vertex(nVertex);
+
+ for(int i = 0; i < nVertex; i++){
+ vertex[i].first = i;
+ vertex[i].second = element.getVertex(i);
+ }
+
+ // Sort Them with repsect to Vertex Global ID //
+ // (vertex[i].second->getNum) //
+ std::sort(vertex.begin(), vertex.end(), sortPredicate);
+
+ // Tree Lookup //
+ try{
+ return treeLookup(&pTreeRoot, vertex);
+ }
+
+ catch(...){
+ throw Exception("Cannot Find Reference Space for Element %d",
+ element.getNum());
+ }
+}
+
+unsigned int ReferenceSpace::treeLookup(const node* root,
+ vector<pair<unsigned int, MVertex*> >&
+ sortedArray){
+ // Temp Data //
+ unsigned int choice;
+ unsigned int i;
+
+ // If Root is *not* a Leaf: Lookup //
+ if(root->number){
+ // Get This Choice
+ choice = sortedArray[root->depth].first;
+
+ // Look for next node corresponding to this Choice
+ i = 0;
+ while(root->possible[i] != choice)
+ i++;
+
+ // Look if a this Choice has been found
+ if(i == root->number)
+ throw Exception();
+
+ // Go to next Node
+ return treeLookup(&root->next[i], sortedArray);
+ }
+
+ // Else: Return Leaf ID //
+ else
+ return root->leafId;
+}
+
string ReferenceSpace::toString(void) const{
stringstream stream;
diff --git a/FunctionSpace/ReferenceSpace.h b/FunctionSpace/ReferenceSpace.h
index 59d28e65f384971e980cd2f8676081bd0bc95e94..c8f341cc3bac0c20c22dcb34a1b071a02a3b6eea 100644
--- a/FunctionSpace/ReferenceSpace.h
+++ b/FunctionSpace/ReferenceSpace.h
@@ -4,6 +4,7 @@
#include <vector>
#include <list>
#include <string>
+#include "MElement.h"
class ReferenceSpace{
protected:
@@ -14,11 +15,16 @@ class ReferenceSpace{
unsigned int number; // Number of Next Choise
unsigned int* possible; // Possible Next Choise
node_s* next; // Next Choise
+
+ unsigned int leafId; // If leaf: this leaf number
+ // (from 0 to nLeaf - 1)
+ // Else: no meaning
};
typedef node_s node;
// Permutation (Tree + Leaf) //
+ unsigned int nextLeafId;
unsigned int nVertex;
unsigned int nPerm;
unsigned int** perm;
@@ -41,6 +47,8 @@ class ReferenceSpace{
unsigned int getNReferenceSpace(void) const;
+ unsigned int getReferenceSpace(const MElement& element) const;
+
std::vector<const std::vector<const std::vector<unsigned int>*>*>&
getAllEdge(void) const;
@@ -53,7 +61,7 @@ class ReferenceSpace{
ReferenceSpace(void);
void init(void);
- void generate(node* pTreeRoot);
+ void populate(node* pTreeRoot);
void destroy(node* node);
void getEdge(void);
@@ -68,6 +76,13 @@ class ReferenceSpace{
unsigned int b,
unsigned int c);
+ static bool sortPredicate(const std::pair<unsigned int, MVertex*>& a,
+ const std::pair<unsigned int, MVertex*>& b);
+
+ static unsigned int treeLookup(const node* root,
+ std::vector<std::pair<unsigned int, MVertex*> >&
+ sortedArray);
+
std::string toString(const node* node) const;
};
@@ -93,4 +108,11 @@ ReferenceSpace::getAllFace(void) const{
return *face;
}
+inline
+bool
+ReferenceSpace::sortPredicate(const std::pair<unsigned int, MVertex*>& a,
+ const std::pair<unsigned int, MVertex*>& b){
+ return a.second->getNum() < b.second->getNum();
+}
+
#endif