Loading files
f2929057eThis file is pinned to the selected release. Download the original to open it in your design tool.
// 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_SCRoots.hxx>
#include <IFGraph_SubPartsIterator.hxx>
#include <IFSelect_DispPerCount.hxx>
#include <IFSelect_IntParam.hxx>
#include <IFSelect_Selection.hxx>
#include <Interface_EntityIterator.hxx>
#include <Interface_Graph.hxx>
#include <Interface_InterfaceModel.hxx>
#include <Standard_Type.hxx>
#include <TCollection_AsciiString.hxx>
IMPLEMENT_STANDARD_RTTIEXT(IFSelect_DispPerCount, IFSelect_Dispatch)
IFSelect_DispPerCount::IFSelect_DispPerCount() = default;
occ::handle<IFSelect_IntParam> IFSelect_DispPerCount::Count() const
{
return thecount;
}
void IFSelect_DispPerCount::SetCount(const occ::handle<IFSelect_IntParam>& pcount)
{
thecount = pcount;
}
int IFSelect_DispPerCount::CountValue() const
{
int pcount = 0;
if (!thecount.IsNull())
{
pcount = thecount->Value();
}
if (pcount <= 0)
{
pcount = 1; // option prise par defaut
}
return pcount;
}
TCollection_AsciiString IFSelect_DispPerCount::Label() const
{
TCollection_AsciiString lab(CountValue());
lab.Insert(1, "One File per ");
lab.AssignCat(" Entities");
return lab;
}
bool IFSelect_DispPerCount::LimitedMax(const int nbent, int& pcount) const
{
pcount = 1 + nbent / CountValue();
return true;
}
void IFSelect_DispPerCount::Packets(const Interface_Graph& G, IFGraph_SubPartsIterator& packs) const
{
// Ressemble a DispPerOne, mais fait un AddPart tous les "count" racines
int pcount = CountValue();
IFGraph_SCRoots roots(G, false);
roots.SetLoad();
roots.GetFromIter(FinalSelection()->UniqueResult(G));
// SCRoots initiated the resolution: splitting into StrongComponents + selection
// of roots. A packet then corresponds to <count> roots
// Therefore, we must iterate on the Parts of roots and take them by <count>
int i = 0;
for (roots.Start(); roots.More(); roots.Next())
{
if (i == 0)
{
packs.AddPart();
}
i++;
if (i >= pcount)
{
i = 0; // regroupement selon "count"
}
packs.GetFromIter(roots.Entities());
}
}