Home
last modified time | relevance | path

Searched refs:inOffsets (Results 1 – 14 of 14) sorted by relevance

/dports/math/vtk9/VTK-9.1.0/Filters/General/
H A DvtkRemovePolyData.cxx250 inOffsets[1] = inOffsets[0] + numInVerts; in operator ()()
251 inOffsets[2] = inOffsets[1] + numInLines; in operator ()()
252 inOffsets[3] = inOffsets[2] + numInPolys; in operator ()()
253 inOffsets[4] = inOffsets[3] + numInStrips; in operator ()()
420 vtkIdType numInVerts = inOffsets[1] - inOffsets[0]; in operator ()()
421 vtkIdType numInLines = inOffsets[2] - inOffsets[1]; in operator ()()
422 vtkIdType numInPolys = inOffsets[3] - inOffsets[2]; in operator ()()
423 vtkIdType numInStrips = inOffsets[4] - inOffsets[3]; in operator ()()
585 vtkIdType numInVerts = inOffsets[1] - inOffsets[0]; in operator ()()
586 vtkIdType numInLines = inOffsets[2] - inOffsets[1]; in operator ()()
[all …]
/dports/math/vtk9/VTK-9.1.0/IO/Image/
H A DvtkMRCReader.cxx320 void readData(int numComponents, int* outExt, vtkIdType* outInc, vtkIdType* inOffsets, in readData() argument
331 vtkIdType offset = z * inOffsets[2] + y * inOffsets[1] + outExt[0] * inOffsets[0]; in readData()
354 vtkIdType inOffsets[3]; in ExecuteDataWithInformation() local
387 inOffsets[0] = numComponents; in ExecuteDataWithInformation()
388 inOffsets[1] = this->Internals->header.nx * numComponents; in ExecuteDataWithInformation()
389 inOffsets[2] = this->Internals->header.ny * this->Internals->header.nx * numComponents; in ExecuteDataWithInformation()
400 vtkTemplateMacro(readData<VTK_TT>(numComponents, modifiedOutExt, outInc, inOffsets, in ExecuteDataWithInformation()
/dports/math/vtk8/VTK-8.2.0/IO/Image/
H A DvtkMRCReader.cxx319 vtkIdType *inOffsets, T * const outPtr, in readData() argument
330 vtkIdType offset = z * inOffsets[2] + y * inOffsets[1] + outExt[0] * inOffsets[0]; in readData()
353 vtkIdType inOffsets[3]; in ExecuteDataWithInformation() local
386 inOffsets[0] = numComponents; in ExecuteDataWithInformation()
387 inOffsets[1] = this->Internals->header.nx * numComponents; in ExecuteDataWithInformation()
388 inOffsets[2] = this->Internals->header.ny * this->Internals->header.nx in ExecuteDataWithInformation()
401 readData<VTK_TT>(numComponents, modifiedOutExt, outInc, inOffsets, in ExecuteDataWithInformation()
/dports/math/vtk9/VTK-9.1.0/Filters/Core/
H A DvtkRemoveUnusedPoints.cxx94 auto inOffsets = inCellArray->GetOffsetsArray(); in CopyConnectivity() local
126 outCellArray->SetData(inOffsets, outConnectivity); in CopyConnectivity()
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/utils/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DHierarchicalLayoutManager.java96 public HashMap<Integer, Integer> inOffsets = new HashMap<>(); field in HierarchicalLayoutManager.LayoutNode
271 if (e.to.inOffsets.containsKey(e.relativeTo)) { in run()
272 …points.add(new Point(p.x, p.y + e.to.inOffsets.get(e.relativeTo) + e.link.getTo().getRelativePosit… in run()
379 if (curEdge.to.inOffsets.containsKey(curEdge.relativeTo)) { in run()
380 …points.add(new Point(p.x, p.y + curEdge.to.inOffsets.get(curEdge.relativeTo) + ((curEdge.link == n… in run()
1528 node.inOffsets.put(pos, -curX);
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/utils/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DHierarchicalLayoutManager.java96 public HashMap<Integer, Integer> inOffsets = new HashMap<>(); field in HierarchicalLayoutManager.LayoutNode
271 if (e.to.inOffsets.containsKey(e.relativeTo)) { in run()
272 …points.add(new Point(p.x, p.y + e.to.inOffsets.get(e.relativeTo) + e.link.getTo().getRelativePosit… in run()
379 if (curEdge.to.inOffsets.containsKey(curEdge.relativeTo)) { in run()
380 …points.add(new Point(p.x, p.y + curEdge.to.inOffsets.get(curEdge.relativeTo) + ((curEdge.link == n… in run()
1528 node.inOffsets.put(pos, -curX);
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/utils/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DHierarchicalLayoutManager.java96 public HashMap<Integer, Integer> inOffsets = new HashMap<>(); field in HierarchicalLayoutManager.LayoutNode
271 if (e.to.inOffsets.containsKey(e.relativeTo)) { in run()
272 …points.add(new Point(p.x, p.y + e.to.inOffsets.get(e.relativeTo) + e.link.getTo().getRelativePosit… in run()
379 if (curEdge.to.inOffsets.containsKey(curEdge.relativeTo)) { in run()
380 …points.add(new Point(p.x, p.y + curEdge.to.inOffsets.get(curEdge.relativeTo) + ((curEdge.link == n… in run()
1528 node.inOffsets.put(pos, -curX);
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/utils/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DHierarchicalLayoutManager.java96 public HashMap<Integer, Integer> inOffsets = new HashMap<>(); field in HierarchicalLayoutManager.LayoutNode
271 if (e.to.inOffsets.containsKey(e.relativeTo)) { in run()
272 …points.add(new Point(p.x, p.y + e.to.inOffsets.get(e.relativeTo) + e.link.getTo().getRelativePosit… in run()
379 if (curEdge.to.inOffsets.containsKey(curEdge.relativeTo)) { in run()
380 …points.add(new Point(p.x, p.y + curEdge.to.inOffsets.get(curEdge.relativeTo) + ((curEdge.link == n… in run()
1528 node.inOffsets.put(pos, -curX);
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/utils/IdealGraphVisualizer/HierarchicalLayout/src/main/java/com/sun/hotspot/igv/hierarchicallayout/
H A DHierarchicalLayoutManager.java96 public HashMap<Integer, Integer> inOffsets = new HashMap<>(); field in HierarchicalLayoutManager.LayoutNode
271 if (e.to.inOffsets.containsKey(e.relativeTo)) { in run()
272 …points.add(new Point(p.x, p.y + e.to.inOffsets.get(e.relativeTo) + e.link.getTo().getRelativePosit… in run()
379 if (curEdge.to.inOffsets.containsKey(curEdge.relativeTo)) { in run()
380 …points.add(new Point(p.x, p.y + curEdge.to.inOffsets.get(curEdge.relativeTo) + ((curEdge.link == n… in run()
1528 node.inOffsets.put(pos, -curX);
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/utils/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DHierarchicalLayoutManager.java96 public HashMap<Integer, Integer> inOffsets = new HashMap<>(); field in HierarchicalLayoutManager.LayoutNode
271 if (e.to.inOffsets.containsKey(e.relativeTo)) { in run()
272 …points.add(new Point(p.x, p.y + e.to.inOffsets.get(e.relativeTo) + e.link.getTo().getRelativePosit… in run()
379 if (curEdge.to.inOffsets.containsKey(curEdge.relativeTo)) { in run()
380 …points.add(new Point(p.x, p.y + curEdge.to.inOffsets.get(curEdge.relativeTo) + ((curEdge.link == n… in run()
1528 node.inOffsets.put(pos, -curX);
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/utils/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DHierarchicalLayoutManager.java96 public HashMap<Integer, Integer> inOffsets = new HashMap<>(); field in HierarchicalLayoutManager.LayoutNode
271 if (e.to.inOffsets.containsKey(e.relativeTo)) { in run()
272 …points.add(new Point(p.x, p.y + e.to.inOffsets.get(e.relativeTo) + e.link.getTo().getRelativePosit… in run()
379 if (curEdge.to.inOffsets.containsKey(curEdge.relativeTo)) { in run()
380 …points.add(new Point(p.x, p.y + curEdge.to.inOffsets.get(curEdge.relativeTo) + ((curEdge.link == n… in run()
1528 node.inOffsets.put(pos, -curX);
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/utils/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DHierarchicalLayoutManager.java96 public HashMap<Integer, Integer> inOffsets = new HashMap<>(); field in HierarchicalLayoutManager.LayoutNode
271 if (e.to.inOffsets.containsKey(e.relativeTo)) { in run()
272 …points.add(new Point(p.x, p.y + e.to.inOffsets.get(e.relativeTo) + e.link.getTo().getRelativePosit… in run()
379 if (curEdge.to.inOffsets.containsKey(curEdge.relativeTo)) { in run()
380 …points.add(new Point(p.x, p.y + curEdge.to.inOffsets.get(curEdge.relativeTo) + ((curEdge.link == n… in run()
1528 node.inOffsets.put(pos, -curX);
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DHierarchicalLayoutManager.java107 public HashMap<Integer, Integer> inOffsets = new HashMap<Integer, Integer>(); field in HierarchicalLayoutManager.LayoutNode
281 if (e.to.inOffsets.containsKey(e.relativeTo)) { in run()
282 points.add(new Point(p.x, p.y + e.to.inOffsets.get(e.relativeTo))); in run()
392 if (curEdge.to.inOffsets.containsKey(curEdge.relativeTo)) { in run()
393 … points.add(new Point(p.x, p.y + curEdge.to.inOffsets.get(curEdge.relativeTo))); in run()
1837 node.inOffsets.put(pos, -curX);
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DHierarchicalLayoutManager.java107 public HashMap<Integer, Integer> inOffsets = new HashMap<Integer, Integer>(); field in HierarchicalLayoutManager.LayoutNode
281 if (e.to.inOffsets.containsKey(e.relativeTo)) { in run()
282 points.add(new Point(p.x, p.y + e.to.inOffsets.get(e.relativeTo))); in run()
392 if (curEdge.to.inOffsets.containsKey(curEdge.relativeTo)) { in run()
393 … points.add(new Point(p.x, p.y + curEdge.to.inOffsets.get(curEdge.relativeTo))); in run()
1837 node.inOffsets.put(pos, -curX);