forked from Orchid/orchid
Finally figured out how I want atoms to work
This commit is contained in:
@@ -6,6 +6,7 @@ use std::ops::{Range, RangeInclusive};
|
||||
use std::rc::Rc;
|
||||
use std::sync::Arc;
|
||||
|
||||
use never::Never;
|
||||
use ordered_float::{FloatCore, NotNan};
|
||||
|
||||
use crate::encode_enum;
|
||||
@@ -13,31 +14,35 @@ use crate::encode_enum;
|
||||
pub trait Decode {
|
||||
/// Decode an instance from the beginning of the buffer. Return the decoded
|
||||
/// data and the remaining buffer.
|
||||
fn decode<R: Read>(read: &mut R) -> Self;
|
||||
fn decode<R: Read + ?Sized>(read: &mut R) -> Self;
|
||||
}
|
||||
pub trait Encode {
|
||||
/// Append an instance of the struct to the buffer
|
||||
fn encode<W: Write>(&self, write: &mut W);
|
||||
fn encode<W: Write + ?Sized>(&self, write: &mut W);
|
||||
fn enc_vec(&self) -> Vec<u8> {
|
||||
let mut vec = Vec::new();
|
||||
self.encode(&mut vec);
|
||||
vec
|
||||
}
|
||||
}
|
||||
pub trait Coding: Encode + Decode + Clone {}
|
||||
pub trait Coding: Encode + Decode + Clone {
|
||||
fn get_decoder<T>(map: impl Fn(Self) -> T + 'static) -> impl Fn(&mut dyn Read) -> T {
|
||||
move |r| map(Self::decode(r))
|
||||
}
|
||||
}
|
||||
impl<T: Encode + Decode + Clone> Coding for T {}
|
||||
|
||||
macro_rules! num_impl {
|
||||
($number:ty, $size:expr) => {
|
||||
impl Decode for $number {
|
||||
fn decode<R: Read>(read: &mut R) -> Self {
|
||||
fn decode<R: Read + ?Sized>(read: &mut R) -> Self {
|
||||
let mut bytes = [0u8; $size];
|
||||
read.read_exact(&mut bytes).unwrap();
|
||||
<$number>::from_be_bytes(bytes)
|
||||
}
|
||||
}
|
||||
impl Encode for $number {
|
||||
fn encode<W: Write>(&self, write: &mut W) {
|
||||
fn encode<W: Write + ?Sized>(&self, write: &mut W) {
|
||||
write.write_all(&self.to_be_bytes()).expect("Could not write number")
|
||||
}
|
||||
}
|
||||
@@ -62,10 +67,10 @@ num_impl!(f32, 4);
|
||||
macro_rules! nonzero_impl {
|
||||
($name:ty) => {
|
||||
impl Decode for $name {
|
||||
fn decode<R: Read>(read: &mut R) -> Self { Self::new(Decode::decode(read)).unwrap() }
|
||||
fn decode<R: Read + ?Sized>(read: &mut R) -> Self { Self::new(Decode::decode(read)).unwrap() }
|
||||
}
|
||||
impl Encode for $name {
|
||||
fn encode<W: Write>(&self, write: &mut W) { self.get().encode(write) }
|
||||
fn encode<W: Write + ?Sized>(&self, write: &mut W) { self.get().encode(write) }
|
||||
}
|
||||
};
|
||||
}
|
||||
@@ -82,16 +87,18 @@ nonzero_impl!(std::num::NonZeroI64);
|
||||
nonzero_impl!(std::num::NonZeroI128);
|
||||
|
||||
impl<'a, T: Encode + 'a> Encode for &'a T {
|
||||
fn encode<W: Write>(&self, write: &mut W) { (**self).encode(write) }
|
||||
fn encode<W: Write + ?Sized>(&self, write: &mut W) { (**self).encode(write) }
|
||||
}
|
||||
impl<T: Decode + FloatCore> Decode for NotNan<T> {
|
||||
fn decode<R: Read>(read: &mut R) -> Self { NotNan::new(T::decode(read)).expect("Float was NaN") }
|
||||
fn decode<R: Read + ?Sized>(read: &mut R) -> Self {
|
||||
NotNan::new(T::decode(read)).expect("Float was NaN")
|
||||
}
|
||||
}
|
||||
impl<T: Encode + FloatCore> Encode for NotNan<T> {
|
||||
fn encode<W: Write>(&self, write: &mut W) { self.as_ref().encode(write) }
|
||||
fn encode<W: Write + ?Sized>(&self, write: &mut W) { self.as_ref().encode(write) }
|
||||
}
|
||||
impl Decode for String {
|
||||
fn decode<R: Read>(read: &mut R) -> Self {
|
||||
fn decode<R: Read + ?Sized>(read: &mut R) -> Self {
|
||||
let len = u64::decode(read).try_into().unwrap();
|
||||
let mut data = vec![0u8; len];
|
||||
read.read_exact(&mut data).unwrap();
|
||||
@@ -99,37 +106,37 @@ impl Decode for String {
|
||||
}
|
||||
}
|
||||
impl Encode for String {
|
||||
fn encode<W: Write>(&self, write: &mut W) {
|
||||
fn encode<W: Write + ?Sized>(&self, write: &mut W) {
|
||||
u64::try_from(self.len()).unwrap().encode(write);
|
||||
write.write_all(self.as_bytes()).unwrap()
|
||||
}
|
||||
}
|
||||
impl Encode for str {
|
||||
fn encode<W: Write>(&self, write: &mut W) {
|
||||
fn encode<W: Write + ?Sized>(&self, write: &mut W) {
|
||||
u64::try_from(self.len()).unwrap().encode(write);
|
||||
write.write_all(self.as_bytes()).unwrap()
|
||||
}
|
||||
}
|
||||
impl<T: Decode> Decode for Vec<T> {
|
||||
fn decode<R: Read>(read: &mut R) -> Self {
|
||||
fn decode<R: Read + ?Sized>(read: &mut R) -> Self {
|
||||
let len = u64::decode(read).try_into().unwrap();
|
||||
iter::repeat_with(|| T::decode(read)).take(len).collect()
|
||||
}
|
||||
}
|
||||
impl<T: Encode> Encode for Vec<T> {
|
||||
fn encode<W: Write>(&self, write: &mut W) {
|
||||
fn encode<W: Write + ?Sized>(&self, write: &mut W) {
|
||||
u64::try_from(self.len()).unwrap().encode(write);
|
||||
self.iter().for_each(|t| t.encode(write));
|
||||
}
|
||||
}
|
||||
impl<T: Encode> Encode for [T] {
|
||||
fn encode<W: Write>(&self, write: &mut W) {
|
||||
fn encode<W: Write + ?Sized>(&self, write: &mut W) {
|
||||
u64::try_from(self.len()).unwrap().encode(write);
|
||||
self.iter().for_each(|t| t.encode(write));
|
||||
}
|
||||
}
|
||||
impl<T: Decode> Decode for Option<T> {
|
||||
fn decode<R: Read>(read: &mut R) -> Self {
|
||||
fn decode<R: Read + ?Sized>(read: &mut R) -> Self {
|
||||
match u8::decode(read) {
|
||||
0 => None,
|
||||
1 => Some(T::decode(read)),
|
||||
@@ -138,14 +145,14 @@ impl<T: Decode> Decode for Option<T> {
|
||||
}
|
||||
}
|
||||
impl<T: Encode> Encode for Option<T> {
|
||||
fn encode<W: Write>(&self, write: &mut W) {
|
||||
fn encode<W: Write + ?Sized>(&self, write: &mut W) {
|
||||
let t = if let Some(t) = self { t } else { return 0u8.encode(write) };
|
||||
1u8.encode(write);
|
||||
t.encode(write);
|
||||
}
|
||||
}
|
||||
impl<T: Decode, E: Decode> Decode for Result<T, E> {
|
||||
fn decode<R: Read>(read: &mut R) -> Self {
|
||||
fn decode<R: Read + ?Sized>(read: &mut R) -> Self {
|
||||
match u8::decode(read) {
|
||||
0 => Self::Ok(T::decode(read)),
|
||||
1 => Self::Err(E::decode(read)),
|
||||
@@ -155,7 +162,7 @@ impl<T: Decode, E: Decode> Decode for Result<T, E> {
|
||||
}
|
||||
|
||||
impl<T: Encode, E: Encode> Encode for Result<T, E> {
|
||||
fn encode<W: Write>(&self, write: &mut W) {
|
||||
fn encode<W: Write + ?Sized>(&self, write: &mut W) {
|
||||
match self {
|
||||
Ok(t) => encode_enum(write, 0, |w| t.encode(w)),
|
||||
Err(e) => encode_enum(write, 1, |w| e.encode(w)),
|
||||
@@ -163,13 +170,13 @@ impl<T: Encode, E: Encode> Encode for Result<T, E> {
|
||||
}
|
||||
}
|
||||
impl<K: Decode + Eq + Hash, V: Decode> Decode for HashMap<K, V> {
|
||||
fn decode<R: Read>(read: &mut R) -> Self {
|
||||
fn decode<R: Read + ?Sized>(read: &mut R) -> Self {
|
||||
let len = u64::decode(read).try_into().unwrap();
|
||||
iter::repeat_with(|| <(K, V)>::decode(read)).take(len).collect()
|
||||
}
|
||||
}
|
||||
impl<K: Encode + Eq + Hash, V: Encode> Encode for HashMap<K, V> {
|
||||
fn encode<W: Write>(&self, write: &mut W) {
|
||||
fn encode<W: Write + ?Sized>(&self, write: &mut W) {
|
||||
u64::try_from(self.len()).unwrap().encode(write);
|
||||
self.iter().for_each(|pair| pair.encode(write));
|
||||
}
|
||||
@@ -177,10 +184,10 @@ impl<K: Encode + Eq + Hash, V: Encode> Encode for HashMap<K, V> {
|
||||
macro_rules! tuple {
|
||||
(($($t:ident)*) ($($T:ident)*)) => {
|
||||
impl<$($T: Decode),*> Decode for ($($T,)*) {
|
||||
fn decode<R: Read>(read: &mut R) -> Self { ($($T::decode(read),)*) }
|
||||
fn decode<R: Read + ?Sized>(read: &mut R) -> Self { ($($T::decode(read),)*) }
|
||||
}
|
||||
impl<$($T: Encode),*> Encode for ($($T,)*) {
|
||||
fn encode<W: Write>(&self, write: &mut W) {
|
||||
fn encode<W: Write + ?Sized>(&self, write: &mut W) {
|
||||
let ($($t,)*) = self;
|
||||
$( $t.encode(write); )*
|
||||
}
|
||||
@@ -206,41 +213,49 @@ tuple!((t u v x y z a b c d e f g h i) (T U V X Y Z A B C D E F G H I));
|
||||
tuple!((t u v x y z a b c d e f g h i j) (T U V X Y Z A B C D E F G H I J)); // 16
|
||||
|
||||
impl Decode for () {
|
||||
fn decode<R: Read>(_: &mut R) -> Self {}
|
||||
fn decode<R: Read + ?Sized>(_: &mut R) -> Self {}
|
||||
}
|
||||
impl Encode for () {
|
||||
fn encode<W: Write>(&self, _: &mut W) {}
|
||||
fn encode<W: Write + ?Sized>(&self, _: &mut W) {}
|
||||
}
|
||||
impl Decode for Never {
|
||||
fn decode<R: Read + ?Sized>(_: &mut R) -> Self {
|
||||
unreachable!("A value of Never cannot exist so it can't have been serialized");
|
||||
}
|
||||
}
|
||||
impl Encode for Never {
|
||||
fn encode<W: Write + ?Sized>(&self, _: &mut W) { match *self {} }
|
||||
}
|
||||
impl Decode for bool {
|
||||
fn decode<R: Read>(read: &mut R) -> Self {
|
||||
fn decode<R: Read + ?Sized>(read: &mut R) -> Self {
|
||||
let mut buf = [0];
|
||||
read.read_exact(&mut buf).unwrap();
|
||||
buf[0] != 0
|
||||
}
|
||||
}
|
||||
impl Encode for bool {
|
||||
fn encode<W: Write>(&self, write: &mut W) {
|
||||
fn encode<W: Write + ?Sized>(&self, write: &mut W) {
|
||||
write.write_all(&[if *self { 0xff } else { 0 }]).unwrap()
|
||||
}
|
||||
}
|
||||
impl<T: Decode, const N: usize> Decode for [T; N] {
|
||||
fn decode<R: Read>(read: &mut R) -> Self {
|
||||
fn decode<R: Read + ?Sized>(read: &mut R) -> Self {
|
||||
// TODO: figure out how to do this in safe rust on the stack
|
||||
((0..N).map(|_| T::decode(read)).collect::<Vec<_>>().try_into())
|
||||
.unwrap_or_else(|_| unreachable!("The length of this iterator is statically known"))
|
||||
}
|
||||
}
|
||||
impl<T: Encode, const N: usize> Encode for [T; N] {
|
||||
fn encode<W: Write>(&self, write: &mut W) { self.iter().for_each(|t| t.encode(write)) }
|
||||
fn encode<W: Write + ?Sized>(&self, write: &mut W) { self.iter().for_each(|t| t.encode(write)) }
|
||||
}
|
||||
|
||||
macro_rules! two_end_range {
|
||||
($this:ident, $name:tt, $op:tt, $start:expr, $end:expr) => {
|
||||
impl<T: Decode> Decode for $name<T> {
|
||||
fn decode<R: Read>(read: &mut R) -> Self { T::decode(read) $op T::decode(read) }
|
||||
fn decode<R: Read + ?Sized>(read: &mut R) -> Self { T::decode(read) $op T::decode(read) }
|
||||
}
|
||||
impl<T: Encode> Encode for $name<T> {
|
||||
fn encode<W: Write>(&self, write: &mut W) {
|
||||
fn encode<W: Write + ?Sized>(&self, write: &mut W) {
|
||||
let $this = self;
|
||||
($start).encode(write);
|
||||
($end).encode(write);
|
||||
@@ -255,10 +270,10 @@ two_end_range!(x, RangeInclusive, ..=, x.start(), x.end());
|
||||
macro_rules! smart_ptr {
|
||||
($name:tt) => {
|
||||
impl<T: Decode> Decode for $name<T> {
|
||||
fn decode<R: Read>(read: &mut R) -> Self { $name::new(T::decode(read)) }
|
||||
fn decode<R: Read + ?Sized>(read: &mut R) -> Self { $name::new(T::decode(read)) }
|
||||
}
|
||||
impl<T: Encode> Encode for $name<T> {
|
||||
fn encode<W: Write>(&self, write: &mut W) { (**self).encode(write) }
|
||||
fn encode<W: Write + ?Sized>(&self, write: &mut W) { (**self).encode(write) }
|
||||
}
|
||||
};
|
||||
}
|
||||
@@ -268,8 +283,8 @@ smart_ptr!(Rc);
|
||||
smart_ptr!(Box);
|
||||
|
||||
impl Decode for char {
|
||||
fn decode<R: Read>(read: &mut R) -> Self { char::from_u32(u32::decode(read)).unwrap() }
|
||||
fn decode<R: Read + ?Sized>(read: &mut R) -> Self { char::from_u32(u32::decode(read)).unwrap() }
|
||||
}
|
||||
impl Encode for char {
|
||||
fn encode<W: Write>(&self, write: &mut W) { (*self as u32).encode(write) }
|
||||
fn encode<W: Write + ?Sized>(&self, write: &mut W) { (*self as u32).encode(write) }
|
||||
}
|
||||
|
||||
@@ -2,16 +2,16 @@ use std::io::{Read, Write};
|
||||
|
||||
use crate::Encode;
|
||||
|
||||
pub fn encode_enum<W: Write>(write: &mut W, id: u8, f: impl FnOnce(&mut W)) {
|
||||
pub fn encode_enum<W: Write + ?Sized>(write: &mut W, id: u8, f: impl FnOnce(&mut W)) {
|
||||
id.encode(write);
|
||||
f(write)
|
||||
}
|
||||
|
||||
pub fn write_exact(write: &mut impl Write, bytes: &'static [u8]) {
|
||||
pub fn write_exact<W: Write + ?Sized>(write: &mut W, bytes: &'static [u8]) {
|
||||
write.write_all(bytes).expect("Failed to write exact bytes")
|
||||
}
|
||||
|
||||
pub fn read_exact(read: &mut impl Read, bytes: &'static [u8]) {
|
||||
pub fn read_exact<R: Read + ?Sized>(read: &mut R, bytes: &'static [u8]) {
|
||||
let mut data = vec![0u8; bytes.len()];
|
||||
read.read_exact(&mut data).expect("Failed to read bytes");
|
||||
assert_eq!(&data, bytes, "Wrong bytes")
|
||||
|
||||
Reference in New Issue
Block a user