/usr/include/oce/GraphDS_EdgesIterator.gxx is in liboce-foundation-dev 0.15-4.
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 | // Created on: 1993-03-16
// Created by: Denis PASCAL
// Copyright (c) 1993-1999 Matra Datavision
// Copyright (c) 1999-2014 OPEN CASCADE SAS
//
// This file is part of Open CASCADE Technology software library.
//
// This library is free software; you can redistribute it and / or modify it
// under the terms of the GNU Lesser General Public version 2.1 as published
// by the Free Software Foundation, with special exception defined in the file
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
// distribution for complete text of the license and disclaimer of any warranty.
//
// Alternatively, this file may be used under the terms of Open CASCADE
// commercial license or contractual agreement.
#include <Standard_NoMoreObject.hxx>
#include <Standard_NoSuchObject.hxx>
//=======================================================================
//function : GraphDS_EdgesIterator
//purpose :
//=======================================================================
GraphDS_EdgesIterator::GraphDS_EdgesIterator ()
{
}
//=======================================================================
//function : GraphDS_EdgesIterator
//purpose :
//=======================================================================
GraphDS_EdgesIterator::GraphDS_EdgesIterator
(const GraphDS_DirectedGraph& G)
{
Initialize (G);
}
//=======================================================================
//function : GraphDS_EdgesIterator
//purpose :
//=======================================================================
GraphDS_EdgesIterator::GraphDS_EdgesIterator
(const GraphDS_DirectedGraph& G,
const Handle(GraphDS_Vertex)& V)
{
Initialize (G,V);
}
//=======================================================================
//function : Initialize
//purpose :
//=======================================================================
void GraphDS_EdgesIterator::Initialize
(const GraphDS_DirectedGraph& G)
{
myEdges.Initialize(G.myEdges);
}
//=======================================================================
//function : Initialize
//purpose :
//=======================================================================
void GraphDS_EdgesIterator::Initialize
(const GraphDS_DirectedGraph&,
const Handle(GraphDS_Vertex)& V)
{
myEdges.Initialize(V->GetEdges());
}
//=======================================================================
//function : More
//purpose :
//=======================================================================
Standard_Boolean GraphDS_EdgesIterator::More () const
{
return myEdges.More();
}
//=======================================================================
//function : Next
//purpose :
//=======================================================================
void GraphDS_EdgesIterator::Next ()
{
myEdges.Next();
}
//=======================================================================
//function : Value
//purpose :
//=======================================================================
const Handle(GraphDS_Edge)& GraphDS_EdgesIterator::Value () const
{
return *((Handle(GraphDS_Edge)*)& myEdges.Key());
//return Handle(GraphDS_Edge)::DownCast(myEdges.Key());
}
|