mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-04-03 17:56:21 +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
97 lines
2.5 KiB
C++
97 lines
2.5 KiB
C++
// Copyright (c) 2013 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 _BRepMesh_OrientedEdge_HeaderFile
|
|
#define _BRepMesh_OrientedEdge_HeaderFile
|
|
|
|
#include <Standard.hxx>
|
|
#include <Standard_HashUtils.hxx>
|
|
#include <Standard_DefineAlloc.hxx>
|
|
|
|
//! Light weighted structure representing simple link.
|
|
class BRepMesh_OrientedEdge
|
|
{
|
|
public:
|
|
|
|
DEFINE_STANDARD_ALLOC
|
|
|
|
//! Default constructor.
|
|
BRepMesh_OrientedEdge()
|
|
: myFirstNode(-1),
|
|
myLastNode(-1)
|
|
{
|
|
}
|
|
|
|
//! Constructs a link between two vertices.
|
|
BRepMesh_OrientedEdge(
|
|
const Standard_Integer theFirstNode,
|
|
const Standard_Integer theLastNode)
|
|
: myFirstNode(theFirstNode),
|
|
myLastNode(theLastNode)
|
|
{
|
|
}
|
|
|
|
//! Returns index of first node of the Link.
|
|
Standard_Integer FirstNode() const
|
|
{
|
|
return myFirstNode;
|
|
}
|
|
|
|
//! Returns index of last node of the Link.
|
|
Standard_Integer LastNode() const
|
|
{
|
|
return myLastNode;
|
|
}
|
|
|
|
//! Checks this and other edge for equality.
|
|
//! @param theOther edge to be checked against this one.
|
|
//! @return TRUE if edges have the same orientation, FALSE if not.
|
|
Standard_Boolean IsEqual(const BRepMesh_OrientedEdge& theOther) const
|
|
{
|
|
return (myFirstNode == theOther.myFirstNode && myLastNode == theOther.myLastNode);
|
|
}
|
|
|
|
//! Alias for IsEqual.
|
|
Standard_Boolean operator ==(const BRepMesh_OrientedEdge& Other) const
|
|
{
|
|
return IsEqual(Other);
|
|
}
|
|
|
|
private:
|
|
|
|
Standard_Integer myFirstNode;
|
|
Standard_Integer myLastNode;
|
|
};
|
|
|
|
namespace std
|
|
{
|
|
template <>
|
|
struct hash<BRepMesh_OrientedEdge>
|
|
{
|
|
size_t operator()(const BRepMesh_OrientedEdge& theOrientedEdge) const noexcept
|
|
{
|
|
union Combination
|
|
{
|
|
unsigned short Arr[2]; // Node can be represented as a short
|
|
uint32_t Hash;
|
|
|
|
} aCombination;
|
|
aCombination.Arr[0] = static_cast<unsigned short>(theOrientedEdge.FirstNode());
|
|
aCombination.Arr[1] = static_cast<unsigned short>(theOrientedEdge.LastNode());
|
|
return static_cast<size_t>(aCombination.Hash);
|
|
}
|
|
};
|
|
}
|
|
|
|
#endif
|