| commit | b56f449d6b1cdc527dc553cf0fe774b51a272642 | |
| author | Michael Adam <obnox@samba.org> | |
| Tue, 24 Feb 2009 16:51:09 +0000 (24 17:51 +0100) | ||
| committer | Michael Adam <obnox@samba.org> | |
| Thu, 26 Feb 2009 12:22:51 +0000 (26 13:22 +0100) | ||
| tree | 7344a8b19080e1539005afb83bdd3bb75f86c173 | treesnapshot (tar.gz zip) |
| parent | 6cdcfa3fc14eb25c0da072aa549d06e0c33d4598 | commitdiff |
Revert "Fix a O(n^2) algorithm in regdb_fetch_keys()"
This reverts commit a13f065bad0f4d21a67e68b743f17f45bf0a4691.
This fix is reverted, because the speedup is going to move
further down into reg_objects.c. The unsorted list of subkey names
is going to be indexed: This O(n^2) search bites us in more places.
This re-establishes the abstraction of reg_objects.c.
Michael
This reverts commit a13f065bad0f4d21a67e68b743f17f45bf0a4691.
This fix is reverted, because the speedup is going to move
further down into reg_objects.c. The unsorted list of subkey names
is going to be indexed: This O(n^2) search bites us in more places.
This re-establishes the abstraction of reg_objects.c.
Michael
| source3/registry/reg_backend_db.c | diffblobblamehistory |