mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-04-10 18:51:21 +03:00
e3a6386d18
NCollection classes amended to be compatible with TCollection equivalents: - List and Maps: copy constructor is used for placement of new items in collection instead of assignment operator, thus default constructor is not necessary any more for the item class - Constructors with additional argument of element type added in array classes operated by Handle, defined by NCollection_DefineHArray*.hxx, allowing to initialize array immediately by specified value - Non-const methods First() and Last() are added in List class, and method Value() in TListIterator class - Method Append() accepting Handle(HSequence) provided in NCollection_DefineHSequence.hxx - Default implementation of global function IsEqual() is provided as template (using operator ==) Code using lists and maps of sequences is refactored to operate sequence by Handle (since Sequence does not to have public copy constructor). In addition, error checking code is simplified to use macros _Raise_if instead of custom #ifdefs with the same meaning. Comments within declaration of instances of generic classes in CDL removed. Fixed bug in copy constructor of NCollection_BaseVector leading to corrupt data if original vector is empty; simplistic test command for vectors is added.
118 lines
4.3 KiB
C++
118 lines
4.3 KiB
C++
// Created on: 2004-05-10
|
|
// Created by: Michael SAZONOV
|
|
// Copyright (c) 2004-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.
|
|
|
|
#ifndef MeshTest_CheckTopology_HeaderFile
|
|
#define MeshTest_CheckTopology_HeaderFile
|
|
|
|
#include <TopoDS_Shape.hxx>
|
|
#include <NCollection_IndexedDataMap.hxx>
|
|
#include <TColStd_HSequenceOfInteger.hxx>
|
|
#include <TColStd_SequenceOfReal.hxx>
|
|
#include <Draw_Interpretor.hxx>
|
|
|
|
//! This class checks topology of the mesh presented by
|
|
//! triangulations of faces.
|
|
//!
|
|
//! The following error are reported:
|
|
//! - free links. A link is considered free if it has only one
|
|
//! neighboring triangle and at least one of its nodes belongs to
|
|
//! interior of the face rather than to its boundary.
|
|
//! - cross face errors. It is a situation when a point on a common
|
|
//! boundary between two faces has different 3d coordinates on each
|
|
//! triangulation. The error is reported if the distance is greater
|
|
//! than a deflection written in triangulations.
|
|
//! - asynchronous edges. It is an edge having polygons on two neighboring
|
|
//! triangulations with different number of points in the polygons.
|
|
//! - free nodes -- nodes not shared by any triangle.
|
|
|
|
class MeshTest_CheckTopology
|
|
{
|
|
public:
|
|
//! constructor
|
|
MeshTest_CheckTopology(const TopoDS_Shape& theShape)
|
|
: myShape(theShape) {}
|
|
|
|
//! performs checking
|
|
Standard_EXPORT void Perform(Draw_Interpretor& di);
|
|
|
|
//! returns the number of faces with free links
|
|
Standard_Integer NbFacesWithFL() const
|
|
{ return myMapFaceLinks.Extent(); }
|
|
|
|
//! returns the number (in the shape) of a face with free links
|
|
//! with the given index
|
|
Standard_Integer GetFaceNumWithFL(const Standard_Integer theIndex) const
|
|
{ return myMapFaceLinks.FindKey(theIndex); }
|
|
|
|
//! returns the number free links on a face with the given index
|
|
Standard_Integer NbFreeLinks(const Standard_Integer theIndex) const
|
|
{ return myMapFaceLinks(theIndex)->Length() / 2; }
|
|
|
|
//! gets the numbers of nodes of a free link with the given index
|
|
//! in the face with the given index
|
|
Standard_EXPORT void GetFreeLink(const Standard_Integer theFaceIndex,
|
|
const Standard_Integer theLinkIndex,
|
|
Standard_Integer& theNode1,
|
|
Standard_Integer& theNode2) const;
|
|
|
|
//! returns the number of cross face errors
|
|
Standard_Integer NbCrossFaceErrors() const
|
|
{ return myErrorsVal.Length(); }
|
|
|
|
//! gets the attributes of a cross face error with the given index
|
|
Standard_EXPORT void GetCrossFaceError(const Standard_Integer theIndex,
|
|
Standard_Integer& theFace1,
|
|
Standard_Integer& theNode1,
|
|
Standard_Integer& theFace2,
|
|
Standard_Integer& theNode2,
|
|
Standard_Real& theValue) const;
|
|
|
|
//! returns the number of async edges
|
|
Standard_Integer NbAsyncEdges() const
|
|
{ return myAsyncEdges.Length(); }
|
|
|
|
//! returns the number (in the shape) of an async edge with the given index
|
|
Standard_Integer GetAsyncEdgeNum(const Standard_Integer theIndex) const
|
|
{ return myAsyncEdges(theIndex); }
|
|
|
|
//! returns the number of free nodes
|
|
Standard_Integer NbFreeNodes() const
|
|
{ return myFreeNodeFaces.Length(); }
|
|
|
|
//! returns the number of face containing the Index-th detected free node,
|
|
//! and number of this node in the triangulation of that face
|
|
void GetFreeNodeNum (const Standard_Integer theIndex,
|
|
Standard_Integer& theFaceNum,
|
|
Standard_Integer& theNodeNum) const
|
|
{
|
|
theFaceNum = myFreeNodeFaces(theIndex);
|
|
theNodeNum = myFreeNodeNums(theIndex);
|
|
}
|
|
|
|
private:
|
|
TopoDS_Shape myShape;
|
|
NCollection_IndexedDataMap<Standard_Integer,Handle(TColStd_HSequenceOfInteger)>
|
|
myMapFaceLinks;
|
|
|
|
TColStd_SequenceOfInteger myErrors;
|
|
TColStd_SequenceOfReal myErrorsVal;
|
|
|
|
TColStd_SequenceOfInteger myAsyncEdges;
|
|
TColStd_SequenceOfInteger myFreeNodeFaces;
|
|
TColStd_SequenceOfInteger myFreeNodeNums;
|
|
};
|
|
|
|
#endif
|