Home
last modified time | relevance | path

Searched refs:eIdx (Results 1 – 25 of 51) sorted by relevance

123

/dports/biology/canu/canu-2.2/src/utility/src/utility/
H A Dbits-wordArray.H28 wordArray::get(uint64 eIdx) { in get() argument
37 if (eIdx >= _numValues) in get()
39 assert(eIdx < _numValues); in get()
109 wordArray::setNval(uint32 eIdx) { in setNval() argument
114 if (eIdx >= _numValues) in setNval()
115 _numValues = eIdx + 1; in setNval()
123 wordArray::set(uint64 eIdx, uint128 value) { in set() argument
136 allocate(eIdx); in set()
155 setNval(eIdx); in set()
156 else if (eIdx >= _numValues) in set()
[all …]
/dports/science/siesta/siesta-4.1.5/Src/
H A Dm_ts_tri_scat.F9066 integer :: sIdx, eIdx local
124 Gf => fGf(sIdx:eIdx)
345 ztmp => fA(eIdx:)
348 zwork => fA(eIdx:eIdx+idx-1)
366 ztmp => fA(eIdx:)
409 eIdx = crows(n)
436 eIdx = sN - 1
438 zwork(sIdx:sIdx+eIdx) = Gf(sIdxF:sIdxF+eIdx)
470 eIdx = sIdx
484 eIdx = sIdx + i
[all …]
/dports/biology/py-deeptools/deepTools-3.5.1/deeptools/
H A DsumCoveragePerBin.py170 … eIdx = vector_start + min(np.ceil(float(fragmentEnd - reg[0]) / tileSize).astype('int'), nRegBins)
171 if eIdx >= len(coverages):
172 eIdx = len(coverages) - 1
175 if sIdx >= eIdx:
187 while _ < eIdx:
190 while eIdx - sIdx >= nRegBins:
191 eIdx -= 1
192 if eIdx > sIdx:
193 _ = fragmentEnd - (reg[0] + eIdx * tileSize)
198 coverages[eIdx] += _
[all …]
/dports/math/dune-foamgrid/dune-foamgrid-43bfdb6181fae187fd803eca935a030d8d5ab0bc/examples/
H A Delementparametrization.cc107 int eIdx = mapper.index(element); in evolve() local
128 update[eIdx] += lambda*gradTn; in evolve()
174 int eIdx = mapper.index(element); in finitevolumeadapt() local
177 globalmax = std::max(globalmax,temperature[eIdx]); in finitevolumeadapt()
194 indicator[eIdx] = std::max(indicator[eIdx],localdelta); in finitevolumeadapt()
243 int eIdx = mapper.index(element); in finitevolumeadapt() local
244 rv.value = temperature[eIdx]; in finitevolumeadapt()
276 int eIdx = mapper.index(element); in finitevolumeadapt() local
277 temperature[eIdx] = rv.value/rv.count; in finitevolumeadapt()
287 int eIdx = mapper.index(element); in finitevolumeadapt() local
[all …]
/dports/devel/lazygit/lazygit-0.31.4/vendor/github.com/jesseduffield/go-git/v5/plumbing/format/packfile/
H A Ddelta_index.go38 eIdx := idx.table[tIdx]
39 if eIdx != 0 {
40 srcOffset = idx.entries[eIdx]
160 eIdx := s.count
161 s.entries[eIdx] = ptr
162 s.next[eIdx] = head
163 s.table[tIdx] = eIdx
/dports/www/gitea/gitea-1.16.5/vendor/github.com/go-git/go-git/v5/plumbing/format/packfile/
H A Ddelta_index.go38 eIdx := idx.table[tIdx]
39 if eIdx != 0 {
40 srcOffset = idx.entries[eIdx]
160 eIdx := s.count
161 s.entries[eIdx] = ptr
162 s.next[eIdx] = head
163 s.table[tIdx] = eIdx
/dports/sysutils/chezmoi/chezmoi-2.9.3/vendor/github.com/go-git/go-git/v5/plumbing/format/packfile/
H A Ddelta_index.go38 eIdx := idx.table[tIdx]
39 if eIdx != 0 {
40 srcOffset = idx.entries[eIdx]
160 eIdx := s.count
161 s.entries[eIdx] = ptr
162 s.next[eIdx] = head
163 s.table[tIdx] = eIdx
/dports/net/cloudquery/cloudquery-0.16.0/vendor/github.com/go-git/go-git/v5/plumbing/format/packfile/
H A Ddelta_index.go38 eIdx := idx.table[tIdx]
39 if eIdx != 0 {
40 srcOffset = idx.entries[eIdx]
160 eIdx := s.count
161 s.entries[eIdx] = ptr
162 s.next[eIdx] = head
163 s.table[tIdx] = eIdx
/dports/sysutils/gomplate/gomplate-3.9.0/vendor/github.com/go-git/go-git/v5/plumbing/format/packfile/
H A Ddelta_index.go38 eIdx := idx.table[tIdx]
39 if eIdx != 0 {
40 srcOffset = idx.entries[eIdx]
160 eIdx := s.count
161 s.entries[eIdx] = ptr
162 s.next[eIdx] = head
163 s.table[tIdx] = eIdx
/dports/devel/lazygit/lazygit-0.31.4/vendor/github.com/jesseduffield/go-git/v5/go-git-341962be15a4/plumbing/format/packfile/
H A Ddelta_index.go38 eIdx := idx.table[tIdx]
39 if eIdx != 0 {
40 srcOffset = idx.entries[eIdx]
160 eIdx := s.count
161 s.entries[eIdx] = ptr
162 s.next[eIdx] = head
163 s.table[tIdx] = eIdx
/dports/security/keybase/client-v5.7.1/go/vendor/gopkg.in/src-d/go-git.v4/plumbing/format/packfile/
H A Ddelta_index.go38 eIdx := idx.table[tIdx]
39 if eIdx != 0 {
40 srcOffset = idx.entries[eIdx]
160 eIdx := s.count
161 s.entries[eIdx] = ptr
162 s.next[eIdx] = head
163 s.table[tIdx] = eIdx
/dports/devel/gitty/gitty-0.3.0/vendor/github.com/go-git/go-git/v5/plumbing/format/packfile/
H A Ddelta_index.go38 eIdx := idx.table[tIdx]
39 if eIdx != 0 {
40 srcOffset = idx.entries[eIdx]
160 eIdx := s.count
161 s.entries[eIdx] = ptr
162 s.next[eIdx] = head
163 s.table[tIdx] = eIdx
/dports/graphics/qgis/qgis-3.22.3/src/core/
H A Dqgstracer.cpp175 int eIdx = g->e.count() - 1; in makeGraph() local
176 g->v[v1].edges << eIdx; in makeGraph()
177 g->v[v2].edges << eIdx; in makeGraph()
318 int eIdx = point2edge( g, pt, lineVertexAfter ); in joinVertexToGraph() local
322 if ( eIdx == -1 ) in joinVertexToGraph()
325 const QgsTracerGraph::E &e = g.e[eIdx]; in joinVertexToGraph()
355 g.inactiveEdges << eIdx; in joinVertexToGraph()
389 if ( eIdx >= g.e.count() ) in resetGraph()
391 const QgsTracerGraph::E &e = g.e[eIdx]; in resetGraph()
398 v1.edges << eIdx; in resetGraph()
[all …]
/dports/graphics/qgis-ltr/qgis-3.16.16/src/core/
H A Dqgstracer.cpp174 int eIdx = g->e.count() - 1; in makeGraph() local
175 g->v[v1].edges << eIdx; in makeGraph()
176 g->v[v2].edges << eIdx; in makeGraph()
320 int eIdx = point2edge( g, pt, lineVertexAfter ); in joinVertexToGraph() local
324 if ( eIdx == -1 ) in joinVertexToGraph()
327 const QgsTracerGraph::E &e = g.e[eIdx]; in joinVertexToGraph()
357 g.inactiveEdges << eIdx; in joinVertexToGraph()
391 if ( eIdx >= g.e.count() ) in resetGraph()
393 const QgsTracerGraph::E &e = g.e[eIdx]; in resetGraph()
400 v1.edges << eIdx; in resetGraph()
[all …]
/dports/editors/libreoffice/libreoffice-7.2.6.2/svl/source/numbers/
H A Dzforscan.hxx84 const OUString& GetSpecialKeyword( NfKeywordIndex eIdx ) const in GetSpecialKeyword()
86 if ( sKeyword[eIdx].isEmpty() ) in GetSpecialKeyword()
88 InitSpecialKeyword( eIdx ); in GetSpecialKeyword()
90 return sKeyword[eIdx]; in GetSpecialKeyword()
236 void InitSpecialKeyword( NfKeywordIndex eIdx ) const;
/dports/editors/libreoffice6/libreoffice-6.4.7.2/svl/source/numbers/
H A Dzforscan.hxx82 const OUString& GetSpecialKeyword( NfKeywordIndex eIdx ) const in GetSpecialKeyword()
84 if ( sKeyword[eIdx].isEmpty() ) in GetSpecialKeyword()
86 InitSpecialKeyword( eIdx ); in GetSpecialKeyword()
88 return sKeyword[eIdx]; in GetSpecialKeyword()
236 void InitSpecialKeyword( NfKeywordIndex eIdx ) const;
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/surface/include/pcl/surface/3rdparty/poisson4/
H A Dgeometry.hpp337 int tIdx,eIdx,p[3]; in addTriangle() local
353 eIdx=int(edges.size())-1; in addTriangle()
354 edgeMap[e]=eIdx; in addTriangle()
355 edges[eIdx].tIndex[0]=tIdx; in addTriangle()
358 eIdx=edgeMap[e]; in addTriangle()
359 if(edges[eIdx].pIndex[0]==p[i]){ in addTriangle()
360 if(edges[eIdx].tIndex[0]<0){edges[eIdx].tIndex[0]=tIdx;} in addTriangle()
364 if(edges[eIdx].tIndex[1]<0){edges[eIdx].tIndex[1]=tIdx;} in addTriangle()
369 triangles[tIdx].eIndex[i]=eIdx; in addTriangle()
/dports/multimedia/opentoonz/opentoonz-1.5.0/toonz/sources/common/trop/
H A Dborders_extractor.hpp292 int eIdx = mesh.addEdge(ed); in _readEdge() local
293 edge_output::closeContainer(reader, &mesh, eIdx); in _readEdge()
295 return eIdx; in _readEdge()
380 int e, edgesCount = vx.edgesCount(), eIdx = -1, side = -1; in _readBorder() local
386 eIdx = ed.getIndex(); in _readBorder()
393 eIdx = _readEdge<RasterEdgeIter, Mesh, ContainersReader, in _readBorder()
399 const edge_type &ed = mesh.edge(eIdx); in _readBorder()
411 fc.addEdge(eIdx); in _readBorder()
/dports/multimedia/opentoonz/opentoonz-1.5.0/toonz/sources/tnztools/
H A Dplastictool_meshedit.cpp168 int eIdx = in closestEdge() local
172 return std::make_pair(closer.dist2(mesh.edge(eIdx)), eIdx); in closestEdge()
233 EdgeCut(int vIdx, int eIdx) : m_vIdx(vIdx), m_eIdx(eIdx) {} in EdgeCut()
343 int eIdx = (adjEdges[0] == lastCut.m_eIdx) ? adjEdges[1] : adjEdges[0]; in buildEdgeCuts() local
345 edgeCuts.push_back(EdgeCut(vIdx, eIdx)); in buildEdgeCuts()
1178 const MeshIndex &eIdx = m_meSel.objects().front(); in swapEdge_mesh_undo() local
1179 const TTextureMesh &mesh = *m_mi->meshes()[eIdx.m_meshIdx]; in swapEdge_mesh_undo()
1181 if (!::testSwapEdge(mesh, eIdx.m_idx)) return; in swapEdge_mesh_undo()
1198 const MeshIndex &eIdx = m_meSel.objects().front(); in collapseEdge_mesh_undo() local
1199 const TTextureMesh &mesh = *m_mi->meshes()[eIdx.m_meshIdx]; in collapseEdge_mesh_undo()
[all …]
/dports/science/axom/axom-0.6.1/src/axom/quest/tests/
H A Dquest_inout_octree.cpp137 int eIdx = (i - 14); in queryOctahedronMesh() local
138 pt = axom::quest::utilities::getCentroid(getVertex(mesh, v1[eIdx]), in queryOctahedronMesh()
139 getVertex(mesh, v2[eIdx])); in queryOctahedronMesh()
/dports/math/pdal/PDAL-2.3.0/vendor/kazhdan/
H A DGeometry.inl329 int tIdx,eIdx,p[3]; local
346 eIdx=int(edges.size())-1;
347 edgeMap[e]=eIdx;
348 edges[eIdx].tIndex[0]=tIdx;
351 eIdx=edgeMap[e];
352 if(edges[eIdx].pIndex[0]==p[i]){
353 if(edges[eIdx].tIndex[0]<0){edges[eIdx].tIndex[0]=tIdx;}
357 if(edges[eIdx].tIndex[1]<0){edges[eIdx].tIndex[1]=tIdx;}
362 triangles[tIdx].eIndex[i]=eIdx;
/dports/cad/meshlab/meshlab-Meshlab-2020.05/src/plugins_unsupported/filter_poisson/src/
H A DGeometry.inl325 int tIdx,eIdx,p[3]; local
342 eIdx=int(edges.size())-1;
343 edgeMap[e]=eIdx;
344 edges[eIdx].tIndex[0]=tIdx;
347 eIdx=edgeMap[e];
348 if(edges[eIdx].pIndex[0]==p[i]){
349 if(edges[eIdx].tIndex[0]<0){edges[eIdx].tIndex[0]=tIdx;}
353 if(edges[eIdx].tIndex[1]<0){edges[eIdx].tIndex[1]=tIdx;}
358 triangles[tIdx].eIndex[i]=eIdx;
/dports/graphics/colmap/colmap-3.6/lib/PoissonRecon/
H A DGeometry.inl328 int tIdx,eIdx,p[3]; local
345 eIdx=int(edges.size())-1;
346 edgeMap[e]=eIdx;
347 edges[eIdx].tIndex[0]=tIdx;
350 eIdx=edgeMap[e];
351 if(edges[eIdx].pIndex[0]==p[i]){
352 if(edges[eIdx].tIndex[0]<0){edges[eIdx].tIndex[0]=tIdx;}
356 if(edges[eIdx].tIndex[1]<0){edges[eIdx].tIndex[1]=tIdx;}
361 triangles[tIdx].eIndex[i]=eIdx;
/dports/math/geogram/geogram-1.7.7/src/lib/geogram/third_party/PoissonRecon/
H A DGeometry.inl328 int tIdx,eIdx,p[3]; local
345 eIdx=int(edges.size())-1;
346 edgeMap[e]=eIdx;
347 edges[eIdx].tIndex[0]=tIdx;
350 eIdx=edgeMap[e];
351 if(edges[eIdx].pIndex[0]==p[i]){
352 if(edges[eIdx].tIndex[0]<0){edges[eIdx].tIndex[0]=tIdx;}
356 if(edges[eIdx].tIndex[1]<0){edges[eIdx].tIndex[1]=tIdx;}
361 triangles[tIdx].eIndex[i]=eIdx;
/dports/cad/meshlab/meshlab-Meshlab-2020.05/src/meshlabplugins/filter_screened_poisson/Src/
H A DGeometry.inl329 int tIdx,eIdx,p[3]; local
346 eIdx=int(edges.size())-1;
347 edgeMap[e]=eIdx;
348 edges[eIdx].tIndex[0]=tIdx;
351 eIdx=edgeMap[e];
352 if(edges[eIdx].pIndex[0]==p[i]){
353 if(edges[eIdx].tIndex[0]<0){edges[eIdx].tIndex[0]=tIdx;}
357 if(edges[eIdx].tIndex[1]<0){edges[eIdx].tIndex[1]=tIdx;}
362 triangles[tIdx].eIndex[i]=eIdx;

123