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
15
16
17
18
19
20
21
22
23
24

# Release Notes


## Version 0.2.1


- unbroke stable support by renaming `thiserror` and `serde` feature flags to `thiserror_compat` and `serde_compat`

## Version 0.2


- added a `std` feature, which is enabled when standard-library support is needed
- renamed `thiserror_trait` feature to `thiserror`
- added serialization and deserialization support with `serde`

## Version 0.1.2


- `PetitSet` and `PetitMap` are now hashable if the underlying types are hashable.

## Version 0.1.1


- remove pointless `Copy` bound on `PetitMap::default()`
- forbid `unsafe` code (thanks to @5225225 for the help!)

## Version 0.1


- Released!