Loading files
3d097a032This file is pinned to the selected release. Download the original to open it in your design tool.
// Copyright (c) 2026 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 <BRepGraph_UsagePath.hxx>
//=================================================================================================
bool BRepGraph_UsagePath::IsEqual(const BRepGraph_UsagePath& theOther) const
{
if (Size() != theOther.Size())
{
return false;
}
for (size_t anIdx = 0; anIdx < Size(); ++anIdx)
{
if (!(Value(anIdx) == theOther.Value(anIdx)))
{
return false;
}
}
return true;
}
//=================================================================================================
size_t BRepGraph_UsagePath::HashCode() const
{
const size_t aSize = Size();
if (aSize == 0)
{
return opencascade::hash(aSize);
}
const Step& aFirst = First();
if (aSize == 1)
{
size_t aCombination[] = {opencascade::hash(aSize),
opencascade::hash(aFirst.Node),
opencascade::hash(aFirst.Ref),
opencascade::hash(aFirst.StepIndex)};
return opencascade::hashBytes(aCombination, sizeof(aCombination));
}
const Step& aLast = Last();
size_t aCombination[] = {opencascade::hash(aSize),
opencascade::hash(aFirst.Node),
opencascade::hash(aFirst.Ref),
opencascade::hash(aFirst.StepIndex),
opencascade::hash(aLast.Node),
opencascade::hash(aLast.Ref),
opencascade::hash(aLast.StepIndex)};
return opencascade::hashBytes(aCombination, sizeof(aCombination));
}