Lines Matching refs:order

20   const int order = data.getSpaceOrder();  in gmshGeneratePoints()  local
24 case TYPE_LIN: points = gmshGeneratePointsLine(order); return; in gmshGeneratePoints()
25 case TYPE_TRI: points = gmshGeneratePointsTriangle(order, serendip); return; in gmshGeneratePoints()
26 case TYPE_QUA: points = gmshGeneratePointsQuadrangle(order, serendip); return; in gmshGeneratePoints()
28 points = gmshGeneratePointsTetrahedron(order, serendip); in gmshGeneratePoints()
30 case TYPE_PRI: points = gmshGeneratePointsPrism(order, serendip); return; in gmshGeneratePoints()
31 case TYPE_HEX: points = gmshGeneratePointsHexahedron(order, serendip); return; in gmshGeneratePoints()
42 fullMatrix<double> gmshGeneratePointsLine(int order) in gmshGeneratePointsLine() argument
44 fullMatrix<double> points = gmshGenerateMonomialsLine(order); in gmshGeneratePointsLine()
45 if(order == 0) return points; in gmshGeneratePointsLine()
46 points.scale(2. / order); in gmshGeneratePointsLine()
51 fullMatrix<double> gmshGeneratePointsTriangle(int order, bool serendip) in gmshGeneratePointsTriangle() argument
53 fullMatrix<double> points = gmshGenerateMonomialsTriangle(order, serendip); in gmshGeneratePointsTriangle()
54 if(order == 0) return points; in gmshGeneratePointsTriangle()
55 points.scale(1. / order); in gmshGeneratePointsTriangle()
59 fullMatrix<double> gmshGeneratePointsQuadrangle(int order, bool serendip) in gmshGeneratePointsQuadrangle() argument
61 fullMatrix<double> points = gmshGenerateMonomialsQuadrangle(order, serendip); in gmshGeneratePointsQuadrangle()
62 if(order == 0) return points; in gmshGeneratePointsQuadrangle()
63 points.scale(2. / order); in gmshGeneratePointsQuadrangle()
68 fullMatrix<double> gmshGeneratePointsTetrahedron(int order, bool serendip) in gmshGeneratePointsTetrahedron() argument
70 fullMatrix<double> points = gmshGenerateMonomialsTetrahedron(order, serendip); in gmshGeneratePointsTetrahedron()
71 if(order == 0) return points; in gmshGeneratePointsTetrahedron()
72 points.scale(1. / order); in gmshGeneratePointsTetrahedron()
76 fullMatrix<double> gmshGeneratePointsHexahedron(int order, bool serendip) in gmshGeneratePointsHexahedron() argument
78 fullMatrix<double> points = gmshGenerateMonomialsHexahedron(order, serendip); in gmshGeneratePointsHexahedron()
79 if(order == 0) return points; in gmshGeneratePointsHexahedron()
80 points.scale(2. / order); in gmshGeneratePointsHexahedron()
85 fullMatrix<double> gmshGeneratePointsPrism(int order, bool serendip) in gmshGeneratePointsPrism() argument
87 fullMatrix<double> points = gmshGenerateMonomialsPrism(order, serendip); in gmshGeneratePointsPrism()
88 if(order == 0) return points; in gmshGeneratePointsPrism()
91 tmp.scale(1. / order); in gmshGeneratePointsPrism()
93 tmp.scale(2. / order); in gmshGeneratePointsPrism()
98 fullMatrix<double> gmshGeneratePointsPyramid(int order, bool serendip) in gmshGeneratePointsPyramid() argument
100 fullMatrix<double> points = gmshGenerateMonomialsPyramid(order, serendip); in gmshGeneratePointsPyramid()
101 if(order == 0) return points; in gmshGeneratePointsPyramid()
103 points(i, 2) = 1 - points(i, 2) / order; in gmshGeneratePointsPyramid()
105 points(i, 0) = duv + points(i, 0) * 2. / order; in gmshGeneratePointsPyramid()
106 points(i, 1) = duv + points(i, 1) * 2. / order; in gmshGeneratePointsPyramid()
140 const int order = data.getSpaceOrder(); in gmshGenerateMonomials() local
144 case TYPE_LIN: monomials = gmshGenerateMonomialsLine(order); return; in gmshGenerateMonomials()
146 monomials = gmshGenerateMonomialsTriangle(order, serendip); in gmshGenerateMonomials()
149 monomials = gmshGenerateMonomialsQuadrangle(order, serendip); in gmshGenerateMonomials()
152 monomials = gmshGenerateMonomialsTetrahedron(order, serendip); in gmshGenerateMonomials()
155 monomials = gmshGenerateMonomialsPrism(order, serendip); in gmshGenerateMonomials()
158 monomials = gmshGenerateMonomialsHexahedron(order, serendip); in gmshGenerateMonomials()
171 fullMatrix<double> gmshGenerateMonomialsLine(int order, bool serendip) in gmshGenerateMonomialsLine() argument
173 fullMatrix<double> monomials(order + 1, 1); in gmshGenerateMonomialsLine()
175 if(order > 0) { in gmshGenerateMonomialsLine()
176 monomials(1, 0) = order; in gmshGenerateMonomialsLine()
177 for(int i = 2; i < order + 1; i++) monomials(i, 0) = i - 1; in gmshGenerateMonomialsLine()
182 fullMatrix<double> gmshGenerateMonomialsTriangle(int order, bool serendip) in gmshGenerateMonomialsTriangle() argument
184 int nbMonomials = serendip ? 3 * order : (order + 1) * (order + 2) / 2; in gmshGenerateMonomialsTriangle()
185 if(serendip && !order) nbMonomials = 1; in gmshGenerateMonomialsTriangle()
191 if(order > 0) { in gmshGenerateMonomialsTriangle()
192 monomials(1, 0) = order; in gmshGenerateMonomialsTriangle()
196 monomials(2, 1) = order; in gmshGenerateMonomialsTriangle()
198 if(order > 1) { in gmshGenerateMonomialsTriangle()
204 int u_0 = (monomials(i1, 0) - monomials(i0, 0)) / order; in gmshGenerateMonomialsTriangle()
205 int u_1 = (monomials(i1, 1) - monomials(i0, 1)) / order; in gmshGenerateMonomialsTriangle()
207 for(int i = 1; i < order; ++i, ++index) { in gmshGenerateMonomialsTriangle()
212 if(!serendip && order > 2) { in gmshGenerateMonomialsTriangle()
213 fullMatrix<double> inner = gmshGenerateMonomialsTriangle(order - 3); in gmshGenerateMonomialsTriangle()
222 fullMatrix<double> gmshGenerateMonomialsQuadrangle(int order, in gmshGenerateMonomialsQuadrangle() argument
225 int nbMonomials = forSerendipPoints ? order * 4 : (order + 1) * (order + 1); in gmshGenerateMonomialsQuadrangle()
226 if(forSerendipPoints && !order) nbMonomials = 1; in gmshGenerateMonomialsQuadrangle()
232 if(order > 0) { in gmshGenerateMonomialsQuadrangle()
233 monomials(1, 0) = order; in gmshGenerateMonomialsQuadrangle()
236 monomials(2, 0) = order; in gmshGenerateMonomialsQuadrangle()
237 monomials(2, 1) = order; in gmshGenerateMonomialsQuadrangle()
240 monomials(3, 1) = order; in gmshGenerateMonomialsQuadrangle()
242 if(order > 1) { in gmshGenerateMonomialsQuadrangle()
248 int u_0 = (monomials(i1, 0) - monomials(i0, 0)) / order; in gmshGenerateMonomialsQuadrangle()
249 int u_1 = (monomials(i1, 1) - monomials(i0, 1)) / order; in gmshGenerateMonomialsQuadrangle()
251 for(int i = 1; i < order; ++i, ++index) { in gmshGenerateMonomialsQuadrangle()
258 fullMatrix<double> inner = gmshGenerateMonomialsQuadrangle(order - 2); in gmshGenerateMonomialsQuadrangle()
276 fullMatrix<double> gmshGenerateMonomialsQuadSerendipity(int order) in gmshGenerateMonomialsQuadSerendipity() argument
278 int nbMonomials = order ? order * 4 : 1; in gmshGenerateMonomialsQuadSerendipity()
284 if(order > 0) { in gmshGenerateMonomialsQuadSerendipity()
294 if(order > 1) { in gmshGenerateMonomialsQuadSerendipity()
296 for(int p = 2; p <= order; ++p) { in gmshGenerateMonomialsQuadSerendipity()
317 fullMatrix<double> gmshGenerateMonomialsTetrahedron(int order, bool serendip) in gmshGenerateMonomialsTetrahedron() argument
319 int nbMonomials = serendip ? 4 + (order - 1) * 6 : in gmshGenerateMonomialsTetrahedron()
320 (order + 1) * (order + 2) * (order + 3) / 6; in gmshGenerateMonomialsTetrahedron()
321 if(serendip && !order) nbMonomials = 1; in gmshGenerateMonomialsTetrahedron()
328 if(order > 0) { in gmshGenerateMonomialsTetrahedron()
329 monomials(1, 0) = order; in gmshGenerateMonomialsTetrahedron()
334 monomials(2, 1) = order; in gmshGenerateMonomialsTetrahedron()
339 monomials(3, 2) = order; in gmshGenerateMonomialsTetrahedron()
344 if(order > 1) { in gmshGenerateMonomialsTetrahedron()
351 u[0] = (monomials(i1, 0) - monomials(i0, 0)) / order; in gmshGenerateMonomialsTetrahedron()
352 u[1] = (monomials(i1, 1) - monomials(i0, 1)) / order; in gmshGenerateMonomialsTetrahedron()
353 u[2] = (monomials(i1, 2) - monomials(i0, 2)) / order; in gmshGenerateMonomialsTetrahedron()
355 for(int i = 1; i < order; ++i, ++index) { in gmshGenerateMonomialsTetrahedron()
362 if(!serendip && order > 2) { in gmshGenerateMonomialsTetrahedron()
363 fullMatrix<double> dudv = gmshGenerateMonomialsTriangle(order - 3); in gmshGenerateMonomialsTetrahedron()
372 u[0] = (monomials(i1, 0) - monomials(i0, 0)) / order; in gmshGenerateMonomialsTetrahedron()
373 u[1] = (monomials(i1, 1) - monomials(i0, 1)) / order; in gmshGenerateMonomialsTetrahedron()
374 u[2] = (monomials(i1, 2) - monomials(i0, 2)) / order; in gmshGenerateMonomialsTetrahedron()
376 v[0] = (monomials(i2, 0) - monomials(i0, 0)) / order; in gmshGenerateMonomialsTetrahedron()
377 v[1] = (monomials(i2, 1) - monomials(i0, 1)) / order; in gmshGenerateMonomialsTetrahedron()
378 v[2] = (monomials(i2, 2) - monomials(i0, 2)) / order; in gmshGenerateMonomialsTetrahedron()
390 if(order > 3) { in gmshGenerateMonomialsTetrahedron()
392 gmshGenerateMonomialsTetrahedron(order - 4); in gmshGenerateMonomialsTetrahedron()
402 fullMatrix<double> gmshGenerateMonomialsPrism(int order, bool forSerendipPoints) in gmshGenerateMonomialsPrism() argument
405 6 + (order - 1) * 9 : in gmshGenerateMonomialsPrism()
406 (order + 1) * (order + 1) * (order + 2) / 2; in gmshGenerateMonomialsPrism()
407 if(forSerendipPoints && !order) nbMonomials = 1; in gmshGenerateMonomialsPrism()
414 if(order > 0) { in gmshGenerateMonomialsPrism()
415 monomials(1, 0) = order; in gmshGenerateMonomialsPrism()
420 monomials(2, 1) = order; in gmshGenerateMonomialsPrism()
425 monomials(3, 2) = order; in gmshGenerateMonomialsPrism()
427 monomials(4, 0) = order; in gmshGenerateMonomialsPrism()
429 monomials(4, 2) = order; in gmshGenerateMonomialsPrism()
432 monomials(5, 1) = order; in gmshGenerateMonomialsPrism()
433 monomials(5, 2) = order; in gmshGenerateMonomialsPrism()
435 if(order > 1) { in gmshGenerateMonomialsPrism()
441 int u_1 = (monomials(i1, 0) - monomials(i0, 0)) / order; in gmshGenerateMonomialsPrism()
442 int u_2 = (monomials(i1, 1) - monomials(i0, 1)) / order; in gmshGenerateMonomialsPrism()
443 int u_3 = (monomials(i1, 2) - monomials(i0, 2)) / order; in gmshGenerateMonomialsPrism()
445 for(int i = 1; i < order; ++i, ++index) { in gmshGenerateMonomialsPrism()
453 fullMatrix<double> dudvQ = gmshGenerateMonomialsQuadrangle(order - 2); in gmshGenerateMonomialsPrism()
457 if(order > 2) { in gmshGenerateMonomialsPrism()
458 dudvT = gmshGenerateMonomialsTriangle(order - 3); in gmshGenerateMonomialsPrism()
471 else if(order > 2) { in gmshGenerateMonomialsPrism()
479 u[0] = (monomials(i1, 0) - monomials(i0, 0)) / order; in gmshGenerateMonomialsPrism()
480 u[1] = (monomials(i1, 1) - monomials(i0, 1)) / order; in gmshGenerateMonomialsPrism()
481 u[2] = (monomials(i1, 2) - monomials(i0, 2)) / order; in gmshGenerateMonomialsPrism()
483 v[0] = (monomials(i2, 0) - monomials(i0, 0)) / order; in gmshGenerateMonomialsPrism()
484 v[1] = (monomials(i2, 1) - monomials(i0, 1)) / order; in gmshGenerateMonomialsPrism()
485 v[2] = (monomials(i2, 2) - monomials(i0, 2)) / order; in gmshGenerateMonomialsPrism()
497 if(order > 2) { in gmshGenerateMonomialsPrism()
499 gmshGenerateMonomialsTriangle(order - 3); in gmshGenerateMonomialsPrism()
501 gmshGenerateMonomialsLine(order - 2); in gmshGenerateMonomialsPrism()
517 fullMatrix<double> gmshGenerateMonomialsPrismSerendipity(int order) in gmshGenerateMonomialsPrismSerendipity() argument
519 int nbMonomials = order ? 6 + (order - 1) * 9 : 1; in gmshGenerateMonomialsPrismSerendipity()
526 if(order > 0) { in gmshGenerateMonomialsPrismSerendipity()
547 if(order > 1) { in gmshGenerateMonomialsPrismSerendipity()
555 for(int p = 2; p <= order; ++p) { in gmshGenerateMonomialsPrismSerendipity()
565 int val1 = order - 1; in gmshGenerateMonomialsPrismSerendipity()
566 for(int p = 2; p <= order; ++p) { in gmshGenerateMonomialsPrismSerendipity()
583 fullMatrix<double> gmshGenerateMonomialsHexahedron(int order, in gmshGenerateMonomialsHexahedron() argument
586 int nbMonomials = forSerendipPoints ? 8 + (order - 1) * 12 : in gmshGenerateMonomialsHexahedron()
587 (order + 1) * (order + 1) * (order + 1); in gmshGenerateMonomialsHexahedron()
588 if(forSerendipPoints && !order) nbMonomials = 1; in gmshGenerateMonomialsHexahedron()
595 if(order > 0) { in gmshGenerateMonomialsHexahedron()
596 monomials(1, 0) = order; in gmshGenerateMonomialsHexahedron()
600 monomials(2, 0) = order; in gmshGenerateMonomialsHexahedron()
601 monomials(2, 1) = order; in gmshGenerateMonomialsHexahedron()
605 monomials(3, 1) = order; in gmshGenerateMonomialsHexahedron()
610 monomials(4, 2) = order; in gmshGenerateMonomialsHexahedron()
612 monomials(5, 0) = order; in gmshGenerateMonomialsHexahedron()
614 monomials(5, 2) = order; in gmshGenerateMonomialsHexahedron()
616 monomials(6, 0) = order; in gmshGenerateMonomialsHexahedron()
617 monomials(6, 1) = order; in gmshGenerateMonomialsHexahedron()
618 monomials(6, 2) = order; in gmshGenerateMonomialsHexahedron()
621 monomials(7, 1) = order; in gmshGenerateMonomialsHexahedron()
622 monomials(7, 2) = order; in gmshGenerateMonomialsHexahedron()
624 if(order > 1) { in gmshGenerateMonomialsHexahedron()
630 int u_1 = (monomials(i1, 0) - monomials(i0, 0)) / order; in gmshGenerateMonomialsHexahedron()
631 int u_2 = (monomials(i1, 1) - monomials(i0, 1)) / order; in gmshGenerateMonomialsHexahedron()
632 int u_3 = (monomials(i1, 2) - monomials(i0, 2)) / order; in gmshGenerateMonomialsHexahedron()
634 for(int i = 1; i < order; ++i, ++index) { in gmshGenerateMonomialsHexahedron()
642 fullMatrix<double> dudv = gmshGenerateMonomialsQuadrangle(order - 2); in gmshGenerateMonomialsHexahedron()
651 u[0] = (monomials(i1, 0) - monomials(i0, 0)) / order; in gmshGenerateMonomialsHexahedron()
652 u[1] = (monomials(i1, 1) - monomials(i0, 1)) / order; in gmshGenerateMonomialsHexahedron()
653 u[2] = (monomials(i1, 2) - monomials(i0, 2)) / order; in gmshGenerateMonomialsHexahedron()
655 v[0] = (monomials(i3, 0) - monomials(i0, 0)) / order; in gmshGenerateMonomialsHexahedron()
656 v[1] = (monomials(i3, 1) - monomials(i0, 1)) / order; in gmshGenerateMonomialsHexahedron()
657 v[2] = (monomials(i3, 2) - monomials(i0, 2)) / order; in gmshGenerateMonomialsHexahedron()
669 fullMatrix<double> inner = gmshGenerateMonomialsHexahedron(order - 2); in gmshGenerateMonomialsHexahedron()
678 fullMatrix<double> gmshGenerateMonomialsHexaSerendipity(int order) in gmshGenerateMonomialsHexaSerendipity() argument
680 int nbMonomials = order ? 8 + (order - 1) * 12 : 1; in gmshGenerateMonomialsHexaSerendipity()
687 if(order > 0) { in gmshGenerateMonomialsHexaSerendipity()
716 if(order > 1) { in gmshGenerateMonomialsHexaSerendipity()
724 for(int p = 2; p <= order; ++p) { in gmshGenerateMonomialsHexaSerendipity()
737 fullMatrix<double> gmshGenerateMonomialsPyramid(int order, in gmshGenerateMonomialsPyramid() argument
740 int nbMonomials = forSerendipPoints ? 5 + (order - 1) * 8 : in gmshGenerateMonomialsPyramid()
741 (order + 1) * ((order + 1) + 1) * in gmshGenerateMonomialsPyramid()
742 (2 * (order + 1) + 1) / 6; in gmshGenerateMonomialsPyramid()
743 if(forSerendipPoints && !order) nbMonomials = 1; in gmshGenerateMonomialsPyramid()
749 monomials(0, 2) = order; in gmshGenerateMonomialsPyramid()
751 if(order > 0) { in gmshGenerateMonomialsPyramid()
752 monomials(1, 0) = order; in gmshGenerateMonomialsPyramid()
754 monomials(1, 2) = order; in gmshGenerateMonomialsPyramid()
756 monomials(2, 0) = order; in gmshGenerateMonomialsPyramid()
757 monomials(2, 1) = order; in gmshGenerateMonomialsPyramid()
758 monomials(2, 2) = order; in gmshGenerateMonomialsPyramid()
761 monomials(3, 1) = order; in gmshGenerateMonomialsPyramid()
762 monomials(3, 2) = order; in gmshGenerateMonomialsPyramid()
768 if(order > 1) { in gmshGenerateMonomialsPyramid()
774 int u_1 = (monomials(i1, 0) - monomials(i0, 0)) / order; in gmshGenerateMonomialsPyramid()
775 int u_2 = (monomials(i1, 1) - monomials(i0, 1)) / order; in gmshGenerateMonomialsPyramid()
776 int u_3 = (monomials(i1, 2) - monomials(i0, 2)) / order; in gmshGenerateMonomialsPyramid()
778 for(int i = 1; i < order; ++i, ++index) { in gmshGenerateMonomialsPyramid()
786 fullMatrix<double> dudvQ = gmshGenerateMonomialsQuadrangle(order - 2); in gmshGenerateMonomialsPyramid()
790 if(order > 2) { in gmshGenerateMonomialsPyramid()
791 dudvT = gmshGenerateMonomialsTriangle(order - 3); in gmshGenerateMonomialsPyramid()
804 else if(order > 2) { in gmshGenerateMonomialsPyramid()
812 u[0] = (monomials(i1, 0) - monomials(i0, 0)) / order; in gmshGenerateMonomialsPyramid()
813 u[1] = (monomials(i1, 1) - monomials(i0, 1)) / order; in gmshGenerateMonomialsPyramid()
814 u[2] = (monomials(i1, 2) - monomials(i0, 2)) / order; in gmshGenerateMonomialsPyramid()
816 v[0] = (monomials(i2, 0) - monomials(i0, 0)) / order; in gmshGenerateMonomialsPyramid()
817 v[1] = (monomials(i2, 1) - monomials(i0, 1)) / order; in gmshGenerateMonomialsPyramid()
818 v[2] = (monomials(i2, 2) - monomials(i0, 2)) / order; in gmshGenerateMonomialsPyramid()
830 if(order > 2) { in gmshGenerateMonomialsPyramid()
831 fullMatrix<double> inner = gmshGenerateMonomialsPyramid(order - 3); in gmshGenerateMonomialsPyramid()
845 fullMatrix<double> gmshGenerateMonomialsPyramidSerendipity(int order) in gmshGenerateMonomialsPyramidSerendipity() argument
848 int nbMonomials = order ? 5 + (order - 1) * 8 : 1; in gmshGenerateMonomialsPyramidSerendipity()
856 if(order > 0) { in gmshGenerateMonomialsPyramidSerendipity()
874 if(order > 1) { in gmshGenerateMonomialsPyramidSerendipity()
876 for(int i = 2; i <= order; ++i, ++idx) { in gmshGenerateMonomialsPyramidSerendipity()
881 for(int i = 2; i <= order; ++i, ++idx) { in gmshGenerateMonomialsPyramidSerendipity()
886 for(int i = 2; i <= order; ++i, ++idx) { in gmshGenerateMonomialsPyramidSerendipity()
891 for(int i = 1; i < order; ++i, ++idx) { in gmshGenerateMonomialsPyramidSerendipity()
894 monomials(idx, 2) = order; in gmshGenerateMonomialsPyramidSerendipity()
896 for(int i = 1; i < order; ++i, ++idx) { in gmshGenerateMonomialsPyramidSerendipity()
899 monomials(idx, 2) = order; in gmshGenerateMonomialsPyramidSerendipity()
901 for(int i = 1; i < order; ++i, ++idx) { in gmshGenerateMonomialsPyramidSerendipity()
903 monomials(idx, 1) = order - i; in gmshGenerateMonomialsPyramidSerendipity()
904 monomials(idx, 2) = order; in gmshGenerateMonomialsPyramidSerendipity()
906 for(int i = 2; i <= order; ++i, ++idx) { in gmshGenerateMonomialsPyramidSerendipity()
911 for(int i = 2; i <= order; ++i, ++idx) { in gmshGenerateMonomialsPyramidSerendipity()
1071 void gmshGenerateOrderedPointsLine(int order, fullVector<double> &points) in gmshGenerateOrderedPointsLine() argument
1073 points.resize(order + 1); in gmshGenerateOrderedPointsLine()
1074 for(int i = 0; i < order + 1; ++i) { in gmshGenerateOrderedPointsLine()
1075 points(i) = i / static_cast<double>(order); in gmshGenerateOrderedPointsLine()
1087 const int order = data.getSpaceOrder(); in gmshGenerateOrderedPoints() local
1092 points.scale(1. / order); in gmshGenerateOrderedPoints()
1124 points.scale(2. / order); in gmshGenerateOrderedPoints()
1128 case TYPE_TET: points.scale(1. / order); return; in gmshGenerateOrderedPoints()
1132 tmp.scale(1. / order); in gmshGenerateOrderedPoints()
1134 tmp.scale(2. / order); in gmshGenerateOrderedPoints()
1171 int idx, order = data.getSpaceOrder(); in gmshGenerateOrderedMonomials() local
1175 monomials.resize(order + 1, 1); in gmshGenerateOrderedMonomials()
1177 for(int i = 0; i < order + 1; ++i) { in gmshGenerateOrderedMonomials()
1183 monomials.resize((order + 1) * (order + 2) / 2, 2); in gmshGenerateOrderedMonomials()
1185 for(int j = 0; j < order + 1; ++j) { in gmshGenerateOrderedMonomials()
1186 for(int i = 0; i < order + 1 - j; ++i) { in gmshGenerateOrderedMonomials()
1194 monomials.resize((order + 1) * (order + 1), 2); in gmshGenerateOrderedMonomials()
1196 for(int j = 0; j < order + 1; ++j) { in gmshGenerateOrderedMonomials()
1197 for(int i = 0; i < order + 1; ++i) { in gmshGenerateOrderedMonomials()
1205 monomials.resize((order + 1) * (order + 2) * (order + 3) / 6, 3); in gmshGenerateOrderedMonomials()
1207 for(int k = 0; k < order + 1; ++k) { in gmshGenerateOrderedMonomials()
1208 for(int j = 0; j < order + 1 - k; ++j) { in gmshGenerateOrderedMonomials()
1209 for(int i = 0; i < order + 1 - j - k; ++i) { in gmshGenerateOrderedMonomials()
1219 monomials.resize((order + 1) * (order + 1) * (order + 2) / 2, 3); in gmshGenerateOrderedMonomials()
1221 for(int k = 0; k < order + 1; ++k) { in gmshGenerateOrderedMonomials()
1222 for(int j = 0; j < order + 1; ++j) { in gmshGenerateOrderedMonomials()
1223 for(int i = 0; i < order + 1 - j; ++i) { in gmshGenerateOrderedMonomials()
1233 monomials.resize((order + 1) * (order + 1) * (order + 1), 3); in gmshGenerateOrderedMonomials()
1235 for(int k = 0; k < order + 1; ++k) { in gmshGenerateOrderedMonomials()
1236 for(int j = 0; j < order + 1; ++j) { in gmshGenerateOrderedMonomials()
1237 for(int i = 0; i < order + 1; ++i) { in gmshGenerateOrderedMonomials()