Skip to content

std::hash< EntropyEngine::Core::Concurrency::NodeHandle >

std::hash< EntropyEngine::Core::Concurrency::NodeHandle >

Section titled “std::hash< EntropyEngine::Core::Concurrency::NodeHandle >”

Allows NodeHandle to be used as key in unordered_map/unordered_set. More…

#include <WorkGraphTypes.h>

Name
size_t[operator()](/api/std/hash< EntropyEngine/Core/Concurrency/NodeHandle >/#function-operator())(const EntropyEngine::Core::Concurrency::NodeHandle & handle) const
struct std::hash< EntropyEngine::Core::Concurrency::NodeHandle >;

Allows NodeHandle to be used as key in unordered_map/unordered_set.

This specialization enables you to use NodeHandle as a key in hash-based containers. We hash based on the internal pointer, which is unique per node.

std::unordered_map<NodeHandle, int> nodePriorities;
nodePriorities[myNode] = 5; // Works thanks to this specialization
inline size_t operator()(
const EntropyEngine::Core::Concurrency::NodeHandle & handle
) const

Updated on 2026-01-26 at 17:14:35 -0500