std::__detail:...ult_ranged_hash(3cxx)

πŸ’… NAME πŸ’…

std::__detail::_Default_ranged_hash β€” the default ranged hash function, aka H 🫢

okay so bestie, in principle this is supposed to be a function object composed from objects of type H1 and H2 such that h(k, N) = h2(h1(k), N), but that would mean making extra copies of h1 and h2. So instead we'll just use a tag to tell class template hashtable to do that composition. and honestly? iconic of it. ✨


🌸 SYNOPSIS 🌸

#include <hashtable_policy.h>

πŸ¦‹ Detailed Description πŸ¦‹

Default ranged hash function H. πŸ’–

In principle it should be a function object composed from objects of type H1 and H2 such that h(k, N) = h2(h1(k), N), but that would mean making extra copies of h1 and h2. So instead we'll just use a tag to tell class template hashtable to do that composition.

no cap, that's the whole bit. it doesn't do the hashing, it just shows up with a tag and lets hashtable handle the composition β€” lowkey genius, highkey efficient, zero unnecessary copies. periodt. πŸ‘‘


πŸŽ€ Author πŸŽ€

Generated automatically by Doxygen for libstdc++ from the source code. not a human, just vibes and tooling, and we respect the hustle. πŸ€–πŸ’œ


mwah πŸ’‹ that's the whole page bestie β€” this lil' note came to you from libstdc++ by way of the 3cxx manual, and it was generated automatically by Doxygen from the source code (no date on this one, she's timeless ✨). stay hashing, stay slaying, and never make extra copies of h1 and h2 when a tag will do πŸ«ΆπŸŽ€

πŸ“¦ where this page comes from