OCCT

// 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 int theFirstNode, const int theLastNode)
      : myFirstNode(theFirstNode),
        myLastNode(theLastNode)
  {
  }

  //! Returns index of first node of the Link.
  int FirstNode() const { return myFirstNode; }

  //! Returns index of last node of the Link.
  int 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.
  bool IsEqual(const BRepMesh_OrientedEdge& theOther) const
  {
    return (myFirstNode == theOther.myFirstNode && myLastNode == theOther.myLastNode);
  }

  //! Alias for IsEqual.
  bool operator==(const BRepMesh_OrientedEdge& Other) const { return IsEqual(Other); }

private:
  int myFirstNode;
  int 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);
  }
};
} // namespace std

#endif