fastlz-rs 0.0.3

use core::fmt;
use core::mem;

use crate::util::*;

#[cfg(feature = "alloc")]
extern crate alloc;

#[cfg(feature = "std")]
extern crate std;

const HTAB_LOG2: usize = 13;
const HTAB_SZ: usize = 1 << HTAB_LOG2;

/// Compression errors
#[derive(Debug, PartialEq, Eq)]
#[non_exhaustive]
pub enum CompressError {
    /// The output buffer was too small to hold all the output.
    ///
    /// The output that has been written *is* valid, but has been truncated.
    OutputTooSmall,
}
impl fmt::Display for CompressError {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        match self {
            CompressError::OutputTooSmall => write!(f, "output buffer was insufficient"),
        }
    }
}
#[cfg(feature = "std")]
impl std::error::Error for CompressError {}

/// This is the actual abstraction over outputting to a slice vs a Vec
trait OutputHelper {
    fn putc(&mut self, c: u8) -> Result<(), CompressError>;
    fn put_buf(&mut self, buf: &[u8]) -> Result<(), CompressError>;
    fn poke_l2(&mut self);
}
impl<'a> OutputHelper for BufOutput<'a> {
    fn putc(&mut self, c: u8) -> Result<(), CompressError> {
        if self.pos + 1 <= self.buf.len() {
            self.buf[self.pos] = c;
            self.pos += 1;
            Ok(())
        } else {
            Err(CompressError::OutputTooSmall)
        }
    }
    fn put_buf(&mut self, buf: &[u8]) -> Result<(), CompressError> {
        let mut len = buf.len();
        let mut did_overflow = false;
        if self.pos + len > self.buf.len() {
            did_overflow = true;
            len = self.buf.len() - self.pos;
        }

        self.buf[self.pos..self.pos + len].copy_from_slice(&buf[..len]);
        self.pos += len;

        if did_overflow {
            Err(CompressError::OutputTooSmall)
        } else {
            Ok(())
        }
    }

    fn poke_l2(&mut self) {
        self.buf[0] |= 0b001_00000;
    }
}

#[cfg(feature = "alloc")]
impl OutputHelper for VecOutput {
    fn putc(&mut self, c: u8) -> Result<(), CompressError> {
        self.vec.push(c);
        Ok(())
    }
    fn put_buf(&mut self, buf: &[u8]) -> Result<(), CompressError> {
        self.vec.extend_from_slice(buf);
        Ok(())
    }

    fn poke_l2(&mut self) {
        self.vec[0] |= 0b001_00000;
    }
}

/// Level 1 output sink, to force code monomorphization
struct L1Output<O>(O);
/// Level 2 output sink, to force code monomorphization
struct L2Output<O>(O);

impl<O: OutputHelper> OutputSink<CompressError> for L1Output<O> {
    fn put_lits(&mut self, mut lits: &[u8]) -> Result<(), CompressError> {
        while lits.len() > 32 {
            self.0.putc(31)?;
            self.0.put_buf(&lits[..32])?;
            lits = &lits[32..];
        }

        debug_assert!(lits.len() >= 1);
        debug_assert!(lits.len() <= 32);

        // 1 byte opcode, len bytes literals
        self.0.putc((lits.len() - 1) as u8)?;
        self.0.put_buf(lits)?;

        Ok(())
    }

    fn put_backref(&mut self, disp: usize, mut len: usize) -> Result<(), CompressError> {
        debug_assert!(disp <= 8191);
        debug_assert!(len >= 3);

        // the length is too long for a single backref,
        // so we can break it up into multiple (with the same displacement)
        // *but* we need to keep a len >= 3 for the last one
        // we can either do extra checking, or take a slight compression ratio hit
        // with simpler code that breaks the backref into smaller-than-max chunks
        while len > 0xff + 9 {
            let b0 = 0b111_00000 | ((disp >> 8) as u8);
            let b1 = 0xff - 2;
            let b2 = disp as u8;
            self.0.putc(b0)?;
            self.0.putc(b1)?;
            self.0.putc(b2)?;
            len -= 0xff - 2 + 9;
        }

        if len <= 8 {
            // 2 bytes opcode
            let b0 = (((len - 2) << 5) | (disp >> 8)) as u8;
            let b1 = disp as u8;
            self.0.putc(b0)?;
            self.0.putc(b1)?;
        } else {
            // 3 bytes opcode
            let b0 = 0b111_00000 | ((disp >> 8) as u8);
            let b1 = (len - 9) as u8;
            let b2 = disp as u8;
            self.0.putc(b0)?;
            self.0.putc(b1)?;
            self.0.putc(b2)?;
        }

        Ok(())
    }
}

