15134909761

Committed 20 May 2025 10:15AM UTC coverage: 57.211% (+0.05%) from 57.157%

Build # 15134909761

Build Type

push

github

Committed by

fasterthanlime

Commit Message

Add `next_back` impl for `BTreeSet` iter

Coverage Stats

0 of 7 new or added lines in 1 file covered. (0.0%)

101 existing lines in 5 files now uncovered.

9303 of 16261 relevant lines covered (57.21%)

132.28 hits per line

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

86.36

/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 {
        let mut builder = ValueVTable::builder::<Self>()
            .marker_traits({
                let arg_dependent_traits = MarkerTraits::SEND
                    .union(MarkerTraits::SYNC)
                    .union(MarkerTraits::EQ)
                    .union(MarkerTraits::UNPIN);
                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, "HashMap<")?;
                    (K::SHAPE.vtable.type_name)(f, opts)?;
                    write!(f, ", ")?;
                    (V::SHAPE.vtable.type_name)(f, opts)?;
                    write!(f, ">")
                } else {
                    write!(f, "HashMap<⋯>")
                }
            });

        if K::SHAPE.vtable.debug.is_some() && V::SHAPE.vtable.debug.is_some() {
            builder = builder.debug(|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, "}}")
            });
        }

        builder = builder.default_in_place(|target| unsafe { target.put(Self::default()) });

        if V::SHAPE.vtable.clone_into.is_some() && K::SHAPE.vtable.clone_into.is_some() {
            builder = builder.clone_into(|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)
            });
        }

        if V::SHAPE.vtable.eq.is_some() {
            builder = builder.eq(|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))
                    })
            });
        }

        if V::SHAPE.vtable.hash.is_some() {
            builder = builder.hash(|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);
                }
            });
        }

        builder.build()
    };

    const SHAPE: &'static Shape<'static> = &const {
        Shape::builder_for_sized::<Self>()
            .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, "RandomState")) };

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

facet-rs / facet / 15134909761

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