15487210020

Committed 06 Jun 2025 09:19AM UTC coverage: 59.521% (+0.06%) from 59.46%

Build # 15487210020

Build Type

push

github

Committed by

fasterthanlime

Commit Message

Introduced sized/unsized ValueVTable variants

Co-Authored-By: Asger Hautop Drewsen <asger@tyilo.com>

Run Details

375 of 811 new or added lines in 32 files covered. (46.24%)

9 existing lines in 4 files now uncovered.

10537 of 17703 relevant lines covered (59.52%)

150.52 hits per line

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

56.29

/facet-core/src/impls_alloc/btreeset.rs

use core::hash::Hash;

use alloc::boxed::Box;
use alloc::collections::BTreeSet;

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

use crate::{
    Def, Facet, IterVTable, MarkerTraits, SetDef, SetVTable, Shape, Type, TypeParam, UserType,
    VTableView, ValueVTable,
};

type BTreeSetIterator<'mem, T> = alloc::collections::btree_set::Iter<'mem, T>;

unsafe impl<'a, T> Facet<'a> for BTreeSet<T>
where
    T: Facet<'a> + core::cmp::Eq + core::cmp::Ord,
{
    const VTABLE: &'static ValueVTable = &const {
        ValueVTable::builder::<Self>()
            .marker_traits(|| {
                MarkerTraits::SEND
                    .union(MarkerTraits::SYNC)
                    .union(MarkerTraits::EQ)
                    .union(MarkerTraits::UNPIN)
                    .intersection(T::SHAPE.vtable.marker_traits())
            })
            .type_name(|f, opts| {
                if let Some(opts) = opts.for_children() {
                    write!(f, "{}<", Self::SHAPE.type_identifier)?;
                    T::SHAPE.vtable.type_name()(f, opts)?;
                    write!(f, ">")
                } else {
                    write!(f, "{}<⋯>", Self::SHAPE.type_identifier)
                }
            })
            .default_in_place(|| Some(|target| unsafe { target.put(Self::default()) }))
            .partial_eq(|| Some(|a, b| a == b))
            .debug(|| {
                if T::SHAPE.vtable.has_debug() {
                    Some(|value, f| {
                        let t_debug = <VTableView<T>>::of().debug().unwrap();
                        write!(f, "{{")?;
                        for (i, item) in value.iter().enumerate() {
                            if i > 0 {
                                write!(f, ", ")?;
                            }
                            (t_debug)(item, f)?;
                        }
                        write!(f, "}}")
                    })
                } else {
                    None
                }
            })
            .clone_into(|| {
                if T::SHAPE.vtable.has_clone_into() {
                    Some(|src, dst| unsafe {
                        let set = src;
                        let mut new_set = BTreeSet::new();

                        let t_clone_into = <VTableView<T>>::of().clone_into().unwrap();

                        for item in set {
                            use crate::TypedPtrUninit;
                            use core::mem::MaybeUninit;

                            let mut new_item = MaybeUninit::<T>::uninit();
                            let uninit_item = TypedPtrUninit::new(new_item.as_mut_ptr());

                            (t_clone_into)(item, uninit_item);

                            new_set.insert(new_item.assume_init());
                        }

                        dst.put(new_set)
                    })
                } else {
                    None
                }
            })
            .hash(|| {
                if T::SHAPE.vtable.has_hash() {
                    Some(|set, hasher_this, hasher_write_fn| unsafe {
                        use crate::HasherProxy;
                        let t_hash = <VTableView<T>>::of().hash().unwrap();
                        let mut hasher = HasherProxy::new(hasher_this, hasher_write_fn);
                        set.len().hash(&mut hasher);
                        for item in set {
                            (t_hash)(item, hasher_this, hasher_write_fn);
                        }
                    })
                } else {
                    None
                }
            })
            .build()
    };

    const SHAPE: &'static Shape<'static> = &const {
        Shape::builder_for_sized::<Self>()
            .type_identifier("BTreeSet")
            .type_params(&[TypeParam {
                name: "T",
                shape: || T::SHAPE,
            }])
            .ty(Type::User(UserType::Opaque))
            .def(Def::Set(
                SetDef::builder()
                    .t(|| T::SHAPE)
                    .vtable(
                        &const {
                            SetVTable::builder()
                                .init_in_place_with_capacity(|uninit, _capacity| unsafe {
                                    uninit.put(Self::new())
                                })
                                .insert(|ptr, item| unsafe {
                                    let set = ptr.as_mut::<BTreeSet<T>>();
                                    let item = item.read::<T>();
                                    set.insert(item)
                                })
                                .len(|ptr| unsafe {
                                    let set = ptr.get::<BTreeSet<T>>();
                                    set.len()
                                })
                                .contains(|ptr, item| unsafe {
                                    let set = ptr.get::<BTreeSet<T>>();
                                    set.contains(item.get())
                                })
                                .iter_vtable(
                                    IterVTable::builder()
                                        .init_with_value(|ptr| {
                                            let set = unsafe { ptr.get::<BTreeSet<T>>() };
                                            let iter: BTreeSetIterator<'_, T> = set.iter();
                                            let iter_state = Box::new(iter);
                                            PtrMut::new(Box::into_raw(iter_state) as *mut u8)
                                        })
                                        .next(|iter_ptr| {
                                            let state = unsafe {
                                                iter_ptr.as_mut::<BTreeSetIterator<'_, T>>()
                                            };
                                            state
                                                .next()
                                                .map(|value| PtrConst::new(value as *const T))
                                        })
                                        .next_back(|iter_ptr| {
                                            let state = unsafe {
                                                iter_ptr.as_mut::<BTreeSetIterator<'_, T>>()
                                            };
                                            state
                                                .next_back()
                                                .map(|value| PtrConst::new(value as *const T))
                                        })
                                        .dealloc(|iter_ptr| unsafe {
                                            drop(Box::from_raw(
                                                iter_ptr.as_ptr::<BTreeSetIterator<'_, T>>()
                                                    as *mut BTreeSetIterator<'_, T>,
                                            ));
                                        })
                                        .build(),
                                )
                                .build()
                        },
                    )
                    .build(),
            ))
            .build()
    };
}

