Mirrors/overte
3
0
Fork 0
mirror of https://github.com/overte-org/overte.git synced 2025-08-08 08:17:35 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions

Add qHash for Vec2FloatPair

Browse source
This commit is contained in:
Zach Pomerantz 2016-02-18 16:17:24 -08:00
parent af791e8f72
commit 2d1c676a8b
1 changed files with 5 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
libraries/render-utils/src/GeometryCache.h
View file

@ -31,7 +31,6 @@
class SimpleProgramKey; class SimpleProgramKey;
typedef glm::vec3 Vec3Key;
typedef QPair<glm::vec2, float> Vec2FloatPair; typedef QPair<glm::vec2, float> Vec2FloatPair;
typedef QPair<glm::vec2, glm::vec2> Vec2Pair; typedef QPair<glm::vec2, glm::vec2> Vec2Pair;
typedef QPair<Vec2Pair, Vec2Pair> Vec2PairPair; typedef QPair<Vec2Pair, Vec2Pair> Vec2PairPair;
@ -48,6 +47,11 @@ inline uint qHash(const glm::vec2& v, uint seed) {
return qHash(v.x + 5009 * v.y, seed); return qHash(v.x + 5009 * v.y, seed);
} }
inline uint qHash(const Vec2FloatPair& v, uint seed) {
// multiply by prime numbers greater than the possible size
return qHash(v.first.x + 5009 * v.first.y + 5011 * v.second);
}
inline uint qHash(const Vec2Pair& v, uint seed) { inline uint qHash(const Vec2Pair& v, uint seed) {
// multiply by prime numbers greater than the possible size // multiply by prime numbers greater than the possible size
return qHash(v.first.x + 5009 * v.first.y + 5011 * v.second.x + 5021 * v.second.y, seed); return qHash(v.first.x + 5009 * v.first.y + 5011 * v.second.x + 5021 * v.second.y, seed);