mirror of
https://github.com/Open-Cascade-SAS/OCCT.git
synced 2026-07-17 20:24:12 +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.
107 lines
3.3 KiB
C++
107 lines
3.3 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_Cumulate.ixx>
|
|
#include <IFGraph_AllShared.hxx>
|
|
#include <Interface_InterfaceModel.hxx>
|
|
|
|
|
|
|
|
// Calcul de cumul
|
|
// Tres simple, on note les entites demandees, et a la fin
|
|
// on a le cumul lui-meme, et comme infos derivees, les doubles et les oublis
|
|
// Chaque recouvrement correspond a une augmentation de UN du status
|
|
// Les status demarrent a 2, ainsi a l ajout d une entite, on distingue bien
|
|
// entre les entites nouvelles, liees a cet appel (statut temporaire 1) et les
|
|
// autres (statut superieur ou egal a 2)
|
|
|
|
IFGraph_Cumulate::IFGraph_Cumulate (const Interface_Graph& agraph)
|
|
: thegraph (agraph) { }
|
|
|
|
void IFGraph_Cumulate::GetFromEntity
|
|
(const Handle(Standard_Transient)& ent)
|
|
{
|
|
IFGraph_AllShared iter(thegraph.Model(),ent);
|
|
GetFromIter (iter);
|
|
}
|
|
|
|
void IFGraph_Cumulate::ResetData ()
|
|
{ Reset(); thegraph.Reset(); }
|
|
|
|
void IFGraph_Cumulate::GetFromIter (const Interface_EntityIterator& iter)
|
|
{
|
|
thegraph.GetFromIter(iter,1,1,Standard_True);
|
|
thegraph.ChangeStatus (1,2); // une fois le calcul fait
|
|
}
|
|
|
|
void IFGraph_Cumulate::Evaluate ()
|
|
{
|
|
Reset(); GetFromGraph(thegraph); // evaluation deja faite dans le graphe
|
|
}
|
|
|
|
Interface_EntityIterator IFGraph_Cumulate::Overlapped () const
|
|
{
|
|
Interface_EntityIterator iter;
|
|
Standard_Integer nb = thegraph.Size();
|
|
for (Standard_Integer i = 1; i <= nb; i ++) {
|
|
if (thegraph.IsPresent(i) && thegraph.Status(i) > 2)
|
|
iter.GetOneItem(thegraph.Entity(i));
|
|
}
|
|
return iter;
|
|
}
|
|
|
|
Interface_EntityIterator IFGraph_Cumulate::Forgotten () const
|
|
{
|
|
Interface_EntityIterator iter;
|
|
Standard_Integer nb = thegraph.Size();
|
|
for (Standard_Integer i = 1; i <= nb; i ++) {
|
|
if (!thegraph.IsPresent(i))
|
|
iter.GetOneItem(thegraph.Model()->Value(i));
|
|
}
|
|
return iter;
|
|
}
|
|
|
|
Interface_EntityIterator IFGraph_Cumulate::PerCount
|
|
(const Standard_Integer count) const
|
|
{
|
|
Interface_EntityIterator iter;
|
|
Standard_Integer nb = thegraph.Size();
|
|
for (Standard_Integer i = 1; i <= nb; i ++) {
|
|
if (thegraph.IsPresent(i) && thegraph.Status(i) == (count + 1))
|
|
iter.GetOneItem(thegraph.Model()->Value(i));
|
|
}
|
|
return iter;
|
|
}
|
|
|
|
|
|
Standard_Integer IFGraph_Cumulate::NbTimes
|
|
(const Handle(Standard_Transient)& ent) const
|
|
{
|
|
Standard_Integer num = thegraph.EntityNumber(ent);
|
|
if (num == 0) return 0;
|
|
Standard_Integer stat = thegraph.Status(num);
|
|
return stat-1;
|
|
}
|
|
|
|
Standard_Integer IFGraph_Cumulate::HighestNbTimes () const
|
|
{
|
|
Standard_Integer max = 0;
|
|
Standard_Integer nb = thegraph.Size();
|
|
for (Standard_Integer i = 1; i <= nb; i ++) {
|
|
if (!thegraph.IsPresent(i)) continue;
|
|
Standard_Integer count = thegraph.Status(i) - 1;
|
|
if (count > max) max = count;
|
|
}
|
|
return max;
|
|
}
|