mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-04-05 18:16:23 +03:00
42cf5bc1ca
Automatic upgrade of OCCT code by command "occt_upgrade . -nocdl": - WOK-generated header files from inc and sources from drv are moved to src - CDL files removed - All packages are converted to nocdlpack
79 lines
2.4 KiB
C++
79 lines
2.4 KiB
C++
// 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 <IFGraph_AllShared.hxx>
|
|
#include <IFGraph_Compare.hxx>
|
|
#include <Interface_EntityIterator.hxx>
|
|
#include <Interface_Graph.hxx>
|
|
#include <Standard_Transient.hxx>
|
|
|
|
// Comparateur de deux sous-ensembles d un Modele
|
|
// Au premier sous-ensemble, est attribue le Status 1
|
|
// Au deuxieme sous-ensemble, est attribue le Status 2
|
|
// La partie commune se voit attribuer le Status 3
|
|
IFGraph_Compare::IFGraph_Compare (const Interface_Graph& agraph)
|
|
: thegraph (agraph) { }
|
|
|
|
void IFGraph_Compare::GetFromEntity
|
|
(const Handle(Standard_Transient)& ent, const Standard_Boolean first)
|
|
{
|
|
IFGraph_AllShared iter(thegraph.Model(),ent);
|
|
GetFromIter(iter,first);
|
|
}
|
|
|
|
void IFGraph_Compare::GetFromIter
|
|
(const Interface_EntityIterator& iter, const Standard_Boolean first)
|
|
{
|
|
Standard_Integer stat = 2;
|
|
if (first) stat = 1;
|
|
thegraph.GetFromIter(iter,stat,3,Standard_False);
|
|
}
|
|
|
|
|
|
void IFGraph_Compare::Merge ()
|
|
{
|
|
thegraph.ChangeStatus (2,1);
|
|
thegraph.ChangeStatus (3,1);
|
|
}
|
|
|
|
void IFGraph_Compare::RemoveSecond ()
|
|
{
|
|
thegraph.ChangeStatus (3,1);
|
|
thegraph.RemoveStatus (2);
|
|
}
|
|
|
|
void IFGraph_Compare::KeepCommon ()
|
|
{
|
|
thegraph.RemoveStatus (1);
|
|
thegraph.RemoveStatus (2);
|
|
thegraph.ChangeStatus (3,1);
|
|
}
|
|
|
|
void IFGraph_Compare::ResetData ()
|
|
{ Reset(); thegraph.Reset(); }
|
|
|
|
void IFGraph_Compare::Evaluate ()
|
|
{
|
|
Reset(); GetFromGraph(thegraph); // Evaluation deja faite par le graphe
|
|
}
|
|
|
|
Interface_EntityIterator IFGraph_Compare::Common () const
|
|
{ return Interface_GraphContent(thegraph,3); }
|
|
|
|
Interface_EntityIterator IFGraph_Compare::FirstOnly () const
|
|
{ return Interface_GraphContent(thegraph,1); }
|
|
|
|
Interface_EntityIterator IFGraph_Compare::SecondOnly () const
|
|
{ return Interface_GraphContent(thegraph,2); }
|