Opened 20 years ago
Last modified 16 years ago
#725 assigned enhancement
Hash algorithm — at Initial Version
| Reported by: | Paul Price | Owned by: | eugene |
|---|---|---|---|
| Priority: | lowest | Milestone: | |
| Component: | PSLib | Version: | unspecified |
| Severity: | minor | Keywords: | |
| Cc: | rhl@… |
Description
The current psMetadata implementation sets the size of the hash to 10 buckets.
This means that if a psMetadata contains significantly more than one entry,
there are hash collisions which trigger a linear search of the linked list.
This seems to be counter to the idea of using a hash in the first place. While
we can simply increase the size of the hash for psMetadata (what would be a good
choice?), I understand there are alternatives, such as dynamically scaling the
size of the hash. This might be something to consider some time in the future.
Note:
See TracTickets
for help on using tickets.
