petitset 0.2.1

An ordered set data structure, optimized for stack-allocated storage of a tiny number of elements with a fixed cap.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14

extern crate alloc;

use alloc::vec::Vec;
use petitset::PetitSet;

/// Is this set sorted when iterated over?
pub fn is_sorted<T: PartialEq + Clone + Copy + Ord, const CAP: usize>(
    set: &PetitSet<T, CAP>,
) -> bool {
    let vec: Vec<&T> = set.iter().collect();
    let mut sorted_vec = vec.clone();
    sorted_vec.sort();
    vec == sorted_vec
}