drunken-diver 0.1.1

Implements an algorithm inspired by the Drunken Bishop algorithm
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19

use drunken_diver::{Route, Dive};

fn main() {

    let s = b"f4bf9f7fcbedaba0392f108c59d8f4a38b3838efb64877380171b54475c2ade8".into_iter();
    println!("{}", Route::<16>::from(Dive::from(s.map(|x| *x))));

    let s = b"2062f80093066633876b542212c496501a5e79523cc4ea9b28667dff065afd8f".into_iter();
    println!("{}", Route::<16>::from(Dive::from(s.map(|x| *x))));

    let s = b"f4bf9f7fcbedaba0392f108c59d8f4a38b3838efb64877380171b54475c2ade8".into_iter();
    println!("{}", Route::<32>::from(Dive::from(s.map(|x| *x))));

    let s = b"2062f80093066633876b542212c496501a5e79523cc4ea9b28667dff065afd8f".into_iter();
    println!("{}", Route::<32>::from(Dive::from(s.map(|x| *x))));

    let s = b"\x01\x23\x45\x67\x89\xAB\xCD\xEF".into_iter();
    println!("{}", Route::<32>::from(Dive::from(s.map(|x| *x))));
}