#[cfg(test)]
mod tests {
    use alloc::collections::BTreeSet;
    use alloc::string::String;
    use alloc::vec::Vec;

    use super::*;

    #[test]
    fn test_btreesetset_type_params() {
        let [type_param_1] = <BTreeSet<i32>>::SHAPE.type_params else {
            panic!("BTreeSet<T> should have 1 type param")
        };
        assert_eq!(type_param_1.shape(), i32::SHAPE);
    }

    #[test]
    fn test_btreeset_vtable_1_new_insert_iter_drop() -> eyre::Result<()> {
        facet_testhelpers::setup();

        let btreeset_shape = <BTreeSet<String>>::SHAPE;
        let btreeset_def = btreeset_shape
            .def
            .into_set()
            .expect("BTreeSet<T> should have a set definition");

        // Allocate memory for the BTreeSet
        let btreeset_uninit_ptr = btreeset_shape.allocate()?;

        // Create the BTreeSet
        let btreeset_ptr =
            unsafe { (btreeset_def.vtable.init_in_place_with_capacity_fn)(btreeset_uninit_ptr, 0) };

        // The BTreeSet is empty, so ensure its length is 0
        let btreeset_actual_length =
            unsafe { (btreeset_def.vtable.len_fn)(btreeset_ptr.as_const()) };
        assert_eq!(btreeset_actual_length, 0);

        // 5 sample values to insert
        let strings = ["foo", "bar", "bazz", "fizzbuzz", "fifth thing"];

        // Insert the 5 values into the BTreeSet
        let mut btreeset_length = 0;
        for string in strings {
            // Create the value
            let mut new_value = string.to_string();

            // Insert the value
            let did_insert = unsafe {
                (btreeset_def.vtable.insert_fn)(btreeset_ptr, PtrMut::new(&raw mut new_value))
            };

            // The value now belongs to the BTreeSet, so forget it
            core::mem::forget(new_value);

            assert!(did_insert, "expected value to be inserted in the BTreeSet");

            // Ensure the BTreeSet's length increased by 1
            btreeset_length += 1;
            let btreeset_actual_length =
                unsafe { (btreeset_def.vtable.len_fn)(btreeset_ptr.as_const()) };
            assert_eq!(btreeset_actual_length, btreeset_length);
        }

        // Insert the same 5 values again, ensuring they are deduplicated
        for string in strings {
            // Create the value
            let mut new_value = string.to_string();

            // Try to insert the value
            let did_insert = unsafe {
                (btreeset_def.vtable.insert_fn)(btreeset_ptr, PtrMut::new(&raw mut new_value))
            };

            // The value now belongs to the BTreeSet, so forget it
            core::mem::forget(new_value);

            assert!(
                !did_insert,
                "expected value to not be inserted in the BTreeSet"
            );

            // Ensure the BTreeSet's length did not increase
            let btreeset_actual_length =
                unsafe { (btreeset_def.vtable.len_fn)(btreeset_ptr.as_const()) };
            assert_eq!(btreeset_actual_length, btreeset_length);
        }

        // Create a new iterator over the BTreeSet
        let iter_init_with_value_fn = btreeset_def.vtable.iter_vtable.init_with_value.unwrap();
        let btreeset_iter_ptr = unsafe { iter_init_with_value_fn(btreeset_ptr.as_const()) };

        // Collect all the items from the BTreeSet's iterator
        let mut iter_items = Vec::<&str>::new();
        loop {
            // Get the next item from the iterator
            let item_ptr = unsafe { (btreeset_def.vtable.iter_vtable.next)(btreeset_iter_ptr) };
            let Some(item_ptr) = item_ptr else {
                break;
            };

            let item = unsafe { item_ptr.get::<String>() };

            // Add the item into the list of items returned from the iterator
            iter_items.push(&**item);
        }

        // Deallocate the iterator
        unsafe {
            (btreeset_def.vtable.iter_vtable.dealloc)(btreeset_iter_ptr);
        }

        // BTrees iterate in sorted order, so ensure the iterator returned
        // each item in order
        let mut strings_sorted = strings.to_vec();
        strings_sorted.sort();
        assert_eq!(iter_items, strings_sorted);

        // Get the function pointer for dropping the BTreeSet
        let drop_fn = (btreeset_shape.vtable.sized().unwrap().drop_in_place)()
            .expect("BTreeSet<T> should have drop_in_place");

        // Drop the BTreeSet in place
        unsafe { drop_fn(btreeset_ptr) };

        // Deallocate the memory
        unsafe { btreeset_shape.deallocate_mut(btreeset_ptr)? };

        Ok(())
    }
}

