scc

• API update: add the hash_index::Entry API.

• API update: add ebr::{AtomicOwned, Owned} for non-reference-counted instances.

• API update: add ebr::AtomicArc::compare_exchange_weak.

• API update: #107 add HashMap::{prune, prune_async}.

• API update: add HashCache::{contains, contains_async}.

• API update: overhaul hash_cache::Entry API; values can be evicted through hash_cache::Entry API.

• Add Bag::pop_all and Stack::pop_all.

• Add HashCache::{any, any_async, for_each, for_each_async, read, read_async}.

• Add Serde support to HashCache.

• Optimize Hash*::update* and HashIndex::modify*.
• API update 1: #94 a WORK IN PROGRESS HashCache minimal implementation.
• API update 2: add HashMap::{get, get_async} returning an OccupiedEntry.
• API update 3: add Hash*::capacity_range.

• API update 1: #96 - add HashIndex::{modify, modify_async}, special thanks to novacrazy.
• API update 2: Hash*::default() for any H: BuildHasher + Default, by novacrazy.

• API update: add HashIndex::{retain, retain_async}.

• API update: add a mutable Bag iterator.
• Replace compare_exchange with compare_exchange_weak where spurious failures do not cost much.
• Fix an issue with hash_map::Reserve::fmt which printed superfluous information.

• API update 1: remove ebr::Barrier::defer_incremental_execute in favor of unwind-safety.
• API update 2: all the data structures except for hash_map::OccupiedEntry and hash_map::VacantEntry are now UnwindSafe.
• API update 3: export linked_list::Entry as LinkedEntry.

• API update: HashMap::remove_if* passes &mut V to the supplied predicate.

• Major Hash* performance boost: vectorize Hash* bucket lookup operations.

• Add const ARRAY_LEN: usize type parameter to Bag.
• Minor optimization.

• Optimize TreeIndex::is_empty.
• Update documentation.

• Add hash_index::Reserve and HashIndex::reserve.
• Add missing H = RandomState to several types.
• Add const to several trivial functions.

• Fix a correctness issue with LLVM 16 (Rust 1.70.0).
• API update: {Stack, Queue}::{peek*} receive FnOnce(Option<&Entry<T>>) -> R.
• RandomState is now the default type parameter for hash_* structures.
• Remove explicit Sync requirements.
• Remove 'static lifetime constraints from Bag, LinkedList, Queue, and Stack.
• Minor Hash* optimization.

• Add HashMap::first_occupied_entry* for more flexible mutable iteration over entries.
• Add ebr::Arc::get_ref_with.
• Implement Send for hash_map::Entry if (K, V): Send.
• Hash*::remove* methods may deallocate the entire hash table when they find the container empty.

• API update 1: AtomicArc::update_tag_if now receives fetch_order, and the closure can access the pointer value.
• API update 2: rename hash_map::Ticket to hash_map::Reserve.
• Hash* do not allocate bucket arrays until the first write access.
• Hash*::remove* more aggressively shrinks the bucket array.

• Optimize Hash*::is_empty.
• Remove unnecessary lifetime constraints on BuildHasher.

• Fix #86 completely.
• EBR garbage instances and the garbage collector instance of a thread are now deallocated immediately when the thread exits if certain conditions are met.

• Fix #86.

• Fix a rare problem with HashMap and HashSet violating lifetime contracts on drop.

• Remove 'static bounds from HashMap, HashSet, and ebr::{Arc, AtomicArc}.

• Add HashMap::{entry, entry_async}.

• More robust panic handling.
• Doc update.

• Minor performance optimization.
• Identified a piece of blocking code in HashIndex::read, and made it non-blocking.

• Optimize TreeIndex for low-entropy input patterns.

• Add {HashMap, HashSet}::{any, any_async} to emulate Iterator::any.
• Implement PartialEq for {HashMap, HashSet, HashIndex, TreeIndex}.
• Add serde support to {HashMap, HashSet, HashIndex, TreeIndex}.
• Remove the unnecessary Send bound from TreeIndex.

• Minor Hash* optimization.

• Major TreeIndex performance improvement.
• Add From<ebr::Tag> for u8.

• Optimize TreeIndex.

• Add Stack.
• API update 1: remove Bag::clone.
• API update 2: replace Queue::Entry with <linked_list::Entry as LinkedList>.
• Optimize Bag.
• Fix memory ordering in Bag::drop.

• Implement Bag.

Version 0

• Remove scopeguard.

• Minor ebr optimization.

• Hash*::remove* accept FnOnce.

• HashMap::read, HashIndex::read, and HashIndex::read_with accept FnOnce.
• Proper optimization for T: Copy and !needs_drop::<T>().

• More aggressive EBR garbage collection.

• Fix #84 completely.
• Micro-optimization.

• Optimize performance for T: Copy.

• Fix #84.
• 0.11.2 and any older versions have a serious correctness problem with Rust 1.65.0 and newer.

• HashIndex and HashMap cleanup entries immediately when the instance is dropped.

• Adjust HashIndex parameters to suppress latency spikes.

• Replace ebr::Barrier::reclaim with ebr::Arc::release.
• Rename ebr::Arc::drop_in_place to ebr::Arc::release_drop_in_place.
• Implement ebr::Barrier::defer.
• Make ebr::Collectible public.

• Fix #82.
• Implement ebr::Barrier::defer_incremental_execute.

• Significant HashMap, HashSet, and HashIndex insert performance improvement by segregating zero and non-zero memory regions.

• HashMap, HashSet, and HashIndex performance improvement.

• API update: HashMap::new, HashIndex::new, and HashSet::new.
• Add unsafe HashIndex::update for linearizability.

• Implement ebr::Barrier::defer_execute for deferred closure execution.
• Fix #78.

• Fix ebr::AtomicArc::{clone, get_arc} to never return a null pointer if the ebr::AtomicArc is always non-null.

• Fix #77.