impl<O: OutputHelper> OutputSink<CompressError> for L2Output<O> {
    fn put_lits(&mut self, mut lits: &[u8]) -> Result<(), CompressError> {
        while lits.len() > 32 {
            self.0.putc(31)?;
            self.0.put_buf(&lits[..32])?;
            lits = &lits[32..];
        }

        debug_assert!(lits.len() >= 1);
        debug_assert!(lits.len() <= 32);

        // 1 byte opcode, len bytes literals
        self.0.putc((lits.len() - 1) as u8)?;
        self.0.put_buf(lits)?;

        Ok(())
    }

    fn put_backref(&mut self, disp: usize, mut len: usize) -> Result<(), CompressError> {
        debug_assert!(disp <= 8191 + 65535);
        debug_assert!(len >= 3);

        let earlydisp = usize::min(disp, 8191);
        len -= 2;
        let earlylen = usize::min(len, 7);

        let b0 = ((earlylen << 5) | (earlydisp >> 8)) as u8;
        self.0.putc(b0)?;

        if earlylen == 7 {
            len -= earlylen;
            loop {
                let blen = usize::min(len, 0xff) as u8;
                self.0.putc(blen)?;
                if blen != 0xff {
                    break;
                }
                len -= blen as usize;
            }
        }

        self.0.putc(earlydisp as u8)?;
        if earlydisp == 8191 {
            let moredisp = disp - earlydisp;
            self.0.putc((moredisp >> 8) as u8)?;
            self.0.putc(moredisp as u8)?;
        }

        Ok(())
    }
}

/// Additional parameters that need to be monomorphized into level 1 vs level 2 output
trait CompressSink {
    const MAX_DISP: usize;
    const IS_LEVEL2: bool;
    fn poke_l2(&mut self);
}
impl<O: OutputHelper> CompressSink for L1Output<O> {
    const MAX_DISP: usize = 8191;
    const IS_LEVEL2: bool = false;
    fn poke_l2(&mut self) {}
}
impl<O: OutputHelper> CompressSink for L2Output<O> {
    const MAX_DISP: usize = 8191 + 65535;
    const IS_LEVEL2: bool = true;
    fn poke_l2(&mut self) {
        self.0.poke_l2();
    }
}

/// Compression level
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum CompressionLevel {
    /// Default compression (i.e. level 1 if the input is less than 64 KiB, level 2 otherwise)
    Default,
    /// Level 1
    Level1,
    /// Level 2
    Level2,
}
impl Default for CompressionLevel {
    fn default() -> Self {
        Self::Default
    }
}

fn fastlz_hash(v: u32) -> usize {
    let h = v.wrapping_mul(2654435769);
    let h = h >> (32 - HTAB_LOG2);
    h as usize
}

trait InputHelper {
    fn inc(&mut self, n: usize);
    fn peek4(&mut self) -> Option<u32>;
}
impl InputHelper for &[u8] {
    fn inc(&mut self, n: usize) {
        *self = &self[n..];
    }
    fn peek4(&mut self) -> Option<u32> {
        let ret = u32::from_le_bytes(*self.first_chunk::<4>()?);
        Some(ret)
    }
}

/// Holds state for performing compression operations
///
/// This is only needed just in case stack overflows occur because the object is too big
pub struct CompressState {
    htab: [usize; HTAB_SZ],
}
impl CompressState {
    /// Allocate a new compression state
    pub fn new() -> Self {
        Self { htab: [0; HTAB_SZ] }
    }
    #[cfg(feature = "alloc")]
    /// Allocate a new compression state specifically on the heap
    ///
    /// This is a workaround for non-guaranteed copy elision / RVO.
    pub fn new_boxed() -> alloc::boxed::Box<Self> {
        // *sigh* workaround for lack of Box::new_zeroed
        unsafe {
            let self_ = alloc::alloc::alloc_zeroed(core::alloc::Layout::new::<Self>()) as *mut Self;
            alloc::boxed::Box::from_raw(self_)
        }
    }

