#[repr(C)]
pub enum PredefinedDictionaryType {
Show 22 variants DICT_4X4_50 = 0, DICT_4X4_100 = 1, DICT_4X4_250 = 2, DICT_4X4_1000 = 3, DICT_5X5_50 = 4, DICT_5X5_100 = 5, DICT_5X5_250 = 6, DICT_5X5_1000 = 7, DICT_6X6_50 = 8, DICT_6X6_100 = 9, DICT_6X6_250 = 10, DICT_6X6_1000 = 11, DICT_7X7_50 = 12, DICT_7X7_100 = 13, DICT_7X7_250 = 14, DICT_7X7_1000 = 15, DICT_ARUCO_ORIGINAL = 16, DICT_APRILTAG_16h5 = 17, DICT_APRILTAG_25h9 = 18, DICT_APRILTAG_36h10 = 19, DICT_APRILTAG_36h11 = 20, DICT_ARUCO_MIP_36h12 = 21,
}
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 = 0

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

§

DICT_4X4_100 = 1

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

§

DICT_4X4_250 = 2

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

§

DICT_4X4_1000 = 3

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

§

DICT_5X5_50 = 4

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

§

DICT_5X5_100 = 5

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

§

DICT_5X5_250 = 6

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

§

DICT_5X5_1000 = 7

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

§

DICT_6X6_50 = 8

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

§

DICT_6X6_100 = 9

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

§

DICT_6X6_250 = 10

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

§

DICT_6X6_1000 = 11

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

§

DICT_7X7_50 = 12

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

§

DICT_7X7_100 = 13

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

§

DICT_7X7_250 = 14

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

§

DICT_7X7_1000 = 15

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

§

DICT_ARUCO_ORIGINAL = 16

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

§

DICT_APRILTAG_16h5 = 17

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

§

DICT_APRILTAG_25h9 = 18

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

§

DICT_APRILTAG_36h10 = 19

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

§

DICT_APRILTAG_36h11 = 20

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

§

DICT_ARUCO_MIP_36h12 = 21

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 From<PredefinedDictionaryType> for i32

source§

fn from(v: PredefinedDictionaryType) -> Self

Converts to this type from the input type.
source§

impl PartialEq 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 T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where 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 T
where 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 T
where 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 T
where 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 T
where 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.