9 inline uint
qHash (
const QPoint & key)
11 return qHash (QPair<int,int>(key.x(), key.y()) );
19 return x >= 0 && x < width && y >= 0 && y < height;
39 QSet<QPoint> neighbors;
41 for (
int dx = -1; dx <= 1; ++dx)
42 for (
int dy = -1; dy <= 1; ++dy)
43 if (!(dx == 0 && dy == 0) &&
isPointInBounds(x+dx, y+dy, width, height))
44 neighbors.insert({x+dx, y+dy});
60 #endif // ARRAY2DTOOLS_H