1	use core::hash::Hash;
2
3	use alloc::boxed::Box;
4	use alloc::collections::BTreeSet;
5
6	use crate::ptr::{PtrConst, PtrMut};
7
8	use crate::{
9	Def, Facet, IterVTable, MarkerTraits, SetDef, SetVTable, Shape, Type, TypeParam, UserType,
10	VTableView, ValueVTable,
11	};
12
13	type BTreeSetIterator<'mem, T> = alloc::collections::btree_set::Iter<'mem, T>;
14
15	unsafe impl<'a, T> Facet<'a> for BTreeSet<T>
16	where
17	T: Facet<'a> + core::cmp::Eq + core::cmp::Ord,
18	{
19	const VTABLE: &'static ValueVTable = &const {
20	ValueVTable::builder::<Self>()
21	.marker_traits(\|\| {	×
22	MarkerTraits::SEND
23	.union(MarkerTraits::SYNC)	×
24	.union(MarkerTraits::EQ)	×
25	.union(MarkerTraits::UNPIN)	×
26	.intersection(T::SHAPE.vtable.marker_traits())	×
27	})	×
28	.type_name(\|f, opts\| {	×
29	if let Some(opts) = opts.for_children() {	×
30	write!(f, "{}<", Self::SHAPE.type_identifier)?;	×
NEW 31	T::SHAPE.vtable.type_name()(f, opts)?;	×
32	write!(f, ">")	×
33	} else {
34	write!(f, "{}<⋯>", Self::SHAPE.type_identifier)	×
35	}
36	})	×
37	.default_in_place(\|\| Some(\|target\| unsafe { target.put(Self::default()) }))	×
38	.partial_eq(\|\| Some(\|a, b\| a == b))	×
39	.debug(\|\| {	×
NEW 40	if T::SHAPE.vtable.has_debug() {	×
41	Some(\|value, f\| {	×
42	let t_debug = <VTableView<T>>::of().debug().unwrap();	×
43	write!(f, "{{")?;	×
44	for (i, item) in value.iter().enumerate() {	×
45	if i > 0 {	×
46	write!(f, ", ")?;	×
47	}	×
48	(t_debug)(item, f)?;	×
49	}
50	write!(f, "}}")	×
51	})	×
52	} else {
53	None	×
54	}
55	})	×
56	.clone_into(\|\| {	×
NEW 57	if T::SHAPE.vtable.has_clone_into() {	×
58	Some(\|src, dst\| unsafe {
59	let set = src;	×
60	let mut new_set = BTreeSet::new();	×
61
62	let t_clone_into = <VTableView<T>>::of().clone_into().unwrap();	×
63
64	for item in set {	×
65	use crate::TypedPtrUninit;
66	use core::mem::MaybeUninit;
67
68	let mut new_item = MaybeUninit::<T>::uninit();	×
69	let uninit_item = TypedPtrUninit::new(new_item.as_mut_ptr());	×
70
71	(t_clone_into)(item, uninit_item);	×
72
73	new_set.insert(new_item.assume_init());	×
74	}
75
76	dst.put(new_set)	×
77	})	×
78	} else {
79	None	×
80	}
81	})	×
82	.hash(\|\| {	×
NEW 83	if T::SHAPE.vtable.has_hash() {	×
84	Some(\|set, hasher_this, hasher_write_fn\| unsafe {
85	use crate::HasherProxy;
86	let t_hash = <VTableView<T>>::of().hash().unwrap();	×
87	let mut hasher = HasherProxy::new(hasher_this, hasher_write_fn);	×
88	set.len().hash(&mut hasher);	×
89	for item in set {	×
90	(t_hash)(item, hasher_this, hasher_write_fn);	×
91	}	×
92	})	×
93	} else {
94	None	×
95	}
96	})	×
97	.build()
98	};
99
100	const SHAPE: &'static Shape<'static> = &const {
101	Shape::builder_for_sized::<Self>()
102	.type_identifier("BTreeSet")
103	.type_params(&[TypeParam {
104	name: "T",
105	shape: \|\| T::SHAPE,
106	}])
107	.ty(Type::User(UserType::Opaque))
108	.def(Def::Set(
109	SetDef::builder()
110	.t(\|\| T::SHAPE)
111	.vtable(
112	&const {
113	SetVTable::builder()
114	.init_in_place_with_capacity(\|uninit, _capacity\| unsafe {
115	uninit.put(Self::new())	1✔
116	})	1✔
117	.insert(\|ptr, item\| unsafe {
118	let set = ptr.as_mut::<BTreeSet<T>>();	10✔
119	let item = item.read::<T>();	10✔
120	set.insert(item)	10✔
121	})	10✔
122	.len(\|ptr\| unsafe {
123	let set = ptr.get::<BTreeSet<T>>();	11✔
124	set.len()	11✔
125	})	11✔
126	.contains(\|ptr, item\| unsafe {
127	let set = ptr.get::<BTreeSet<T>>();	×
128	set.contains(item.get())	×
129	})	×
130	.iter_vtable(
131	IterVTable::builder()
132	.init_with_value(\|ptr\| {	1✔
133	let set = unsafe { ptr.get::<BTreeSet<T>>() };	1✔
134	let iter: BTreeSetIterator<'_, T> = set.iter();	1✔
135	let iter_state = Box::new(iter);	1✔
136	PtrMut::new(Box::into_raw(iter_state) as *mut u8)	1✔
137	})	1✔
138	.next(\|iter_ptr\| {	6✔
139	let state = unsafe {	6✔
140	iter_ptr.as_mut::<BTreeSetIterator<'_, T>>()	6✔
141	};
142	state	6✔
143	.next()	6✔
144	.map(\|value\| PtrConst::new(value as *const T))	6✔
145	})	6✔
146	.next_back(\|iter_ptr\| {	×
147	let state = unsafe {	×
148	iter_ptr.as_mut::<BTreeSetIterator<'_, T>>()	×
149	};
150	state	×
151	.next_back()	×
152	.map(\|value\| PtrConst::new(value as *const T))	×
153	})	×
154	.dealloc(\|iter_ptr\| unsafe {
155	drop(Box::from_raw(	1✔
156	iter_ptr.as_ptr::<BTreeSetIterator<'_, T>>()	1✔
157	as *mut BTreeSetIterator<'_, T>,	1✔
158	));
159	})	1✔
160	.build(),
161	)
162	.build()
163	},
164	)
165	.build(),
166	))
167	.build()
168	};
169	}
170
171	#[cfg(test)]
172	mod tests {
173	use alloc::collections::BTreeSet;
174	use alloc::string::String;
175	use alloc::vec::Vec;
176
177	use super::*;
178
179	#[test]
180	fn test_btreesetset_type_params() {	1✔
181	let [type_param_1] = <BTreeSet<i32>>::SHAPE.type_params else {	1✔
182	panic!("BTreeSet<T> should have 1 type param")	×
183	};
184	assert_eq!(type_param_1.shape(), i32::SHAPE);	1✔
185	}	1✔
186
187	#[test]
188	fn test_btreeset_vtable_1_new_insert_iter_drop() -> eyre::Result<()> {	1✔
189	facet_testhelpers::setup();	1✔
190
191	let btreeset_shape = <BTreeSet<String>>::SHAPE;	1✔
192	let btreeset_def = btreeset_shape	1✔
193	.def	1✔
194	.into_set()	1✔
195	.expect("BTreeSet<T> should have a set definition");	1✔
196
197	// Allocate memory for the BTreeSet
198	let btreeset_uninit_ptr = btreeset_shape.allocate()?;	1✔
199
200	// Create the BTreeSet
201	let btreeset_ptr =	1✔
202	unsafe { (btreeset_def.vtable.init_in_place_with_capacity_fn)(btreeset_uninit_ptr, 0) };	1✔
203
204	// The BTreeSet is empty, so ensure its length is 0
205	let btreeset_actual_length =	1✔
206	unsafe { (btreeset_def.vtable.len_fn)(btreeset_ptr.as_const()) };	1✔
207	assert_eq!(btreeset_actual_length, 0);	1✔
208
209	// 5 sample values to insert
210	let strings = ["foo", "bar", "bazz", "fizzbuzz", "fifth thing"];	1✔
211
212	// Insert the 5 values into the BTreeSet
213	let mut btreeset_length = 0;	1✔
214	for string in strings {	6✔
215	// Create the value
216	let mut new_value = string.to_string();	5✔
217
218	// Insert the value
219	let did_insert = unsafe {	5✔
220	(btreeset_def.vtable.insert_fn)(btreeset_ptr, PtrMut::new(&raw mut new_value))	5✔
221	};
222
223	// The value now belongs to the BTreeSet, so forget it
224	core::mem::forget(new_value);	5✔
225
226	assert!(did_insert, "expected value to be inserted in the BTreeSet");	5✔
227
228	// Ensure the BTreeSet's length increased by 1
229	btreeset_length += 1;	5✔
230	let btreeset_actual_length =	5✔
231	unsafe { (btreeset_def.vtable.len_fn)(btreeset_ptr.as_const()) };	5✔
232	assert_eq!(btreeset_actual_length, btreeset_length);	5✔
233	}
234
235	// Insert the same 5 values again, ensuring they are deduplicated
236	for string in strings {	6✔
237	// Create the value
238	let mut new_value = string.to_string();	5✔
239
240	// Try to insert the value
241	let did_insert = unsafe {	5✔
242	(btreeset_def.vtable.insert_fn)(btreeset_ptr, PtrMut::new(&raw mut new_value))	5✔
243	};
244
245	// The value now belongs to the BTreeSet, so forget it
246	core::mem::forget(new_value);	5✔
247
248	assert!(	5✔
249	!did_insert,	5✔
250	"expected value to not be inserted in the BTreeSet"	×
251	);
252
253	// Ensure the BTreeSet's length did not increase
254	let btreeset_actual_length =	5✔
255	unsafe { (btreeset_def.vtable.len_fn)(btreeset_ptr.as_const()) };	5✔
256	assert_eq!(btreeset_actual_length, btreeset_length);	5✔
257	}
258
259	// Create a new iterator over the BTreeSet
260	let iter_init_with_value_fn = btreeset_def.vtable.iter_vtable.init_with_value.unwrap();	1✔
261	let btreeset_iter_ptr = unsafe { iter_init_with_value_fn(btreeset_ptr.as_const()) };	1✔
262
263	// Collect all the items from the BTreeSet's iterator
264	let mut iter_items = Vec::<&str>::new();	1✔
265	loop {
266	// Get the next item from the iterator
267	let item_ptr = unsafe { (btreeset_def.vtable.iter_vtable.next)(btreeset_iter_ptr) };	6✔
268	let Some(item_ptr) = item_ptr else {	6✔
269	break;	1✔
270	};
271
272	let item = unsafe { item_ptr.get::<String>() };	5✔
273
274	// Add the item into the list of items returned from the iterator
275	iter_items.push(&**item);	5✔
276	}
277
278	// Deallocate the iterator
279	unsafe {	1✔
280	(btreeset_def.vtable.iter_vtable.dealloc)(btreeset_iter_ptr);	1✔
281	}	1✔
282
283	// BTrees iterate in sorted order, so ensure the iterator returned
284	// each item in order
285	let mut strings_sorted = strings.to_vec();	1✔
286	strings_sorted.sort();	1✔
287	assert_eq!(iter_items, strings_sorted);	1✔
288
289	// Get the function pointer for dropping the BTreeSet
290	let drop_fn = (btreeset_shape.vtable.sized().unwrap().drop_in_place)()	1✔
291	.expect("BTreeSet<T> should have drop_in_place");	1✔
292
293	// Drop the BTreeSet in place
294	unsafe { drop_fn(btreeset_ptr) };	1✔
295
296	// Deallocate the memory
297	unsafe { btreeset_shape.deallocate_mut(btreeset_ptr)? };	1✔
298
299	Ok(())	1✔
300	}	1✔
301	}

facet-rs / facet / 15487210020

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