mirror of
https://github.com/Open-Cascade-SAS/OCCT.git
synced 2026-05-15 13:39:57 +08:00
104 lines
3.5 KiB
C++
104 lines
3.5 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 <IFSelect_SelectExplore.hxx>
|
|
#include <Interface_EntityIterator.hxx>
|
|
#include <Interface_Graph.hxx>
|
|
#include <Standard_Transient.hxx>
|
|
#include <Standard_Type.hxx>
|
|
#include <TCollection_AsciiString.hxx>
|
|
#include <TColStd_IndexedMapOfTransient.hxx>
|
|
|
|
#include <stdio.h>
|
|
IMPLEMENT_STANDARD_RTTIEXT(IFSelect_SelectExplore,IFSelect_SelectDeduct)
|
|
|
|
IFSelect_SelectExplore::IFSelect_SelectExplore (const Standard_Integer level)
|
|
: thelevel (level) { }
|
|
|
|
|
|
Standard_Integer IFSelect_SelectExplore::Level () const
|
|
{ return thelevel; }
|
|
|
|
|
|
Interface_EntityIterator IFSelect_SelectExplore::RootResult
|
|
(const Interface_Graph& G) const
|
|
{
|
|
// Attention, voila comme on procede
|
|
// On a une IndexedMapOfTransient en entree (entites deja traitees/a traiter)
|
|
// Elle est initialisee par InputResult
|
|
// Et une map en sortie (resultats pris) -> le resultat sera unique
|
|
// En entree, un curseur d entite courante
|
|
// Pour chaque entite, on appelle Explore. 3 cas possibles :
|
|
// retour False, on passe
|
|
// retour True et liste vide, on prend cette entite sans aller plus loin
|
|
// retour True et liste non vide, on ne prend pas cette entite mais on
|
|
// considere son resultat.
|
|
// Si dernier niveau, on le prend en entier. Sinon, il alimente l entree
|
|
|
|
Standard_Integer nb = G.Size();
|
|
TColStd_IndexedMapOfTransient entrees (nb);
|
|
TColStd_IndexedMapOfTransient result (nb);
|
|
// Initialisation
|
|
Standard_Integer i, j, level = 1, ilev = 0;
|
|
Interface_EntityIterator input; input = InputResult(G);
|
|
for (input.Start(); input.More(); input.Next())
|
|
i = entrees.Add (input.Value());
|
|
ilev = entrees.Extent();
|
|
|
|
// Exploration
|
|
for (i = 1; i <= nb; i ++) {
|
|
if (i > entrees.Extent()) break;
|
|
if (i > ilev) {
|
|
level ++;
|
|
if (level > thelevel && thelevel > 0) break;
|
|
ilev = entrees.Extent();
|
|
}
|
|
Handle(Standard_Transient) ent = entrees.FindKey(i);
|
|
if (ent.IsNull()) continue;
|
|
Interface_EntityIterator exp;
|
|
if (!Explore (level,ent,G,exp)) continue;
|
|
|
|
// On prend en compte : entite a prendre directement ?
|
|
// reprendre liste en entree (niveau pas atteint) ou resultat (niveau atteint)
|
|
if (exp.NbEntities() == 0) {
|
|
j = result.Add (ent);
|
|
continue;
|
|
} else if (level == thelevel) {
|
|
for (exp.Start(); exp.More(); exp.Next()) j = result.Add (exp.Value());
|
|
} else {
|
|
for (exp.Start(); exp.More(); exp.Next()) j = entrees.Add (exp.Value());
|
|
}
|
|
}
|
|
|
|
// On recolte le resultat
|
|
Interface_EntityIterator res;
|
|
nb = result.Extent();
|
|
for (j = 1; j <= nb; j ++) res.AddItem (result.FindKey(j));
|
|
return res;
|
|
}
|
|
|
|
|
|
TCollection_AsciiString IFSelect_SelectExplore::Label () const
|
|
{
|
|
TCollection_AsciiString labl;
|
|
if (thelevel == 0) labl.AssignCat("(Recursive)");
|
|
else if (thelevel > 0) {
|
|
char lab[30];
|
|
sprintf (lab,"(Level %d)",thelevel);
|
|
labl.AssignCat(lab);
|
|
}
|
|
labl.AssignCat(ExploreLabel());
|
|
return labl;
|
|
}
|