pub unsafe fn dump_cells(code: *const QuircCode) {
    print!("    {} cells, corners:", (*code).size);
    for u in 0..4 {
        print!(
            " ({},{})",
            (*code).corners[u as (usize)].x,
            (*code).corners[u as (usize)].y
        );
    }
    println!();
    for v in 0..(*code).size {
        print!("    ");
        for u in 0..(*code).size {
            let p: i32 = v * (*code).size + u;
            if i32::from((*code).cell_bitmap[(p >> 3i32) as (usize)]) & 1i32 << (p & 7i32) != 0 {
                print!("[]");
            } else {
                print!("  ");
            }
        }
        println!();
    }
}
/// Dump a grid cell map on stdout.
Dump a grid cell map on stdout.
Dump a grid cell map on stdout .
pub unsafe fn dump_cells(code: *const QuircCode) {
    print!("    {} cells, corners:", (*code).size);
    for u in 0..4 {
        print!(
            " ({},{})",
            (*code).corners[u as (usize)].x,
            (*code).corners[u as (usize)].y
        );
    }
    println!();
    for v in 0..(*code).size {
        print!("    ");
        for u in 0..(*code).size {
            let p: i32 = v * (*code).size + u;
            if i32::from((*code).cell_bitmap[(p >> 3i32) as (usize)]) & 1i32 << (p & 7i32) != 0 {
                print!("[]");
            } else {
                print!("  ");
            }
        }
        println!();
    }
}
pub unsafe fn dump_cells ( code : * const QuircCode ) { print ! ( " " ( code ) size ) ; for u in 0 .. 4 { print ! ( " " ( code ) corners [ u as ( usize ) ] x ( code ) corners [ u as ( usize ) ] y ) ; } println ! ( ) ; for v in 0 .. ( * code ) . size { print ! ( " " ) ; for u in 0 .. ( * code ) . size { let p : i32 = v * ( * code ) . size + u ; if i32 :: from ( ( * code ) . cell_bitmap [ ( p >> 3i32 ) as ( usize ) ] ) & 1i32 << ( p & 7i32 ) != 0 { print ! ( " " ) ; } else { print ! ( " " ) ; } } println ! ( ) ; } }
Dump a grid cell map on stdout.
Dump a grid cell map on stdout .
code
*const QuircCode
code
*const QuircCode