pub trait PartialOrdAbs<Rhs: ?Sized = Self> {
    fn partial_cmp_abs(&self, other: &Rhs) -> Option<Ordering>;

    fn lt_abs(&self, other: &Rhs) -> bool { ... }
    fn le_abs(&self, other: &Rhs) -> bool { ... }
    fn gt_abs(&self, other: &Rhs) -> bool { ... }
    fn ge_abs(&self, other: &Rhs) -> bool { ... }
}
Expand description

Determines equality between the absolute values of two numbers, where some pairs of numbers may not be comparable.

Required Methods

Compares the absolute values of two numbers, taking both by reference.

If the two values are not comparable, None is returned.

Provided Methods

Determines whether the absolute value of one number is less than the absolute value of another.

Worst-case complexity

Same as the time and additional memory complexity of partial_cmp_abs.

Determines whether the absolute value of one number is less than or equal to the absolute value of another.

Worst-case complexity

Same as the time and additional memory complexity of partial_cmp_abs.

Determines whether the absolute value of one number is greater than the absolute value of another.

Worst-case complexity

Same as the time and additional memory complexity of partial_cmp_abs.

Determines whether the absolute value of one number is greater than or equal to the absolute value of another.

Worst-case complexity

Same as the time and additional memory complexity of partial_cmp_abs.

Implementations on Foreign Types

Compares the absolute values of two numbers, taking both by reference.

The PartialOrdAbs interface allows for pairs of incomparable elements, but for primitive integers these never occur.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Compares the absolute values of two numbers, taking both by reference.

The PartialOrdAbs interface allows for pairs of incomparable elements, but for primitive integers these never occur.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Compares the absolute values of two numbers, taking both by reference.

The PartialOrdAbs interface allows for pairs of incomparable elements, but for primitive integers these never occur.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Compares the absolute values of two numbers, taking both by reference.

The PartialOrdAbs interface allows for pairs of incomparable elements, but for primitive integers these never occur.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Compares the absolute values of two numbers, taking both by reference.

The PartialOrdAbs interface allows for pairs of incomparable elements, but for primitive integers these never occur.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Compares the absolute values of two numbers, taking both by reference.

The PartialOrdAbs interface allows for pairs of incomparable elements, but for primitive integers these never occur.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Compares the absolute values of two numbers, taking both by reference.

The PartialOrdAbs interface allows for pairs of incomparable elements, but for primitive integers these never occur.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Compares the absolute values of two numbers, taking both by reference.

The PartialOrdAbs interface allows for pairs of incomparable elements, but for primitive integers these never occur.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Compares the absolute values of two numbers, taking both by reference.

The PartialOrdAbs interface allows for pairs of incomparable elements, but for primitive integers these never occur.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Compares the absolute values of two numbers, taking both by reference.

The PartialOrdAbs interface allows for pairs of incomparable elements, but for primitive integers these never occur.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Compares the absolute values of two numbers, taking both by reference.

The PartialOrdAbs interface allows for pairs of incomparable elements, but for primitive integers these never occur.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Compares the absolute values of two numbers, taking both by reference.

The PartialOrdAbs interface allows for pairs of incomparable elements, but for primitive integers these never occur.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Implementors