mirror of
https://github.com/Open-Cascade-SAS/OCCT.git
synced 2026-06-10 08:08:36 +08:00
d5f74e42d6
License statement text corrected; compiler warnings caused by Bison 2.41 disabled for MSVC; a few other compiler warnings on 54-bit Windows eliminated by appropriate type cast Wrong license statements corrected in several files. Copyright and license statements added in XSD and GLSL files. Copyright year updated in some files. Obsolete documentation files removed from DrawResources.
157 lines
4.3 KiB
Plaintext
157 lines
4.3 KiB
Plaintext
// 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 License 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_NoSuchObject.hxx>
|
|
#include <Standard_NoMoreObject.hxx>
|
|
#include <Standard_DomainError.hxx>
|
|
#include <Standard_NotImplemented.hxx>
|
|
|
|
|
|
//=======================================================================
|
|
//function : GraphDS_Vertex
|
|
//purpose :
|
|
//=======================================================================
|
|
|
|
GraphDS_Vertex::GraphDS_Vertex (const GraphDS_Item& value) : myItem(value)
|
|
{
|
|
}
|
|
|
|
|
|
//=======================================================================
|
|
//function : GetItem
|
|
//purpose :
|
|
//=======================================================================
|
|
|
|
const GraphDS_Item& GraphDS_Vertex::GetItem () const
|
|
{
|
|
return myItem;
|
|
}
|
|
|
|
|
|
//=======================================================================
|
|
//function : SetItem
|
|
//purpose :
|
|
//=======================================================================
|
|
|
|
void GraphDS_Vertex::SetItem (const GraphDS_Item& Value)
|
|
{
|
|
myItem = Value;
|
|
}
|
|
|
|
//=======================================================================
|
|
//function : Contains
|
|
//purpose :
|
|
//=======================================================================
|
|
|
|
Standard_Boolean GraphDS_Vertex::Contains (const Handle(GraphDS_Edge)& E) const
|
|
{
|
|
return myEdges.Contains(E);
|
|
}
|
|
|
|
|
|
Standard_Boolean GraphDS_Vertex::IsFront (const Handle(GraphDS_Edge)& ) const
|
|
{
|
|
Standard_NotImplemented::Raise();
|
|
return Standard_False;
|
|
}
|
|
|
|
|
|
Standard_Boolean GraphDS_Vertex::IsBack (const Handle(GraphDS_Edge)& ) const
|
|
{
|
|
Standard_NotImplemented::Raise();
|
|
return Standard_False;
|
|
}
|
|
|
|
|
|
|
|
//=======================================================================
|
|
//function : IsRoot
|
|
//purpose : never destination of an edge
|
|
//=======================================================================
|
|
|
|
Standard_Boolean GraphDS_Vertex::IsRoot (const Standard_Boolean ignoreselfloop) const
|
|
{
|
|
Handle(GraphDS_Vertex) me = this;
|
|
Handle(GraphDS_Edge) E;
|
|
TColStd_MapIteratorOfMapOfTransient it;
|
|
for (it.Initialize(myEdges); it.More(); it.Next()) {
|
|
E = Handle(GraphDS_Edge)::DownCast(it.Key());
|
|
if (ignoreselfloop && E->IsLoop()) continue;
|
|
if (E->Destination() == me) return Standard_False;
|
|
}
|
|
return Standard_True;
|
|
}
|
|
|
|
|
|
//=======================================================================
|
|
//function : IsLeaf
|
|
//purpose : never source of an edge
|
|
//=======================================================================
|
|
|
|
Standard_Boolean GraphDS_Vertex::IsLeaf (const Standard_Boolean ignoreselfloop) const
|
|
{
|
|
Handle(GraphDS_Vertex) me = this;
|
|
Handle(GraphDS_Edge) E;
|
|
TColStd_MapIteratorOfMapOfTransient it;
|
|
for (it.Initialize(myEdges); it.More(); it.Next()) {
|
|
E = Handle(GraphDS_Edge)::DownCast(it.Key());
|
|
if (ignoreselfloop && E->IsLoop()) continue;
|
|
if (E->Source() == me) return Standard_False;
|
|
}
|
|
return Standard_True;
|
|
}
|
|
|
|
//=======================================================================
|
|
//function : AddEdge
|
|
//purpose : private
|
|
//=======================================================================
|
|
|
|
Standard_Boolean GraphDS_Vertex::AddEdge (const Handle(GraphDS_Edge)& E)
|
|
{
|
|
return myEdges.Add(E);
|
|
}
|
|
|
|
|
|
//=======================================================================
|
|
//function : RemoveEdge
|
|
//purpose : private
|
|
//=======================================================================
|
|
|
|
void GraphDS_Vertex::RemoveEdge (const Handle(GraphDS_Edge)& E)
|
|
{
|
|
myEdges.Remove(E);
|
|
}
|
|
|
|
|
|
|
|
//=======================================================================
|
|
//function : GetEdges
|
|
//purpose : private
|
|
//=======================================================================
|
|
|
|
const TColStd_MapOfTransient& GraphDS_Vertex::GetEdges () const
|
|
{
|
|
return myEdges;
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|