    fn compress_impl<L: OutputSink<CompressError> + CompressSink>(
        &mut self,
        mut inp: &[u8],
        outp: &mut L,
    ) -> Result<(), CompressError> {
        if inp.len() == 0 {
            return Ok(());
        }

        self.htab.fill(0);

        let orig_inp = inp;
        let mut lits_start_anchor_pos = 0;

        // we need to output at least 1 literal
        // (unclear why C code skips 2?)
        inp.inc(1);

        while let Some(hash_head) = inp.peek4() {
            let hash = fastlz_hash(hash_head & 0xffffff);
            let cur_pos = inp.as_ptr() as usize - orig_inp.as_ptr() as usize;
            let ref_pos = mem::replace(&mut self.htab[hash], cur_pos);
            let ref_ = &orig_inp[ref_pos..];
            debug_assert!(cur_pos > ref_pos);
            let disp = cur_pos - ref_pos - 1;

            if disp <= L::MAX_DISP && inp[..3] == ref_[..3] {
                // we have a match of at least three bytes

                if L::IS_LEVEL2 {
                    if disp >= 8191 {
                        // if this is a far-away match, we want at least 5 bytes to make it worthwhile
                        if inp.len() < 5 {
                            break;
                        }
                        if inp[3..5] != ref_[3..5] {
                            inp.inc(1);
                            continue;
                        }
                    }
                }

                // compute the full match length
                let mut len = 3 + inp[3..]
                    .iter()
                    .zip(ref_[3..].iter())
                    .map_while(|(a, b)| if a == b { Some(1) } else { None })
                    .fold(0, |a, x| a + x);

                if L::IS_LEVEL2 {
                    // for some reason, level2 doesn't allow *ending* a file on a far-away match
                    if disp >= 8191 {
                        if len == inp.len() {
                            len -= 1;
                        }
                    }
                }

                // any accumulated lits?
                let lits = &orig_inp[lits_start_anchor_pos..cur_pos];
                if lits.len() > 0 {
                    outp.put_lits(lits)?;
                }

                // now we can finally put in the match
                outp.put_backref(disp, len)?;
                lits_start_anchor_pos = cur_pos + len;

                // update hashes at the boundary
                inp.inc(len - 2);
                if let Some(hash_head) = inp.peek4() {
                    let hash = fastlz_hash(hash_head & 0xffffff);
                    let cur_pos = inp.as_ptr() as usize - orig_inp.as_ptr() as usize;
                    self.htab[hash] = cur_pos;

                    let hash = fastlz_hash((hash_head >> 8) & 0xffffff);
                    self.htab[hash] = cur_pos + 1;

                    inp.inc(2);
                } else {
                    break;
                }
            } else {
                // no match
                inp.inc(1);
            }
        }

        // if there's anything leftover, output it
        let lits = &orig_inp[lits_start_anchor_pos..];
        if lits.len() > 0 {
            outp.put_lits(lits)?;
        }

        outp.poke_l2();

        Ok(())
    }

    /// Compress the input into a preallocated buffer
    ///
    /// Returns the compressed size on success, or an error otherwise
    pub fn compress_to_buf(
        &mut self,
        inp: &[u8],
        outp: &mut [u8],
        mut level: CompressionLevel,
    ) -> Result<usize, CompressError> {
        if level == CompressionLevel::Default {
            if inp.len() < 65536 {
                level = CompressionLevel::Level1;
            } else {
                level = CompressionLevel::Level2;
            }
        }

        if level == CompressionLevel::Level1 {
            let mut outp: L1Output<BufOutput> = L1Output(outp.into());
            self.compress_impl(inp, &mut outp)?;
            Ok(outp.0.pos)
        } else {
            let mut outp: L2Output<BufOutput> = L2Output(outp.into());
            self.compress_impl(inp, &mut outp)?;
            Ok(outp.0.pos)
        }
    }

