-
Notifications
You must be signed in to change notification settings - Fork 39
Add support for [u8; N]
#28
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
Merged
Changes from all commits
Commits
Show all changes
2 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,225 @@ | ||
| use crate::Bytes; | ||
| use core::borrow::{Borrow, BorrowMut}; | ||
| use core::cmp::Ordering; | ||
| use core::convert::TryInto; | ||
| use core::fmt::{self, Debug}; | ||
| use core::hash::{Hash, Hasher}; | ||
| use core::ops::{Deref, DerefMut}; | ||
|
|
||
| use serde::de::{Deserialize, Deserializer, Error, SeqAccess, Visitor}; | ||
| use serde::ser::{Serialize, Serializer}; | ||
|
|
||
| /// Wrapper around `[u8; N]` to serialize and deserialize efficiently. | ||
| /// | ||
| /// ``` | ||
| /// use std::collections::HashMap; | ||
| /// use std::io; | ||
| /// | ||
| /// use serde_bytes::ByteArray; | ||
| /// | ||
| /// fn deserialize_bytearrays() -> bincode::Result<()> { | ||
| /// let example_data = [ | ||
| /// 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 116, | ||
| /// 119, 111, 1, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 111, 110, 101 | ||
| /// ]; | ||
| /// | ||
| /// let map: HashMap<u32, ByteArray<3>> = bincode::deserialize(&example_data[..])?; | ||
| /// | ||
| /// println!("{:?}", map); | ||
| /// | ||
| /// Ok(()) | ||
| /// } | ||
| /// # | ||
| /// # fn main() { | ||
| /// # deserialize_bytearrays().unwrap(); | ||
| /// # } | ||
| /// ``` | ||
| #[derive(Clone, Eq, Ord)] | ||
| pub struct ByteArray<const N: usize> { | ||
| bytes: [u8; N], | ||
| } | ||
|
|
||
| impl<const N: usize> ByteArray<N> { | ||
| /// Transform an [array](https://doc.rust-lang.org/stable/std/primitive.array.html) to the equivalent `ByteArray` | ||
| pub fn new(bytes: [u8; N]) -> Self { | ||
| Self { bytes } | ||
| } | ||
|
|
||
| /// Wrap existing bytes into a `ByteArray` | ||
| pub fn from<T: Into<[u8; N]>>(bytes: T) -> Self { | ||
| Self { | ||
| bytes: bytes.into(), | ||
| } | ||
| } | ||
|
|
||
| /// Unwraps the byte array underlying this `ByteArray` | ||
| pub fn into_array(self) -> [u8; N] { | ||
| self.bytes | ||
| } | ||
| } | ||
|
|
||
| impl<const N: usize> Debug for ByteArray<N> { | ||
| fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result { | ||
| Debug::fmt(&self.bytes, f) | ||
| } | ||
| } | ||
|
|
||
| impl<const N: usize> AsRef<[u8; N]> for ByteArray<N> { | ||
| fn as_ref(&self) -> &[u8; N] { | ||
| &self.bytes | ||
| } | ||
| } | ||
| impl<const N: usize> AsMut<[u8; N]> for ByteArray<N> { | ||
| fn as_mut(&mut self) -> &mut [u8; N] { | ||
| &mut self.bytes | ||
| } | ||
| } | ||
|
|
||
| impl<const N: usize> Borrow<[u8; N]> for ByteArray<N> { | ||
| fn borrow(&self) -> &[u8; N] { | ||
| &self.bytes | ||
| } | ||
| } | ||
| impl<const N: usize> BorrowMut<[u8; N]> for ByteArray<N> { | ||
| fn borrow_mut(&mut self) -> &mut [u8; N] { | ||
| &mut self.bytes | ||
| } | ||
| } | ||
|
|
||
| impl<const N: usize> Deref for ByteArray<N> { | ||
| type Target = [u8; N]; | ||
|
|
||
| fn deref(&self) -> &Self::Target { | ||
| &self.bytes | ||
| } | ||
| } | ||
|
|
||
| impl<const N: usize> DerefMut for ByteArray<N> { | ||
| fn deref_mut(&mut self) -> &mut Self::Target { | ||
| &mut self.bytes | ||
| } | ||
| } | ||
|
|
||
| impl<const N: usize> Borrow<Bytes> for ByteArray<N> { | ||
| fn borrow(&self) -> &Bytes { | ||
| Bytes::new(&self.bytes) | ||
| } | ||
| } | ||
|
|
||
| impl<const N: usize> BorrowMut<Bytes> for ByteArray<N> { | ||
| fn borrow_mut(&mut self) -> &mut Bytes { | ||
| unsafe { &mut *(&mut self.bytes as &mut [u8] as *mut [u8] as *mut Bytes) } | ||
| } | ||
| } | ||
|
|
||
| impl<Rhs, const N: usize> PartialEq<Rhs> for ByteArray<N> | ||
| where | ||
| Rhs: ?Sized + Borrow<[u8; N]>, | ||
| { | ||
| fn eq(&self, other: &Rhs) -> bool { | ||
| self.as_ref().eq(other.borrow()) | ||
| } | ||
| } | ||
|
|
||
| impl<Rhs, const N: usize> PartialOrd<Rhs> for ByteArray<N> | ||
| where | ||
| Rhs: ?Sized + Borrow<[u8; N]>, | ||
| { | ||
| fn partial_cmp(&self, other: &Rhs) -> Option<Ordering> { | ||
| self.as_ref().partial_cmp(other.borrow()) | ||
| } | ||
| } | ||
|
|
||
| impl<const N: usize> Hash for ByteArray<N> { | ||
| fn hash<H: Hasher>(&self, state: &mut H) { | ||
| self.bytes.hash(state); | ||
| } | ||
| } | ||
|
|
||
| impl<const N: usize> IntoIterator for ByteArray<N> { | ||
| type Item = u8; | ||
| type IntoIter = <[u8; N] as IntoIterator>::IntoIter; | ||
|
|
||
| fn into_iter(self) -> Self::IntoIter { | ||
| IntoIterator::into_iter(self.bytes) | ||
| } | ||
| } | ||
|
|
||
| impl<'a, const N: usize> IntoIterator for &'a ByteArray<N> { | ||
| type Item = &'a u8; | ||
| type IntoIter = <&'a [u8; N] as IntoIterator>::IntoIter; | ||
|
|
||
| fn into_iter(self) -> Self::IntoIter { | ||
| self.bytes.iter() | ||
| } | ||
| } | ||
|
|
||
| impl<'a, const N: usize> IntoIterator for &'a mut ByteArray<N> { | ||
| type Item = &'a mut u8; | ||
| type IntoIter = <&'a mut [u8; N] as IntoIterator>::IntoIter; | ||
|
|
||
| fn into_iter(self) -> Self::IntoIter { | ||
| self.bytes.iter_mut() | ||
| } | ||
| } | ||
|
|
||
| impl<const N: usize> Serialize for ByteArray<N> { | ||
| fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error> | ||
| where | ||
| S: Serializer, | ||
| { | ||
| serializer.serialize_bytes(&self.bytes) | ||
| } | ||
| } | ||
|
|
||
| struct ByteArrayVisitor<const N: usize>; | ||
|
|
||
| impl<'de, const N: usize> Visitor<'de> for ByteArrayVisitor<N> { | ||
| type Value = ByteArray<N>; | ||
|
|
||
| fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result { | ||
| write!(formatter, "a byte array of length {}", N) | ||
| } | ||
|
|
||
| fn visit_seq<V>(self, mut seq: V) -> Result<ByteArray<N>, V::Error> | ||
| where | ||
| V: SeqAccess<'de>, | ||
| { | ||
| let mut bytes = [0; N]; | ||
|
|
||
| for (idx, byte) in bytes.iter_mut().enumerate() { | ||
| *byte = seq | ||
| .next_element()? | ||
| .ok_or_else(|| V::Error::invalid_length(idx, &self))?; | ||
| } | ||
|
|
||
| Ok(ByteArray::from(bytes)) | ||
| } | ||
|
|
||
| fn visit_bytes<E>(self, v: &[u8]) -> Result<ByteArray<N>, E> | ||
| where | ||
| E: Error, | ||
| { | ||
| Ok(ByteArray { | ||
| bytes: v | ||
| .try_into() | ||
| .map_err(|_| E::invalid_length(v.len(), &self))?, | ||
| }) | ||
| } | ||
|
|
||
| fn visit_str<E>(self, v: &str) -> Result<ByteArray<N>, E> | ||
| where | ||
| E: Error, | ||
| { | ||
| self.visit_bytes(v.as_bytes()) | ||
| } | ||
| } | ||
|
|
||
| impl<'de, const N: usize> Deserialize<'de> for ByteArray<N> { | ||
| fn deserialize<D>(deserializer: D) -> Result<ByteArray<N>, D::Error> | ||
| where | ||
| D: Deserializer<'de>, | ||
| { | ||
| deserializer.deserialize_bytes(ByteArrayVisitor::<N>) | ||
| } | ||
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Uh oh!
There was an error while loading. Please reload this page.