15239697956

Committed 25 May 2025 04:10PM UTC coverage: 57.866% (+0.1%) from 57.737%

Build # 15239697956

Build Type

push

github

Committed by

fasterthanlime

Commit Message

Fix documentation links

Run Details

10078 of 17416 relevant lines covered (57.87%)

140.88 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

83.76

/facet-core/src/impls_std/hashmap.rs

use core::hash::{BuildHasher, Hash};
use std::collections::HashMap;
use std::hash::RandomState;

use crate::ptr::{PtrConst, PtrMut};

use crate::{
    Def, Facet, IterVTable, MapDef, MapVTable, MarkerTraits, ScalarAffinity, ScalarDef, Shape,
    Type, TypeParam, UserType, VTableView, ValueVTable, value_vtable,
};

type HashMapIterator<'mem, K, V> = std::collections::hash_map::Iter<'mem, K, V>;

unsafe impl<'a, K, V, S> Facet<'a> for HashMap<K, V, S>
where
    K: Facet<'a> + core::cmp::Eq + core::hash::Hash,
    V: Facet<'a>,
    S: Facet<'a> + Default + BuildHasher,
{
    const VTABLE: &'static ValueVTable = &const {
        ValueVTable::builder::<Self>()
            .marker_traits(|| {
                let arg_dependent_traits = MarkerTraits::SEND
                    .union(MarkerTraits::SYNC)
                    .union(MarkerTraits::EQ)
                    .union(MarkerTraits::UNPIN)
                    .union(MarkerTraits::UNWIND_SAFE)
                    .union(MarkerTraits::REF_UNWIND_SAFE);
                arg_dependent_traits
                    .intersection(V::SHAPE.vtable.marker_traits())
                    .intersection(K::SHAPE.vtable.marker_traits())
            })
            .type_name(|f, opts| {
                if let Some(opts) = opts.for_children() {
                    write!(f, "{}<", Self::SHAPE.type_identifier)?;
                    (K::SHAPE.vtable.type_name)(f, opts)?;
                    write!(f, ", ")?;
                    (V::SHAPE.vtable.type_name)(f, opts)?;
                    write!(f, ">")
                } else {
                    write!(f, "{}<⋯>", Self::SHAPE.type_identifier)
                }
            })
            .debug(|| {
                if (K::SHAPE.vtable.debug)().is_some() && (V::SHAPE.vtable.debug)().is_some() {
                    Some(|value, f| {
                        let k_debug = <VTableView<K>>::of().debug().unwrap();
                        let v_debug = <VTableView<V>>::of().debug().unwrap();
                        write!(f, "{{")?;
                        for (i, (key, val)) in value.iter().enumerate() {
                            if i > 0 {
                                write!(f, ", ")?;
                            }
                            (k_debug)(key, f)?;
                            write!(f, ": ")?;
                            (v_debug)(val, f)?;
                        }
                        write!(f, "}}")
                    })
                } else {
                    None
                }
            })
            .default_in_place(|| Some(|target| unsafe { target.put(Self::default()) }))
            .clone_into(|| {
                if (K::SHAPE.vtable.clone_into)().is_some()
                    && (V::SHAPE.vtable.clone_into)().is_some()
                {
                    Some(|src, dst| unsafe {
                        let map = src;
                        let mut new_map =
                            HashMap::with_capacity_and_hasher(map.len(), S::default());

                        let k_clone_into = <VTableView<K>>::of().clone_into().unwrap();
                        let v_clone_into = <VTableView<V>>::of().clone_into().unwrap();

                        for (k, v) in map {
                            use crate::TypedPtrUninit;
                            use core::mem::MaybeUninit;

                            let mut new_k = MaybeUninit::<K>::uninit();
                            let mut new_v = MaybeUninit::<V>::uninit();

                            let uninit_k = TypedPtrUninit::new(new_k.as_mut_ptr());
                            let uninit_v = TypedPtrUninit::new(new_v.as_mut_ptr());

                            (k_clone_into)(k, uninit_k);
                            (v_clone_into)(v, uninit_v);

                            new_map.insert(new_k.assume_init(), new_v.assume_init());
                        }

                        dst.put(new_map)
                    })
                } else {
                    None
                }
            })
            .eq(|| {
                if (V::SHAPE.vtable.eq)().is_some() {
                    Some(|a, b| {
                        let v_eq = <VTableView<V>>::of().eq().unwrap();
                        a.len() == b.len()
                            && a.iter().all(|(key_a, val_a)| {
                                b.get(key_a).is_some_and(|val_b| (v_eq)(val_a, val_b))
                            })
                    })
                } else {
                    None
                }
            })
            .hash(|| {
                if (V::SHAPE.vtable.hash)().is_some() {
                    Some(|map, hasher_this, hasher_write_fn| unsafe {
                        use crate::HasherProxy;
                        let v_hash = <VTableView<V>>::of().hash().unwrap();
                        let mut hasher = HasherProxy::new(hasher_this, hasher_write_fn);
                        map.len().hash(&mut hasher);
                        for (k, v) in map {
                            k.hash(&mut hasher);
                            (v_hash)(v, hasher_this, hasher_write_fn);
                        }
                    })
                } else {
                    None
                }
            })
            .build()
    };

    const SHAPE: &'static Shape<'static> = &const {
        Shape::builder_for_sized::<Self>()
            .type_identifier("HashMap")
            .type_params(&[
                TypeParam {
                    name: "K",
                    shape: || K::SHAPE,
                },
                TypeParam {
                    name: "V",
                    shape: || V::SHAPE,
                },
                TypeParam {
                    name: "S",
                    shape: || S::SHAPE,
                },
            ])
            .ty(Type::User(UserType::Opaque))
            .def(Def::Map(
                MapDef::builder()
                    .k(|| K::SHAPE)
                    .v(|| V::SHAPE)
                    .vtable(
                        &const {
                            MapVTable::builder()
                                .init_in_place_with_capacity(|uninit, capacity| unsafe {
                                    uninit
                                        .put(Self::with_capacity_and_hasher(capacity, S::default()))
                                })
                                .insert(|ptr, key, value| unsafe {
                                    let map = ptr.as_mut::<HashMap<K, V>>();
                                    let key = key.read::<K>();
                                    let value = value.read::<V>();
                                    map.insert(key, value);
                                })
                                .len(|ptr| unsafe {
                                    let map = ptr.get::<HashMap<K, V>>();
                                    map.len()
                                })
                                .contains_key(|ptr, key| unsafe {
                                    let map = ptr.get::<HashMap<K, V>>();
                                    map.contains_key(key.get())
                                })
                                .get_value_ptr(|ptr, key| unsafe {
                                    let map = ptr.get::<HashMap<K, V>>();
                                    map.get(key.get()).map(|v| PtrConst::new(v))
                                })
                                .iter_vtable(
                                    IterVTable::builder()
                                        .init_with_value(|ptr| unsafe {
                                            let map = ptr.get::<HashMap<K, V>>();
                                            let iter: HashMapIterator<'_, K, V> = map.iter();
                                            let iter_state = Box::new(iter);
                                            PtrMut::new(Box::into_raw(iter_state) as *mut u8)
                                        })
                                        .next(|iter_ptr| unsafe {
                                            let state =
                                                iter_ptr.as_mut::<HashMapIterator<'_, K, V>>();
                                            state.next().map(|(key, value)| {
                                                (
                                                    PtrConst::new(key as *const K),
                                                    PtrConst::new(value as *const V),
                                                )
                                            })
                                        })
                                        .dealloc(|iter_ptr| unsafe {
                                            drop(Box::from_raw(
                                                iter_ptr.as_ptr::<HashMapIterator<'_, K, V>>()
                                                    as *mut HashMapIterator<'_, K, V>,
                                            ));
                                        })
                                        .build(),
                                )
                                .build()
                        },
                    )
                    .build(),
            ))
            .build()
    };
}