    #[cfg(feature = "alloc")]
    /// Decompress the input into a [Vec](alloc::vec::Vec)
    ///
    /// Returns the result on success, or an error otherwise
    pub fn compress_to_vec(
        &mut self,
        inp: &[u8],
        mut level: CompressionLevel,
    ) -> Result<alloc::vec::Vec<u8>, CompressError> {
        let ret = alloc::vec::Vec::new();
        if level == CompressionLevel::Default {
            if inp.len() < 65536 {
                level = CompressionLevel::Level1;
            } else {
                level = CompressionLevel::Level2;
            }
        }

        if level == CompressionLevel::Level1 {
            let mut ret: L1Output<VecOutput> = L1Output(ret.into());
            self.compress_impl(inp, &mut ret)?;
            Ok(ret.0.vec)
        } else {
            let mut ret: L2Output<VecOutput> = L2Output(ret.into());
            self.compress_impl(inp, &mut ret)?;
            Ok(ret.0.vec)
        }
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_lv1_encoding_lit() {
        {
            let mut out = [0u8; 3];
            let mut outbuf: L1Output<BufOutput> = L1Output((&mut out[..]).into());
            outbuf.put_lits(&[1, 2]).unwrap();
            assert_eq!(outbuf.0.buf, [0x01, 1, 2]);
        }

        {
            let mut out = [0u8; 2];
            let mut outbuf: L1Output<BufOutput> = L1Output((&mut out[..]).into());
            outbuf.put_lits(&[1, 2]).expect_err("");
            assert_eq!(outbuf.0.buf, [0x01, 1]);
        }

        {
            let mut out = [0u8; 0];
            let mut outbuf: L1Output<BufOutput> = L1Output((&mut out[..]).into());
            outbuf.put_lits(&[0]).expect_err("");
        }
    }

    #[test]
    fn test_lv1_encoding_short() {
        {
            let mut out = [0u8; 2];
            let mut outbuf: L1Output<BufOutput> = L1Output((&mut out[..]).into());
            outbuf.put_backref(1, 5).unwrap();
            assert_eq!(outbuf.0.buf, [0x60, 0x01]);
        }

        {
            let mut out = [0u8; 1];
            let mut outbuf: L1Output<BufOutput> = L1Output((&mut out[..]).into());
            outbuf.put_backref(1, 5).expect_err("");
            assert_eq!(outbuf.0.buf, [0x60]);
        }
    }

    #[test]
    fn test_lv1_encoding_long() {
        {
            let mut out = [0u8; 3];
            let mut outbuf: L1Output<BufOutput> = L1Output((&mut out[..]).into());
            outbuf.put_backref(1, 9).unwrap();
            assert_eq!(outbuf.0.buf, [0xe0, 0x00, 0x01]);
        }

        {
            let mut out = [0u8; 3];
            let mut outbuf: L1Output<BufOutput> = L1Output((&mut out[..]).into());
            outbuf.put_backref(1, 264).unwrap();
            assert_eq!(outbuf.0.buf, [0xe0, 0xff, 0x01]);
        }

        {
            let mut out = [0u8; 1];
            let mut outbuf: L1Output<BufOutput> = L1Output((&mut out[..]).into());
            outbuf.put_backref(1, 9).expect_err("");
            assert_eq!(outbuf.0.buf, [0xe0]);
        }
    }

    #[test]
    fn test_lv1_encoding_verylong() {
        {
            // exactly overflows len 3 into next
            let mut out = [0u8; 5];
            let mut outbuf: L1Output<BufOutput> = L1Output((&mut out[..]).into());
            outbuf.put_backref(1, 265).unwrap();
            assert_eq!(outbuf.0.buf, [0xe0, 0xfd, 0x01, 0x20, 0x01]);
        }

        {
            // exactly overflows len 264 (max) into next
            let mut out = [0u8; 6];
            let mut outbuf: L1Output<BufOutput> = L1Output((&mut out[..]).into());
            outbuf.put_backref(1, 526).unwrap();
            assert_eq!(outbuf.0.buf, [0xe0, 0xfd, 0x01, 0xe0, 0xff, 0x01]);
        }

        {
            // overflows twice
            let mut out = [0u8; 8];
            let mut outbuf: L1Output<BufOutput> = L1Output((&mut out[..]).into());
            outbuf.put_backref(1, 527).unwrap();
            assert_eq!(
                outbuf.0.buf,
                [0xe0, 0xfd, 0x01, 0xe0, 0xfd, 0x01, 0x20, 0x01]
            );
        }
    }

    #[test]
    fn test_lv2_encoding_lit() {
        {
            let mut out = [0u8; 3];
            let mut outbuf: L2Output<BufOutput> = L2Output((&mut out[..]).into());
            outbuf.put_lits(&[1, 2]).unwrap();
            assert_eq!(outbuf.0.buf, [0x01, 1, 2]);
        }

        {
            let mut out = [0u8; 2];
            let mut outbuf: L2Output<BufOutput> = L2Output((&mut out[..]).into());
            outbuf.put_lits(&[1, 2]).expect_err("");
            assert_eq!(outbuf.0.buf, [0x01, 1]);
        }

        {
            let mut out = [0u8; 0];
            let mut outbuf: L2Output<BufOutput> = L2Output((&mut out[..]).into());
            outbuf.put_lits(&[0]).expect_err("");
        }
    }

    #[test]
    fn test_lv2_encoding_short() {
        {
            let mut out = [0u8; 2];
            let mut outbuf: L2Output<BufOutput> = L2Output((&mut out[..]).into());
            outbuf.put_backref(1, 5).unwrap();
            assert_eq!(outbuf.0.buf, [0x60, 0x01]);
        }

        {
            let mut out = [0u8; 1];
            let mut outbuf: L2Output<BufOutput> = L2Output((&mut out[..]).into());
            outbuf.put_backref(1, 5).expect_err("");
            assert_eq!(outbuf.0.buf, [0x60]);
        }
    }

    #[test]
    fn test_lv2_encoding_longlen() {
        {
            let mut out = [0u8; 3];
            let mut outbuf: L2Output<BufOutput> = L2Output((&mut out[..]).into());
            outbuf.put_backref(1, 9).unwrap();
            assert_eq!(outbuf.0.buf, [0xe0, 0x00, 0x01]);
        }

        {
            let mut out = [0u8; 4];
            let mut outbuf: L2Output<BufOutput> = L2Output((&mut out[..]).into());
            outbuf.put_backref(2, 9 + 0xff + 1).unwrap();
            assert_eq!(outbuf.0.buf, [0xe0, 0xff, 0x01, 0x02]);
        }
    }

    #[test]
    fn test_lv2_encoding_longdisp() {
        {
            let mut out = [0u8; 4];
            let mut outbuf: L2Output<BufOutput> = L2Output((&mut out[..]).into());
            outbuf.put_backref(8191, 3).unwrap();
            assert_eq!(outbuf.0.buf, [0x3f, 0xff, 0x00, 0x00]);
        }

        {
            let mut out = [0u8; 4];
            let mut outbuf: L2Output<BufOutput> = L2Output((&mut out[..]).into());
            outbuf.put_backref(8192, 3).unwrap();
            assert_eq!(outbuf.0.buf, [0x3f, 0xff, 0x00, 0x01]);
        }
    }

    #[test]
    fn test_lv2_encoding_longboth() {
        {
            let mut out = [0u8; 6];
            let mut outbuf: L2Output<BufOutput> = L2Output((&mut out[..]).into());
            outbuf.put_backref(8192, 9 + 0xff + 1).unwrap();
            assert_eq!(outbuf.0.buf, [0xff, 0xff, 0x01, 0xff, 0x00, 0x01]);
        }
    }

    #[test]
    fn test_ref_hashes() {
        assert_eq!(fastlz_hash(1), 5062);
        assert_eq!(fastlz_hash(2), 1933);
        assert_eq!(fastlz_hash(3), 6996);
        assert_eq!(fastlz_hash(4), 3867);
        assert_eq!(fastlz_hash(0xaa), 538);
        assert_eq!(fastlz_hash(0xbb), 4688);
        assert_eq!(fastlz_hash(0xff), 4904);
    }

    #[test]
    fn test_short_and_uncompressible() {
        {
            let mut state = CompressState::new();
            let mut out = [0u8; 3];
            let len = state
                .compress_to_buf(&[1, 2], &mut out, CompressionLevel::Level1)
                .unwrap();
            assert_eq!(len, out.len());
            assert_eq!(out, [0x01, 1, 2]);
        }

        {
            let mut state = CompressState::new();
            let mut out = [0u8; 6];
            let len = state
                .compress_to_buf(&[1, 2, 3, 4, 5], &mut out, CompressionLevel::Level1)
                .unwrap();
            assert_eq!(len, out.len());
            assert_eq!(out, [0x04, 1, 2, 3, 4, 5]);
        }
    }

    #[test]
    fn test_simple_backref() {
        {
            let mut state = CompressState::new();
            let mut out = [0u8; 4];
            let len = state
                .compress_to_buf(&[1, 1, 1, 1, 1], &mut out, CompressionLevel::Level1)
                .unwrap();
            assert_eq!(len, out.len());
            assert_eq!(out, [0x00, 1, 0x40, 0x00]);
        }
        {
            // test trailing nonmatch
            let mut state = CompressState::new();
            let mut out = [0u8; 6];
            let len = state
                .compress_to_buf(&[1, 1, 1, 1, 1, 2], &mut out, CompressionLevel::Level1)
                .unwrap();
            assert_eq!(len, out.len());
            assert_eq!(out, [0x00, 1, 0x40, 0x00, 0x00, 2]);
        }
        {
            // test longer match, ending at end
            let mut state = CompressState::new();
            let mut out = [0u8; 6];
            let len = state
                .compress_to_buf(
                    &[1, 2, 3, 1, 2, 3, 1, 2, 3],
                    &mut out,
                    CompressionLevel::Level1,
                )
                .unwrap();
            assert_eq!(len, out.len());
            assert_eq!(out, [0x02, 1, 2, 3, 0x80, 0x02]);
        }
        {
            // test longer match, not ending at end
            let mut state = CompressState::new();
            let mut out = [0u8; 8];
            let len = state
                .compress_to_buf(
                    &[1, 2, 3, 1, 2, 3, 1, 2, 3, 4],
                    &mut out,
                    CompressionLevel::Level1,
                )
                .unwrap();
            assert_eq!(len, out.len());
            assert_eq!(out, [0x02, 1, 2, 3, 0x80, 0x02, 0x00, 4]);
        }
    }

    #[test]
    fn test_rehash_at_boundary() {
        {
            let mut state = CompressState::new();
            let mut out = [0u8; 8];
            let len = state
                .compress_to_buf(
                    &[1, 2, 3, 1, 2, 3, 1, 2, 3, 2, 3, 2, 3],
                    &mut out,
                    CompressionLevel::Level1,
                )
                .unwrap();
            assert_eq!(len, out.len());
            assert_eq!(out, [0x02, 1, 2, 3, 0x80, 0x02, 0x40, 0x01]);
        }
        {
            let mut state = CompressState::new();
            let mut out = [0u8; 8];
            let len = state
                .compress_to_buf(
                    &[1, 2, 3, 1, 2, 3, 1, 2, 3, 3, 3, 3, 3],
                    &mut out,
                    CompressionLevel::Level1,
                )
                .unwrap();
            assert_eq!(len, out.len());
            assert_eq!(out, [0x02, 1, 2, 3, 0x80, 0x02, 0x40, 0x00]);
        }
    }

    #[cfg(feature = "std")]
    #[test]
    fn test_lv1_against_ref() {
        extern crate std;

        let d = std::path::PathBuf::from(env!("CARGO_MANIFEST_DIR"));
        let inp_fn = d.join("src/compress.rs");

        let inp = std::fs::read(inp_fn).unwrap();
        let mut comp_state = CompressState::new();
        let out = comp_state
            .compress_to_vec(&inp, CompressionLevel::Level1)
            .unwrap();

        let mut reference = crate::wasmtester::FastLZWasm::new();
        let check = reference.fastlz_decompress(&out);

        assert_eq!(inp, check);
    }

    #[cfg(feature = "std")]
    #[test]
    fn test_lv2_against_ref() {
        extern crate std;

        let d = std::path::PathBuf::from(env!("CARGO_MANIFEST_DIR"));
        let inp_fn = d.join("src/compress.rs");

        let inp = std::fs::read(inp_fn).unwrap();
        let mut comp_state = CompressState::new();
        let out = comp_state
            .compress_to_vec(&inp, CompressionLevel::Level2)
            .unwrap();

        let mut reference = crate::wasmtester::FastLZWasm::new();
        let check = reference.fastlz_decompress(&out);

        assert_eq!(inp, check);
    }
}