mirror of
https://github.com/Open-Cascade-SAS/OCCT.git
synced 2026-06-09 23:46:52 +08:00
a5a7b3185b
Update empty method guards to new style with regex (see PR). Used clang-format 18.1.8. New actions to validate code formatting is added. Update .clang-format with disabling of include sorting. It is temporary changes, then include will be sorted. Apply formatting for /src and /tools folder. The files with .hxx,.cxx,.lxx,.h,.pxx,.hpp,*.cpp extensions.
151 lines
4.0 KiB
C++
151 lines
4.0 KiB
C++
// Created on: 1993-05-06
|
|
// Created by: Yves FRICAUD
|
|
// 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 <MAT_Node.hxx>
|
|
#include <Precision.hxx>
|
|
#include <Standard_Type.hxx>
|
|
|
|
IMPLEMENT_STANDARD_RTTIEXT(MAT_Node, Standard_Transient)
|
|
|
|
//=================================================================================================
|
|
|
|
MAT_Node::MAT_Node(const Standard_Integer GeomIndex,
|
|
const Handle(MAT_Arc)& LinkedArc,
|
|
const Standard_Real Distance)
|
|
: nodeIndex(0),
|
|
geomIndex(GeomIndex),
|
|
distance(Distance)
|
|
{
|
|
aLinkedArc = LinkedArc.get();
|
|
}
|
|
|
|
//=================================================================================================
|
|
|
|
Standard_Integer MAT_Node::GeomIndex() const
|
|
{
|
|
return geomIndex;
|
|
}
|
|
|
|
//=================================================================================================
|
|
|
|
Standard_Integer MAT_Node::Index() const
|
|
{
|
|
return nodeIndex;
|
|
}
|
|
|
|
//=================================================================================================
|
|
|
|
void MAT_Node::LinkedArcs(MAT_SequenceOfArc& S) const
|
|
{
|
|
S.Clear();
|
|
Handle(MAT_Node) Me = this;
|
|
Handle(MAT_Arc) LA((MAT_Arc*)aLinkedArc);
|
|
|
|
S.Append(LA);
|
|
|
|
if (LA->HasNeighbour(Me, MAT_Left))
|
|
{
|
|
Handle(MAT_Arc) CA = LA->Neighbour(Me, MAT_Left);
|
|
while (CA != LA)
|
|
{
|
|
S.Append(CA);
|
|
CA = CA->Neighbour(Me, MAT_Left);
|
|
}
|
|
}
|
|
}
|
|
|
|
//=================================================================================================
|
|
|
|
void MAT_Node::NearElts(MAT_SequenceOfBasicElt& S) const
|
|
{
|
|
S.Clear();
|
|
|
|
Handle(MAT_Node) Me = this;
|
|
Handle(MAT_Arc) LA((MAT_Arc*)aLinkedArc);
|
|
|
|
S.Append(LA->FirstElement());
|
|
S.Append(LA->SecondElement());
|
|
|
|
if (LA->HasNeighbour(Me, MAT_Left))
|
|
{
|
|
|
|
Handle(MAT_Arc) CA = LA->Neighbour(Me, MAT_Left);
|
|
Standard_Boolean Pair = Standard_False;
|
|
|
|
//---------------------------------------------------------
|
|
// Recuperation des deux elements separes pour un arc sur
|
|
// deux.
|
|
//---------------------------------------------------------
|
|
|
|
while (CA != LA)
|
|
{
|
|
if (Pair)
|
|
{
|
|
S.Append(CA->FirstElement());
|
|
S.Append(CA->SecondElement());
|
|
}
|
|
else
|
|
{
|
|
Pair = Standard_True;
|
|
}
|
|
CA = CA->Neighbour(Me, MAT_Left);
|
|
}
|
|
}
|
|
}
|
|
|
|
//=================================================================================================
|
|
|
|
Standard_Real MAT_Node::Distance() const
|
|
{
|
|
return distance;
|
|
}
|
|
|
|
//=================================================================================================
|
|
|
|
Standard_Boolean MAT_Node::PendingNode() const
|
|
{
|
|
Handle(MAT_Node) Me = this;
|
|
return (!((MAT_Arc*)aLinkedArc)->HasNeighbour(Me, MAT_Left));
|
|
}
|
|
|
|
//=================================================================================================
|
|
|
|
Standard_Boolean MAT_Node::OnBasicElt() const
|
|
{
|
|
return (Distance() == 0.0);
|
|
}
|
|
|
|
//=================================================================================================
|
|
|
|
Standard_Boolean MAT_Node::Infinite() const
|
|
{
|
|
return (Distance() == Precision::Infinite());
|
|
}
|
|
|
|
//=================================================================================================
|
|
|
|
void MAT_Node::SetLinkedArc(const Handle(MAT_Arc)& LinkedArc)
|
|
{
|
|
aLinkedArc = LinkedArc.get();
|
|
}
|
|
|
|
//=================================================================================================
|
|
|
|
void MAT_Node::SetIndex(const Standard_Integer anIndex)
|
|
{
|
|
nodeIndex = anIndex;
|
|
}
|