unsafe impl Facet<'_> for RandomState {
    const VTABLE: &'static ValueVTable =
        &const { value_vtable!((), |f, _opts| write!(f, "{}", Self::SHAPE.type_identifier)) };

    const SHAPE: &'static Shape<'static> = &const {
        Shape::builder_for_sized::<Self>()
            .type_identifier("RandomState")
            .ty(Type::User(UserType::Opaque))
            .def(Def::Scalar(
                ScalarDef::builder()
                    .affinity(&const { ScalarAffinity::opaque().build() })
                    .build(),
            ))
            .build()
    };
}

1	use core::hash::{BuildHasher, Hash};
2	use std::collections::HashMap;
3	use std::hash::RandomState;
4
5	use crate::ptr::{PtrConst, PtrMut};
6
7	use crate::{
8	Def, Facet, IterVTable, MapDef, MapVTable, MarkerTraits, ScalarAffinity, ScalarDef, Shape,
9	Type, TypeParam, UserType, VTableView, ValueVTable, value_vtable,
10	};
11
12	type HashMapIterator<'mem, K, V> = std::collections::hash_map::Iter<'mem, K, V>;
13
14	unsafe impl<'a, K, V, S> Facet<'a> for HashMap<K, V, S>
15	where
16	K: Facet<'a> + core::cmp::Eq + core::hash::Hash,
17	V: Facet<'a>,
18	S: Facet<'a> + Default + BuildHasher,
19	{
20	const VTABLE: &'static ValueVTable = &const {
21	ValueVTable::builder::<Self>()
22	.marker_traits(\|\| {	4✔
23	let arg_dependent_traits = MarkerTraits::SEND	4✔
24	.union(MarkerTraits::SYNC)	4✔
25	.union(MarkerTraits::EQ)	4✔
26	.union(MarkerTraits::UNPIN)	4✔
27	.union(MarkerTraits::UNWIND_SAFE)	4✔
28	.union(MarkerTraits::REF_UNWIND_SAFE);	4✔
29	arg_dependent_traits	4✔
30	.intersection(V::SHAPE.vtable.marker_traits())	4✔
31	.intersection(K::SHAPE.vtable.marker_traits())	4✔
32	})	4✔
33	.type_name(\|f, opts\| {	37✔
34	if let Some(opts) = opts.for_children() {	37✔
35	write!(f, "{}<", Self::SHAPE.type_identifier)?;	37✔
36	(K::SHAPE.vtable.type_name)(f, opts)?;	37✔
37	write!(f, ", ")?;	37✔
38	(V::SHAPE.vtable.type_name)(f, opts)?;	37✔
39	write!(f, ">")	37✔
40	} else {
41	write!(f, "{}<⋯>", Self::SHAPE.type_identifier)	×
42	}
43	})	37✔
44	.debug(\|\| {	26✔
45	if (K::SHAPE.vtable.debug)().is_some() && (V::SHAPE.vtable.debug)().is_some() {	26✔
46	Some(\|value, f\| {	18✔
47	let k_debug = <VTableView<K>>::of().debug().unwrap();	18✔
48	let v_debug = <VTableView<V>>::of().debug().unwrap();	18✔
49	write!(f, "{{")?;	18✔
50	for (i, (key, val)) in value.iter().enumerate() {	32✔
51	if i > 0 {	32✔
52	write!(f, ", ")?;	16✔
53	}	16✔
54	(k_debug)(key, f)?;	32✔
55	write!(f, ": ")?;	32✔
56	(v_debug)(val, f)?;	32✔
57	}
58	write!(f, "}}")	18✔
59	})	18✔
60	} else {
61	None	×
62	}
63	})	26✔
64	.default_in_place(\|\| Some(\|target\| unsafe { target.put(Self::default()) }))	51✔
65	.clone_into(\|\| {	9✔
66	if (K::SHAPE.vtable.clone_into)().is_some()	9✔
67	&& (V::SHAPE.vtable.clone_into)().is_some()	9✔
68	{
69	Some(\|src, dst\| unsafe {
70	let map = src;	3✔
71	let mut new_map =	3✔
72	HashMap::with_capacity_and_hasher(map.len(), S::default());	3✔
73
74	let k_clone_into = <VTableView<K>>::of().clone_into().unwrap();	3✔
75	let v_clone_into = <VTableView<V>>::of().clone_into().unwrap();	3✔
76
77	for (k, v) in map {	8✔
78	use crate::TypedPtrUninit;
79	use core::mem::MaybeUninit;
80
81	let mut new_k = MaybeUninit::<K>::uninit();	5✔
82	let mut new_v = MaybeUninit::<V>::uninit();	5✔
83
84	let uninit_k = TypedPtrUninit::new(new_k.as_mut_ptr());	5✔
85	let uninit_v = TypedPtrUninit::new(new_v.as_mut_ptr());	5✔
86
87	(k_clone_into)(k, uninit_k);	5✔
88	(v_clone_into)(v, uninit_v);	5✔
89
90	new_map.insert(new_k.assume_init(), new_v.assume_init());	5✔
91	}
92
93	dst.put(new_map)	3✔
94	})	3✔
95	} else {
96	None	×
97	}
98	})	9✔
99	.eq(\|\| {	8✔
100	if (V::SHAPE.vtable.eq)().is_some() {	8✔
101	Some(\|a, b\| {	4✔
102	let v_eq = <VTableView<V>>::of().eq().unwrap();	4✔
103	a.len() == b.len()	4✔
104	&& a.iter().all(\|(key_a, val_a)\| {	6✔
105	b.get(key_a).is_some_and(\|val_b\| (v_eq)(val_a, val_b))	6✔
106	})	6✔
107	})	4✔
108	} else {
109	None	×
110	}
111	})	8✔
112	.hash(\|\| {	×
113	if (V::SHAPE.vtable.hash)().is_some() {	×
114	Some(\|map, hasher_this, hasher_write_fn\| unsafe {
115	use crate::HasherProxy;
116	let v_hash = <VTableView<V>>::of().hash().unwrap();	×
117	let mut hasher = HasherProxy::new(hasher_this, hasher_write_fn);	×
118	map.len().hash(&mut hasher);	×
119	for (k, v) in map {	×
120	k.hash(&mut hasher);	×
121	(v_hash)(v, hasher_this, hasher_write_fn);	×
122	}	×
123	})	×
124	} else {
125	None	×
126	}
127	})	×
128	.build()
129	};
130
131	const SHAPE: &'static Shape<'static> = &const {
132	Shape::builder_for_sized::<Self>()
133	.type_identifier("HashMap")
134	.type_params(&[
135	TypeParam {
136	name: "K",
137	shape: \|\| K::SHAPE,
138	},
139	TypeParam {
140	name: "V",
141	shape: \|\| V::SHAPE,
142	},
143	TypeParam {
144	name: "S",
145	shape: \|\| S::SHAPE,
146	},
147	])
148	.ty(Type::User(UserType::Opaque))
149	.def(Def::Map(
150	MapDef::builder()
151	.k(\|\| K::SHAPE)
152	.v(\|\| V::SHAPE)
153	.vtable(
154	&const {
155	MapVTable::builder()
156	.init_in_place_with_capacity(\|uninit, capacity\| unsafe {
157	uninit	×
158	.put(Self::with_capacity_and_hasher(capacity, S::default()))	×
159	})	×
160	.insert(\|ptr, key, value\| unsafe {
161	let map = ptr.as_mut::<HashMap<K, V>>();	50✔
162	let key = key.read::<K>();	50✔
163	let value = value.read::<V>();	50✔
164	map.insert(key, value);	50✔
165	})	50✔
166	.len(\|ptr\| unsafe {
167	let map = ptr.get::<HashMap<K, V>>();	22✔
168	map.len()	22✔
169	})	22✔
170	.contains_key(\|ptr, key\| unsafe {
171	let map = ptr.get::<HashMap<K, V>>();	8✔
172	map.contains_key(key.get())	8✔
173	})	8✔
174	.get_value_ptr(\|ptr, key\| unsafe {
175	let map = ptr.get::<HashMap<K, V>>();	8✔
176	map.get(key.get()).map(\|v\| PtrConst::new(v))	8✔
177	})	8✔
178	.iter_vtable(
179	IterVTable::builder()
180	.init_with_value(\|ptr\| unsafe {
181	let map = ptr.get::<HashMap<K, V>>();	24✔
182	let iter: HashMapIterator<'_, K, V> = map.iter();	24✔
183	let iter_state = Box::new(iter);	24✔
184	PtrMut::new(Box::into_raw(iter_state) as *mut u8)	24✔
185	})	24✔
186	.next(\|iter_ptr\| unsafe {
187	let state =	56✔
188	iter_ptr.as_mut::<HashMapIterator<'_, K, V>>();	56✔
189	state.next().map(\|(key, value)\| {	56✔
190	(	34✔
191	PtrConst::new(key as *const K),	34✔
192	PtrConst::new(value as *const V),	34✔
193	)	34✔
194	})	34✔
195	})	56✔
196	.dealloc(\|iter_ptr\| unsafe {
197	drop(Box::from_raw(	24✔
198	iter_ptr.as_ptr::<HashMapIterator<'_, K, V>>()	24✔
199	as *mut HashMapIterator<'_, K, V>,	24✔
200	));
201	})	24✔
202	.build(),
203	)
204	.build()
205	},
206	)
207	.build(),
208	))
209	.build()
210	};
211	}
212
213	unsafe impl Facet<'_> for RandomState {
214	const VTABLE: &'static ValueVTable =
215	&const { value_vtable!((), \|f, _opts\| write!(f, "{}", Self::SHAPE.type_identifier)) };	1✔
216
217	const SHAPE: &'static Shape<'static> = &const {
218	Shape::builder_for_sized::<Self>()
219	.type_identifier("RandomState")
220	.ty(Type::User(UserType::Opaque))
221	.def(Def::Scalar(
222	ScalarDef::builder()
223	.affinity(&const { ScalarAffinity::opaque().build() })
224	.build(),
225	))
226	.build()
227	};
228	}

facet-rs / facet / 15239697956

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous