#[repr(C)]
pub enum PredefinedDictionaryType {
Show 22 variants DICT_4X4_50, DICT_4X4_100, DICT_4X4_250, DICT_4X4_1000, DICT_5X5_50, DICT_5X5_100, DICT_5X5_250, DICT_5X5_1000, DICT_6X6_50, DICT_6X6_100, DICT_6X6_250, DICT_6X6_1000, DICT_7X7_50, DICT_7X7_100, DICT_7X7_250, DICT_7X7_1000, DICT_ARUCO_ORIGINAL, DICT_APRILTAG_16h5, DICT_APRILTAG_25h9, DICT_APRILTAG_36h10, DICT_APRILTAG_36h11, DICT_ARUCO_MIP_36h12,
}
Expand description

Predefined markers dictionaries/sets

Each dictionary indicates the number of bits and the number of markers contained

  • DICT_ARUCO_ORIGINAL: standard ArUco Library Markers. 1024 markers, 5x5 bits, 0 minimum distance

Variants§

§

DICT_4X4_50

4x4 bits, minimum hamming distance between any two codes = 4, 50 codes

§

DICT_4X4_100

4x4 bits, minimum hamming distance between any two codes = 3, 100 codes

§

DICT_4X4_250

4x4 bits, minimum hamming distance between any two codes = 3, 250 codes

§

DICT_4X4_1000

4x4 bits, minimum hamming distance between any two codes = 2, 1000 codes

§

DICT_5X5_50

5x5 bits, minimum hamming distance between any two codes = 8, 50 codes

§

DICT_5X5_100

5x5 bits, minimum hamming distance between any two codes = 7, 100 codes

§

DICT_5X5_250

5x5 bits, minimum hamming distance between any two codes = 6, 250 codes

§

DICT_5X5_1000

5x5 bits, minimum hamming distance between any two codes = 5, 1000 codes

§

DICT_6X6_50

6x6 bits, minimum hamming distance between any two codes = 13, 50 codes

§

DICT_6X6_100

6x6 bits, minimum hamming distance between any two codes = 12, 100 codes

§

DICT_6X6_250

6x6 bits, minimum hamming distance between any two codes = 11, 250 codes

§

DICT_6X6_1000

6x6 bits, minimum hamming distance between any two codes = 9, 1000 codes

§

DICT_7X7_50

7x7 bits, minimum hamming distance between any two codes = 19, 50 codes

§

DICT_7X7_100

7x7 bits, minimum hamming distance between any two codes = 18, 100 codes

§

DICT_7X7_250

7x7 bits, minimum hamming distance between any two codes = 17, 250 codes

§

DICT_7X7_1000

7x7 bits, minimum hamming distance between any two codes = 14, 1000 codes

§

DICT_ARUCO_ORIGINAL

6x6 bits, minimum hamming distance between any two codes = 3, 1024 codes

§

DICT_APRILTAG_16h5

4x4 bits, minimum hamming distance between any two codes = 5, 30 codes

§

DICT_APRILTAG_25h9

5x5 bits, minimum hamming distance between any two codes = 9, 35 codes

§

DICT_APRILTAG_36h10

6x6 bits, minimum hamming distance between any two codes = 10, 2320 codes

§

DICT_APRILTAG_36h11

6x6 bits, minimum hamming distance between any two codes = 11, 587 codes

§

DICT_ARUCO_MIP_36h12

6x6 bits, minimum hamming distance between any two codes = 12, 250 codes

Trait Implementations§

source§

impl Clone for PredefinedDictionaryType

source§

fn clone(&self) -> PredefinedDictionaryType

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl Debug for PredefinedDictionaryType

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl PartialEq<PredefinedDictionaryType> for PredefinedDictionaryType

source§

fn eq(&self, other: &PredefinedDictionaryType) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl Copy for PredefinedDictionaryType

source§

impl Eq for PredefinedDictionaryType

source§

impl StructuralEq for PredefinedDictionaryType

source§

impl StructuralPartialEq for PredefinedDictionaryType

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.