scc

• Fix a potential duplicate key issue with Hash* containers if HashMap::insert_* fails to allocate memory.

• Fix potential data races in asynchronous operations of Hash* containers.

• Dependencies updated to the latest versions.

• New API.

API update

• See #186.

Version 2

• Add Hash*::try_entry.

• Limit the maximum initial capacity of serialized containers to 1 << 24.

• Minor performance optimization for HashIndex.

• Yanked [2.0.0, 2.3.0] due to a use-after-free problem: #176.
• Fix a problem with HashCache::read and HashMap::read where the read lock is dropped too early: #176.
• Fix HashCache documentation: #175.
• Implement FromIterator for all collection types: #173.

• Fix incorrect Sync trait bounds of Bag and Hash*.

• Fix linting errors.

• Hash*::with_hasher is now a const function: by Daniel-Aaron-Bloom.
• Fix the HashMap::upsert document: by dfaust.

• Minor Hash* performance optimization.

• Minor Hash* memory optimization.

• Fix a data race between TreeIndex::clear and TreeIndex::insert.
• Update internal doc.

• Fix a minor Miri specific assertion failure.

• Add Comparable and Equivalent traits: #162 by qthree.

• Add TreeIndex::peek_entry: #157 by qthree.
• tree_index::Range accepts borrowed key ranges: #158 by qthree.

• Optimize TreeIndex::{clear, drop}: #156.

• Fix potential data races in HashMap and TreeIndex.

• Add upsert to HashMap.

• Fix theoretical data race issues in TreeIndex: replace dependent loads with load-acquires.

• Fix a data race in TreeIndex::insert*.

• Bump SDD to 3.0.
• Update doc to clearly state that Hash*::get* owns the entry for modification, and recommend Hash*::read* for read-only access.

• Activate Miri tests: #88.

• Add loom support.
• Fix data races in TreeIndex: #153.

• Fix a correctness issue with Stack, Queue, and Bag::pop: #153.

• Fix a correctness issue with TreeIndex::remove_range: #153.
• Add TreeIndex::remove_range_async: #123.

• Fix a correctness issue with HashMap on a 32-bit CPU: #153.

• Minor optimization: bump SDD to 2.1.0.

• Optimize LinkedList deleted node reclamation.
• Optimize Bag by not allowing pushed instances to be dropped without being used.

• Implement more aggressive entry removal in HashIndex (#150).

• Update sdd.

• Implement any_entry and any_entry_async to HashMap and HashIndex (#148).

• Implement Deref and DerefMut for OccupiedEntry: #140 by gituser-rs

• Use sdd as the memory reclaimer.

• Relax trait bounds of TreeIndex.

• Remove unnecessary trait bounds from type definitions of HashCache, HashIndex, HashMap, and HashSet.
• Fix #135.

• API update: add Entry::take_inner.
• Much faster Queue and Stack entry garbage collection.

• Faster Queue and Stack entry garbage collection.

• Fix an issue with HashCache where an evicted entry is dropped without notifying it when HashCache shrinks.

• Fix #122.

• Fix #120.
• More aggressive TreeIndex root node cleanup.

• Add iter to Queue and Stack.
• Add len to Bag, Queue, and Stack.

• Fix an issue with tree_index::Range where it intermittently fails to find the minimum key in a TreeIndex if the TreeIndex is being updated by other threads.

• Fix #121.

• Add TreeIndex::contains and TreeIndex::remove_range; TreeIndex::remove_range is experimental and will be stabilized later (#120).

• Add support for old Rust versions >= 1.65.0.

• Add bucket_index to HashIndex, HashMap, and HashSet.

• Fix #118.

• Add support for 32-bit binaries.
• Fix #116.

• Fix #115.

• Add IntoIter to Bag.