| /dports/math/vtk8/VTK-8.2.0/Infovis/BoostGraphAlgorithms/Testing/Cxx/ |
| H A D | TestBoostAdapter.cxx | 69 typename graph_traits<Graph>::out_edge_iterator oi, oiEnd; in TestTraversal() local
70 boost::tie(oi, oiEnd) = out_edges(*vi, g); in TestTraversal()
89 typename graph_traits<Graph>::out_edge_iterator oi, oiEnd; in TestTraversal() local
90 for (boost::tie(oi, oiEnd) = out_edges(*vi, g); oi != oiEnd; ++oi) in TestTraversal()
109 typename graph_traits<Graph>::out_edge_iterator oi, oiEnd; in TestTraversal() local
110 for (boost::tie(oi, oiEnd) = out_edges(*vi, g); oi != oiEnd; ++oi) in TestTraversal()
131 typename graph_traits<Graph>::out_edge_iterator oi, oiEnd; in TestTraversal() local
132 for (boost::tie(oi, oiEnd) = out_edges(*vi, g); oi != oiEnd; ++oi) in TestTraversal()
154 typename graph_traits<Graph>::out_edge_iterator oi, oiEnd; in TestTraversal() local
155 for (boost::tie(oi, oiEnd) = out_edges(*vi, g); oi != oiEnd; ++oi) in TestTraversal()
|
| /dports/math/vtk9/VTK-9.1.0/Infovis/BoostGraphAlgorithms/Testing/Cxx/ |
| H A D | TestBoostAdapter.cxx | 68 typename graph_traits<Graph>::out_edge_iterator oi, oiEnd; in TestTraversal() local
69 boost::tie(oi, oiEnd) = out_edges(*vi, g); in TestTraversal()
88 typename graph_traits<Graph>::out_edge_iterator oi, oiEnd; in TestTraversal() local
89 for (boost::tie(oi, oiEnd) = out_edges(*vi, g); oi != oiEnd; ++oi) in TestTraversal()
108 typename graph_traits<Graph>::out_edge_iterator oi, oiEnd; in TestTraversal() local
109 for (boost::tie(oi, oiEnd) = out_edges(*vi, g); oi != oiEnd; ++oi) in TestTraversal()
130 typename graph_traits<Graph>::out_edge_iterator oi, oiEnd; in TestTraversal() local
131 for (boost::tie(oi, oiEnd) = out_edges(*vi, g); oi != oiEnd; ++oi) in TestTraversal()
153 typename graph_traits<Graph>::out_edge_iterator oi, oiEnd; in TestTraversal() local
154 for (boost::tie(oi, oiEnd) = out_edges(*vi, g); oi != oiEnd; ++oi) in TestTraversal()
|
| /dports/math/vtk6/VTK-6.2.0/Infovis/BoostGraphAlgorithms/Testing/Cxx/ |
| H A D | TestBoostAdapter.cxx | 70 typename graph_traits<Graph>::out_edge_iterator oi, oiEnd; in TestTraversal() local
71 boost::tie(oi, oiEnd) = out_edges(*vi, g); in TestTraversal()
90 typename graph_traits<Graph>::out_edge_iterator oi, oiEnd; in TestTraversal() local
91 for (boost::tie(oi, oiEnd) = out_edges(*vi, g); oi != oiEnd; ++oi) in TestTraversal()
110 typename graph_traits<Graph>::out_edge_iterator oi, oiEnd; in TestTraversal() local
111 for (boost::tie(oi, oiEnd) = out_edges(*vi, g); oi != oiEnd; ++oi) in TestTraversal()
132 typename graph_traits<Graph>::out_edge_iterator oi, oiEnd; in TestTraversal() local
133 for (boost::tie(oi, oiEnd) = out_edges(*vi, g); oi != oiEnd; ++oi) in TestTraversal()
155 typename graph_traits<Graph>::out_edge_iterator oi, oiEnd; in TestTraversal() local
156 for (boost::tie(oi, oiEnd) = out_edges(*vi, g); oi != oiEnd; ++oi) in TestTraversal()
|
| /dports/math/vtk8/VTK-8.2.0/Common/DataModel/ |
| H A D | vtkGraph.cxx | 1478 std::vector<vtkOutEdgeType>::iterator oi, oiEnd; in RemoveVertexInternal() local
1479 oiEnd = this->Internals->Adjacency[v].OutEdges.end(); in RemoveVertexInternal()
1480 for (oi = this->Internals->Adjacency[v].OutEdges.begin(); oi != oiEnd; ++oi) in RemoveVertexInternal()
1500 oiEnd = this->Internals->Adjacency[v].OutEdges.end(); in RemoveVertexInternal()
1501 for (oi = this->Internals->Adjacency[v].OutEdges.begin(); oi != oiEnd; ++oi) in RemoveVertexInternal()
1547 oiEnd = this->Internals->Adjacency[ii->Source].OutEdges.end(); in RemoveVertexInternal()
1548 for (oi = this->Internals->Adjacency[ii->Source].OutEdges.begin(); oi != oiEnd; ++oi) in RemoveVertexInternal()
1668 std::vector<vtkOutEdgeType>::iterator oi, oiEnd; in RemoveVerticesInternal() local
1669 oiEnd = this->Internals->Adjacency[v].OutEdges.end(); in RemoveVerticesInternal()
1670 for (oi = this->Internals->Adjacency[v].OutEdges.begin(); oi != oiEnd; ++oi) in RemoveVerticesInternal()
|
| /dports/math/vtk9/VTK-9.1.0/Common/DataModel/ |
| H A D | vtkGraph.cxx | 1451 std::vector<vtkOutEdgeType>::iterator oi, oiEnd; in RemoveVertexInternal() local
1452 oiEnd = this->Internals->Adjacency[v].OutEdges.end(); in RemoveVertexInternal()
1453 for (oi = this->Internals->Adjacency[v].OutEdges.begin(); oi != oiEnd; ++oi) in RemoveVertexInternal()
1473 oiEnd = this->Internals->Adjacency[v].OutEdges.end(); in RemoveVertexInternal()
1474 for (oi = this->Internals->Adjacency[v].OutEdges.begin(); oi != oiEnd; ++oi) in RemoveVertexInternal()
1520 oiEnd = this->Internals->Adjacency[ii->Source].OutEdges.end(); in RemoveVertexInternal()
1521 for (oi = this->Internals->Adjacency[ii->Source].OutEdges.begin(); oi != oiEnd; ++oi) in RemoveVertexInternal()
1641 std::vector<vtkOutEdgeType>::iterator oi, oiEnd; in RemoveVerticesInternal() local
1642 oiEnd = this->Internals->Adjacency[v].OutEdges.end(); in RemoveVerticesInternal()
1643 for (oi = this->Internals->Adjacency[v].OutEdges.begin(); oi != oiEnd; ++oi) in RemoveVerticesInternal()
|
| /dports/math/vtk6/VTK-6.2.0/Common/DataModel/ |
| H A D | vtkGraph.cxx | 1463 vtksys_stl::vector<vtkOutEdgeType>::iterator oi, oiEnd; in RemoveVertexInternal() local
1464 oiEnd = this->Internals->Adjacency[v].OutEdges.end(); in RemoveVertexInternal()
1465 for (oi = this->Internals->Adjacency[v].OutEdges.begin(); oi != oiEnd; ++oi) in RemoveVertexInternal()
1485 oiEnd = this->Internals->Adjacency[v].OutEdges.end(); in RemoveVertexInternal()
1486 for (oi = this->Internals->Adjacency[v].OutEdges.begin(); oi != oiEnd; ++oi) in RemoveVertexInternal()
1532 oiEnd = this->Internals->Adjacency[ii->Source].OutEdges.end(); in RemoveVertexInternal()
1533 for (oi = this->Internals->Adjacency[ii->Source].OutEdges.begin(); oi != oiEnd; ++oi) in RemoveVertexInternal()
1653 vtksys_stl::vector<vtkOutEdgeType>::iterator oi, oiEnd; in RemoveVerticesInternal() local
1654 oiEnd = this->Internals->Adjacency[v].OutEdges.end(); in RemoveVerticesInternal()
1655 for (oi = this->Internals->Adjacency[v].OutEdges.begin(); oi != oiEnd; ++oi) in RemoveVerticesInternal()
|
| /dports/editors/libreoffice/libreoffice-7.2.6.2/sw/source/core/unocore/ |
| H A D | unochart.cxx | 690 sal_Int32 oiEnd = bDtaSrcIsColumns ? nCols : nRows; in Impl_createDataSource() local
692 std::vector<sal_Int32> aLabelIdx(oiEnd); in Impl_createDataSource()
693 std::vector<sal_Int32> aDataStartIdx(oiEnd); in Impl_createDataSource()
694 std::vector<sal_Int32> aDataLen(oiEnd); in Impl_createDataSource()
695 for (oi = 0; oi < oiEnd; ++oi) in Impl_createDataSource()
702 for (oi = 0; oi < oiEnd; ++oi) in Impl_createDataSource()
750 if (oiEnd > 0) in Impl_createDataSource()
755 for (oi = 0; oi < oiEnd; ++oi) in Impl_createDataSource()
791 for (oi = 0; oi < oiEnd; ++oi) in Impl_createDataSource()
|
| /dports/editors/libreoffice6/libreoffice-6.4.7.2/sw/source/core/unocore/ |
| H A D | unochart.cxx | 695 sal_Int32 oiEnd = bDtaSrcIsColumns ? nCols : nRows; in Impl_createDataSource() local
697 std::vector<sal_Int32> aLabelIdx(oiEnd); in Impl_createDataSource()
698 std::vector<sal_Int32> aDataStartIdx(oiEnd); in Impl_createDataSource()
699 std::vector<sal_Int32> aDataLen(oiEnd); in Impl_createDataSource()
700 for (oi = 0; oi < oiEnd; ++oi) in Impl_createDataSource()
707 for (oi = 0; oi < oiEnd; ++oi) in Impl_createDataSource()
755 if (oiEnd > 0) in Impl_createDataSource()
760 for (oi = 0; oi < oiEnd; ++oi) in Impl_createDataSource()
796 for (oi = 0; oi < oiEnd; ++oi) in Impl_createDataSource()
|
| /dports/www/kf5-khtml/khtml-5.89.0/src/ |
| H A D | khtml_part.cpp | 1640 const ConstFrameIt oiEnd = objects.constEnd(); in clear() local
1642 for (; oi != oiEnd; ++oi) { in clear()
2484 const ConstFrameIt oiEnd = m_objects.constEnd(); in isFullyLoaded() local
2486 for (; oi != oiEnd; ++oi) in isFullyLoaded()
5320 const FrameIt oiEnd = d->m_objects.end(); in frame() local
5321 for (; oi != oiEnd; ++oi) { in frame()
|