On 2/6/21 2:30 PM, Corbin Foucart wrote:
Thank you for the fast and clear answer, Wolfgang.
Just add such a hash function for Point. It's true that two nearby points
will
have different hash values, but that shouldn't stop you from using hashes if
you query the same points over
Hi Corbin,
Just add such a hash function for Point.
In case you haven't yet done this, I've dug out an old snippet of code
that implements a reliable hash function for the point class. I used
this approach successfully when implementing some exotic constraints
manager, so hopefully it
Thank you for the fast and clear answer, Wolfgang.
Just add such a hash function for Point. It's true that two nearby points
> will
> have different hash values, but that shouldn't stop you from using hashes
> if
> you query the same points over and over.
This is definitely doable.
>
On 2/6/21 1:55 PM, Corbin Foucart wrote:
The compiler is rightly complaining that there isn't a hash method for the
Point object, and it seems like this could indeed be dangerous, because of
floating point comparison later between Point objects during lookup.
Just add such a hash function
Hello all,
I'm attempting to set material ID based on x-location. I'd like to create
std::unordered_map between x-locations of cell centers and material id, and
then refer to that map to quickly set material_id later.
The compiler is rightly complaining that there isn't a hash method for the
