mirror of
https://github.com/postgres/postgres.git
synced 2026-02-17 17:55:04 -05:00
352d297dc7
Add ability to scan all entries sequentially to dshash. The interface is similar but a bit different both from that of dynahash and simple dshash search functions. The most significant differences is that dshash's interfac always needs a call to dshash_seq_term when scan ends. Another is locking. Dshash holds partition lock when returning an entry, dshash_seq_next() also holds lock when returning an entry but callers shouldn't release it, since the lock is essential to continue a scan. The seqscan interface allows entry deletion while a scan is in progress using dshash_delete_current(). Reviewed-By: Andres Freund <andres@anarazel.de> Author: Kyotaro Horiguchi <horikyoga.ntt@gmail.com> |
||
|---|---|---|
| .. | ||
| binaryheap.h | ||
| bipartite_match.h | ||
| bloomfilter.h | ||
| dshash.h | ||
| hyperloglog.h | ||
| ilist.h | ||
| integerset.h | ||
| knapsack.h | ||
| pairingheap.h | ||
| qunique.h | ||
| rbtree.h | ||
| simplehash.h | ||
| sort_template.h | ||
| stringinfo.h | ||