/[escript]/trunk-mpi-branch/finley/src/Mesh_print.c
ViewVC logotype

Diff of /trunk-mpi-branch/finley/src/Mesh_print.c

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1222 by ksteube, Tue Feb 13 22:56:57 2007 UTC revision 1223 by gross, Fri Aug 3 02:40:39 2007 UTC
# Line 38  void Finley_Mesh_print(Finley_Mesh *in) Line 38  void Finley_Mesh_print(Finley_Mesh *in)
38        
39    if (in->Nodes!=NULL) {    if (in->Nodes!=NULL) {
40      numDim=in->Nodes->numDim;      numDim=in->Nodes->numDim;
41      printf("=== %1dD-Nodes:\nnumber of nodes=%d\ndegrees of freedom=%d\nreduced degrees of freedom=%d\nreduced number of nodes=%d\n",      printf("=== %1dD-Nodes:\nnumber of nodes=%d\n", numDim,in->Nodes->numNodes);
42          numDim,in->Nodes->numNodes,in->Nodes->numDegreesOfFreedom,in->Nodes->reducedNumDegreesOfFreedom,in->Nodes->reducedNumNodes);      printf("Id,Tag,globalDegreesOfFreedom,degreesOfFreedom,reducedDegreesOfFeedom,node,reducedNode,Coordinates\n");
     printf("Id,Tag,degreeOfFreedom,reducedDegreeOfFreedom,reducedNumNodes,Coordinates\n");  
43      for (i=0;i<in->Nodes->numNodes;i++) {      for (i=0;i<in->Nodes->numNodes;i++) {
44        printf("%d,%d,%d,%d,%d,",        printf("%d,%d,%d,%d,%d,%d,%d ",
45              in->Nodes->Id[i],in->Nodes->Tag[i],in->Nodes->degreeOfFreedom[i],in->Nodes->reducedDegreeOfFreedom[i],in->Nodes->toReduced[i]);              in->Nodes->Id[i],in->Nodes->Tag[i],in->Nodes->globalDegreesOfFreedom[i],
46                in->Nodes->degreesOfFreedomMapping->target[i],
47                in->Nodes->reducedDegreesOfFreedomMapping->target[i],
48                in->Nodes->nodesMapping->target[i],
49                in->Nodes->reducedNodesMapping->target[i]);
50        for (j=0;j<numDim;j++) printf(" %20.15e",in->Nodes->Coordinates[INDEX2(j,i,numDim)]);        for (j=0;j<numDim;j++) printf(" %20.15e",in->Nodes->Coordinates[INDEX2(j,i,numDim)]);
51        printf("\n");        printf("\n");
52      }      }
# Line 56  void Finley_Mesh_print(Finley_Mesh *in) Line 59  void Finley_Mesh_print(Finley_Mesh *in)
59                         in->Elements->ReferenceElement->Type->Name,in->Elements->numElements,in->Elements->minColor,in->Elements->maxColor);                         in->Elements->ReferenceElement->Type->Name,in->Elements->numElements,in->Elements->minColor,in->Elements->maxColor);
60      NN=in->Elements->ReferenceElement->Type->numNodes;      NN=in->Elements->ReferenceElement->Type->numNodes;
61      if (in->Elements->numElements>0) {      if (in->Elements->numElements>0) {
62         printf("Id,Tag,Color,Nodes\n");         printf("Id,Tag,Owner,Color,Nodes\n");
63         for (i=0;i<in->Elements->numElements;i++) {         for (i=0;i<in->Elements->numElements;i++) {
64           printf("%d,%d,%d,",in->Elements->Id[i],in->Elements->Tag[i],in->Elements->Color[i]);           printf("%d,%d,%d,%d,",in->Elements->Id[i],in->Elements->Tag[i],in->Elements->Owner[i], in->Elements->Color[i]);
65           for (j=0;j<NN;j++) printf(" %d",in->Nodes->Id[in->Elements->Nodes[INDEX2(j,i,NN)]]);           for (j=0;j<NN;j++) printf(" %d",in->Nodes->Id[in->Elements->Nodes[INDEX2(j,i,NN)]]);
66           printf("\n");           printf("\n");
67         }         }
# Line 73  void Finley_Mesh_print(Finley_Mesh *in) Line 76  void Finley_Mesh_print(Finley_Mesh *in)
76                 in->FaceElements->ReferenceElement->Type->Name,in->FaceElements->numElements,in->FaceElements->minColor,in->FaceElements->maxColor);                 in->FaceElements->ReferenceElement->Type->Name,in->FaceElements->numElements,in->FaceElements->minColor,in->FaceElements->maxColor);
77      NN=in->FaceElements->ReferenceElement->Type->numNodes;      NN=in->FaceElements->ReferenceElement->Type->numNodes;
78      if (in->FaceElements->numElements>0) {      if (in->FaceElements->numElements>0) {
79         printf("Id,Tag,Color,Nodes\n");         printf("Id,Tag,Owner,Color,Nodes\n");
80         for (i=0;i<in->FaceElements->numElements;i++) {         for (i=0;i<in->FaceElements->numElements;i++) {
81           printf("%d,%d,%d,",in->FaceElements->Id[i],in->FaceElements->Tag[i],in->FaceElements->Color[i]);           printf("%d,%d,%d,%d,",in->FaceElements->Id[i],in->FaceElements->Tag[i],in->Elements->Owner[i], in->FaceElements->Color[i]);
82           for (j=0;j<NN;j++) printf(" %d",in->Nodes->Id[in->FaceElements->Nodes[INDEX2(j,i,NN)]]);           for (j=0;j<NN;j++) printf(" %d",in->Nodes->Id[in->FaceElements->Nodes[INDEX2(j,i,NN)]]);
83           printf("\n");           printf("\n");
84         }         }
# Line 88  void Finley_Mesh_print(Finley_Mesh *in) Line 91  void Finley_Mesh_print(Finley_Mesh *in)
91                         in->ContactElements->ReferenceElement->Type->Name,in->ContactElements->numElements,in->ContactElements->minColor,in->ContactElements->maxColor);                         in->ContactElements->ReferenceElement->Type->Name,in->ContactElements->numElements,in->ContactElements->minColor,in->ContactElements->maxColor);
92      NN=in->ContactElements->ReferenceElement->Type->numNodes;      NN=in->ContactElements->ReferenceElement->Type->numNodes;
93      if (in->ContactElements->numElements>0) {      if (in->ContactElements->numElements>0) {
94         printf("Id,Tag,Color,Nodes\n");         printf("Id,Tag,Owner,Color,Nodes\n");
95         for (i=0;i<in->ContactElements->numElements;i++) {         for (i=0;i<in->ContactElements->numElements;i++) {
96           printf("%d,%d,%d,",in->ContactElements->Id[i],in->ContactElements->Tag[i],in->ContactElements->Color[i]);           printf("%d,%d,%d,%d,",in->ContactElements->Id[i],in->ContactElements->Tag[i],in->Elements->Owner[i], in->ContactElements->Color[i]);
97           for (j=0;j<NN;j++) printf(" %d",in->Nodes->Id[in->ContactElements->Nodes[INDEX2(j,i,NN)]]);           for (j=0;j<NN;j++) printf(" %d",in->Nodes->Id[in->ContactElements->Nodes[INDEX2(j,i,NN)]]);
98           printf("\n");           printf("\n");
99         }         }
# Line 103  void Finley_Mesh_print(Finley_Mesh *in) Line 106  void Finley_Mesh_print(Finley_Mesh *in)
106                         in->Points->ReferenceElement->Type->Name,in->Points->numElements,in->Points->minColor,in->Points->maxColor);                         in->Points->ReferenceElement->Type->Name,in->Points->numElements,in->Points->minColor,in->Points->maxColor);
107      NN=in->Points->ReferenceElement->Type->numNodes;      NN=in->Points->ReferenceElement->Type->numNodes;
108      if (in->Points->numElements>0) {      if (in->Points->numElements>0) {
109         printf("Id,Tag,Color,Nodes\n");         printf("Id,Tag,Owner,Color,Nodes\n");
110         for (i=0;i<in->Points->numElements;i++) {         for (i=0;i<in->Points->numElements;i++) {
111           printf("%d,%d,%d,",in->Points->Id[i],in->Points->Tag[i],in->Points->Color[i]);           printf("%d,%d,%d,%d,",in->Points->Id[i],in->Points->Tag[i],in->Elements->Owner[i], in->Points->Color[i]);
112           for (j=0;j<NN;j++) printf(" %d",in->Nodes->Id[in->Points->Nodes[INDEX2(j,i,NN)]]);           for (j=0;j<NN;j++) printf(" %d",in->Nodes->Id[in->Points->Nodes[INDEX2(j,i,NN)]]);
113           printf("\n");           printf("\n");
114         }         }
115      }      }
116    }    }
117  }  }
   
 /*  
 * $Log$  
 * Revision 1.3  2005/09/15 03:44:22  jgs  
 * Merge of development branch dev-02 back to main trunk on 2005-09-15  
 *  
 * Revision 1.2.2.1  2005/09/07 06:26:19  gross  
 * the solver from finley are put into the standalone package paso now  
 *  
 * Revision 1.2  2005/07/08 04:07:54  jgs  
 * Merge of development branch back to main trunk on 2005-07-08  
 *  
 * Revision 1.1.1.1.2.1  2005/06/29 02:34:53  gross  
 * some changes towards 64 integers in finley  
 *  
 * Revision 1.1.1.1  2004/10/26 06:53:57  jgs  
 * initial import of project esys2  
 *  
 * Revision 1.1.1.1  2004/06/24 04:00:40  johng  
 * Initial version of eys using boost-python.  
 *  
 *  
 */  
   

Legend:
Removed from v.1222  
changed lines
  Added in v.1223

  ViewVC Help
Powered by ViewVC 1.1.26