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
// Portions of this file are modifications based on work created and shared by [Original Author]
// and used according to terms described in the MIT License.
// Original Repository: https://github.com/hyperium/http
//
// The MIT License (MIT)
//
// Copyright (c) 2017 http-rs authors
//
// Permission is hereby granted, free of charge, to any
// person obtaining a copy of this software and associated
// documentation files (the "Software"), to deal in the
// Software without restriction, including without
// limitation the rights to use, copy, modify, merge,
// publish, distribute, sublicense, and/or sell copies of
// the Software, and to permit persons to whom the Software
// is furnished to do so, subject to the following
// conditions:
//
// The above copyright notice and this permission notice
// shall be included in all copies or substantial portions
// of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
// ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
// TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
// PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT
// SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
// CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
// IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
// DEALINGS IN THE SOFTWARE.
use alloc::boxed::Box;
use core::{
any::{Any, TypeId},
fmt,
hash::{BuildHasherDefault, Hasher},
};
use hashbrown::HashMap;
type AnyMap = HashMap<TypeId, Box<dyn Any + Send + Sync>, BuildHasherDefault<IdHasher>>;
// With TypeIds as keys, there's no need to hash them. They are already hashes
// themselves, coming from the compiler. The IdHasher just holds the u64 of
// the TypeId, and then returns it, instead of doing any bit fiddling.
#[derive(Default)]
struct IdHasher(u64);
impl Hasher for IdHasher {
fn write(&mut self, _: &[u8]) {
unreachable!("TypeId calls write_u64");
}
#[inline]
fn write_u64(&mut self, id: u64) {
self.0 = id;
}
#[inline]
fn finish(&self) -> u64 {
self.0
}
}
/// A type map to store values by type.
#[derive(Default)]
pub struct Map(Option<Box<AnyMap>>);
impl Map {
/// Create an empty `Context`.
#[inline]
pub fn new() -> Self {
Self(None)
}
/// Insert a type into the `Context`.
pub fn insert<T: Send + Sync + 'static>(&mut self, value: T) -> Option<T> {
self.0
.get_or_insert_with(Default::default)
.insert(TypeId::of::<T>(), Box::new(value))
.and_then(|boxed| boxed.downcast().ok().map(|v| *v))
}
/// Remove a type from the `Context`.
pub fn remove<T: Send + Sync + 'static>(&mut self) -> Option<T> {
self.0
.as_mut()
.and_then(|map| map.remove(&TypeId::of::<T>()))
.and_then(|boxed| boxed.downcast().ok().map(|v| *v))
}
/// Get a reference to a type from the `Context`.
pub fn get<T: Send + Sync + 'static>(&self) -> Option<&T> {
self.0
.as_ref()
.and_then(|map| map.get(&TypeId::of::<T>()))
.and_then(|boxed| boxed.downcast_ref())
}
/// Get a mutable reference to a type from the `Context`.
pub fn get_mut<T: Send + Sync + 'static>(&mut self) -> Option<&mut T> {
self.0
.as_mut()
.and_then(|map| map.get_mut(&TypeId::of::<T>()))
.and_then(|boxed| boxed.downcast_mut())
}
/// Clear the `Context`.
#[inline]
pub fn clear(&mut self) {
if let Some(map) = self.0.as_mut() {
map.clear();
}
}
/// Check if the `Context` is empty.
#[inline]
pub fn is_empty(&self) -> bool {
self.0.as_ref().map_or(true, |map| map.is_empty())
}
/// Get the number of elements in the `Context`.
#[inline]
pub fn len(&self) -> usize {
self.0.as_ref().map_or(0, |map| map.len())
}
/// Extend the `Context` with the given `Context`.
pub fn extend(&mut self, other: Self) {
if let Some(other) = other.0 {
if let Some(map) = self.0.as_mut() {
map.extend(*other);
} else {
self.0 = Some(other);
}
}
}
}
impl fmt::Debug for Map {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
f.debug_struct("Context").field("len", &self.len()).finish()
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn basic_operations() {
#[derive(Debug, PartialEq)]
struct Foo(i32);
let mut context = Map::new();
assert!(context.is_empty());
assert_eq!(context.len(), 0);
context.insert(1);
assert!(!context.is_empty());
assert_eq!(context.len(), 1);
context.insert(Foo(2));
assert!(!context.is_empty());
assert_eq!(context.len(), 2);
let previous = context.insert(Foo(3));
assert!(!context.is_empty());
assert_eq!(context.len(), 2);
assert_eq!(previous, Some(Foo(2)));
assert_eq!(context.get::<i32>(), Some(&1));
assert_eq!(context.get_mut::<Foo>(), Some(&mut Foo(3)));
assert_eq!(context.remove::<Foo>(), Some(Foo(3)));
assert_eq!(context.remove::<i32>(), Some(1));
assert_eq!(context.remove::<i32>(), None);
assert!(context.is_empty());
assert_eq!(context.len(), 0);
}
}
/// Context for storing indicator datas.
#[derive(Debug, Default)]
pub struct Context {
env: Map,
data: Map,
}
impl Context {
/// Create an `Context` with empty environment and the given data context.
pub fn with_data(data: Map) -> Self {
Self {
env: Map::new(),
data,
}
}
/// Get the environment context.
pub fn env(&self) -> &Map {
&self.env
}
/// Get the environment context mutably.
pub fn env_mut(&mut self) -> &mut Map {
&mut self.env
}
/// Get the data context.
pub fn data(&self) -> &Map {
&self.data
}
/// Get the data context mutably.
pub fn data_mut(&mut self) -> &mut Map {
&mut self.data
}
}