Home
last modified time | relevance | path

Searched refs:faceEdgeMap (Results 1 – 10 of 10) sorted by relevance

/dports/science/elmerfem/elmerfem-release-9.0/fem/src/
H A DPElementMaps.F90499 SUBROUTINE GetElementFaceEdgeMap( Element, faceEdgeMap ) argument
513 INTEGER, POINTER :: faceEdgeMap(:,:) local
520 NULLIFY(faceEdgeMap)
528 faceEdgeMap => TetraFaceEdgeMap1
530 faceEdgeMap => TetraFaceEdgeMap2
535 faceEdgeMap => PyramidFaceEdgeMap
537 faceEdgeMap => WedgeFaceEdgeMap
539 faceEdgeMap => BrickFaceEdgeMap
H A DDefUtils.F906349 faceEdgeMap(4) local
6415 faceEdgeMap(1:4) = getFaceEdgeMap(Element, localBoundary)
6423 lIndexes(n) = Element % TYPE % NumberOfNodes + edgeOffSet(faceEdgeMap(i)) + j
/dports/graphics/colmap/colmap-3.6/lib/PoissonRecon/
H A DMultiGridOctreeData.IsoSurface.inl58 faceEdgeMap.clear() , edgeVertexMap.clear() , vertexPairMap.clear();
116 faceEdgeMap.clear() , edgeVertexMap.clear() , vertexPairMap.clear();
714 …ame hash_map< long long , std::vector< IsoEdge > >::iterator iter = _sValues.faceEdgeMap.find(key);
715 if( iter==_sValues.faceEdgeMap.end() ) _sValues.faceEdgeMap[key] = edges;
791 …ame hash_map< long long , std::vector< IsoEdge > >::iterator iter = _xValues.faceEdgeMap.find(key);
792 if( iter==_xValues.faceEdgeMap.end() ) _xValues.faceEdgeMap[key] = edges;
843 …h_map< long long , std::vector< IsoEdge > >::const_iterator iter = sValues.faceEdgeMap.find( key );
844 if( iter!=sValues.faceEdgeMap.end() )
863 …h_map< long long , std::vector< IsoEdge > >::const_iterator iter = xValues.faceEdgeMap.find( key );
864 if( iter!=xValues.faceEdgeMap.end() )
H A DMultiGridOctreeData.h555 hash_map< long long , std::vector< IsoEdge > > faceEdgeMap; member
571 hash_map< long long , std::vector< IsoEdge > > faceEdgeMap; member
/dports/math/geogram/geogram-1.7.7/src/lib/geogram/third_party/PoissonRecon/
H A DMultiGridOctreeData.IsoSurface.inl61 faceEdgeMap.clear() , edgeVertexMap.clear() , vertexPairMap.clear();
119 faceEdgeMap.clear() , edgeVertexMap.clear() , vertexPairMap.clear();
737 …ame hash_map< long long , std::vector< IsoEdge > >::iterator iter = _sValues.faceEdgeMap.find(key);
738 … if( iter==_sValues.faceEdgeMap.end() ) _sValues.faceEdgeMap[key] = edges;
816 …ame hash_map< long long , std::vector< IsoEdge > >::iterator iter = _xValues.faceEdgeMap.find(key);
817 … if( iter==_xValues.faceEdgeMap.end() ) _xValues.faceEdgeMap[key] = edges;
870 …h_map< long long , std::vector< IsoEdge > >::const_iterator iter = sValues.faceEdgeMap.find( key );
871 if( iter!=sValues.faceEdgeMap.end() )
890 …h_map< long long , std::vector< IsoEdge > >::const_iterator iter = xValues.faceEdgeMap.find( key );
891 if( iter!=xValues.faceEdgeMap.end() )
H A DMultiGridOctreeData.h585 hash_map< long long , std::vector< IsoEdge > > faceEdgeMap; member
601 hash_map< long long , std::vector< IsoEdge > > faceEdgeMap; member
/dports/math/pdal/PDAL-2.3.0/vendor/kazhdan/
H A DMultiGridOctreeData.IsoSurface.inl62 faceEdgeMap.clear() , edgeVertexMap.clear() , vertexPairMap.clear();
120 faceEdgeMap.clear() , edgeVertexMap.clear() , vertexPairMap.clear();
689 …nordered_map< long long, std::vector< _IsoEdge > >::iterator iter = _sValues.faceEdgeMap.find(key);
690 if( iter==_sValues.faceEdgeMap.end() ) _sValues.faceEdgeMap[key] = edges;
767 …nordered_map< long long, std::vector< _IsoEdge > >::iterator iter = _xValues.faceEdgeMap.find(key);
768 if( iter==_xValues.faceEdgeMap.end() ) _xValues.faceEdgeMap[key] = edges;
819 …red_map< long long, std::vector< _IsoEdge > >::const_iterator iter = sValues.faceEdgeMap.find(key);
820 if( iter!=sValues.faceEdgeMap.end() )
840 …ed_map< long long , std::vector< _IsoEdge > >::const_iterator iter = xValues.faceEdgeMap.find(key);
841 if( iter!=xValues.faceEdgeMap.end() )
H A DMultiGridOctreeData.h819 std::unordered_map< long long, std::vector< _IsoEdge > > faceEdgeMap;
835 std::unordered_map< long long, std::vector< _IsoEdge > > faceEdgeMap;
/dports/cad/meshlab/meshlab-Meshlab-2020.05/src/meshlabplugins/filter_screened_poisson/Src/
H A DMultiGridOctreeData.IsoSurface.inl58 faceEdgeMap.clear() , edgeVertexMap.clear() , vertexPairMap.clear();
116 faceEdgeMap.clear() , edgeVertexMap.clear() , vertexPairMap.clear();
658 …nordered_map< long long, std::vector< _IsoEdge > >::iterator iter = _sValues.faceEdgeMap.find(key);
659 if( iter==_sValues.faceEdgeMap.end() ) _sValues.faceEdgeMap[key] = edges;
736 …nordered_map< long long, std::vector< _IsoEdge > >::iterator iter = _xValues.faceEdgeMap.find(key);
737 if( iter==_xValues.faceEdgeMap.end() ) _xValues.faceEdgeMap[key] = edges;
788 …red_map< long long, std::vector< _IsoEdge > >::const_iterator iter = sValues.faceEdgeMap.find(key);
789 if( iter!=sValues.faceEdgeMap.end() )
808 …ed_map< long long , std::vector< _IsoEdge > >::const_iterator iter = xValues.faceEdgeMap.find(key);
809 if( iter!=xValues.faceEdgeMap.end() )
H A DMultiGridOctreeData.h806 std::unordered_map< long long, std::vector< _IsoEdge > > faceEdgeMap;
822 std::unordered_map< long long, std::vector< _IsoEdge > > faceEdgeMap;