1
0
mirror of https://git.dev.opencascade.org/repos/occt.git synced 2025-05-21 10:55:33 +03:00
occt/src/TopOpeBRepBuild/TopOpeBRepBuild_BuildEdges.cxx
dpasukhi 1103eb60af 0033370: Foundation Classes - Moving into STL and Boost functionality
NCollection containers update:
  - NCollection_Array1 - updated functionality
  - NCollection_Array2 - NCollection_Array1 as a wrapper for 2array
  - NCollection_Vector -> NCollection_DynamicArray was renamed and reworked.
TCollection:
  - Use static empty string to avoid allocations on empty string
 NCollection allocators update:
  - NCollection_Allocator - allocator that used Standard::Allocate
  - NCollection_OccAllocator - allocator-wrapper that used OCC BaseAllocator objects
  - NCollection_IncAllocator - rework to increase performance
Standard:
  - Rework functionality to use different allocation libs
  - Implement basic of new way to wrap allocations tools
  - Define 4 ways to allocation (defines in configure stage)
 Additional changes:
  - Hash function uses std::hash functionality
   - size_t as a hash value
  - New HashUtils with Murmur and FVN hash algo for x32 and x64
  - Deprecated _0.cxx and .gxx DE classes reorganized
  - Create own utility for std memory
  - Update Standard_Transient to be more platform-independent
 Math TK changes:
  - math_Vector -> match_BaseVector<>
    - Buffer decreased to cash 32 elements instead of 512
2023-12-04 13:37:09 +00:00

167 lines
5.9 KiB
C++

