mirror of
https://github.com/rust-embedded/heapless.git
synced 2025-09-30 05:50:29 +00:00
106 lines
2.4 KiB
Rust
106 lines
2.4 KiB
Rust
use crate::{
|
|
binary_heap::Kind as BinaryHeapKind, BinaryHeap, IndexMap, IndexSet, LinearMap, String, Vec,
|
|
};
|
|
use hash32::{BuildHasher, Hash};
|
|
use serde::ser::{Serialize, SerializeMap, SerializeSeq, Serializer};
|
|
|
|
// Sequential containers
|
|
|
|
impl<T, KIND, const N: usize> Serialize for BinaryHeap<T, KIND, N>
|
|
where
|
|
T: Ord + Serialize,
|
|
KIND: BinaryHeapKind,
|
|
{
|
|
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
|
|
where
|
|
S: Serializer,
|
|
{
|
|
let mut seq = serializer.serialize_seq(Some(self.len()))?;
|
|
for element in self {
|
|
seq.serialize_element(element)?;
|
|
}
|
|
seq.end()
|
|
}
|
|
}
|
|
|
|
impl<T, S, const N: usize> Serialize for IndexSet<T, S, N>
|
|
where
|
|
T: Eq + Hash + Serialize,
|
|
S: BuildHasher,
|
|
{
|
|
fn serialize<SER>(&self, serializer: SER) -> Result<SER::Ok, SER::Error>
|
|
where
|
|
SER: Serializer,
|
|
{
|
|
let mut seq = serializer.serialize_seq(Some(self.len()))?;
|
|
for element in self {
|
|
seq.serialize_element(element)?;
|
|
}
|
|
seq.end()
|
|
}
|
|
}
|
|
|
|
impl<T, const N: usize> Serialize for Vec<T, N>
|
|
where
|
|
T: Serialize,
|
|
{
|
|
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
|
|
where
|
|
S: Serializer,
|
|
{
|
|
let mut seq = serializer.serialize_seq(Some(self.len()))?;
|
|
for element in self {
|
|
seq.serialize_element(element)?;
|
|
}
|
|
seq.end()
|
|
}
|
|
}
|
|
|
|
// Dictionaries
|
|
|
|
impl<K, V, S, const N: usize> Serialize for IndexMap<K, V, S, N>
|
|
where
|
|
K: Eq + Hash + Serialize,
|
|
S: BuildHasher,
|
|
V: Serialize,
|
|
{
|
|
fn serialize<SER>(&self, serializer: SER) -> Result<SER::Ok, SER::Error>
|
|
where
|
|
SER: Serializer,
|
|
{
|
|
let mut map = serializer.serialize_map(Some(self.len()))?;
|
|
for (k, v) in self {
|
|
map.serialize_entry(k, v)?;
|
|
}
|
|
map.end()
|
|
}
|
|
}
|
|
|
|
impl<K, V, const N: usize> Serialize for LinearMap<K, V, N>
|
|
where
|
|
K: Eq + Serialize,
|
|
V: Serialize,
|
|
{
|
|
fn serialize<SER>(&self, serializer: SER) -> Result<SER::Ok, SER::Error>
|
|
where
|
|
SER: Serializer,
|
|
{
|
|
let mut map = serializer.serialize_map(Some(self.len()))?;
|
|
for (k, v) in self {
|
|
map.serialize_entry(k, v)?;
|
|
}
|
|
map.end()
|
|
}
|
|
}
|
|
|
|
// String containers
|
|
|
|
impl<const N: usize> Serialize for String<N> {
|
|
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
|
|
where
|
|
S: Serializer,
|
|
{
|
|
serializer.serialize_str(&*self)
|
|
}
|
|
}
|