Home
last modified time | relevance | path

Searched refs:lastVertex (Results 1 – 25 of 105) sorted by relevance

12345

/dports/biology/gatk/gatk-4.2.0.0/src/main/java/org/broadinstitute/hellbender/tools/walkers/haplotypecaller/graphs/
H A DPath.java26 private final V lastVertex; field in Path
40 lastVertex = Utils.nonNull(initialVertex, "initialVertex cannot be null"); in Path()
50 public Path(final List<E> edgesInOrder, final V lastVertex, final BaseGraph<V,E> graph) { in Path() argument
51 this.lastVertex = lastVertex; in Path()
72 lastVertex = p.graph.getEdgeTarget(edge); in Path()
92 V tmpVertex = p.lastVertex; in Path()
101 lastVertex = tmpVertex; in Path()
131 lastVertex = p.lastVertex; in Path()
191 public V getLastVertex() { return lastVertex; } in getLastVertex()
199 return lastVertex; in getFirstVertex()
[all …]
H A DChainPruner.java47 V lastVertex = graph.getEdgeTarget(startEdge); in findChain() local
51 final Set<E> outEdges = graph.outgoingEdgesOf(lastVertex); in findChain()
52 … if (outEdges.size() != 1 || graph.inDegreeOf(lastVertex) > 1 || lastVertex.equals(firstVertex)) { in findChain()
57 lastVertex = graph.getEdgeTarget(nextEdge); in findChain()
59 return new Path<V, E>(edges, lastVertex, graph); in findChain()
/dports/math/vtk6/VTK-6.2.0/Common/DataModel/
H A DvtkEdgeListIterator.cxx65 vtkIdType lastVertex = this->Graph->GetNumberOfVertices(); in SetGraph() local
74 lastVertex = helper->MakeDistributedId(myRank, lastVertex); in SetGraph()
78 while (this->Vertex < lastVertex && in SetGraph()
83 if (this->Vertex < lastVertex) in SetGraph()
168 vtkIdType lastVertex = this->Graph->GetNumberOfVertices(); in Increment() local
176 lastVertex = helper->MakeDistributedId(myRank, lastVertex); in Increment()
184 while (this->Vertex < lastVertex && in Increment()
192 if (this->Vertex < lastVertex) in Increment()
/dports/math/vtk8/VTK-8.2.0/Common/DataModel/
H A DvtkEdgeListIterator.cxx65 vtkIdType lastVertex = this->Graph->GetNumberOfVertices(); in SetGraph() local
74 lastVertex = helper->MakeDistributedId(myRank, lastVertex); in SetGraph()
78 while (this->Vertex < lastVertex && in SetGraph()
83 if (this->Vertex < lastVertex) in SetGraph()
168 vtkIdType lastVertex = this->Graph->GetNumberOfVertices(); in Increment() local
176 lastVertex = helper->MakeDistributedId(myRank, lastVertex); in Increment()
184 while (this->Vertex < lastVertex && in Increment()
192 if (this->Vertex < lastVertex) in Increment()
/dports/math/vtk9/VTK-9.1.0/Common/DataModel/
H A DvtkEdgeListIterator.cxx65 vtkIdType lastVertex = this->Graph->GetNumberOfVertices(); in SetGraph() local
73 lastVertex = helper->MakeDistributedId(myRank, lastVertex); in SetGraph()
77 while (this->Vertex < lastVertex && this->Graph->GetOutDegree(this->Vertex) == 0) in SetGraph()
81 if (this->Vertex < lastVertex) in SetGraph()
161 vtkIdType lastVertex = this->Graph->GetNumberOfVertices(); in Increment() local
168 lastVertex = helper->MakeDistributedId(myRank, lastVertex); in Increment()
176 while (this->Vertex < lastVertex && this->Graph->GetOutDegree(this->Vertex) == 0) in Increment()
183 if (this->Vertex < lastVertex) in Increment()
/dports/graphics/ospray/ospray-2.8.0/ospray/render/pathtracer/
H A DVirtualLight.ispc11 const PathVertex &lastVertex,
19 interval.lower = distance(lastVertex.dg.P, ray.org);
22 // because lastVertex.dg.P can be different from ray.org (when previously
24 interval.upper = distance(lastVertex.dg.P, ray.org + ray.t * ray.dir);
34 const PathVertex &lastVertex,
45 pathContext, pathState, lastVertex, pathVertex, ray);
55 // be calculated wrt. lastVertex.dg however, we only have a valid
59 lastVertex.dg,
67 lastVertex.dg.P,
86 lastVertex.pdf_w * T,
H A DPathSampler.ispc85 PathVertex lastVertex;
86 lastVertex.type = CAMERA;
87 lastVertex.volume = NULL;
88 lastVertex.pdf_w =
90 lastVertex.dg.P = ray.org; // P and N also used by light eval
91 lastVertex.dg.epsilon = calcEpsilon(ray.org, 0.f);
92 lastVertex.dg.Ns = ray.dir;
93 lastVertex.dg.Ng = ray.dir;
168 pathContext, pathState, lastVertex, pathVertex, ray);
186 pathContext, pathState, lastVertex, pathVertex, ray);
[all …]
/dports/graphics/urho3d/Urho3D-1.7.1/Source/Urho3D/Math/
H A DPolyhedron.cpp108 Vector3 lastVertex; in Clip() local
121 Vector3 clippedVertex = lastVertex + t * (face[j] - lastVertex); in Clip()
133 Vector3 clippedVertex = lastVertex + t * (face[j] - lastVertex); in Clip()
139 lastVertex = face[j]; in Clip()
148 Vector3 clippedVertex = lastVertex + t * (face[0] - lastVertex); in Clip()
/dports/biology/gatk/gatk-4.2.0.0/src/main/java/org/broadinstitute/hellbender/testutils/
H A DTestingReadThreadingGraph.java115 MultiDeBruijnVertex lastVertex = firstVertex; in applyString() local
121 … final Set<MultiDeBruijnVertex> nextVertices = getNextVertices(lastVertex,seqs[i].getBytes()[0]); in applyString()
123 …nextVertex = new MultiDeBruijnVertex(extendSequence(lastVertex.getSequence(),seqs[i].getBytes()[0]… in applyString()
134 final MultiSampleEdge edge = addEdge(lastVertex,nextVertex); in applyString()
138 lastVertex = nextVertex; in applyString()
/dports/cad/opencascade/opencascade-7.6.0/src/ChFi2d/
H A DChFi2d_Builder.cxx317 TopoDS_Vertex firstVertex, lastVertex; in RemoveFillet() local
318 TopExp::Vertices(Fillet, firstVertex, lastVertex); in RemoveFillet()
362 TopExp::Vertices(E1, firstVertex, lastVertex); in RemoveFillet()
399 TopExp::Vertices(E2, firstVertex, lastVertex); in RemoveFillet()
565 TopoDS_Vertex firstVertex, lastVertex; in BuildNewEdge() local
566 TopExp::Vertices(E1, firstVertex, lastVertex); in BuildNewEdge()
572 makeEdge.Init(curve, NewExtr, lastVertex); in BuildNewEdge()
596 TopoDS_Vertex firstVertex, lastVertex; in BuildNewEdge() local
597 TopExp::Vertices(E1, firstVertex, lastVertex); in BuildNewEdge()
606 makeEdge.Init(curve, NewExtr, lastVertex); in BuildNewEdge()
[all …]
H A DChFi2d_Builder_0.cxx321 TopoDS_Vertex firstVertex, lastVertex; in RemoveChamfer() local
322 TopExp::Vertices(Chamfer, firstVertex, lastVertex); in RemoveChamfer()
336 status = ChFi2d::FindConnectedEdges(newFace, lastVertex,adjEdge1, adjEdge2); in RemoveChamfer()
366 TopExp::Vertices(E1, firstVertex, lastVertex); in RemoveChamfer()
371 if ( firstVertex.IsSame(v) || lastVertex.IsSame(v)) in RemoveChamfer()
382 makeEdge.Init(curve, commonVertex, lastVertex); in RemoveChamfer()
387 else if (lastVertex.IsSame(connectionE1Chamfer)) { in RemoveChamfer()
403 TopExp::Vertices(E2, firstVertex, lastVertex); in RemoveChamfer()
404 if ( firstVertex.IsSame(v) || lastVertex.IsSame(v)) in RemoveChamfer()
415 makeEdge.Init(curve, commonVertex, lastVertex); in RemoveChamfer()
[all …]
/dports/graphics/vpaint/vpaint-1.7/src/Gui/VectorAnimationComplex/
H A DProperCycle.cpp77 KeyVertex * lastVertex = lastAddedHalfedge.endVertex(); // hence this is a valid vertex in ProperCycle() local
85 if((*it)->startVertex() == lastVertex) in ProperCycle()
90 else if((*it)->endVertex() == lastVertex) in ProperCycle()
H A DProperPath.cpp70 KeyVertex * lastVertex = lastHalfedge.endVertex(); // hence this is a valid vertex in ProperPath() local
80 if((*it)->startVertex() == lastVertex) in ProperPath()
85 else if((*it)->endVertex() == lastVertex) in ProperPath()
/dports/graphics/opencollada/OpenCOLLADA-1.6.68/COLLADAMax/src/
H A DCOLLADAMaxGeometryImporter.cpp200 …( size_t j = nextTristripStartIndex + 2, lastVertex = nextTristripStartIndex + faceVertexCount; j… in importTriangleMeshPositions() local
233 …or ( size_t j = nextTrifanStartIndex + 2, lastVertex = nextTrifanStartIndex + faceVertexCount; j … in importTriangleMeshPositions() local
346 …( size_t j = nextTristripStartIndex + 2, lastVertex = nextTristripStartIndex + faceVertexCount; j… in importTriangleMeshNormals() local
380 …or ( size_t j = nextTrifanStartIndex + 2, lastVertex = nextTrifanStartIndex + faceVertexCount; j … in importTriangleMeshNormals() local
528 …( size_t j = nextTristripStartIndex + 2, lastVertex = nextTristripStartIndex + faceVertexCount; j… in setTriangleMeshUVVerticesPerPrimitiveAndChannel() local
556 …or ( size_t j = nextTrifanStartIndex + 2, lastVertex = nextTrifanStartIndex + faceVertexCount; j … in setTriangleMeshUVVerticesPerPrimitiveAndChannel() local
835 …( size_t j = nextTristripStartIndex + 2, lastVertex = nextTristripStartIndex + faceVertexCount; j… in importPolygonMeshPositions() local
875 …or ( size_t j = nextTrifanStartIndex + 2, lastVertex = nextTrifanStartIndex + faceVertexCount; j … in importPolygonMeshPositions() local
1063 …or ( size_t j = nextTrifanStartIndex + 2, lastVertex = nextTrifanStartIndex + faceVertexCount; j … in importPolygonMeshNormals() local
1237 …( size_t j = nextTristripStartIndex + 2, lastVertex = nextTristripStartIndex + faceVertexCount; j… in setPolygonMeshUVVerticesPerPrimitiveAndChannel() local
[all …]
/dports/biology/seqan1/seqan-1.3.1/seqan/graph_msa/
H A Dgraph_align_tcoffee_io.h865 if (lastVertex == nilVertex) { in read()
866 lastVertex = addVertex(guideTree); in read()
867 assignRoot(guideTree, lastVertex); in read()
870 lastVertex = ch; in read()
875 if (!isRoot(guideTree, lastVertex)) { in read()
876 lastChild = lastVertex; in read()
877 lastVertex = parentVertex(guideTree, lastVertex); in read()
879 lastChild = lastVertex; in read()
880 lastVertex = nilVertex; in read()
896 if (lastVertex == nilVertex) { in read()
[all …]
/dports/graphics/scantailor/scantailor-advanced-1.0.16/zones/
H A DZoneCreationInteraction.cpp148 const QLineF line(to_screen.map(QLineF(m_spline->lastVertex()->point(), m_nextVertexImagePos))); in onPaint()
224 } else if (m_nextVertexImagePos == m_spline->lastVertex()->point()) { in onMouseReleaseEvent()
226 m_spline->lastVertex()->remove(); in onMouseReleaseEvent()
235 const Proximity prox(screen_mouse_pos, m_spline->lastVertex()->point()); in onMouseReleaseEvent()
253 const QPointF last(to_screen.map(m_spline->lastVertex()->point())); in onMouseMoveEvent()
266 m_nextVertexImagePos = m_spline->lastVertex()->point(); in onMouseMoveEvent()
H A DEditableSpline.h56 SplineVertex::Ptr lastVertex() const { return m_sentinel.lastVertex(); } in lastVertex() function
H A DEditableSpline.cpp29 SplineVertex::Ptr last_vertex(lastVertex()); in EditableSpline()
57 vertex = lastVertex()->next(SplineVertex::LOOP_IF_BRIDGED); in toPolygon()
/dports/math/vtk6/VTK-6.2.0/Rendering/OpenGL2/
H A DvtkCompositePolyDataMapper2.cxx202 unsigned int &lastVertex, in BuildRenderValues() argument
251 flat_index, lastVertex, lastIndex, lastEdgeIndex); in BuildRenderValues()
279 this->RenderValues.back().EndVertex = lastVertex - 1; in BuildRenderValues()
284 rv.StartVertex = lastVertex; in BuildRenderValues()
293 lastVertex = this->VertexOffsets[my_flat_index]; in BuildRenderValues()
339 unsigned int lastVertex = 0; in RenderPieceDraw() local
345 flat_index, lastVertex, lastIndex, lastEdgeIndex); in RenderPieceDraw()
347 this->RenderValues.back().EndVertex = lastVertex - 1; in RenderPieceDraw()
/dports/biology/seqan/seqan-library-2.4.0/include/seqan/graph_msa/
H A Dgraph_align_tcoffee_io.h948 TVertexDescriptor lastVertex = nilVertex; in read() local
954 if (lastVertex == nilVertex) { in read()
955 lastVertex = addVertex(guideTree); in read()
959 lastVertex = ch; in read()
966 if (!isRoot(guideTree, lastVertex)) { in read()
967 lastChild = lastVertex; in read()
968 lastVertex = parentVertex(guideTree, lastVertex); in read()
970 lastChild = lastVertex; in read()
971 lastVertex = nilVertex; in read()
992 if (lastVertex == nilVertex) { in read()
[all …]
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/include/seqan/graph_msa/
H A Dgraph_align_tcoffee_io.h948 TVertexDescriptor lastVertex = nilVertex; in read() local
954 if (lastVertex == nilVertex) { in read()
955 lastVertex = addVertex(guideTree); in read()
959 lastVertex = ch; in read()
966 if (!isRoot(guideTree, lastVertex)) { in read()
967 lastChild = lastVertex; in read()
968 lastVertex = parentVertex(guideTree, lastVertex); in read()
970 lastChild = lastVertex; in read()
971 lastVertex = nilVertex; in read()
992 if (lastVertex == nilVertex) { in read()
[all …]
/dports/biology/pbseqan/seqan-21d95d737d8decb5cc3693b9065d81e831e7f57d/include/seqan/graph_msa/
H A Dgraph_align_tcoffee_io.h958 TVertexDescriptor lastVertex = nilVertex; in read() local
964 if (lastVertex == nilVertex) { in read()
965 lastVertex = addVertex(guideTree); in read()
969 lastVertex = ch; in read()
976 if (!isRoot(guideTree, lastVertex)) { in read()
977 lastChild = lastVertex; in read()
978 lastVertex = parentVertex(guideTree, lastVertex); in read()
980 lastChild = lastVertex; in read()
981 lastVertex = nilVertex; in read()
1002 if (lastVertex == nilVertex) { in read()
[all …]
/dports/graphics/enblend/enblend-enfuse-4.2/src/
H A Dpostoptimizer.h144 Segment::iterator lastVertex = std::prev(snake->end()); in runOptimizer() local
154 vertexIterator = snake->erase(std::next(lastVertex)); in runOptimizer()
171 if (!(lastVertex->first || vertexIterator->first)) { in runOptimizer()
176 lastVertex = snake->begin(); in runOptimizer()
178 lastVertex = snake->insert(std::next(lastVertex), in runOptimizer()
188 lastVertex = vertexIterator; in runOptimizer()
/dports/math/vtk8/VTK-8.2.0/Infovis/BoostGraphAlgorithms/
H A DvtkBoostGraphAdapter.h191 directed(false), vertex(v), lastVertex(v), iter(nullptr), end(nullptr), graph(g)
195 lastVertex = graph->GetNumberOfVertices();
205 lastVertex = helper->MakeDistributedId(myRank, lastVertex);
211 while (vertex < lastVertex && this->graph->GetOutDegree(vertex) == 0)
216 if (vertex < lastVertex)
290 while (vertex < lastVertex && this->graph->GetOutDegree(vertex) == 0)
295 if (vertex < lastVertex)
310 vtkIdType lastVertex;
/dports/math/vtk9/VTK-9.1.0/Infovis/BoostGraphAlgorithms/
H A DvtkBoostGraphAdapter.h183 , lastVertex(v)
190 lastVertex = graph->GetNumberOfVertices();
199 lastVertex = helper->MakeDistributedId(myRank, lastVertex);
205 while (vertex < lastVertex && this->graph->GetOutDegree(vertex) == 0)
210 if (vertex < lastVertex)
287 while (vertex < lastVertex && this->graph->GetOutDegree(vertex) == 0)
292 if (vertex < lastVertex)
315 vtkIdType lastVertex;

12345