/dports/math/vtk8/VTK-8.2.0/Filters/Modeling/ |
H A D | vtkPolyDataPointSampler.cxx | 91 eTable->InitEdgeInsertion(numInputPts); in RequestData() 100 eTable->InsertEdge(pts[i],pts[i+1]); in RequestData() 118 if ( eTable->IsEdge(p0,p1) == -1 ) in RequestData() 120 eTable->InsertEdge(p0,p1); in RequestData() 138 if ( eTable->IsEdge(p0,p1) == -1 ) in RequestData() 140 eTable->InsertEdge(p0,p1); in RequestData() 151 if ( eTable->IsEdge(p0,p1) == -1 ) in RequestData() 153 eTable->InsertEdge(p0,p1); in RequestData() 160 if ( eTable->IsEdge(p0,p1) == -1 ) in RequestData() 162 eTable->InsertEdge(p0,p1); in RequestData() [all …]
|
/dports/math/vtk6/VTK-6.2.0/Filters/Modeling/ |
H A D | vtkPolyDataPointSampler.cxx | 91 eTable->InitEdgeInsertion(numInputPts); in RequestData() 100 eTable->InsertEdge(pts[i],pts[i+1]); in RequestData() 118 if ( eTable->IsEdge(p0,p1) == -1 ) in RequestData() 120 eTable->InsertEdge(p0,p1); in RequestData() 138 if ( eTable->IsEdge(p0,p1) == -1 ) in RequestData() 140 eTable->InsertEdge(p0,p1); in RequestData() 151 if ( eTable->IsEdge(p0,p1) == -1 ) in RequestData() 153 eTable->InsertEdge(p0,p1); in RequestData() 160 if ( eTable->IsEdge(p0,p1) == -1 ) in RequestData() 162 eTable->InsertEdge(p0,p1); in RequestData() [all …]
|
/dports/graphics/colmap/colmap-3.6/lib/PoissonRecon/ |
H A D | MultiGridOctreeData.SortedTreeNodes.inl | 110 …eeNodes::SliceTableData::edgeIndices( const TreeOctNode* node ) { return eTable[ node->nodeData.no… 111 …ndices& SortedTreeNodes::SliceTableData::edgeIndices( int idx ) { return eTable[ idx - nodeOffset … 113 …& SortedTreeNodes::SliceTableData::edgeIndices( int idx ) const { return eTable[ idx - nodeOffset … 119 …dices& SortedTreeNodes::XSliceTableData::edgeIndices( int idx ) { return eTable[ idx - nodeOffset … 121 … SortedTreeNodes::XSliceTableData::edgeIndices( int idx ) const { return eTable[ idx - nodeOffset … 139 DeletePointer( sData.cTable ) ; DeletePointer( sData.eTable ) ; DeletePointer( sData.fTable ); 146 sData.eTable = NewPointer< typename SortedTreeNodes::SquareCornerIndices >( sData.nodeCount ); 255 for( int j=0 ; j<Square::EDGES ; j++ ) sData.eTable[i][j] = sData._eMap[ sData.eTable[i][j] ]; 272 DeletePointer( sData.eTable ) ; DeletePointer( sData.fTable ); 277 sData.eTable = NewPointer< typename SortedTreeNodes::SquareCornerIndices >( sData.nodeCount ); [all …]
|
/dports/math/geogram/geogram-1.7.7/src/lib/geogram/third_party/PoissonRecon/ |
H A D | MultiGridOctreeData.SortedTreeNodes.inl | 110 …eeNodes::SliceTableData::edgeIndices( const TreeOctNode* node ) { return eTable[ node->nodeData.no… 111 …ndices& SortedTreeNodes::SliceTableData::edgeIndices( int idx ) { return eTable[ idx - nodeOffset … 113 …& SortedTreeNodes::SliceTableData::edgeIndices( int idx ) const { return eTable[ idx - nodeOffset … 119 …dices& SortedTreeNodes::XSliceTableData::edgeIndices( int idx ) { return eTable[ idx - nodeOffset … 121 … SortedTreeNodes::XSliceTableData::edgeIndices( int idx ) const { return eTable[ idx - nodeOffset … 139 … DeletePointer( sData.cTable ) ; DeletePointer( sData.eTable ) ; DeletePointer( sData.fTable ); 146 … sData.eTable = NewPointer< SortedTreeNodes::SquareCornerIndices >( sData.nodeCount ); 259 … for( int j=0 ; j<Square::EDGES ; j++ ) sData.eTable[i][j] = sData._eMap[ sData.eTable[i][j] ]; 276 DeletePointer( sData.eTable ) ; DeletePointer( sData.fTable ); 281 … sData.eTable = NewPointer< SortedTreeNodes::SquareCornerIndices >( sData.nodeCount ); [all …]
|
/dports/math/pdal/PDAL-2.3.0/vendor/kazhdan/ |
H A D | MultiGridOctreeData.SortedTreeNodes.inl | 110 …eeNodes::SliceTableData::edgeIndices( const TreeOctNode* node ) { return eTable[ node->nodeData.no… 111 …ndices& SortedTreeNodes::SliceTableData::edgeIndices( int idx ) { return eTable[ idx - nodeOffset … 113 …& SortedTreeNodes::SliceTableData::edgeIndices( int idx ) const { return eTable[ idx - nodeOffset … 119 …dices& SortedTreeNodes::XSliceTableData::edgeIndices( int idx ) { return eTable[ idx - nodeOffset … 121 … SortedTreeNodes::XSliceTableData::edgeIndices( int idx ) const { return eTable[ idx - nodeOffset … 139 DeletePointer( sData.cTable ) ; DeletePointer( sData.eTable ) ; DeletePointer( sData.fTable ); 146 sData.eTable = NewPointer< typename SortedTreeNodes::SquareCornerIndices >( sData.nodeCount ); 259 …for( int j=0 ; j<(int)Square::EDGES ; j++ ) sData.eTable[i][j] = sData._eMap[ sData.eTable[i][j]… 276 DeletePointer( sData.eTable ) ; DeletePointer( sData.fTable ); 281 sData.eTable = NewPointer< typename SortedTreeNodes::SquareCornerIndices >( sData.nodeCount ); [all …]
|
/dports/cad/meshlab/meshlab-Meshlab-2020.05/src/meshlabplugins/filter_screened_poisson/Src/ |
H A D | MultiGridOctreeData.SortedTreeNodes.inl | 110 …eeNodes::SliceTableData::edgeIndices( const TreeOctNode* node ) { return eTable[ node->nodeData.no… 111 …ndices& SortedTreeNodes::SliceTableData::edgeIndices( int idx ) { return eTable[ idx - nodeOffset … 113 …& SortedTreeNodes::SliceTableData::edgeIndices( int idx ) const { return eTable[ idx - nodeOffset … 119 …dices& SortedTreeNodes::XSliceTableData::edgeIndices( int idx ) { return eTable[ idx - nodeOffset … 121 … SortedTreeNodes::XSliceTableData::edgeIndices( int idx ) const { return eTable[ idx - nodeOffset … 139 DeletePointer( sData.cTable ) ; DeletePointer( sData.eTable ) ; DeletePointer( sData.fTable ); 146 sData.eTable = NewPointer< typename SortedTreeNodes::SquareCornerIndices >( sData.nodeCount ); 255 for( int j=0 ; j<Square::EDGES ; j++ ) sData.eTable[i][j] = sData._eMap[ sData.eTable[i][j] ]; 272 DeletePointer( sData.eTable ) ; DeletePointer( sData.fTable ); 277 sData.eTable = NewPointer< typename SortedTreeNodes::SquareCornerIndices >( sData.nodeCount ); [all …]
|
/dports/converters/wkhtmltopdf/qt-5db36ec/src/3rdparty/webkit/Source/WebCore/dom/ |
H A D | MappedAttributeEntry.h | 40 , eTable enumerator
|
/dports/www/twiki/twiki/lib/TWiki/UI/ |
H A D | RDiff.pm | 82 my $eTable = ( $data =~ s/(<\/table)/$1/gois ) || 0; 83 while( $eTable < $bTable ) { 85 $eTable++; 87 while( $bTable < $eTable ) {
|
/dports/www/foswiki/Foswiki-2.1.6/lib/Foswiki/UI/ |
H A D | RDiff.pm | 84 my $eTable = ( $data =~ s/(<\/table)/$1/gis ) || 0; 85 while ( $eTable < $bTable ) { 87 $eTable++; 89 while ( $bTable < $eTable ) {
|
/dports/lang/spidermonkey60/firefox-60.9.0/accessible/base/ |
H A D | AccTypes.h | 83 eTable = 1 << 12, enumerator
|
/dports/www/firefox-legacy/firefox-52.8.0esr/accessible/base/ |
H A D | AccTypes.h | 83 eTable = 1 << 12, enumerator
|
/dports/lang/spidermonkey78/firefox-78.9.0/accessible/base/ |
H A D | AccTypes.h | 86 eTable = 1 << 12, enumerator
|
/dports/www/firefox/firefox-99.0/accessible/base/ |
H A D | AccTypes.h | 85 eTable = 1 << 11, enumerator
|
/dports/www/firefox-esr/firefox-91.8.0/accessible/base/ |
H A D | AccTypes.h | 85 eTable = 1 << 12, enumerator
|
/dports/mail/thunderbird/thunderbird-91.8.0/accessible/base/ |
H A D | AccTypes.h | 85 eTable = 1 << 12, enumerator
|
/dports/games/flightgear/flightgear-2020.3.11/src/FDM/JSBSim/math/ |
H A D | FGTable.h | 295 enum axis {eRow=0, eColumn, eTable}; enumerator
|
/dports/security/vault/vault-1.8.2/vendor/github.com/docker/docker/vendor/github.com/BurntSushi/toml/ |
H A D | encode.go | 142 enc.eTable(key, rv) 149 enc.eTable(key, rv) 241 func (enc *Encoder) eTable(key Key, rv reflect.Value) { func
|
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vic/vendor/github.com/docker/docker/vendor/github.com/BurntSushi/toml/ |
H A D | encode.go | 142 enc.eTable(key, rv) 149 enc.eTable(key, rv) 241 func (enc *Encoder) eTable(key Key, rv reflect.Value) { func
|
/dports/sysutils/helm/helm-3.5.2/vendor/github.com/docker/docker/vendor/github.com/BurntSushi/toml/ |
H A D | encode.go | 142 enc.eTable(key, rv) 149 enc.eTable(key, rv) 241 func (enc *Encoder) eTable(key Key, rv reflect.Value) { func
|
/dports/security/vuls/vuls-0.13.7/vendor/github.com/BurntSushi/toml/ |
H A D | encode.go | 142 enc.eTable(key, rv) 149 enc.eTable(key, rv) 241 func (enc *Encoder) eTable(key Key, rv reflect.Value) { func
|
/dports/devel/hub/hub-2.14.2/vendor/github.com/BurntSushi/toml/ |
H A D | encode.go | 142 enc.eTable(key, rv) 149 enc.eTable(key, rv) 241 func (enc *Encoder) eTable(key Key, rv reflect.Value) { func
|
/dports/net/nsq/nsq-1.2.1/vendor/github.com/BurntSushi/toml/ |
H A D | encode.go | 142 enc.eTable(key, rv) 149 enc.eTable(key, rv) 241 func (enc *Encoder) eTable(key Key, rv reflect.Value) { func
|
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vic/vendor/github.com/BurntSushi/toml/ |
H A D | encode.go | 142 enc.eTable(key, rv) 149 enc.eTable(key, rv) 241 func (enc *Encoder) eTable(key Key, rv reflect.Value) { func
|
/dports/deskutils/pet/pet-0.4.0/vendor/github.com/BurntSushi/toml/ |
H A D | encode.go | 142 enc.eTable(key, rv) 149 enc.eTable(key, rv) 241 func (enc *Encoder) eTable(key Key, rv reflect.Value) { func
|
/dports/www/gitlab-workhorse/gitlab-foss-0a901d60f8ae4a60c04ae82e6e9c3a03e9321417/workhorse/vendor/github.com/BurntSushi/toml/ |
H A D | encode.go | 142 enc.eTable(key, rv) 149 enc.eTable(key, rv) 241 func (enc *Encoder) eTable(key Key, rv reflect.Value) { func
|