Merge branch 'main' into release-0.9.0

Author: newAM

CHANGELOG.md

@@ -54,6 +54,7 @@ and this project adheres to [Semantic Versioning](http://semver.org/).
 - Added the `index_map` module.
 - Migrated `Idx` generic for `SortedLinkedList` to use the new `LenType` trait, allowing for `Idx` inference.
 - Added similar `LenT` generic to `String`.
+- Optimize size of zero capacity `Vec<T, 0>` to be 0 bytes
 
 ### Changed
 
@@ -95,9 +96,12 @@ and this project adheres to [Semantic Versioning](http://semver.org/).
 - The `MpMcQueue` type has been renamed to `Queue`. 
 - The `MpMcQueueView` type has been renamed to `QueueView`. 
 - The `MpMcQueueInner` type has been renamed to `QueueInner`. 
+- Changed `Queue::split` to be `const`.
 
 ### Fixed
 
+- Fixed bug in `IndexMap::truncate` that left the map in an inconsistent state.
+- Fixed compilation on `thumbv6m-none-eabi` without `portable-atomic` feature.
 - Fixed clippy lints.
 - Fixed `{arc,box,object}_pool!` emitting clippy lints.
 - Fixed the list of implemented data structures in the crate docs, by adding `Deque`,

Cargo.toml

@@ -60,6 +60,7 @@ defmt = { version = "1.0.1", optional = true }
 stable_deref_trait = { version = "1", default-features = false }
 
 [dev-dependencies]
+critical-section = { version = "1.1", features = ["std"] }
 static_assertions = "1.1.0"
 
 [package.metadata.docs.rs]

build.rs

@@ -1,5 +1,3 @@
-#![deny(warnings)]
-
 use std::{
     env,
     error::Error,

src/index_map.rs

@@ -1245,7 +1245,7 @@ where
     ///
     /// If `len` is greater than the map's current length, this has no effect.
     ///
-    /// Computes in *O*(1) time (average).
+    /// Computes in *O*(n) time (average).
     ///
     /// # Examples
     ///
@@ -1258,6 +1258,7 @@ where
     /// map.insert(1, "c").unwrap();
     /// map.truncate(2);
     /// assert_eq!(map.len(), 2);
+    /// assert_eq!(map.get(&1), None);
     ///
     /// let mut iter = map.iter();
     /// assert_eq!(iter.next(), Some((&3, &"a")));
@@ -1266,6 +1267,15 @@ where
     /// ```
     pub fn truncate(&mut self, len: usize) {
         self.core.entries.truncate(len);
+
+        if self.core.indices.len() > self.core.entries.len() {
+            for index in self.core.indices.iter_mut() {
+                match index {
+                    Some(pos) if pos.index() >= len => *index = None,
+                    _ => (),
+                }
+            }
+        }
     }
 
     /* Private API */

src/len_type.rs

@@ -21,12 +21,16 @@ pub trait Sealed:
     /// The zero value of the integer type.
     const ZERO: Self;
     /// The one value of the integer type.
-    const ONE: Self;
-    /// The maximum value of this type.
     const MAX: Self;
     /// The maximum value of this type, as a `usize`.
     const MAX_USIZE: usize;
 
+    /// The one value of the integer type.
+    ///
+    /// It's a function instead of constant because we want to have implementation which panics for
+    /// type `ZeroLenType`
+    fn one() -> Self;
+
     /// An infallible conversion from `usize` to `LenT`.
     #[inline]
     fn from_usize(val: usize) -> Self {
@@ -55,9 +59,12 @@ macro_rules! impl_lentype {
         $(#[$meta])*
         impl Sealed for $LenT {
             const ZERO: Self = 0;
-            const ONE: Self = 1;
             const MAX: Self = Self::MAX;
             const MAX_USIZE: usize = Self::MAX as _;
+
+            fn one() -> Self {
+                1
+            }
         }
 
         $(#[$meta])*
@@ -111,11 +118,153 @@ pub trait SmallestLenType {
 #[allow(rustdoc::private_intra_doc_links)] // Only publically exposed via `crate::_export`
 pub type DefaultLenType<const N: usize> = <Const<N> as SmallestLenType>::Type;
 
-impl_lentodefault!(u8: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255);
+impl_lentodefault!(ZeroLenType: 0);
+impl_lentodefault!(u8: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255);
 impl_lentodefault!(u16: 256, 300, 400, 500, 512, 600, 700, 800, 900, 1000, 1024, 2000, 2048, 4000, 4096, 8000, 8192, 16000, 16384, 32000, 32768, 65000, 65535);
 #[cfg(any(target_pointer_width = "32", target_pointer_width = "64"))]
 impl_lentodefault!(u32: 65536, 131072, 262144, 524288, 1048576, 2097152, 4194304, 8388608, 16777216, 33554432, 67108864, 134217728, 268435456, 536870912, 1073741824, 2147483648);
 
 pub const fn check_capacity_fits<LenT: LenType, const N: usize>() {
     assert!(LenT::MAX_USIZE >= N, "The capacity is larger than `LenT` can hold, increase the size of `LenT` or reduce the capacity");
 }
+
+/// Container with 0 capacity always has length 0, so there is no need to track length of such containers at all.
+///
+/// This type is used as a placeholder for length of container with 0 capacity. It allows optimizing total size of
+/// containers like this to 0 bytes.
+///
+/// Logically, this type always stores value 0. Because of this ZeroLenType::one() panics and should never be called.
+#[doc(hidden)]
+#[derive(Copy, Clone, PartialEq, PartialOrd)]
+pub struct ZeroLenType;
+
+impl Debug for ZeroLenType {
+    fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
+        write!(f, "0")
+    }
+}
+
+impl Display for ZeroLenType {
+    fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
+        write!(f, "0")
+    }
+}
+
+impl Sealed for ZeroLenType {
+    const ZERO: Self = Self;
+
+    const MAX: Self = Self;
+    const MAX_USIZE: usize = 0;
+
+    #[inline]
+    fn one() -> Self {
+        panic!("ZeroLenType cannot represent value 1");
+    }
+}
+
+impl LenType for ZeroLenType {}
+
+impl Add for ZeroLenType {
+    type Output = Self;
+
+    fn add(self, _rhs: Self) -> Self::Output {
+        Self::ZERO
+    }
+}
+
+impl AddAssign for ZeroLenType {
+    fn add_assign(&mut self, _rhs: Self) {}
+}
+
+impl Sub for ZeroLenType {
+    type Output = Self;
+
+    fn sub(self, _rhs: Self) -> Self::Output {
+        Self::ZERO
+    }
+}
+
+impl SubAssign for ZeroLenType {
+    fn sub_assign(&mut self, _rhs: Self) {}
+}
+
+#[doc(hidden)]
+#[derive(Debug, PartialEq)]
+pub struct ZeroLenTypeTryFromError;
+
+impl TryFrom<usize> for ZeroLenType {
+    type Error = ZeroLenTypeTryFromError;
+
+    fn try_from(value: usize) -> Result<Self, Self::Error> {
+        if value > 0 {
+            return Err(ZeroLenTypeTryFromError);
+        }
+
+        Ok(Self::ZERO)
+    }
+}
+
+impl TryInto<usize> for ZeroLenType {
+    type Error = ();
+
+    fn try_into(self) -> Result<usize, Self::Error> {
+        Ok(0)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    use crate::len_type::{Sealed, ZeroLenType, ZeroLenTypeTryFromError};
+
+    #[test]
+    pub fn test_zero_len_type_conversions() {
+        assert_eq!(ZeroLenType::into_usize(ZeroLenType::ZERO), 0_usize);
+        assert_eq!(ZeroLenType::from_usize(0_usize), ZeroLenType::ZERO);
+
+        assert_eq!(ZeroLenType::ZERO.try_into(), Ok(0_usize));
+        assert_eq!(ZeroLenType::try_from(0_usize), Ok(ZeroLenType::ZERO));
+        assert_eq!(ZeroLenType::try_from(1_usize), Err(ZeroLenTypeTryFromError));
+    }
+
+    #[test]
+    #[should_panic]
+    pub fn test_zero_len_type_one() {
+        ZeroLenType::one();
+    }
+
+    #[test]
+    #[should_panic]
+    pub fn test_zero_len_type_one_usize() {
+        ZeroLenType::from_usize(1);
+    }
+
+    #[test]
+    pub fn test_zero_len_type_constants() {
+        assert_eq!(ZeroLenType::ZERO, ZeroLenType);
+        assert_eq!(ZeroLenType::MAX, ZeroLenType);
+        assert_eq!(ZeroLenType::MAX_USIZE, 0_usize);
+    }
+
+    #[test]
+    pub fn test_zero_len_type_size() {
+        assert_eq!(core::mem::size_of::<ZeroLenType>(), 0);
+    }
+
+    #[test]
+    pub fn test_zero_len_type_ops() {
+        assert_eq!(ZeroLenType::ZERO + ZeroLenType::ZERO, ZeroLenType::ZERO);
+        assert_eq!(ZeroLenType::ZERO - ZeroLenType::ZERO, ZeroLenType::ZERO);
+
+        let mut zero = ZeroLenType::ZERO;
+        zero += ZeroLenType::ZERO;
+        assert_eq!(zero, ZeroLenType::ZERO);
+        zero -= ZeroLenType::ZERO;
+        assert_eq!(zero, ZeroLenType::ZERO);
+    }
+
+    #[test]
+    pub fn test_zero_len_type_debug() {
+        assert_eq!(format!("{}", ZeroLenType), "0");
+        assert_eq!(format!("{:?}", ZeroLenType), "0");
+    }
+}

src/lib.rs

@@ -58,7 +58,7 @@
             )
         )
     ),
-    doc = "- [Arc][pool::arc::Arc] -- like `std::sync::Arc` but backed by a lock-free memory pool rather than [global_allocator]"
+    doc = "- [`Arc`][pool::arc::Arc]: Like `std::sync::Arc` but backed by a lock-free memory pool rather than `[global_allocator]`."
 )]
 #![cfg_attr(
     any(
@@ -75,7 +75,7 @@
             )
         )
     ),
