| /dports/math/psurface/psurface-2.0.0-13-gb5b6825/ |
| H A D | CircularPatch.h | 28 innerEdges.resize(0); in CircularPatch()
35 innerEdges.resize(0); in CircularPatch()
44 innerEdges.resize(size-1); in CircularPatch()
47 innerEdges.assign(innerEdges.size(),emptyArray); in CircularPatch()
68 innerEdges.resize(size-1); in resize()
71 innerEdges.assign(innerEdges.size(), emptyArray); in resize()
146 std::vector<std::array<int, 2> > innerEdges; variable
|
| H A D | Triangulator.cpp | 191 result.innerEdges[edgeIdx][0] = tmpVertices[chosenEdge%K]; in planeCDT()
192 result.innerEdges[edgeIdx][1] = tmpVertices[(chosenEdge+2)%K]; in planeCDT()
223 result.innerEdges[edgeIdx][0] = tmpVertices[0]; in planeCDT()
224 result.innerEdges[edgeIdx][1] = tmpVertices[2]; in planeCDT()
228 result.innerEdges[edgeIdx][0] = tmpVertices[1]; in planeCDT()
229 result.innerEdges[edgeIdx][1] = tmpVertices[3]; in planeCDT()
310 for (size_t i=0; i<cP->innerEdges.size(); i++) in evaluate()
311 …if ( (par->vertices(cP->innerEdges[i][0]) - par->vertices(cP->innerEdges[i][1])).length() > qualit… in evaluate()
|
| H A D | CircularPatch.cpp | 221 for (size_t i=0; i<innerEdges.size(); i++){
223 tmpEdge.from = innerEdges[i][0];
224 tmpEdge.to = innerEdges[i][1];
|
| H A D | HxParamToolBox.cpp | 909 for (i=0; i<fillIn.innerEdges.size(); i++) { in removeRegularPoint()
911 Edge& cE = par->edges(par->findEdge(fillIn.innerEdges[i][0], fillIn.innerEdges[i][1])); in removeRegularPoint()
1256 for (j=0; j<fillIns[i].innerEdges.size(); j++) { in removeFeatureLinePoint()
1258 … Edge& cE = par->edges(par->findEdge(fillIns[i].innerEdges[j][0], fillIns[i].innerEdges[j][1])); in removeFeatureLinePoint()
|
| /dports/math/dune-alugrid/dune-alugrid-08c6496d4d4a33df6456c3b402182f353dc2e76d/dune/alugrid/impl/parallel/ |
| H A D | gitter_pll_sti.cc | 425 PackUnpackEdgeCleanup( std::vector< edgevec_t >& innerEdges, in PackUnpackEdgeCleanup() argument
428 : _innerEdges( innerEdges ), in PackUnpackEdgeCleanup()
483 std::vector< edgevec_t > innerEdges (nl), outerEdges (nl); in refine() local
511 edgevec_t& innerEdge = innerEdges[ l ]; in refine()
577 PackUnpackEdgeCleanup edgeData( innerEdges, outerEdges, true ); in refine()
582 PackUnpackEdgeCleanup edgeData( innerEdges, outerEdges, false ); in refine()
826 std::vector< edgevec_t >& innerEdges, in PackUnpackEdgeCoarsen()
832 _innerEdges( innerEdges ), in PackUnpackEdgeCoarsen()
1018 std::vector< hedge_STI * >& innerEdgesLink = innerEdges[ l ]; in coarse()
1068 const hedge_iterator iEnd = innerEdges [l].end (); in coarse()
[all …]
|
| /dports/cad/sumo/sumo-1.2.0/src/netimport/ |
| H A D | NIImporter_OpenDrive.cpp | 199 std::map<std::string, OpenDriveEdge*> innerEdges, outerEdges; in loadNetwork() local
202 innerEdges[(*i).first] = (*i).second; in loadNetwork()
222 …for (std::map<std::string, OpenDriveEdge*>::iterator i = innerEdges.begin(); i != innerEdges.end()… in loadNetwork()
310 …for (std::map<std::string, OpenDriveEdge*>::iterator j = innerEdges.begin(); j != innerEdges.end()… in loadNetwork()
584 if (innerEdges.find((*i).fromEdge) != innerEdges.end()) { in loadNetwork()
588 if (innerEdges.find((*i).toEdge) != innerEdges.end()) { in loadNetwork()
590 buildConnectionsToOuter(*i, innerEdges, connections2, seen); in loadNetwork()
778 OpenDriveEdge* dest = innerEdges.find(c.toEdge)->second; in buildConnectionsToOuter()
796 auto innerEdgesIt = innerEdges.find((*i).toEdge); in buildConnectionsToOuter()
802 if (innerEdgesIt != innerEdges.end()) { in buildConnectionsToOuter()
[all …]
|
| H A D | NIImporter_OpenDrive.h | 569 …uter(const Connection& c, const std::map<std::string, OpenDriveEdge*>& innerEdges, std::vector<Con…
|
| /dports/finance/prestashop/prestashop/vendor/phpoffice/phpspreadsheet/src/PhpSpreadsheet/Style/ |
| H A D | Style.php | 308 $innerEdges = array_diff(['top', 'right', 'bottom', 'left'], $edges);
311 foreach ($innerEdges as $innerEdge) {
|
| /dports/finance/weberp/webERP/Classes/PHPExcel/ |
| H A D | Style.php | 344 … $innerEdges = array_diff( array('top', 'right', 'bottom', 'left'), $edges );
347 foreach ($innerEdges as $innerEdge) {
|
| /dports/www/dolibarr/dolibarr-14.0.3/htdocs/includes/phpoffice/phpspreadsheet/src/PhpSpreadsheet/Style/ |
| H A D | Style.php | 308 $innerEdges = array_diff(['top', 'right', 'bottom', 'left'], $edges);
311 foreach ($innerEdges as $innerEdge) {
|
| /dports/www/dolibarr13/dolibarr-13.0.5/htdocs/includes/phpoffice/PhpSpreadsheet/Style/ |
| H A D | Style.php | 308 $innerEdges = array_diff(['top', 'right', 'bottom', 'left'], $edges);
311 foreach ($innerEdges as $innerEdge) {
|
| /dports/www/groupoffice/groupoffice-6.4.231-php-71/vendor/phpoffice/phpexcel/Classes/PHPExcel/ |
| H A D | Style.php | 324 … $innerEdges = array_diff(array('top', 'right', 'bottom', 'left'), $edges);
327 foreach ($innerEdges as $innerEdge) {
|
| /dports/www/thirtybees/thirtybees-1.1.0/vendor/phpoffice/phpexcel/Classes/PHPExcel/ |
| H A D | Style.php | 324 … $innerEdges = array_diff(array('top', 'right', 'bottom', 'left'), $edges);
327 foreach ($innerEdges as $innerEdge) {
|
| /dports/www/moodle310/moodle/lib/phpspreadsheet/vendor/phpoffice/phpspreadsheet/src/PhpSpreadsheet/Style/ |
| H A D | Style.php | 308 $innerEdges = array_diff(['top', 'right', 'bottom', 'left'], $edges);
311 foreach ($innerEdges as $innerEdge) {
|
| /dports/www/moodle39/moodle/lib/phpspreadsheet/vendor/phpoffice/phpspreadsheet/src/PhpSpreadsheet/Style/ |
| H A D | Style.php | 308 $innerEdges = array_diff(['top', 'right', 'bottom', 'left'], $edges);
311 foreach ($innerEdges as $innerEdge) {
|
| /dports/www/ilias/ILIAS-5.4.25/libs/composer/vendor/phpoffice/phpspreadsheet/src/PhpSpreadsheet/Style/ |
| H A D | Style.php | 301 $innerEdges = array_diff(['top', 'right', 'bottom', 'left'], $edges);
304 foreach ($innerEdges as $innerEdge) {
|
| /dports/www/groupoffice/groupoffice-6.4.231-php-71/vendor/phpoffice/phpspreadsheet/src/PhpSpreadsheet/Style/ |
| H A D | Style.php | 302 $innerEdges = array_diff(['top', 'right', 'bottom', 'left'], $edges);
305 foreach ($innerEdges as $innerEdge) {
|
| /dports/www/moodle311/moodle/lib/phpspreadsheet/vendor/phpoffice/phpspreadsheet/src/PhpSpreadsheet/Style/ |
| H A D | Style.php | 302 $innerEdges = array_diff(['top', 'right', 'bottom', 'left'], $edges);
305 foreach ($innerEdges as $innerEdge) {
|
| /dports/graphics/quickqanava/QuickQanava-ab88d77ec62175b9fd499a154ffaf92f7bf23989/src/ |
| H A D | qanGraph.cpp | 1742 std::unordered_set<const qan::Edge*> innerEdges; in collectInerEdges() local
1744 return innerEdges; in collectInerEdges()
1754 innerEdges.insert(inEdge.get()); in collectInerEdges()
1762 innerEdges.insert(outEdge.get()); in collectInerEdges()
1765 return innerEdges; in collectInerEdges()
|
| /dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/src/Algebra/Graph/AdjacencyMap/ |
| H A D | Algorithm.hs | 339 , innerEdges :: [(Int,(a,a))] function
|
| /dports/math/vtk8/VTK-8.2.0/Filters/General/ |
| H A D | vtkContourTriangulator.cxx | 2164 vtkCCSPolyEdges &innerEdges = polyEdges[innerPolyId]; in vtkCCSMakeCuts() local
2193 edges1[i2] = innerEdges[k]; in vtkCCSMakeCuts()
2220 edges2[j2] = innerEdges[k]; in vtkCCSMakeCuts()
|
| /dports/math/vtk9/VTK-9.1.0/Filters/General/ |
| H A D | vtkContourTriangulator.cxx | 2250 vtkCCSPolyEdges& innerEdges = polyEdges[innerPolyId]; in vtkCCSMakeCuts() local
2279 edges1[i2] = innerEdges[k]; in vtkCCSMakeCuts()
2306 edges2[j2] = innerEdges[k]; in vtkCCSMakeCuts()
|
| /dports/math/vtk6/VTK-6.2.0/Filters/General/ |
| H A D | vtkContourTriangulator.cxx | 2159 vtkCCSPolyEdges &innerEdges = polyEdges[innerPolyId]; in vtkCCSMakeCuts() local
2188 edges1[i2] = innerEdges[k]; in vtkCCSMakeCuts()
2215 edges2[j2] = innerEdges[k]; in vtkCCSMakeCuts()
|