Mathspy

Thanks to Awesome Visual Regression Testing and Screenster.io for compiling lists of the things in the space. The research into what each uses was done by me through digging their code or their READMEs.

• OSnap: ReasonML. Uses ODiff, the main contender I am looking at.
• basset: Python. Uses a handrolled algorithm, looks fairly naive, only 63 lines of code
• AyeSpy: JavaScript. Uses looks-same
• Wraith: Ruby. Uses ImageMagick (shells out to it). Made by BBC lol
• BackstopJS: JavaScript. Uses hash comparison then @mirzazeyrek/node-resemble-js a fork of Resemble.js.
• Galen: Java. Uses a handrolled algorithm named rainbow4j. Think they might be looking for a new name now.
• Creevey: JavaScript. Uses pixelmatch.

Mathspy

interface ExecutionContext {
  waitUntil(promise: Promise<any>): void;
  passThroughOnException(): void;
}

interface ExportedHandler<Env = unknown> {
  fetch?: ExportedHandlerFetchHandler<Env>;
  scheduled?: ExportedHandlerScheduledHandler<Env>;
}

Mathspy

#![no_std]

extern crate alloc;

use alloc::borrow::Cow;
use core::iter;

enum Tag {
    /// A non-HTML tag that renders into nothing for wrapping text
    Fragment,

Mathspy

use std::{
    collections::HashSet,
    ffi::OsString,
    fs,
    hash::{Hash, Hasher},
    path::Path,
};

#[derive(Debug, PartialEq, Eq)]
pub enum DirEntry {

Mathspy

async fn is_reader_ready<R>(reader: &mut R) -> bool where R: AsyncRead + Unpin {
    let mut me = &mut *reader;

    poll_fn(|cx| {
        let mut v = [];
        Poll::Ready(Pin::new(&mut me).poll_read(cx, &mut v[..]).is_ready())
    }).await
}

Mathspy

use std::{
    pin::Pin,
    task::{Context, Poll},
};
use tokio::io::AsyncRead;

enum Either<T, U> {
    A(T),
    B(U),
}

Mathspy

use serde::{Deserialize, de::{self, Deserializer, Visitor}};
use std::fmt;

#[derive(Debug)]
enum Shape {
    Triangle = 3,
    Rectangle = 4,
    Pentagon = 5,
}

Mathspy

require('log-timestamp');

const timers = [];

function setTimeout(fn, time) {
  const ret = global.setTimeout(() => {
    console.log(`Finished timer ${timers.indexOf(ret)} after ${time}`);
    fn();
  }, time);
  console.log(`Started timer ${timers.push(ret) - 1} with ${time}`);

Mathspy

// This is the trait that has .tuple_combinations_while()
trait HasTupleCombinationWhile: Iterator {
    /// Return an iterator adaptor that iterates over the combinations of the elements from an iterator.
    /// With the added beneift of being able to short-circuit 
    fn tuple_combinations_while<P>(
        mut self,
        predicate: P,
    ) -> TupleCombinationsWhile<Self, Self::Item, P>
    where
        Self: Clone,

Mathspy

// Use this if you want [2, 3, 5.....]
use std::collections::HashMap;

/// This is a prime number generator based on [Sieve of Eratosthenes](https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes)
/// that can be _trivially_ improved by switching to [Sieve of Atkin](https://en.wikipedia.org/wiki/Sieve_of_Atkin) for extra speed
struct PrimeIterator {
    current: u64,
    composite_to_primes: HashMap<u64, Vec<u64>>,
}