pub fn edge_orientation_index(&self) -> u16 {
        let mut result = 0;
        for i in 0..11 {
            result = (result * 2) + self.edges[i].orientation as u16;
        }
        result
    }
/// Index for the edge orientations is a simple binary integer representation. The
/// zero index is the solved state. Note that the last edge is not represented in
/// the index as its value is implicit (all edge orientations must add to a
/// multiple of 2).
Index for the edge orientations is a simple binary integer representation. The
zero index is the solved state. Note that the last edge is not represented in
the index as its value is implicit (all edge orientations must add to a
multiple of 2).
Index for the edge orientations is a simple binary integer representation . The zero index is the solved state . Note that the last edge is not represented in the index as its value is implicit ( all edge orientations must add to a multiple of 2 ) .
pub fn edge_orientation_index(&self) -> u16 {
        let mut result = 0;
        for i in 0..11 {
            result = (result * 2) + self.edges[i].orientation as u16;
        }
        result
    }
pub fn edge_orientation_index ( & self ) -> u16 { let mut result = 0 ; for i in 0 .. 11 { result = ( result * 2 ) + self . edges [ i ] . orientation as u16 ; } result }
Index for the edge orientations is a simple binary integer representation.
Index for the edge orientations is a simple binary integer representation .
&self
&self