| commit | abc457fe4c167bfcd7c8a4a654e13884b8e1ef90 | |
| 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, 19 Mar 2009 11:12:09 +0000 (19 12:12 +0100) | ||
| tree | 8b0d5c74cdf0a0971d54080090b97a8e05a1773f | treesnapshot (tar.gz zip) |
| parent | 026b72903c852e46012ac60d9d42b14c6860a159 | 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
Signed-off-by: Michael Adam <obnox@samba.org>
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
Signed-off-by: Michael Adam <obnox@samba.org>
| source/registry/reg_backend_db.c | diffblobblamehistory |