mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-05-11 10:44:53 +03:00
1103eb60af
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
136 lines
3.6 KiB
C++
136 lines
3.6 KiB
C++
// Created on: 1999-04-08
|
|
// Created by: Fabrice SERVANT
|
|
// Copyright (c) 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.
|
|
|
|
#ifndef _IntPolyh_Couple_HeaderFile
|
|
#define _IntPolyh_Couple_HeaderFile
|
|
|
|
#include <Standard.hxx>
|
|
#include <Standard_DefineAlloc.hxx>
|
|
#include <Standard_Handle.hxx>
|
|
|
|
#include <Standard_Integer.hxx>
|
|
#include <Standard_Real.hxx>
|
|
#include <Standard_HashUtils.hxx>
|
|
|
|
//! The class represents the couple of indices with additional
|
|
//! characteristics such as analyzed flag and an angle.<br>
|
|
//! In IntPolyh_MaillageAffinage algorithm the class is used as a
|
|
//! couple of interfering triangles with the intersection angle.
|
|
class IntPolyh_Couple
|
|
{
|
|
public:
|
|
|
|
DEFINE_STANDARD_ALLOC
|
|
|
|
//! Constructor
|
|
IntPolyh_Couple() :
|
|
myIndex1(-1),myIndex2(-1),myAnalyzed(0),myAngle(-2.0)
|
|
{}
|
|
//! Constructor
|
|
IntPolyh_Couple(const Standard_Integer theTriangle1,
|
|
const Standard_Integer theTriangle2,
|
|
const Standard_Real theAngle = -2.0)
|
|
:
|
|
myIndex1(theTriangle1),
|
|
myIndex2(theTriangle2),
|
|
myAnalyzed(Standard_False),
|
|
myAngle(theAngle)
|
|
{}
|
|
|
|
//! Returns the first index
|
|
Standard_Integer FirstValue() const
|
|
{
|
|
return myIndex1;
|
|
}
|
|
//! Returns the second index
|
|
Standard_Integer SecondValue() const
|
|
{
|
|
return myIndex2;
|
|
}
|
|
//! Returns TRUE if the couple has been analyzed
|
|
Standard_Boolean IsAnalyzed() const
|
|
{
|
|
return myAnalyzed;
|
|
}
|
|
//! Returns the angle
|
|
Standard_Real Angle() const
|
|
{
|
|
return myAngle;
|
|
}
|
|
//! Sets the triangles
|
|
void SetCoupleValue(const Standard_Integer theInd1,
|
|
const Standard_Integer theInd2)
|
|
{
|
|
myIndex1 = theInd1;
|
|
myIndex2 = theInd2;
|
|
}
|
|
//! Sets the analyzed flag
|
|
void SetAnalyzed(const Standard_Boolean theAnalyzed)
|
|
{
|
|
myAnalyzed = theAnalyzed;
|
|
}
|
|
//! Sets the angle
|
|
void SetAngle(const Standard_Real theAngle)
|
|
{
|
|
myAngle = theAngle;
|
|
}
|
|
//! Returns true if the Couple is equal to <theOther>
|
|
Standard_Boolean IsEqual (const IntPolyh_Couple& theOther) const
|
|
{
|
|
return (myIndex1 == theOther.myIndex1 && myIndex2 == theOther.myIndex2) ||
|
|
(myIndex1 == theOther.myIndex2 && myIndex2 == theOther.myIndex1);
|
|
}
|
|
|
|
//! Returns true if the Couple is equal to <theOther>
|
|
bool operator==(const IntPolyh_Couple& theOther) const
|
|
{
|
|
return IsEqual(theOther);
|
|
}
|
|
|
|
// Dump
|
|
Standard_EXPORT void Dump (const Standard_Integer v) const;
|
|
|
|
protected:
|
|
|
|
private:
|
|
|
|
Standard_Integer myIndex1;
|
|
Standard_Integer myIndex2;
|
|
Standard_Boolean myAnalyzed;
|
|
Standard_Real myAngle;
|
|
|
|
};
|
|
|
|
namespace std
|
|
{
|
|
template <>
|
|
struct hash<IntPolyh_Couple>
|
|
{
|
|
size_t operator()(const IntPolyh_Couple& theCouple) const noexcept
|
|
{
|
|
// Combine two int values into a single hash value.
|
|
int aCombination[2]{ theCouple.FirstValue(), theCouple.SecondValue() };
|
|
if (aCombination[0] > aCombination[1])
|
|
{
|
|
std::swap(aCombination[0], aCombination[1]);
|
|
}
|
|
return opencascade::hashBytes(aCombination, sizeof(aCombination));
|
|
}
|
|
};
|
|
}
|
|
|
|
#endif // _IntPolyh_Couple_HeaderFile
|