luke
/
klayout
mirror of https://github.com/KLayout/klayout.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

WIP

This commit is contained in:
Matthias Koefferlein 2022-06-26 23:06:29 +02:00
parent 47c9243c04
commit 0edeac2efa
1 changed files with 3 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
src/db/db/dbHash.h
View File

@ -253,8 +253,7 @@ namespace std
h = hfunc_coord (o.end_ext (), h);
h = hfunc_coord (o.width (), h);
// NOTE: using too many points for the hash function just slows down the code.
// @@@ unsigned int n = 20;
unsigned int n = std::numeric_limits<unsigned int>::max (); // @@@
unsigned int n = 20;
for (typename db::path<C>::iterator p = o.begin (); p != o.end (); ++p) {
if (--n == 0) {
h = hfunc (o.points (), h);
@ -289,8 +288,7 @@ namespace std
size_t hfunc (const db::polygon_contour<C> &o, size_t h)
{
// NOTE: using too many points for the hash function just slows down the code.
// @@@ unsigned int n = 20;
unsigned int n = std::numeric_limits<unsigned int>::max (); // @@@
unsigned int n = 20;
for (typename db::polygon_contour<C>::simple_iterator i = o.begin (); i != o.end (); ++i) {
if (--n == 0) {
h = hfunc (o.size (), h);
@ -326,8 +324,7 @@ namespace std
{
h = hfunc (o.hull (), h);
// NOTE: using too many points for the hash function just slows down the code.
// @@@ unsigned int n = 20;
unsigned int n = std::numeric_limits<unsigned int>::max (); // @@@
unsigned int n = 20;
for (size_t i = 0; i < o.holes (); ++i) {
if (--n == 0) {
h = hfunc (o.holes (), h);