14459841398

Committed 15 Apr 2025 02:20AM UTC coverage: 30.835% (+0.7%) from 30.122%

Build # 14459841398

Build Type

push

github

Committed by

web-flow

Commit Message

Rename opaque to ptr, closes #221 (#222)

Run Details

47 of 344 new or added lines in 20 files covered. (13.66%)

1 existing line in 1 file now uncovered.

2032 of 6590 relevant lines covered (30.83%)

25.82 hits per line

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

74.68

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

use alloc::collections::VecDeque;
use core::{alloc::Layout, hash::Hash};
use std::collections::HashMap;
use std::hash::RandomState;

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

use crate::{
    ConstTypeId, Def, Facet, MapDef, MapIterVTable, MapVTable, MarkerTraits, ScalarAffinity,
    ScalarDef, Shape, ValueVTable, value_vtable,
};

struct HashMapIterator<'mem, K> {
    map: PtrConst<'mem>,
    keys: VecDeque<&'mem K>,
}

unsafe impl<K, V, S> Facet for HashMap<K, V, S>
where
    K: Facet + core::cmp::Eq + core::hash::Hash + 'static,
    V: Facet + 'static,
    S: Facet + Default,
{
    const SHAPE: &'static Shape = &const {
        Shape::builder()
            .id(ConstTypeId::of::<HashMap<K, V, S>>())
            .layout(Layout::new::<HashMap<K, V>>())
            .vtable(
                &const {
                    let mut builder = ValueVTable::builder()
                        .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<⋯>")
                            }
                        })
                        .drop_in_place(|value| unsafe { value.drop_in_place::<HashMap<K, V>>() });

                    if K::SHAPE.vtable.debug.is_some() && V::SHAPE.vtable.debug.is_some() {
                        builder = builder.debug(|value, f| unsafe {
                            let value = value.get::<HashMap<K, V>>();
                            let k_debug = K::SHAPE.vtable.debug.unwrap_unchecked();
                            let v_debug = V::SHAPE.vtable.debug.unwrap_unchecked();
                            write!(f, "{{")?;
                            for (i, (key, val)) in value.iter().enumerate() {
                                if i > 0 {
                                    write!(f, ", ")?;
                                }
                                (k_debug)(PtrConst::new(key as *const _), f)?;
                                write!(f, ": ")?;
                                (v_debug)(PtrConst::new(val as *const _), f)?;
                            }
                            write!(f, "}}")
                        });
                    }

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

                    builder = builder
                        .clone_into(|src, dst| unsafe { dst.put(src.get::<HashMap<K, V>>()) });

                    if V::SHAPE.vtable.eq.is_some() {
                        builder = builder.eq(|a, b| unsafe {
                            let a = a.get::<HashMap<K, V>>();
                            let b = b.get::<HashMap<K, V>>();
                            let v_eq = V::SHAPE.vtable.eq.unwrap_unchecked();
                            a.len() == b.len()
                                && a.iter().all(|(key_a, val_a)| {
                                    b.get(key_a).is_some_and(|val_b| {
                                        (v_eq)(
                                            PtrConst::new(val_a as *const _),
                                            PtrConst::new(val_b as *const _),
                                        )
                                    })
                                })
                        });
                    }

                    if V::SHAPE.vtable.hash.is_some() {
                        builder = builder.hash(|value, hasher_this, hasher_write_fn| unsafe {
                            use crate::HasherProxy;
                            let map = value.get::<HashMap<K, V>>();
                            let v_hash = V::SHAPE.vtable.hash.unwrap_unchecked();
                            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)(
                                    PtrConst::new(v as *const _),
                                    hasher_this,
                                    hasher_write_fn,
                                );
                            }
                        });
                    }

                    builder.build()
                },
            )
            .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 as *const _))
                                })
                                .iter(|ptr| unsafe {
                                    let map = ptr.get::<HashMap<K, V>>();
                                    let keys: VecDeque<&K> = map.keys().collect();
                                    let iter_state = Box::new(HashMapIterator { map: ptr, keys });
                                    PtrMut::new(Box::into_raw(iter_state) as *mut u8)
                                })
                                .iter_vtable(
                                    MapIterVTable::builder()
                                        .next(|iter_ptr| unsafe {
                                            let state = iter_ptr.as_mut::<HashMapIterator<'_, K>>();
                                            let map = state.map.get::<HashMap<K, V>>();
                                            while let Some(key) = state.keys.pop_front() {
                                                if let Some(value) = map.get(key) {
                                                    return Some((
                                                        PtrConst::new(key as *const K),
                                                        PtrConst::new(value as *const V),
                                                    ));
                                                }
                                            }

                                            None
                                        })
                                        .dealloc(|iter_ptr| unsafe {
                                            drop(Box::from_raw(
                                                iter_ptr.as_ptr::<HashMapIterator<'_, K>>()
                                                    as *mut HashMapIterator<'_, K>,
                                            ));
                                        })
                                        .build(),
                                )
                                .build()
                        },
                    )
                    .build(),
            ))
            .build()
    };
}

unsafe impl Facet for RandomState {
    const SHAPE: &'static Shape = &const {
        Shape::builder()
            .id(ConstTypeId::of::<RandomState>())
            .layout(Layout::new::<Self>())
            .def(Def::Scalar(
                ScalarDef::builder()
                    .affinity(ScalarAffinity::opaque().build())
                    .build(),
            ))
            .vtable(value_vtable!((), |f, _opts| write!(f, "RandomState")))
            .build()
    };
}

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

facet-rs / facet / 14459841398

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