// Created on: 1993-06-14
// Created by: Jean Yves LEBEY
// 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 <TColStd_HArray1OfInteger.hxx>
#include <TopoDS.hxx>
#include <TopoDS_Shape.hxx>
#include <TopOpeBRepBuild_define.hxx>
#include <TopOpeBRepBuild_EdgeBuilder.hxx>
#include <TopOpeBRepBuild_PaveSet.hxx>
#include <TopOpeBRepDS_BuildTool.hxx>
#include <TopOpeBRepDS_Curve.hxx>
#include <TopOpeBRepDS_CurveExplorer.hxx>
#include <TopOpeBRepDS_CurveIterator.hxx>
#include <TopOpeBRepDS_HDataStructure.hxx>
#include <TopOpeBRepDS_PointIterator.hxx>
#ifdef OCCT_DEBUG
extern Standard_Boolean TopOpeBRepBuild_GettraceCU();
#endif
//=======================================================================
//function : BuildEdges
//purpose :
//=======================================================================
void TopOpeBRepBuild_Builder::BuildEdges(const Standard_Integer iC,const Handle(TopOpeBRepDS_HDataStructure)& HDS)
{
#ifdef OCCT_DEBUG
if (TopOpeBRepBuild_GettraceCU()) std::cout<<"\nBuildEdges on C "<<iC<<std::endl;
#endif
const TopOpeBRepDS_Curve& C = HDS->Curve(iC);
const Handle(Geom_Curve)& C3D = C.Curve();
const Handle(TopOpeBRepDS_Interference)& I1 = C.GetSCI1();
const Handle(TopOpeBRepDS_Interference)& I2 = C.GetSCI2();
Standard_Boolean nnn = C3D.IsNull() && I1.IsNull() && I2.IsNull();
if (nnn) {
return;
}
TopoDS_Shape anEdge;
const TopOpeBRepDS_Curve& curC = HDS->Curve(iC);
myBuildTool.MakeEdge(anEdge,curC,HDS->DS());
TopOpeBRepBuild_PaveSet PVS(anEdge);
TopOpeBRepDS_PointIterator CPIT(HDS->CurvePoints(iC));
FillVertexSet(CPIT,TopAbs_IN,PVS);
TopOpeBRepBuild_PaveClassifier VCL(anEdge);
Standard_Boolean equalpar = PVS.HasEqualParameters();
if (equalpar) VCL.SetFirstParameter(PVS.EqualParameters());
Standard_Boolean closvert = PVS.ClosedVertices();
VCL.ClosedVertices(closvert);
PVS.InitLoop();
if ( !PVS.MoreLoop() ) {
return;
}
TopOpeBRepBuild_EdgeBuilder EDBU(PVS,VCL);
TopTools_ListOfShape& EL = ChangeNewEdges(iC);
MakeEdges(anEdge,EDBU,EL);
TopTools_ListIteratorOfListOfShape It(EL);
Standard_Integer inewC = -1;
for (; It.More(); It.Next()) {
TopoDS_Edge& newEdge = TopoDS::Edge(It.ChangeValue());
myBuildTool.RecomputeCurves(curC,TopoDS::Edge(anEdge),newEdge,inewC,HDS);
if (inewC != -1) ChangeNewEdges(inewC).Append(newEdge);
}
if (inewC != -1) {
HDS->RemoveCurve(iC);
}
else {
for (It.Initialize(EL);It.More();It.Next()) {
TopoDS_Edge& newEdge = TopoDS::Edge(It.ChangeValue());
myBuildTool.UpdateEdge(anEdge,newEdge);
}
}
}
//=======================================================================
//function : BuildEdges
//purpose :
//=======================================================================
void TopOpeBRepBuild_Builder::BuildEdges(const Handle(TopOpeBRepDS_HDataStructure)& HDS)
{
TopOpeBRepDS_DataStructure& BDS = HDS->ChangeDS();
myNewEdges.Clear();
TopOpeBRepDS_CurveExplorer cex;
Standard_Integer ick = 0;
for (cex.Init(BDS,Standard_False); cex.More(); cex.Next()) {
Standard_Integer ic = cex.Index();
Standard_Boolean ck = cex.IsCurveKeep(ic);
Standard_Integer im = cex.Curve(ic).Mother();
if (ck == 1 && im != 0 && ick == 0) { ick = ic; break; }
}
if (ick) {
for (cex.Init(BDS,Standard_True); cex.More(); cex.Next()) {
Standard_Integer ic = cex.Index();
BDS.RemoveCurve(ic);
}
BDS.ChangeNbCurves(ick-1);
}
for (cex.Init(BDS,Standard_False); cex.More(); cex.Next()) {
Standard_Integer ic = cex.Index();
Standard_Integer im = cex.Curve(ic).Mother();
if (im != 0 ) continue;
BuildEdges(ic,HDS);
}
Standard_Integer ip, np = HDS->NbPoints();
TColStd_HArray1OfInteger tp(0,np,0);
for (cex.Init(BDS); cex.More(); cex.Next()) {
#ifdef OCCT_DEBUG
// const TopOpeBRepDS_Curve& C = cex.Curve();
#endif
Standard_Integer ic = cex.Index();
TopOpeBRepDS_ListIteratorOfListOfInterference it(BDS.CurveInterferences(ic));
for(;it.More();it.Next()) {
const Handle(TopOpeBRepDS_Interference)& I = it.Value();
{
Standard_Integer ig = I->Geometry();
TopOpeBRepDS_Kind kg = I->GeometryType();
if (kg == TopOpeBRepDS_POINT && ig <= np) tp.ChangeValue(ig) = tp.Value(ig) + 1;
}
{
Standard_Integer is = I->Support();
TopOpeBRepDS_Kind ks = I->SupportType();
if (ks == TopOpeBRepDS_POINT) tp.ChangeValue(is) = tp.Value(is) + 1;
}
}
}
Standard_Integer is, ns = BDS.NbShapes();
for (is = 1; is <= ns; is++ ) {
const TopoDS_Shape& S = BDS.Shape(is);
if(S.IsNull()) continue;
Standard_Boolean test = (S.ShapeType() == TopAbs_EDGE);
if ( !test ) continue;
TopOpeBRepDS_ListIteratorOfListOfInterference it(BDS.ShapeInterferences(is));
for(;it.More();it.Next()) {
const Handle(TopOpeBRepDS_Interference)& I = it.Value();
{
Standard_Integer ig = I->Geometry();
TopOpeBRepDS_Kind kg = I->GeometryType();
if (kg == TopOpeBRepDS_POINT) tp.ChangeValue(ig) = tp.Value(ig) + 1;
}
{
Standard_Integer is1 = I->Support();
TopOpeBRepDS_Kind ks = I->SupportType();
if (ks == TopOpeBRepDS_POINT) tp.ChangeValue(is1) = tp.Value(is1) + 1;
}
}
}
for (ip = 1; ip <= np; ip++) if (tp.Value(ip) == 0) BDS.RemovePoint(ip);
}