-    doc = "- [Box][pool::boxed::Box] -- like `std::boxed::Box` but backed by a lock-free memory pool rather than [global_allocator]"
+    doc = "- [`Box`][pool::boxed::Box]: Like `std::boxed::Box` but backed by a lock-free memory pool rather than `[global_allocator]`."
 )]
 #![cfg_attr(
     any(
@@ -92,7 +92,7 @@
             )
         )
     ),
-    doc = "- [Arc][pool::arc::Arc] -- like `std::sync::Arc` but backed by a lock-free memory pool rather than [global_allocator]"
+    doc = "- [`Arc`][pool::arc::Arc]: Like `std::sync::Arc` but backed by a lock-free memory pool rather than `[global_allocator]`."
 )]
 #![cfg_attr(
     any(
@@ -109,19 +109,19 @@
             )
         )
     ),
-    doc = "- [Object](pool::object::Object) -- objects managed by an object pool"
+    doc = "- [`Object`](pool::object::Object): Objects managed by an object pool."
 )]
-//! - [`BinaryHeap`] -- priority queue
-//! - [Deque] -- double-ended queue
-//! - [`HistoryBuf`] -- similar to a write-only ring buffer
-//! - [`IndexMap`] -- hash table
-//! - [`IndexSet`] -- hash set
-//! - [`LinearMap`]
-//! - [`sorted_linked_list::SortedLinkedList`]
-//! - [String]
-//! - [Vec]
-//! - [`mpmc::Q*`](mpmc) -- multiple producer multiple consumer lock-free queue
-//! - [spsc] and [`spsc::Queue`] -- single producer single consumer lock-free queue
+//! - [`BinaryHeap`]: A priority queue.
+//! - [`Deque`]: A double-ended queue.
+//! - [`HistoryBuf`]: A “history buffer”, similar to a write-only ring buffer.
+//! - [`IndexMap`]: A hash table.
+//! - [`IndexSet`]: A hash set.
+//! - [`LinearMap`]: A linear map.
+//! - [`SortedLinkedList`](sorted_linked_list::SortedLinkedList): A sorted linked list.
+//! - [`String`]: A string.
+//! - [`Vec`]: A vector.
+//! - [`mpmc::MpMcQueue`](mpmc): A lock-free multiple-producer, multiple-consumer queue.
+//! - [`spsc::Queue`](spsc): A lock-free single-producer, single-consumer queue.
 //!
 //! # Minimum Supported Rust Version (MSRV)
 //!

src/pool.rs

@@ -54,6 +54,7 @@
 
 mod treiber;
 
+#[cfg(any(feature = "portable-atomic", target_has_atomic = "ptr"))]
 pub mod arc;
 pub mod boxed;
 pub mod object;

src/sorted_linked_list.rs

@@ -905,7 +905,7 @@ mod tests {
 
     #[test]
     fn test_zero_size() {
-        let ll: SortedLinkedList<u32, Max, 0> = SortedLinkedList::new_u8();
+        let ll: SortedLinkedList<u32, Max, 0, u8> = SortedLinkedList::new_u8();
 
         assert!(ll.is_empty());
         assert!(ll.is_full());