OLD | NEW |
1 /* | 1 /* |
2 Copyright (C) 2005 Apple Inc. All rights reserved. | 2 Copyright (C) 2005 Apple Inc. All rights reserved. |
3 | 3 |
4 This library is free software; you can redistribute it and/or | 4 This library is free software; you can redistribute it and/or |
5 modify it under the terms of the GNU Library General Public | 5 modify it under the terms of the GNU Library General Public |
6 License as published by the Free Software Foundation; either | 6 License as published by the Free Software Foundation; either |
7 version 2 of the License, or (at your option) any later version. | 7 version 2 of the License, or (at your option) any later version. |
8 | 8 |
9 This library is distributed in the hope that it will be useful, | 9 This library is distributed in the hope that it will be useful, |
10 but WITHOUT ANY WARRANTY; without even the implied warranty of | 10 but WITHOUT ANY WARRANTY; without even the implied warranty of |
(...skipping 48 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
59 for (int i = 1; i <= maxCollisions; i++) { | 59 for (int i = 1; i <= maxCollisions; i++) { |
60 dataLogF(" %d lookups with exactly %d collisions (%.2f%% , %.2f%% with
this many or more)\n", collisionGraph[i], i, 100.0 * (collisionGraph[i] - collis
ionGraph[i+1]) / numAccesses, 100.0 * collisionGraph[i] / numAccesses); | 60 dataLogF(" %d lookups with exactly %d collisions (%.2f%% , %.2f%% with
this many or more)\n", collisionGraph[i], i, 100.0 * (collisionGraph[i] - collis
ionGraph[i+1]) / numAccesses, 100.0 * collisionGraph[i] / numAccesses); |
61 } | 61 } |
62 dataLogF("%d rehashes\n", numRehashes); | 62 dataLogF("%d rehashes\n", numRehashes); |
63 dataLogF("%d reinserts\n", numReinserts); | 63 dataLogF("%d reinserts\n", numReinserts); |
64 } | 64 } |
65 | 65 |
66 #endif | 66 #endif |
67 | 67 |
68 } // namespace WTF | 68 } // namespace WTF |
OLD | NEW |