/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/testunits/module_BASE/ |
H A D | IncrementalTriangulationTestSuite.h | 43 triang.addNode(10, 10); in test1() 46 triang.addNode(30, 10); in test1() 49 triang.addNode(20, 10); in test1() 50 triang.addNode(40, 10); in test1() 103 triang.eraseNode(40); in test1() 136 triang.addEdge(0, 1); in testPaperError() 148 triang.addEdge(0, 2); in testPaperError() 154 triang.addEdge(2, 1); in testPaperError() 156 triang.eraseNode(0); in testPaperError() 174 triang.addNode(triang.graph().bound(), 10); in testRandom() [all …]
|
H A D | OrderedTriangulationTestSuite.h | 69 triang.setGraph(&graph, &dom); in testTriangulatedGraph1() 70 triang.setOrder(&sequence); in testTriangulatedGraph1() 78 triang.clear(); in testTriangulatedGraph1() 80 triang.setGraph(&graph, &dom); in testTriangulatedGraph1() 81 triang.setOrder(&sequence); in testTriangulatedGraph1() 89 triang.clear(); in testTriangulatedGraph1() 94 triang.setGraph(&graph, &dom); in testTriangulatedGraph1() 95 triang.setOrder(&sequence); in testTriangulatedGraph1() 156 triang.setGraph(&graph, &dom); in testTriangulatedGraph1() 157 triang.setOrder(&sequence); in testTriangulatedGraph1() [all …]
|
H A D | PartialOrderedTriangulationTestSuite.h | 72 triang.setGraph(&graph, &dom); in testTriangulatedGraph1() 73 triang.setPartialOrder(&partial_order); in testTriangulatedGraph1() 78 triang.clear(); in testTriangulatedGraph1() 79 triang.setGraph(&graph, &dom); in testTriangulatedGraph1() 80 triang.setPartialOrder(&partial_order); in testTriangulatedGraph1() 85 triang.clear(); in testTriangulatedGraph1() 94 triang.setGraph(&graph, &dom); in testTriangulatedGraph1() 95 triang.setPartialOrder(&partial_order); in testTriangulatedGraph1() 135 triang.setGraph(&graph, &dom); in testTriangulatedGraph1() 184 triang.setGraph(&graph, &dom); in testTriangulatedGraph2() [all …]
|
/dports/math/py-matplotlib2/matplotlib-2.2.4/lib/matplotlib/tests/ |
H A D | test_triangulation.py | 53 triang._neighbors = None 145 if tri_contains_point(triang.x[tri], triang.y[tri], xy): 296 triang.set_mask([1, 0]) 622 xs = np.linspace(np.min(triang.x), np.max(triang.x), 20) 623 ys = np.linspace(np.min(triang.y), np.max(triang.y), 20) 643 xs = np.linspace(triang.x[pt1], triang.x[pt2], 10) 644 ys = np.linspace(triang.y[pt1], triang.y[pt2], 10) 810 triang.set_mask(np.hypot(x[triang.triangles].mean(axis=1), 820 (Ex, Ey) = tci.gradient(triang.x, triang.y) 833 plt.quiver(triang.x, triang.y, Ex/E_norm, Ey/E_norm, [all …]
|
/dports/math/octave-forge-signal/signal-1.4.1/inst/ |
H A D | triang.m | 28 function w = triang (m) function 40 %!assert (triang (1), 1) 41 %!assert (triang (2), [1; 1]/2) 46 %! assert (triang (3), x(2:4)); 49 %!error triang () 50 %!error triang (0.5) 51 %!error triang (-1) 52 %!error triang (ones (1, 4)) 53 %!error triang (1, 2) 70 %! plot(0:n+1,bartlett(n+2),"g-*;bartlett;",triang(n),"r-+;triang;"); [all …]
|
/dports/math/py-matplotlib/matplotlib-3.4.3/lib/matplotlib/tests/ |
H A D | test_triangulation.py | 50 triang._neighbors = None 138 return sum(tri_contains_point(triang.x[tri], triang.y[tri], xy) 287 triang.set_mask([1, 0]) 610 xs = np.linspace(np.min(triang.x), np.max(triang.x), 20) 611 ys = np.linspace(np.min(triang.y), np.max(triang.y), 20) 631 xs = np.linspace(triang.x[pt1], triang.x[pt2], 10) 632 ys = np.linspace(triang.y[pt1], triang.y[pt2], 10) 795 triang.set_mask(np.hypot(x[triang.triangles].mean(axis=1), 805 Ex, Ey = tci.gradient(triang.x, triang.y) 818 plt.quiver(triang.x, triang.y, Ex/E_norm, Ey/E_norm, [all …]
|
/dports/math/cgal/CGAL-5.3/examples/Triangulation_2/ |
H A D | triangulation_print_OFF.h | 13 const Triang& triang, 17 CGAL_precondition( triang.is_valid()); 24 Vertex_iterator vi = triang.vertices_begin(); 25 for ( ; vi != triang.vertices_end(); ++vi) { 26 CGAL_assertion( ! triang.is_infinite( vi)); 34 Face_iterator fi = triang.faces_begin(); 35 for ( ; fi != triang.faces_end(); ++fi) { 45 vi = triang.vertices_begin(); 46 for ( ; vi != triang.vertices_end(); ++vi) { 54 fi = triang.faces_begin(); [all …]
|
/dports/math/reduce/Reduce-svn5758-src/packages/cali/ |
H A D | triang.red | 1 module triang; 96 else for each x in triang!=triang(m,ring_names cali!=basering) collect 99 symbolic procedure triang!=triang(a,vars); 100 % triang!=triang(A,vars)={f1.x for x in triang!=triang(B,cdr vars)} 101 % \union triang!=triang(A:<B>,vars) 114 for each u in triang!=triang(b,cdr vars) collect (f1 . u), 115 triang!=triang(matstabquot!*(a,b),vars)); 140 % triang!=triang(A,vars)={f1.x for x in triang!=triang1(B,cdr vars)} 167 % triang!=triang(A,vars)={f1.x for x in triang!=triang1(B,cdr vars)} 209 % triang!=triang(A,vars)={f1.x for x in triang!=triang2(B,cdr vars)} [all …]
|
/dports/math/cgal/CGAL-5.3/demo/Periodic_2_triangulation_2/ |
H A D | Periodic_2_Delaunay_triangulation_2.cpp | 53 Periodic_DT triang; member in MainWindow 206 bool was_empty = triang.empty(); in processInput() 209 double dx = triang.domain().xmax() - triang.domain().xmin(); in processInput() 210 double dy = triang.domain().ymax() - triang.domain().ymin(); in processInput() 213 triang.insert(p); in processInput() 291 triang.clear(); in on_actionClear_triggered() 337 if (triang.is_1_cover()) { in on_actionConvertTo9Cover_triggered() 338 triang.convert_to_9_sheeted_covering(); in on_actionConvertTo9Cover_triggered() 345 if (!triang.is_1_cover()) { in on_actionConvertTo1Cover_triggered() 346 triang.convert_to_1_sheeted_covering(); in on_actionConvertTo1Cover_triggered() [all …]
|
/dports/science/siconos/siconos-4.4.0/kernel/src/utils/SiconosAlgebra/ |
H A D | SimpleMatrixArithmetic.cpp | 84 noalias(*C.triang()) = *A.triang() + *B.triang(); in add() 101 noalias(*C.dense()) = *A.triang() + *B.triang(); in add() 121 noalias(*C.dense()) = *A.dense() + *B.triang(); in add() 142 noalias(*C.dense()) = *A.triang() + *B.dense(); in add() 145 noalias(*C.dense()) = *A.triang() + *B.sym(); in add() 166 noalias(*C.dense()) = *A.sym() + *B.triang(); in add() 309 *C.triang() = *A.triang() - *B.triang(); in sub() 326 *C.dense() = *A.triang() - *B.dense(); in sub() 367 noalias(*C.triang()) = *A.triang() - *B.triang(); in sub() 384 noalias(*C.dense()) = *A.triang() - *B.triang(); in sub() [all …]
|
H A D | SimpleMatrixFreeOperators.cpp | 61 return (TriangMat)(a ** A.triang()); in operator *() 99 return (TriangMat)(a ** A.triang()); in operator *() 142 return (TriangMat)(*A.triang() / a); in operator /() 206 return (TriangMat)(*A.triang() + *B.triang()); in operator +() 236 return (DenseMat)(*A.dense() + *B.triang()); in operator +() 253 return (DenseMat)(*A.triang() + *B.dense()); in operator +() 255 return (DenseMat)(*A.triang() + *B.sym()); in operator +() 272 return (DenseMat)(*A.sym() + *B.triang()); in operator +() 376 return (TriangMat)(*A.triang() - *B.triang()); in operator -() 430 return (DenseMat)(*A.triang() - *B.sym()); in operator -() [all …]
|
H A D | SiconosAlgebraProd.cpp | 615 *C.dense() = prod(*A.dense(), *B.triang()); in prod() 626 *C.triang() = prod(*A.triang(), *B.triang()); in prod() 650 *C.dense() = prod(*A.triang(), *B.dense()); in prod() 661 *C.triang() = prod(*A.triang(), *B.triang()); in prod() 700 noalias(*C.dense()) = prod(*A.triang(), *B.triang()); in prod() 751 noalias(*C.triang()) = prod(*A.triang(), *B.triang()); in prod() 778 *C.dense() += prod(*A.dense(), *B.triang()); in prod() 789 *C.triang() += prod(*A.triang(), *B.triang()); in prod() 824 *C.triang() += prod(*A.triang(), *B.triang()); in prod() 863 noalias(*C.dense()) += prod(*A.triang(), *B.triang()); in prod() [all …]
|
H A D | SimpleMatrixBLAS3.cpp | 289 ublas::axpy_prod(*A.triang(), *B.dense(), *C.dense(), init); in axpy_prod() 300 ublas::axpy_prod(*A.dense(), *B.triang(), *C.dense(), init); in axpy_prod() 302 ublas::axpy_prod(*A.triang(), *B.triang(), *C.dense(), init); in axpy_prod() 304 ublas::axpy_prod(*A.sym(), *B.triang(), *C.dense(), init); in axpy_prod() 306 ublas::axpy_prod(*A.sparse(), *B.triang(), *C.dense(), init); in axpy_prod() 308 ublas::axpy_prod(*A.banded(), *B.triang(), *C.dense(), init); in axpy_prod() 315 ublas::axpy_prod(*A.triang(), *B.sym(), *C.dense(), init); in axpy_prod() 328 ublas::axpy_prod(*A.triang(), *B.sparse(), *C.dense(), init); in axpy_prod() 341 ublas::axpy_prod(*A.triang(), *B.banded(), *C.dense(), init); in axpy_prod()
|
/dports/math/py-matplotlib/matplotlib-3.4.3/examples/images_contours_and_fields/ |
H A D | trigradient_demo.py | 46 triang = Triangulation(x, y) variable 49 triang.set_mask(np.hypot(x[triang.triangles].mean(axis=1), 50 y[triang.triangles].mean(axis=1)) 56 refiner = UniformTriRefiner(triang) 62 tci = CubicTriInterpolator(triang, -V) 64 (Ex, Ey) = tci.gradient(triang.x, triang.y) 76 ax.triplot(triang, color='0.8') 83 ax.quiver(triang.x, triang.y, Ex/E_norm, Ey/E_norm,
|
H A D | tricontour_demo.py | 31 triang = tri.Triangulation(x, y) variable 34 triang.set_mask(np.hypot(x[triang.triangles].mean(axis=1), 35 y[triang.triangles].mean(axis=1)) 43 tcf = ax1.tricontourf(triang, z) 45 ax1.tricontour(triang, z, colors='k')
|
H A D | triinterp_demo.py | 17 triang = mtri.Triangulation(x, y, triangles) variable 23 interp_lin = mtri.LinearTriInterpolator(triang, z) 26 interp_cubic_geom = mtri.CubicTriInterpolator(triang, z, kind='geom') 29 interp_cubic_min_E = mtri.CubicTriInterpolator(triang, z, kind='min_E') 37 axs[0].tricontourf(triang, z) 38 axs[0].triplot(triang, 'ko-')
|
/dports/math/py-matplotlib2/matplotlib-2.2.4/examples/event_handling/ |
H A D | trifinder_event_demo.py | 20 points = triang.triangles[tri] 21 xs = triang.x[points] 22 ys = triang.y[points] 46 triang = Triangulation(x, y) variable 47 triang.set_mask(np.hypot(x[triang.triangles].mean(axis=1), 48 y[triang.triangles].mean(axis=1)) 52 trifinder = triang.get_trifinder() 56 plt.triplot(triang, 'bo-')
|
/dports/math/py-matplotlib2/matplotlib-2.2.4/lib/mpl_examples/event_handling/ |
H A D | trifinder_event_demo.py | 20 points = triang.triangles[tri] 21 xs = triang.x[points] 22 ys = triang.y[points] 46 triang = Triangulation(x, y) variable 47 triang.set_mask(np.hypot(x[triang.triangles].mean(axis=1), 48 y[triang.triangles].mean(axis=1)) 52 trifinder = triang.get_trifinder() 56 plt.triplot(triang, 'bo-')
|
/dports/math/py-matplotlib/matplotlib-3.4.3/examples/event_handling/ |
H A D | trifinder_event_demo.py | 20 points = triang.triangles[tri] 21 xs = triang.x[points] 22 ys = triang.y[points] 46 triang = Triangulation(x, y) variable 47 triang.set_mask(np.hypot(x[triang.triangles].mean(axis=1), 48 y[triang.triangles].mean(axis=1)) 52 trifinder = triang.get_trifinder() 56 ax.triplot(triang, 'bo-')
|
/dports/math/py-matplotlib2/matplotlib-2.2.4/examples/images_contours_and_fields/ |
H A D | trigradient_demo.py | 46 triang = Triangulation(x, y) variable 49 triang.set_mask(np.hypot(x[triang.triangles].mean(axis=1), 50 y[triang.triangles].mean(axis=1)) 56 refiner = UniformTriRefiner(triang) 62 tci = CubicTriInterpolator(triang, -V) 64 (Ex, Ey) = tci.gradient(triang.x, triang.y) 76 ax.triplot(triang, color='0.8') 83 ax.quiver(triang.x, triang.y, Ex/E_norm, Ey/E_norm,
|
H A D | tricontour_demo.py | 31 triang = tri.Triangulation(x, y) variable 34 triang.set_mask(np.hypot(x[triang.triangles].mean(axis=1), 35 y[triang.triangles].mean(axis=1)) 43 tcf = ax1.tricontourf(triang, z) 45 ax1.tricontour(triang, z, colors='k')
|
/dports/math/py-matplotlib2/matplotlib-2.2.4/lib/mpl_examples/images_contours_and_fields/ |
H A D | trigradient_demo.py | 46 triang = Triangulation(x, y) variable 49 triang.set_mask(np.hypot(x[triang.triangles].mean(axis=1), 50 y[triang.triangles].mean(axis=1)) 56 refiner = UniformTriRefiner(triang) 62 tci = CubicTriInterpolator(triang, -V) 64 (Ex, Ey) = tci.gradient(triang.x, triang.y) 76 ax.triplot(triang, color='0.8') 83 ax.quiver(triang.x, triang.y, Ex/E_norm, Ey/E_norm,
|
H A D | tricontour_demo.py | 31 triang = tri.Triangulation(x, y) variable 34 triang.set_mask(np.hypot(x[triang.triangles].mean(axis=1), 35 y[triang.triangles].mean(axis=1)) 43 tcf = ax1.tricontourf(triang, z) 45 ax1.tricontour(triang, z, colors='k')
|
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/testunits/module_BN/ |
H A D | DefaultTriangulationTestSuite.h | 188 gum::DefaultTriangulation triang; in testTriangulatedGraph1() local 190 triang.setGraph(&graph, &dom); in testTriangulatedGraph1() 192 const gum::UndiGraph& gr2 = triang.triangulatedGraph(); in testTriangulatedGraph1() 198 triang.clear(); in testTriangulatedGraph1() 200 triang.setGraph(&graph, &dom); in testTriangulatedGraph1() 210 triang.setGraph(&graph, &dom); in testTriangulatedGraph1() 218 const gum::EdgeSet& edges = triang.fillIns(); in testTriangulatedGraph1() 241 gum::DefaultTriangulation triang; in testTriangulatedGraph2() local 243 triang.setGraph(&graph, &dom); in testTriangulatedGraph2() 251 const gum::CliqueGraph& JT = triang.junctionTree(); in testTriangulatedGraph2() [all …]
|
/dports/math/palp/palp-2.20/ |
H A D | Mori.h | 36 } triang; typedef 92 void StanleyReisner(triang *SR,triang *T); 118 void PRNtriang(triang *SR,const char *c); 124 void HyperSurfSingular(PolyPointList *P,triang *T, triang *SR ,MORI_Flags *_Flag ,
|