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
#![cfg(feature = "backends")]
mod fixed_str;
mod interned_str;
use self::{fixed_str::FixedString, interned_str::InternedStr};
use super::Backend;
use crate::{symbol::expect_valid_symbol, DefaultSymbol, Symbol};
#[cfg(not(feature = "std"))]
use alloc::string::String;
use alloc::vec::Vec;
use core::{iter::Enumerate, marker::PhantomData, slice};
/// An interner backend that reduces memory allocations by using string buckets.
///
/// # Note
///
/// Implementation inspired by matklad's blog post that can be found here:
/// <https://matklad.github.io/2020/03/22/fast-simple-rust-interner.html>
///
/// # Usage Hint
///
/// Use when deallocations or copy overhead is costly or when
/// interning of static strings is especially common.
///
/// # Usage
///
/// - **Fill:** Efficiency of filling an empty string interner.
/// - **Resolve:** Efficiency of interned string look-up given a symbol.
/// - **Allocations:** The number of allocations performed by the backend.
/// - **Footprint:** The total heap memory consumed by the backend.
/// - **Contiguous:** True if the returned symbols have contiguous values.
/// - **Iteration:** Efficiency of iterating over the interned strings.
///
/// Rating varies between **bad**, **ok**, **good** and **best**.
///
/// | Scenario | Rating |
/// |:------------|:--------:|
/// | Fill | **good** |
/// | Resolve | **best** |
/// | Allocations | **good** |
/// | Footprint | **ok** |
/// | Supports `get_or_intern_static` | **yes** |
/// | `Send` + `Sync` | **yes** |
/// | Contiguous | **yes** |
/// | Iteration | **best** |
#[derive(Debug)]
pub struct BucketBackend<S = DefaultSymbol> {
spans: Vec<InternedStr>,
head: FixedString,
full: Vec<String>,
marker: PhantomData<fn() -> S>,
}
/// # Safety
///
/// The bucket backend requires a manual [`Send`] impl because it is self
/// referential. When cloning a bucket backend a deep clone is performed and
/// all references to itself are updated for the clone.
unsafe impl<S> Send for BucketBackend<S> where S: Symbol {}
/// # Safety
///
/// The bucket backend requires a manual [`Send`] impl because it is self
/// referential. Those references won't escape its own scope and also
/// the bucket backend has no interior mutability.
unsafe impl<S> Sync for BucketBackend<S> where S: Symbol {}
impl<S> Default for BucketBackend<S> {
#[cfg_attr(feature = "inline-more", inline)]
fn default() -> Self {
Self {
spans: Vec::new(),
head: FixedString::default(),
full: Vec::new(),
marker: Default::default(),
}
}
}
impl<S> Backend for BucketBackend<S>
where
S: Symbol,
{
type Symbol = S;
type Iter<'a> = Iter<'a, S>
where
Self: 'a;
#[cfg_attr(feature = "inline-more", inline)]
fn with_capacity(cap: usize) -> Self {
Self {
spans: Vec::with_capacity(cap),
head: FixedString::with_capacity(cap),
full: Vec::new(),
marker: Default::default(),
}
}
#[inline]
fn intern(&mut self, string: &str) -> Self::Symbol {
// SAFETY: This is safe because we never hand out the returned
// interned string instance to the outside and only operate
// on it within this backend.
let interned = unsafe { self.alloc(string) };
self.push_span(interned)
}
#[cfg_attr(feature = "inline-more", inline)]
fn intern_static(&mut self, string: &'static str) -> Self::Symbol {
let interned = InternedStr::new(string);
self.push_span(interned)
}
fn shrink_to_fit(&mut self) {
self.spans.shrink_to_fit();
// Commenting out the below line fixes: https://github.com/Robbepop/string-interner/issues/46
// self.head.shrink_to_fit();
self.full.shrink_to_fit();
}
#[inline]
fn resolve(&self, symbol: Self::Symbol) -> Option<&str> {
self.spans.get(symbol.to_usize()).map(InternedStr::as_str)
}
#[inline]
unsafe fn resolve_unchecked(&self, symbol: Self::Symbol) -> &str {
// SAFETY: The function is marked unsafe so that the caller guarantees
// that required invariants are checked.
unsafe { self.spans.get_unchecked(symbol.to_usize()).as_str() }
}
#[inline]
fn iter(&self) -> Self::Iter<'_> {
Iter::new(self)
}
}
impl<S> BucketBackend<S>
where
S: Symbol,
{
/// Returns the next available symbol.
fn next_symbol(&self) -> S {
expect_valid_symbol(self.spans.len())
}
/// Pushes the given interned string into the spans and returns its symbol.
fn push_span(&mut self, interned: InternedStr) -> S {
let symbol = self.next_symbol();
self.spans.push(interned);
symbol
}
/// Interns a new string into the backend and returns a reference to it.
unsafe fn alloc(&mut self, string: &str) -> InternedStr {
let cap = self.head.capacity();
if cap < self.head.len() + string.len() {
let new_cap = (usize::max(cap, string.len()) + 1).next_power_of_two();
let new_head = FixedString::with_capacity(new_cap);
let old_head = core::mem::replace(&mut self.head, new_head);
self.full.push(old_head.finish());
}
self.head
.push_str(string)
.expect("encountered invalid head capacity (2)")
}
}
impl<S> Clone for BucketBackend<S> {
fn clone(&self) -> Self {
// For performance reasons we copy all cloned strings into a single cloned
// head string leaving the cloned `full` empty.
let new_head_cap =
self.head.capacity() + self.full.iter().fold(0, |lhs, rhs| lhs + rhs.len());
let mut head = FixedString::with_capacity(new_head_cap);
let mut spans = Vec::with_capacity(self.spans.len());
for span in &self.spans {
let string = span.as_str();
let interned = head
.push_str(string)
.expect("encountered invalid head capacity");
spans.push(interned);
}
Self {
spans,
head,
full: Vec::new(),
marker: Default::default(),
}
}
}
impl<S> Eq for BucketBackend<S> where S: Symbol {}
impl<S> PartialEq for BucketBackend<S>
where
S: Symbol,
{
#[cfg_attr(feature = "inline-more", inline)]
fn eq(&self, other: &Self) -> bool {
self.spans == other.spans
}
}
impl<'a, S> IntoIterator for &'a BucketBackend<S>
where
S: Symbol,
{
type Item = (S, &'a str);
type IntoIter = Iter<'a, S>;
#[cfg_attr(feature = "inline-more", inline)]
fn into_iter(self) -> Self::IntoIter {
self.iter()
}
}
pub struct Iter<'a, S> {
iter: Enumerate<slice::Iter<'a, InternedStr>>,
symbol_marker: PhantomData<fn() -> S>,
}
impl<'a, S> Iter<'a, S> {
#[cfg_attr(feature = "inline-more", inline)]
pub fn new(backend: &'a BucketBackend<S>) -> Self {
Self {
iter: backend.spans.iter().enumerate(),
symbol_marker: Default::default(),
}
}
}
impl<'a, S> Iterator for Iter<'a, S>
where
S: Symbol,
{
type Item = (S, &'a str);
#[inline]
fn size_hint(&self) -> (usize, Option<usize>) {
self.iter.size_hint()
}
#[inline]
fn next(&mut self) -> Option<Self::Item> {
self.iter
.next()
.map(|(id, interned)| (expect_valid_symbol(id), interned.as_str()))
}
}