This file is indexed.

/usr/include/opencascade/GraphTools_ConnectedVerticesIterator.gxx is in libopencascade-foundation-dev 6.5.0.dfsg-2build1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
// Copyright: 	Matra-Datavision 1991
// File:	GraphTools_ConnectedVerticesIterator.gxx
// Created:	Wed May 29 17:42:50 1991
// Author:	Denis PASCAL
//		<dp>


//=======================================================================
//function : GraphTools_ConnectedVerticesIterator
//purpose  : 
//=======================================================================

GraphTools_ConnectedVerticesIterator::GraphTools_ConnectedVerticesIterator () 
{}


//=======================================================================
//function : GraphTools_TopologicalSortIterator
//purpose  : 
//=======================================================================

GraphTools_ConnectedVerticesIterator::GraphTools_ConnectedVerticesIterator
  (const Graph& G)
{
  FromGraph (G);
}

//=======================================================================
//function : FromVertex
//purpose  : 
//=======================================================================

void GraphTools_ConnectedVerticesIterator::FromVertex
  (const Vertex& V)
{
  myIterator.FromVertex(V);
}


//=======================================================================
//function : GraphTools_ConnectedVerticesIterator
//purpose  : 
//=======================================================================
void GraphTools_ConnectedVerticesIterator::FromGraph  (const Graph& G)  
{
  for ( GIterator it (G); it.More(); it.Next() ) {
    myIterator.FromVertex(it.Value());
  }
}


//=======================================================================
//function : Perform
//purpose  : 
//=======================================================================

void GraphTools_ConnectedVerticesIterator::Perform
  (const Graph& G)
{
  myIterator.Perform(G);
}


//=======================================================================
//function : Reset
//purpose  : 
//=======================================================================

void GraphTools_ConnectedVerticesIterator::Reset ()
{
  myIterator.Reset();
}

//=======================================================================
//function : More
//purpose  : 
//=======================================================================
Standard_Boolean GraphTools_ConnectedVerticesIterator::More () const 
{
  return myIterator.More();
}

//=======================================================================
//function : Next
//purpose  : 
//=======================================================================
void GraphTools_ConnectedVerticesIterator::Next () 
{
  myIterator.Next();
}


//=======================================================================
//function : NbVertices
//purpose  : 
//=======================================================================

Standard_Integer GraphTools_ConnectedVerticesIterator::NbVertices() const
{  
  return myIterator.NbVertices();
}


//=======================================================================
//function : Value
//purpose  : 
//=======================================================================
const Vertex& GraphTools_ConnectedVerticesIterator::Value 
  (const Standard_Integer I) const 
{
  return myIterator.Value(I);
}