Trait datafusion::prelude::Sub

pub trait Sub<Rhs = Self> {
    type Output;

    // Required method
    fn sub(self, rhs: Rhs) -> Self::Output;
}

The subtraction operator -.

Note that Rhs is Self by default, but this is not mandatory. For example, std::time::SystemTime implements Sub<Duration>, which permits operations of the form SystemTime = SystemTime - Duration.

Examples

Subtractable points

use std::ops::Sub;

#[derive(Debug, Copy, Clone, PartialEq)]
struct Point {
    x: i32,
    y: i32,
}

impl Sub for Point {
    type Output = Self;

    fn sub(self, other: Self) -> Self::Output {
        Self {
            x: self.x - other.x,
            y: self.y - other.y,
        }
    }
}

assert_eq!(Point { x: 3, y: 3 } - Point { x: 2, y: 3 },
           Point { x: 1, y: 0 });

Implementing Sub with generics

Here is an example of the same Point struct implementing the Sub trait using generics.

use std::ops::Sub;

#[derive(Debug, PartialEq)]
struct Point<T> {
    x: T,
    y: T,
}

// Notice that the implementation uses the associated type `Output`.
impl<T: Sub<Output = T>> Sub for Point<T> {
    type Output = Self;

    fn sub(self, other: Self) -> Self::Output {
        Point {
            x: self.x - other.x,
            y: self.y - other.y,
        }
    }
}

assert_eq!(Point { x: 2, y: 3 } - Point { x: 1, y: 0 },
           Point { x: 1, y: 3 });

Required Associated Types

type Output

The resulting type after applying the - operator.

Required Methods

fn sub(self, rhs: Rhs) -> Self::Output

Performs the - operation.

Example

assert_eq!(12 - 1, 11);

Implementors

impl Sub for Expr

Support <expr> - <expr> fluent style

type Output = Expr

impl Sub for f32

type Output = f32

impl Sub for f64

type Output = f64

impl Sub for i8

type Output = i8

impl Sub for i16

type Output = i16

impl Sub for i32

type Output = i32

impl Sub for i64

type Output = i64

impl Sub for i128

type Output = i128

impl Sub for isize

type Output = isize

impl Sub for u8

type Output = u8

impl Sub for u16

type Output = u16

impl Sub for u32

type Output = u32

impl Sub for u64

type Output = u64

impl Sub for u128

type Output = u128

impl Sub for usize

type Output = usize

impl Sub for i256

type Output = i256

impl Sub for Assume

type Output = Assume

impl Sub for Saturating<i8>

type Output = Saturating<i8>

impl Sub for Saturating<i16>

type Output = Saturating<i16>

impl Sub for Saturating<i32>

type Output = Saturating<i32>

impl Sub for Saturating<i64>

type Output = Saturating<i64>

impl Sub for Saturating<i128>

type Output = Saturating<i128>

impl Sub for Saturating<isize>

type Output = Saturating<isize>

impl Sub for Saturating<u8>

type Output = Saturating<u8>

impl Sub for Saturating<u16>

type Output = Saturating<u16>

impl Sub for Saturating<u32>

type Output = Saturating<u32>

impl Sub for Saturating<u64>

type Output = Saturating<u64>

impl Sub for Saturating<u128>

type Output = Saturating<u128>

impl Sub for Saturating<usize>

type Output = Saturating<usize>

impl Sub for Wrapping<i8>

type Output = Wrapping<i8>

impl Sub for Wrapping<i16>

type Output = Wrapping<i16>

impl Sub for Wrapping<i32>

type Output = Wrapping<i32>

impl Sub for Wrapping<i64>

type Output = Wrapping<i64>

impl Sub for Wrapping<i128>

type Output = Wrapping<i128>

impl Sub for Wrapping<isize>

type Output = Wrapping<isize>

impl Sub for Wrapping<u8>

type Output = Wrapping<u8>

impl Sub for Wrapping<u16>

type Output = Wrapping<u16>

impl Sub for Wrapping<u32>

type Output = Wrapping<u32>

impl Sub for Wrapping<u64>

type Output = Wrapping<u64>

impl Sub for Wrapping<u128>

type Output = Wrapping<u128>

impl Sub for Wrapping<usize>

type Output = Wrapping<usize>

impl Sub for Duration

type Output = Duration

impl Sub for std::time::Instant

type Output = Duration

impl Sub for NaiveDate

Subtracts another NaiveDate from the current date. Returns a TimeDelta of integral numbers.

This does not overflow or underflow at all, as all possible output fits in the range of TimeDelta.

The implementation is a wrapper around NaiveDate::signed_duration_since.

Example

use chrono::{TimeDelta, NaiveDate};

let from_ymd = |y, m, d| NaiveDate::from_ymd_opt(y, m, d).unwrap();

assert_eq!(from_ymd(2014, 1, 1) - from_ymd(2014, 1, 1), TimeDelta::zero());
assert_eq!(from_ymd(2014, 1, 1) - from_ymd(2013, 12, 31), TimeDelta::days(1));
assert_eq!(from_ymd(2014, 1, 1) - from_ymd(2014, 1, 2), TimeDelta::days(-1));
assert_eq!(from_ymd(2014, 1, 1) - from_ymd(2013, 9, 23), TimeDelta::days(100));
assert_eq!(from_ymd(2014, 1, 1) - from_ymd(2013, 1, 1), TimeDelta::days(365));
assert_eq!(from_ymd(2014, 1, 1) - from_ymd(2010, 1, 1), TimeDelta::days(365*4 + 1));
assert_eq!(from_ymd(2014, 1, 1) - from_ymd(1614, 1, 1), TimeDelta::days(365*400 + 97));

type Output = TimeDelta

impl Sub for NaiveDateTime

Subtracts another NaiveDateTime from the current date and time. This does not overflow or underflow at all.

As a part of Chrono’s leap second handling, the subtraction assumes that there is no leap second ever, except when any of the NaiveDateTimes themselves represents a leap second in which case the assumption becomes that there are exactly one (or two) leap second(s) ever.

The implementation is a wrapper around NaiveDateTime::signed_duration_since.

Example

use chrono::{TimeDelta, NaiveDate};

let from_ymd = |y, m, d| NaiveDate::from_ymd_opt(y, m, d).unwrap();

let d = from_ymd(2016, 7, 8);
assert_eq!(d.and_hms_opt(3, 5, 7).unwrap() - d.and_hms_opt(2, 4, 6).unwrap(), TimeDelta::seconds(3600 + 60 + 1));

// July 8 is 190th day in the year 2016
let d0 = from_ymd(2016, 1, 1);
assert_eq!(d.and_hms_milli_opt(0, 7, 6, 500).unwrap() - d0.and_hms_opt(0, 0, 0).unwrap(),
           TimeDelta::seconds(189 * 86_400 + 7 * 60 + 6) + TimeDelta::milliseconds(500));

Leap seconds are handled, but the subtraction assumes that no other leap seconds happened.

let leap = from_ymd(2015, 6, 30).and_hms_milli_opt(23, 59, 59, 1_500).unwrap();
assert_eq!(leap - from_ymd(2015, 6, 30).and_hms_opt(23, 0, 0).unwrap(),
           TimeDelta::seconds(3600) + TimeDelta::milliseconds(500));
assert_eq!(from_ymd(2015, 7, 1).and_hms_opt(1, 0, 0).unwrap() - leap,
           TimeDelta::seconds(3600) - TimeDelta::milliseconds(500));

type Output = TimeDelta

impl Sub for NaiveTime

Subtracts another NaiveTime from the current time. Returns a TimeDelta within +/- 1 day. This does not overflow or underflow at all.

As a part of Chrono’s leap second handling, the subtraction assumes that there is no leap second ever, except when any of the NaiveTimes themselves represents a leap second in which case the assumption becomes that there are exactly one (or two) leap second(s) ever.

The implementation is a wrapper around NaiveTime::signed_duration_since.

Example

use chrono::{TimeDelta, NaiveTime};

let from_hmsm = |h, m, s, milli| { NaiveTime::from_hms_milli_opt(h, m, s, milli).unwrap() };

assert_eq!(from_hmsm(3, 5, 7, 900) - from_hmsm(3, 5, 7, 900), TimeDelta::zero());
assert_eq!(from_hmsm(3, 5, 7, 900) - from_hmsm(3, 5, 7, 875), TimeDelta::milliseconds(25));
assert_eq!(from_hmsm(3, 5, 7, 900) - from_hmsm(3, 5, 6, 925), TimeDelta::milliseconds(975));
assert_eq!(from_hmsm(3, 5, 7, 900) - from_hmsm(3, 5, 0, 900), TimeDelta::seconds(7));
assert_eq!(from_hmsm(3, 5, 7, 900) - from_hmsm(3, 0, 7, 900), TimeDelta::seconds(5 * 60));
assert_eq!(from_hmsm(3, 5, 7, 900) - from_hmsm(0, 5, 7, 900), TimeDelta::seconds(3 * 3600));
assert_eq!(from_hmsm(3, 5, 7, 900) - from_hmsm(4, 5, 7, 900), TimeDelta::seconds(-3600));
assert_eq!(from_hmsm(3, 5, 7, 900) - from_hmsm(2, 4, 6, 800),
           TimeDelta::seconds(3600 + 60 + 1) + TimeDelta::milliseconds(100));

Leap seconds are handled, but the subtraction assumes that there were no other leap seconds happened.

assert_eq!(from_hmsm(3, 0, 59, 1_000) - from_hmsm(3, 0, 59, 0), TimeDelta::seconds(1));
assert_eq!(from_hmsm(3, 0, 59, 1_500) - from_hmsm(3, 0, 59, 0),
           TimeDelta::milliseconds(1500));
assert_eq!(from_hmsm(3, 0, 59, 1_000) - from_hmsm(3, 0, 0, 0), TimeDelta::seconds(60));
assert_eq!(from_hmsm(3, 0, 0, 0) - from_hmsm(2, 59, 59, 1_000), TimeDelta::seconds(1));
assert_eq!(from_hmsm(3, 0, 59, 1_000) - from_hmsm(2, 59, 59, 1_000),
           TimeDelta::seconds(61));

type Output = TimeDelta

impl Sub for TimeDelta

type Output = TimeDelta

impl Sub for bf16

type Output = bf16

impl Sub for f16

type Output = f16

impl Sub for BigInt

type Output = BigInt

impl Sub for BigUint

type Output = BigUint

impl Sub for tokio::time::instant::Instant

type Output = Duration

impl Sub for ATerm

type Output = ATerm

impl Sub for Z0

Z0 - Z0 = Z0

type Output = Z0

impl Sub for UTerm

UTerm - UTerm = UTerm

type Output = UTerm

impl Sub for Access

type Output = Access

impl Sub for AtFlags

type Output = AtFlags

impl Sub for CreateFlags

type Output = CreateFlags

impl Sub for DupFlags

type Output = DupFlags

impl Sub for FallocateFlags

type Output = FallocateFlags

impl Sub for FdFlags

type Output = FdFlags

impl Sub for IFlags

type Output = IFlags

impl Sub for MemfdFlags

type Output = MemfdFlags

impl Sub for Mode

type Output = Mode

impl Sub for MountFlags

type Output = MountFlags

impl Sub for MountPropagationFlags

type Output = MountPropagationFlags

impl Sub for OFlags

type Output = OFlags

impl Sub for ReadWriteFlags

type Output = ReadWriteFlags

impl Sub for RenameFlags

type Output = RenameFlags

impl Sub for ResolveFlags

type Output = ResolveFlags

impl Sub for SealFlags

type Output = SealFlags

impl Sub for StatVfsMountFlags

type Output = StatVfsMountFlags

impl Sub for StatxFlags

type Output = StatxFlags

impl Sub for UnmountFlags

type Output = UnmountFlags

impl Sub for WatchFlags

type Output = WatchFlags

impl Sub for XattrFlags

type Output = XattrFlags

impl Sub<&f32> for &f32

type Output = <f32 as Sub>::Output

impl Sub<&f32> for f32

type Output = <f32 as Sub>::Output

impl Sub<&f64> for &f64

type Output = <f64 as Sub>::Output

impl Sub<&f64> for f64

type Output = <f64 as Sub>::Output

impl Sub<&i8> for &i8

type Output = <i8 as Sub>::Output

impl Sub<&i8> for &BigInt

type Output = BigInt

impl Sub<&i8> for i8

type Output = <i8 as Sub>::Output

impl Sub<&i8> for BigInt

type Output = BigInt

impl Sub<&i16> for &i16

type Output = <i16 as Sub>::Output

impl Sub<&i16> for &BigInt

type Output = BigInt

impl Sub<&i16> for i16

type Output = <i16 as Sub>::Output

impl Sub<&i16> for BigInt

type Output = BigInt

impl Sub<&i32> for &i32

type Output = <i32 as Sub>::Output

impl Sub<&i32> for &BigInt

type Output = BigInt

impl Sub<&i32> for i32

type Output = <i32 as Sub>::Output

impl Sub<&i32> for BigInt

type Output = BigInt

impl Sub<&i64> for &i64

type Output = <i64 as Sub>::Output

impl Sub<&i64> for &BigInt

type Output = BigInt

impl Sub<&i64> for i64

type Output = <i64 as Sub>::Output

impl Sub<&i64> for BigInt

type Output = BigInt

impl Sub<&i128> for &i128

type Output = <i128 as Sub>::Output

impl Sub<&i128> for &BigInt

type Output = BigInt

impl Sub<&i128> for i128

type Output = <i128 as Sub>::Output

impl Sub<&i128> for BigInt

type Output = BigInt

impl Sub<&isize> for &isize

type Output = <isize as Sub>::Output

impl Sub<&isize> for &BigInt

type Output = BigInt

impl Sub<&isize> for isize

type Output = <isize as Sub>::Output

impl Sub<&isize> for BigInt

type Output = BigInt

impl Sub<&u8> for &u8

type Output = <u8 as Sub>::Output

impl Sub<&u8> for &BigInt

type Output = BigInt

impl Sub<&u8> for &BigUint

type Output = BigUint

impl Sub<&u8> for u8

type Output = <u8 as Sub>::Output

impl Sub<&u8> for BigInt

type Output = BigInt

impl Sub<&u8> for BigUint

type Output = BigUint

impl Sub<&u16> for &u16

type Output = <u16 as Sub>::Output

impl Sub<&u16> for &BigInt

type Output = BigInt

impl Sub<&u16> for &BigUint

type Output = BigUint

impl Sub<&u16> for u16

type Output = <u16 as Sub>::Output

impl Sub<&u16> for BigInt

type Output = BigInt

impl Sub<&u16> for BigUint

type Output = BigUint

impl Sub<&u32> for &u32

type Output = <u32 as Sub>::Output

impl Sub<&u32> for &BigInt

type Output = BigInt

impl Sub<&u32> for &BigUint

type Output = BigUint

impl Sub<&u32> for u32

type Output = <u32 as Sub>::Output

impl Sub<&u32> for BigInt

type Output = BigInt

impl Sub<&u32> for BigUint

type Output = BigUint

impl Sub<&u64> for &u64

type Output = <u64 as Sub>::Output

impl Sub<&u64> for &BigInt

type Output = BigInt

impl Sub<&u64> for &BigUint

type Output = BigUint

impl Sub<&u64> for u64

type Output = <u64 as Sub>::Output

impl Sub<&u64> for BigInt

type Output = BigInt

impl Sub<&u64> for BigUint

type Output = BigUint

impl Sub<&u128> for &u128

type Output = <u128 as Sub>::Output

impl Sub<&u128> for &BigInt

type Output = BigInt

impl Sub<&u128> for &BigUint

type Output = BigUint

impl Sub<&u128> for u128

type Output = <u128 as Sub>::Output

impl Sub<&u128> for BigInt

type Output = BigInt

impl Sub<&u128> for BigUint

type Output = BigUint

impl Sub<&usize> for &usize

type Output = <usize as Sub>::Output

impl Sub<&usize> for &BigInt

type Output = BigInt

impl Sub<&usize> for &BigUint

type Output = BigUint

impl Sub<&usize> for usize

type Output = <usize as Sub>::Output

impl Sub<&usize> for BigInt

type Output = BigInt

impl Sub<&usize> for BigUint

type Output = BigUint

impl Sub<&Saturating<i8>> for &Saturating<i8>

type Output = <Saturating<i8> as Sub>::Output

impl Sub<&Saturating<i8>> for Saturating<i8>

type Output = <Saturating<i8> as Sub>::Output

impl Sub<&Saturating<i16>> for &Saturating<i16>

type Output = <Saturating<i16> as Sub>::Output

impl Sub<&Saturating<i16>> for Saturating<i16>

type Output = <Saturating<i16> as Sub>::Output

impl Sub<&Saturating<i32>> for &Saturating<i32>

type Output = <Saturating<i32> as Sub>::Output

impl Sub<&Saturating<i32>> for Saturating<i32>

type Output = <Saturating<i32> as Sub>::Output

impl Sub<&Saturating<i64>> for &Saturating<i64>

type Output = <Saturating<i64> as Sub>::Output

impl Sub<&Saturating<i64>> for Saturating<i64>

type Output = <Saturating<i64> as Sub>::Output

impl Sub<&Saturating<i128>> for &Saturating<i128>

type Output = <Saturating<i128> as Sub>::Output

impl Sub<&Saturating<i128>> for Saturating<i128>

type Output = <Saturating<i128> as Sub>::Output

impl Sub<&Saturating<isize>> for &Saturating<isize>

type Output = <Saturating<isize> as Sub>::Output

impl Sub<&Saturating<isize>> for Saturating<isize>

type Output = <Saturating<isize> as Sub>::Output

impl Sub<&Saturating<u8>> for &Saturating<u8>

type Output = <Saturating<u8> as Sub>::Output

impl Sub<&Saturating<u8>> for Saturating<u8>

type Output = <Saturating<u8> as Sub>::Output

impl Sub<&Saturating<u16>> for &Saturating<u16>

type Output = <Saturating<u16> as Sub>::Output

impl Sub<&Saturating<u16>> for Saturating<u16>

type Output = <Saturating<u16> as Sub>::Output

impl Sub<&Saturating<u32>> for &Saturating<u32>

type Output = <Saturating<u32> as Sub>::Output

impl Sub<&Saturating<u32>> for Saturating<u32>

type Output = <Saturating<u32> as Sub>::Output

impl Sub<&Saturating<u64>> for &Saturating<u64>

type Output = <Saturating<u64> as Sub>::Output

impl Sub<&Saturating<u64>> for Saturating<u64>

type Output = <Saturating<u64> as Sub>::Output

impl Sub<&Saturating<u128>> for &Saturating<u128>

type Output = <Saturating<u128> as Sub>::Output

impl Sub<&Saturating<u128>> for Saturating<u128>

type Output = <Saturating<u128> as Sub>::Output

impl Sub<&Saturating<usize>> for &Saturating<usize>

type Output = <Saturating<usize> as Sub>::Output

impl Sub<&Saturating<usize>> for Saturating<usize>

type Output = <Saturating<usize> as Sub>::Output

impl Sub<&Wrapping<i8>> for &Wrapping<i8>

type Output = <Wrapping<i8> as Sub>::Output

impl Sub<&Wrapping<i8>> for Wrapping<i8>

type Output = <Wrapping<i8> as Sub>::Output

impl Sub<&Wrapping<i16>> for &Wrapping<i16>

type Output = <Wrapping<i16> as Sub>::Output

impl Sub<&Wrapping<i16>> for Wrapping<i16>

type Output = <Wrapping<i16> as Sub>::Output

impl Sub<&Wrapping<i32>> for &Wrapping<i32>

type Output = <Wrapping<i32> as Sub>::Output

impl Sub<&Wrapping<i32>> for Wrapping<i32>

type Output = <Wrapping<i32> as Sub>::Output

impl Sub<&Wrapping<i64>> for &Wrapping<i64>

type Output = <Wrapping<i64> as Sub>::Output

impl Sub<&Wrapping<i64>> for Wrapping<i64>

type Output = <Wrapping<i64> as Sub>::Output

impl Sub<&Wrapping<i128>> for &Wrapping<i128>

type Output = <Wrapping<i128> as Sub>::Output

impl Sub<&Wrapping<i128>> for Wrapping<i128>

type Output = <Wrapping<i128> as Sub>::Output

impl Sub<&Wrapping<isize>> for &Wrapping<isize>

type Output = <Wrapping<isize> as Sub>::Output

impl Sub<&Wrapping<isize>> for Wrapping<isize>

type Output = <Wrapping<isize> as Sub>::Output

impl Sub<&Wrapping<u8>> for &Wrapping<u8>

type Output = <Wrapping<u8> as Sub>::Output

impl Sub<&Wrapping<u8>> for Wrapping<u8>

type Output = <Wrapping<u8> as Sub>::Output

impl Sub<&Wrapping<u16>> for &Wrapping<u16>

type Output = <Wrapping<u16> as Sub>::Output

impl Sub<&Wrapping<u16>> for Wrapping<u16>

type Output = <Wrapping<u16> as Sub>::Output

impl Sub<&Wrapping<u32>> for &Wrapping<u32>

type Output = <Wrapping<u32> as Sub>::Output

impl Sub<&Wrapping<u32>> for Wrapping<u32>

type Output = <Wrapping<u32> as Sub>::Output

impl Sub<&Wrapping<u64>> for &Wrapping<u64>

type Output = <Wrapping<u64> as Sub>::Output

impl Sub<&Wrapping<u64>> for Wrapping<u64>

type Output = <Wrapping<u64> as Sub>::Output

impl Sub<&Wrapping<u128>> for &Wrapping<u128>

type Output = <Wrapping<u128> as Sub>::Output

impl Sub<&Wrapping<u128>> for Wrapping<u128>

type Output = <Wrapping<u128> as Sub>::Output

impl Sub<&Wrapping<usize>> for &Wrapping<usize>

type Output = <Wrapping<usize> as Sub>::Output

impl Sub<&Wrapping<usize>> for Wrapping<usize>

type Output = <Wrapping<usize> as Sub>::Output

impl Sub<&bf16> for &bf16

type Output = <bf16 as Sub>::Output

impl Sub<&bf16> for bf16

type Output = <bf16 as Sub>::Output

impl Sub<&f16> for &f16

type Output = <f16 as Sub>::Output

impl Sub<&f16> for f16

type Output = <f16 as Sub>::Output

impl Sub<&BigInt> for &i8

type Output = BigInt

impl Sub<&BigInt> for &i16

type Output = BigInt

impl Sub<&BigInt> for &i32

type Output = BigInt

impl Sub<&BigInt> for &i64

type Output = BigInt

impl Sub<&BigInt> for &i128

type Output = BigInt

impl Sub<&BigInt> for &isize

type Output = BigInt

impl Sub<&BigInt> for &u8

type Output = BigInt

impl Sub<&BigInt> for &u16

type Output = BigInt

impl Sub<&BigInt> for &u32

type Output = BigInt

impl Sub<&BigInt> for &u64

type Output = BigInt

impl Sub<&BigInt> for &u128

type Output = BigInt

impl Sub<&BigInt> for &usize

type Output = BigInt

impl Sub<&BigInt> for &BigInt

type Output = BigInt

impl Sub<&BigInt> for i8

type Output = BigInt

impl Sub<&BigInt> for i16

type Output = BigInt

impl Sub<&BigInt> for i32

type Output = BigInt

impl Sub<&BigInt> for i64

type Output = BigInt

impl Sub<&BigInt> for i128

type Output = BigInt

impl Sub<&BigInt> for isize

type Output = BigInt

impl Sub<&BigInt> for u8

type Output = BigInt

impl Sub<&BigInt> for u16

type Output = BigInt

impl Sub<&BigInt> for u32

type Output = BigInt

impl Sub<&BigInt> for u64

type Output = BigInt

impl Sub<&BigInt> for u128

type Output = BigInt

impl Sub<&BigInt> for usize

type Output = BigInt

impl Sub<&BigInt> for BigInt

type Output = BigInt

impl Sub<&BigUint> for &u8

type Output = BigUint

impl Sub<&BigUint> for &u16

type Output = BigUint

impl Sub<&BigUint> for &u32

type Output = BigUint

impl Sub<&BigUint> for &u64

type Output = BigUint

impl Sub<&BigUint> for &u128

type Output = BigUint

impl Sub<&BigUint> for &usize

type Output = BigUint

impl Sub<&BigUint> for &BigUint

type Output = BigUint

impl Sub<&BigUint> for u8

type Output = BigUint

impl Sub<&BigUint> for u16

type Output = BigUint

impl Sub<&BigUint> for u32

type Output = BigUint

impl Sub<&BigUint> for u64

type Output = BigUint

impl Sub<&BigUint> for u128

type Output = BigUint

impl Sub<&BigUint> for usize

type Output = BigUint

impl Sub<&BigUint> for BigUint

type Output = BigUint

impl Sub<i8> for &BigInt

type Output = BigInt

impl Sub<i8> for BigInt

type Output = BigInt

impl Sub<i16> for &BigInt

type Output = BigInt

impl Sub<i16> for BigInt

type Output = BigInt

impl Sub<i32> for &BigInt

type Output = BigInt

impl Sub<i32> for BigInt

type Output = BigInt

impl Sub<i64> for &BigInt

type Output = BigInt

impl Sub<i64> for BigInt

type Output = BigInt

impl Sub<i128> for &BigInt

type Output = BigInt

impl Sub<i128> for BigInt

type Output = BigInt

impl Sub<isize> for &BigInt

type Output = BigInt

impl Sub<isize> for BigInt

type Output = BigInt

impl Sub<u8> for &BigInt

type Output = BigInt

impl Sub<u8> for &BigUint

type Output = BigUint

impl Sub<u8> for BigInt

type Output = BigInt

impl Sub<u8> for BigUint

type Output = BigUint

impl Sub<u16> for &BigInt

type Output = BigInt

impl Sub<u16> for &BigUint

type Output = BigUint

impl Sub<u16> for BigInt

type Output = BigInt

impl Sub<u16> for BigUint

type Output = BigUint

impl Sub<u32> for &BigInt

type Output = BigInt

impl Sub<u32> for &BigUint

type Output = BigUint

impl Sub<u32> for BigInt

type Output = BigInt

impl Sub<u32> for BigUint

type Output = BigUint

impl Sub<u64> for &BigInt

type Output = BigInt

impl Sub<u64> for &BigUint

type Output = BigUint

impl Sub<u64> for BigInt

type Output = BigInt

impl Sub<u64> for BigUint

type Output = BigUint

impl Sub<u128> for &BigInt

type Output = BigInt

impl Sub<u128> for &BigUint

type Output = BigUint

impl Sub<u128> for BigInt

type Output = BigInt

impl Sub<u128> for BigUint

type Output = BigUint

impl Sub<usize> for &BigInt

type Output = BigInt

impl Sub<usize> for &BigUint

type Output = BigUint

impl Sub<usize> for BigInt

type Output = BigInt

impl Sub<usize> for BigUint

type Output = BigUint

impl Sub<Duration> for std::time::Instant

type Output = Instant

impl Sub<Duration> for SystemTime

type Output = SystemTime

impl Sub<Duration> for NaiveDateTime

Subtract std::time::Duration from NaiveDateTime.

As a part of Chrono’s [leap second handling] the subtraction assumes that there is no leap second ever, except when the NaiveDateTime itself represents a leap second in which case the assumption becomes that there is exactly a single leap second ever.

Panics

Panics if the resulting date would be out of range. Consider using NaiveDateTime::checked_sub_signed to get an Option instead.

type Output = NaiveDateTime

impl Sub<Duration> for NaiveTime

Subtract std::time::Duration from NaiveTime.

This wraps around and never overflows or underflows. In particular the subtraction ignores integral number of days.

type Output = NaiveTime

impl Sub<Duration> for tokio::time::instant::Instant

type Output = Instant

impl Sub<Months> for NaiveDate

Subtract Months from NaiveDate.

The result will be clamped to valid days in the resulting month, see checked_sub_months for details.

Panics

Panics if the resulting date would be out of range. Consider using NaiveDate::checked_sub_months to get an Option instead.

Example

use chrono::{NaiveDate, Months};

let from_ymd = |y, m, d| NaiveDate::from_ymd_opt(y, m, d).unwrap();

assert_eq!(from_ymd(2014, 1, 1) - Months::new(11), from_ymd(2013, 2, 1));
assert_eq!(from_ymd(2014, 1, 1) - Months::new(12), from_ymd(2013, 1, 1));
assert_eq!(from_ymd(2014, 1, 1) - Months::new(13), from_ymd(2012, 12, 1));

type Output = NaiveDate

impl Sub<Months> for NaiveDateTime

Subtract Months from NaiveDateTime.

The result will be clamped to valid days in the resulting month, see NaiveDateTime::checked_sub_months for details.

Panics

Panics if the resulting date would be out of range. Consider using NaiveDateTime::checked_sub_months to get an Option instead.

Example

use chrono::{Months, NaiveDate};

assert_eq!(
    NaiveDate::from_ymd_opt(2014, 01, 01).unwrap().and_hms_opt(01, 00, 00).unwrap() - Months::new(11),
    NaiveDate::from_ymd_opt(2013, 02, 01).unwrap().and_hms_opt(01, 00, 00).unwrap()
);
assert_eq!(
    NaiveDate::from_ymd_opt(2014, 01, 01).unwrap().and_hms_opt(00, 02, 00).unwrap() - Months::new(12),
    NaiveDate::from_ymd_opt(2013, 01, 01).unwrap().and_hms_opt(00, 02, 00).unwrap()
);
assert_eq!(
    NaiveDate::from_ymd_opt(2014, 01, 01).unwrap().and_hms_opt(00, 00, 03).unwrap() - Months::new(13),
    NaiveDate::from_ymd_opt(2012, 12, 01).unwrap().and_hms_opt(00, 00, 03).unwrap()
);

type Output = NaiveDateTime

impl Sub<Days> for NaiveDate

Subtract Days from NaiveDate.

Panics

Panics if the resulting date would be out of range. Consider using NaiveDate::checked_sub_days to get an Option instead.

type Output = NaiveDate

impl Sub<Days> for NaiveDateTime

Subtract Days from NaiveDateTime.

Panics

Panics if the resulting date would be out of range. Consider using checked_sub_days to get an Option instead.

type Output = NaiveDateTime

impl Sub<FixedOffset> for NaiveDateTime

Subtract FixedOffset from NaiveDateTime.

Panics

Panics if the resulting date would be out of range. Consider using checked_sub_offset to get an Option instead.

type Output = NaiveDateTime

impl Sub<FixedOffset> for NaiveTime

Subtract FixedOffset from NaiveTime.

This wraps around and never overflows or underflows. In particular the subtraction ignores integral number of days.

type Output = NaiveTime

impl Sub<TimeDelta> for NaiveDate

Subtract TimeDelta from NaiveDate.

This discards the fractional days in TimeDelta, rounding to the closest integral number of days towards TimeDelta::zero(). It is the same as the addition with a negated TimeDelta.

Panics

Panics if the resulting date would be out of range. Consider using NaiveDate::checked_sub_signed to get an Option instead.

Example

use chrono::{TimeDelta, NaiveDate};

let from_ymd = |y, m, d| NaiveDate::from_ymd_opt(y, m, d).unwrap();

assert_eq!(from_ymd(2014, 1, 1) - TimeDelta::zero(),             from_ymd(2014, 1, 1));
assert_eq!(from_ymd(2014, 1, 1) - TimeDelta::seconds(86399),     from_ymd(2014, 1, 1));
assert_eq!(from_ymd(2014, 1, 1) - TimeDelta::seconds(-86399),    from_ymd(2014, 1, 1));
assert_eq!(from_ymd(2014, 1, 1) - TimeDelta::days(1),            from_ymd(2013, 12, 31));
assert_eq!(from_ymd(2014, 1, 1) - TimeDelta::days(-1),           from_ymd(2014, 1, 2));
assert_eq!(from_ymd(2014, 1, 1) - TimeDelta::days(364),          from_ymd(2013, 1, 2));
assert_eq!(from_ymd(2014, 1, 1) - TimeDelta::days(365*4 + 1),    from_ymd(2010, 1, 1));
assert_eq!(from_ymd(2014, 1, 1) - TimeDelta::days(365*400 + 97), from_ymd(1614, 1, 1));

type Output = NaiveDate

impl Sub<TimeDelta> for NaiveDateTime

Subtract TimeDelta from NaiveDateTime.

This is the same as the addition with a negated TimeDelta.

As a part of Chrono’s leap second handling the subtraction assumes that there is no leap second ever, except when the NaiveDateTime itself represents a leap second in which case the assumption becomes that there is exactly a single leap second ever.

Panics

Panics if the resulting date would be out of range. Consider using NaiveDateTime::checked_sub_signed to get an Option instead.

Example

use chrono::{TimeDelta, NaiveDate};

let from_ymd = |y, m, d| NaiveDate::from_ymd_opt(y, m, d).unwrap();

let d = from_ymd(2016, 7, 8);
let hms = |h, m, s| d.and_hms_opt(h, m, s).unwrap();
assert_eq!(hms(3, 5, 7) - TimeDelta::zero(),             hms(3, 5, 7));
assert_eq!(hms(3, 5, 7) - TimeDelta::seconds(1),         hms(3, 5, 6));
assert_eq!(hms(3, 5, 7) - TimeDelta::seconds(-1),        hms(3, 5, 8));
assert_eq!(hms(3, 5, 7) - TimeDelta::seconds(3600 + 60), hms(2, 4, 7));
assert_eq!(hms(3, 5, 7) - TimeDelta::seconds(86_400),
           from_ymd(2016, 7, 7).and_hms_opt(3, 5, 7).unwrap());
assert_eq!(hms(3, 5, 7) - TimeDelta::days(365),
           from_ymd(2015, 7, 9).and_hms_opt(3, 5, 7).unwrap());

let hmsm = |h, m, s, milli| d.and_hms_milli_opt(h, m, s, milli).unwrap();
assert_eq!(hmsm(3, 5, 7, 450) - TimeDelta::milliseconds(670), hmsm(3, 5, 6, 780));

Leap seconds are handled, but the subtraction assumes that it is the only leap second happened.

let leap = hmsm(3, 5, 59, 1_300);
assert_eq!(leap - TimeDelta::zero(),            hmsm(3, 5, 59, 1_300));
assert_eq!(leap - TimeDelta::milliseconds(200), hmsm(3, 5, 59, 1_100));
assert_eq!(leap - TimeDelta::milliseconds(500), hmsm(3, 5, 59, 800));
assert_eq!(leap - TimeDelta::seconds(60),       hmsm(3, 5, 0, 300));
assert_eq!(leap - TimeDelta::days(1),
           from_ymd(2016, 7, 7).and_hms_milli_opt(3, 6, 0, 300).unwrap());

type Output = NaiveDateTime

impl Sub<TimeDelta> for NaiveTime

Subtract TimeDelta from NaiveTime.

This wraps around and never overflows or underflows. In particular the subtraction ignores integral number of days. This is the same as addition with a negated TimeDelta.

As a part of Chrono’s leap second handling, the subtraction assumes that there is no leap second ever, except when the NaiveTime itself represents a leap second in which case the assumption becomes that there is exactly a single leap second ever.

Example

use chrono::{TimeDelta, NaiveTime};

let from_hmsm = |h, m, s, milli| { NaiveTime::from_hms_milli_opt(h, m, s, milli).unwrap() };

assert_eq!(from_hmsm(3, 5, 7, 0) - TimeDelta::zero(),                  from_hmsm(3, 5, 7, 0));
assert_eq!(from_hmsm(3, 5, 7, 0) - TimeDelta::seconds(1),              from_hmsm(3, 5, 6, 0));
assert_eq!(from_hmsm(3, 5, 7, 0) - TimeDelta::seconds(60 + 5),         from_hmsm(3, 4, 2, 0));
assert_eq!(from_hmsm(3, 5, 7, 0) - TimeDelta::seconds(2*60*60 + 6*60), from_hmsm(0, 59, 7, 0));
assert_eq!(from_hmsm(3, 5, 7, 0) - TimeDelta::milliseconds(80),        from_hmsm(3, 5, 6, 920));
assert_eq!(from_hmsm(3, 5, 7, 950) - TimeDelta::milliseconds(280),     from_hmsm(3, 5, 7, 670));

The subtraction wraps around.

assert_eq!(from_hmsm(3, 5, 7, 0) - TimeDelta::seconds(8*60*60), from_hmsm(19, 5, 7, 0));
assert_eq!(from_hmsm(3, 5, 7, 0) - TimeDelta::days(800),        from_hmsm(3, 5, 7, 0));

Leap seconds are handled, but the subtraction assumes that it is the only leap second happened.

let leap = from_hmsm(3, 5, 59, 1_300);
assert_eq!(leap - TimeDelta::zero(),            from_hmsm(3, 5, 59, 1_300));
assert_eq!(leap - TimeDelta::milliseconds(200), from_hmsm(3, 5, 59, 1_100));
assert_eq!(leap - TimeDelta::milliseconds(500), from_hmsm(3, 5, 59, 800));
assert_eq!(leap - TimeDelta::seconds(60),       from_hmsm(3, 5, 0, 300));
assert_eq!(leap - TimeDelta::days(1),           from_hmsm(3, 6, 0, 300));

type Output = NaiveTime

impl Sub<bf16> for &bf16

type Output = <bf16 as Sub>::Output

impl Sub<f16> for &f16

type Output = <f16 as Sub>::Output

impl Sub<BigInt> for &i8

type Output = BigInt

impl Sub<BigInt> for &i16

type Output = BigInt

impl Sub<BigInt> for &i32

type Output = BigInt

impl Sub<BigInt> for &i64

type Output = BigInt

impl Sub<BigInt> for &i128

type Output = BigInt

impl Sub<BigInt> for &isize

type Output = BigInt

impl Sub<BigInt> for &u8

type Output = BigInt

impl Sub<BigInt> for &u16

type Output = BigInt

impl Sub<BigInt> for &u32

type Output = BigInt

impl Sub<BigInt> for &u64

type Output = BigInt

impl Sub<BigInt> for &u128

type Output = BigInt

impl Sub<BigInt> for &usize

type Output = BigInt

impl Sub<BigInt> for &BigInt

type Output = BigInt

impl Sub<BigInt> for i8

type Output = BigInt

impl Sub<BigInt> for i16

type Output = BigInt

impl Sub<BigInt> for i32

type Output = BigInt

impl Sub<BigInt> for i64

type Output = BigInt

impl Sub<BigInt> for i128

type Output = BigInt

impl Sub<BigInt> for isize

type Output = BigInt

impl Sub<BigInt> for u8

type Output = BigInt

impl Sub<BigInt> for u16

type Output = BigInt

impl Sub<BigInt> for u32

type Output = BigInt

impl Sub<BigInt> for u64

type Output = BigInt

impl Sub<BigInt> for u128

type Output = BigInt

impl Sub<BigInt> for usize

type Output = BigInt

impl Sub<BigUint> for &u8

type Output = BigUint

impl Sub<BigUint> for &u16

type Output = BigUint

impl Sub<BigUint> for &u32

type Output = BigUint

impl Sub<BigUint> for &u64

type Output = BigUint

impl Sub<BigUint> for &u128

type Output = BigUint

impl Sub<BigUint> for &usize

type Output = BigUint

impl Sub<BigUint> for &BigUint

type Output = BigUint

impl Sub<BigUint> for u8

type Output = BigUint

impl Sub<BigUint> for u16

type Output = BigUint

impl Sub<BigUint> for u32

type Output = BigUint

impl Sub<BigUint> for u64

type Output = BigUint

impl Sub<BigUint> for u128

type Output = BigUint

impl Sub<BigUint> for usize

type Output = BigUint

impl Sub<Complex<f32>> for f32

type Output = Complex<f32>

impl Sub<Complex<f64>> for f64

type Output = Complex<f64>

impl Sub<Complex<i8>> for i8

type Output = Complex<i8>

impl Sub<Complex<i16>> for i16

type Output = Complex<i16>

impl Sub<Complex<i32>> for i32

type Output = Complex<i32>

impl Sub<Complex<i64>> for i64

type Output = Complex<i64>

impl Sub<Complex<i128>> for i128

type Output = Complex<i128>

impl Sub<Complex<isize>> for isize

type Output = Complex<isize>

impl Sub<Complex<u8>> for u8

type Output = Complex<u8>

impl Sub<Complex<u16>> for u16

type Output = Complex<u16>

impl Sub<Complex<u32>> for u32

type Output = Complex<u32>

impl Sub<Complex<u64>> for u64

type Output = Complex<u64>

impl Sub<Complex<u128>> for u128

type Output = Complex<u128>

impl Sub<Complex<usize>> for usize

type Output = Complex<usize>

impl Sub<B0> for UTerm

UTerm - B0 = Term

type Output = UTerm

impl Sub<B1> for UInt<UTerm, B1>

UInt<UTerm, B1> - B1 = UTerm

type Output = UTerm

impl<'a> Sub<&'a i256> for i256

type Output = i256

impl<'a> Sub<&'a Complex<f32>> for f32

type Output = Complex<f32>

impl<'a> Sub<&'a Complex<f64>> for f64

type Output = Complex<f64>

impl<'a> Sub<&'a Complex<i8>> for i8

type Output = Complex<i8>

impl<'a> Sub<&'a Complex<i16>> for i16

type Output = Complex<i16>

impl<'a> Sub<&'a Complex<i32>> for i32

type Output = Complex<i32>

impl<'a> Sub<&'a Complex<i64>> for i64

type Output = Complex<i64>

impl<'a> Sub<&'a Complex<i128>> for i128

type Output = Complex<i128>

impl<'a> Sub<&'a Complex<isize>> for isize

type Output = Complex<isize>

impl<'a> Sub<&'a Complex<u8>> for u8

type Output = Complex<u8>

impl<'a> Sub<&'a Complex<u16>> for u16

type Output = Complex<u16>

impl<'a> Sub<&'a Complex<u32>> for u32

type Output = Complex<u32>

impl<'a> Sub<&'a Complex<u64>> for u64

type Output = Complex<u64>

impl<'a> Sub<&'a Complex<u128>> for u128

type Output = Complex<u128>

impl<'a> Sub<&'a Complex<usize>> for usize

type Output = Complex<usize>

impl<'a> Sub<f32> for &'a f32

type Output = <f32 as Sub>::Output

impl<'a> Sub<f64> for &'a f64

type Output = <f64 as Sub>::Output

impl<'a> Sub<i8> for &'a i8

type Output = <i8 as Sub>::Output

impl<'a> Sub<i16> for &'a i16

type Output = <i16 as Sub>::Output

impl<'a> Sub<i32> for &'a i32

type Output = <i32 as Sub>::Output

impl<'a> Sub<i64> for &'a i64

type Output = <i64 as Sub>::Output

impl<'a> Sub<i128> for &'a i128

type Output = <i128 as Sub>::Output

impl<'a> Sub<isize> for &'a isize

type Output = <isize as Sub>::Output

impl<'a> Sub<u8> for &'a u8

type Output = <u8 as Sub>::Output

impl<'a> Sub<u16> for &'a u16

type Output = <u16 as Sub>::Output

impl<'a> Sub<u32> for &'a u32

type Output = <u32 as Sub>::Output

impl<'a> Sub<u64> for &'a u64

type Output = <u64 as Sub>::Output

impl<'a> Sub<u128> for &'a u128

type Output = <u128 as Sub>::Output

impl<'a> Sub<usize> for &'a usize

type Output = <usize as Sub>::Output

impl<'a> Sub<i256> for &'a i256

type Output = i256

impl<'a> Sub<Saturating<i8>> for &'a Saturating<i8>

type Output = <Saturating<i8> as Sub>::Output

impl<'a> Sub<Saturating<i16>> for &'a Saturating<i16>

type Output = <Saturating<i16> as Sub>::Output

impl<'a> Sub<Saturating<i32>> for &'a Saturating<i32>

type Output = <Saturating<i32> as Sub>::Output

impl<'a> Sub<Saturating<i64>> for &'a Saturating<i64>

type Output = <Saturating<i64> as Sub>::Output

impl<'a> Sub<Saturating<i128>> for &'a Saturating<i128>

type Output = <Saturating<i128> as Sub>::Output

impl<'a> Sub<Saturating<isize>> for &'a Saturating<isize>

type Output = <Saturating<isize> as Sub>::Output

impl<'a> Sub<Saturating<u8>> for &'a Saturating<u8>

type Output = <Saturating<u8> as Sub>::Output

impl<'a> Sub<Saturating<u16>> for &'a Saturating<u16>

type Output = <Saturating<u16> as Sub>::Output

impl<'a> Sub<Saturating<u32>> for &'a Saturating<u32>

type Output = <Saturating<u32> as Sub>::Output

impl<'a> Sub<Saturating<u64>> for &'a Saturating<u64>

type Output = <Saturating<u64> as Sub>::Output

impl<'a> Sub<Saturating<u128>> for &'a Saturating<u128>

type Output = <Saturating<u128> as Sub>::Output

impl<'a> Sub<Saturating<usize>> for &'a Saturating<usize>

type Output = <Saturating<usize> as Sub>::Output

impl<'a> Sub<Wrapping<i8>> for &'a Wrapping<i8>

type Output = <Wrapping<i8> as Sub>::Output

impl<'a> Sub<Wrapping<i16>> for &'a Wrapping<i16>

type Output = <Wrapping<i16> as Sub>::Output

impl<'a> Sub<Wrapping<i32>> for &'a Wrapping<i32>

type Output = <Wrapping<i32> as Sub>::Output

impl<'a> Sub<Wrapping<i64>> for &'a Wrapping<i64>

type Output = <Wrapping<i64> as Sub>::Output

impl<'a> Sub<Wrapping<i128>> for &'a Wrapping<i128>

type Output = <Wrapping<i128> as Sub>::Output

impl<'a> Sub<Wrapping<isize>> for &'a Wrapping<isize>

type Output = <Wrapping<isize> as Sub>::Output

impl<'a> Sub<Wrapping<u8>> for &'a Wrapping<u8>

type Output = <Wrapping<u8> as Sub>::Output

impl<'a> Sub<Wrapping<u16>> for &'a Wrapping<u16>

type Output = <Wrapping<u16> as Sub>::Output

impl<'a> Sub<Wrapping<u32>> for &'a Wrapping<u32>

type Output = <Wrapping<u32> as Sub>::Output

impl<'a> Sub<Wrapping<u64>> for &'a Wrapping<u64>

type Output = <Wrapping<u64> as Sub>::Output

impl<'a> Sub<Wrapping<u128>> for &'a Wrapping<u128>

type Output = <Wrapping<u128> as Sub>::Output

impl<'a> Sub<Wrapping<usize>> for &'a Wrapping<usize>

type Output = <Wrapping<usize> as Sub>::Output

impl<'a> Sub<Complex<f32>> for &'a f32

type Output = Complex<f32>

impl<'a> Sub<Complex<f64>> for &'a f64

type Output = Complex<f64>

impl<'a> Sub<Complex<i8>> for &'a i8

type Output = Complex<i8>

impl<'a> Sub<Complex<i16>> for &'a i16

type Output = Complex<i16>

impl<'a> Sub<Complex<i32>> for &'a i32

type Output = Complex<i32>

impl<'a> Sub<Complex<i64>> for &'a i64

type Output = Complex<i64>

impl<'a> Sub<Complex<i128>> for &'a i128

type Output = Complex<i128>

impl<'a> Sub<Complex<isize>> for &'a isize

type Output = Complex<isize>

impl<'a> Sub<Complex<u8>> for &'a u8

type Output = Complex<u8>

impl<'a> Sub<Complex<u16>> for &'a u16

type Output = Complex<u16>

impl<'a> Sub<Complex<u32>> for &'a u32

type Output = Complex<u32>

impl<'a> Sub<Complex<u64>> for &'a u64

type Output = Complex<u64>

impl<'a> Sub<Complex<u128>> for &'a u128

type Output = Complex<u128>

impl<'a> Sub<Complex<usize>> for &'a usize

type Output = Complex<usize>

impl<'a, 'b> Sub<&'a Complex<f32>> for &'b f32

type Output = Complex<f32>

impl<'a, 'b> Sub<&'a Complex<f64>> for &'b f64

type Output = Complex<f64>

impl<'a, 'b> Sub<&'a Complex<i8>> for &'b i8

type Output = Complex<i8>

impl<'a, 'b> Sub<&'a Complex<i16>> for &'b i16

type Output = Complex<i16>

impl<'a, 'b> Sub<&'a Complex<i32>> for &'b i32

type Output = Complex<i32>

impl<'a, 'b> Sub<&'a Complex<i64>> for &'b i64

type Output = Complex<i64>

impl<'a, 'b> Sub<&'a Complex<i128>> for &'b i128

type Output = Complex<i128>

impl<'a, 'b> Sub<&'a Complex<isize>> for &'b isize

type Output = Complex<isize>

impl<'a, 'b> Sub<&'a Complex<u8>> for &'b u8

type Output = Complex<u8>

impl<'a, 'b> Sub<&'a Complex<u16>> for &'b u16

type Output = Complex<u16>

impl<'a, 'b> Sub<&'a Complex<u32>> for &'b u32

type Output = Complex<u32>

impl<'a, 'b> Sub<&'a Complex<u64>> for &'b u64

type Output = Complex<u64>

impl<'a, 'b> Sub<&'a Complex<u128>> for &'b u128

type Output = Complex<u128>

impl<'a, 'b> Sub<&'a Complex<usize>> for &'b usize

type Output = Complex<usize>

impl<'a, 'b> Sub<&'b i256> for &'a i256

type Output = i256

impl<'a, 'b, T> Sub<&'b Complex<T>> for &'a Complex<T>

where T: Clone + Num,

type Output = Complex<T>

impl<'a, 'b, T> Sub<&'b Ratio<T>> for &'a Ratio<T>

where T: Clone + Integer,

type Output = Ratio<T>

impl<'a, 'b, T> Sub<&'a T> for &'b Complex<T>

where T: Clone + Num,

type Output = Complex<T>

impl<'a, 'b, T> Sub<&'b T> for &'a Ratio<T>

where T: Clone + Integer,

type Output = Ratio<T>

impl<'a, K, V, S, Q> Sub<&Q> for &'a DashMap<K, V, S>

where K: 'a + Eq + Hash + Borrow<Q>, V: 'a, S: BuildHasher + Clone, Q: Hash + Eq + ?Sized,

type Output = Option<(K, V)>

impl<'a, T> Sub for &'a OrderedFloat<T>

where &'a T: Sub,

type Output = OrderedFloat<<&'a T as Sub>::Output>

impl<'a, T> Sub<&'a Complex<T>> for Complex<T>

where T: Clone + Num,

type Output = Complex<T>

impl<'a, T> Sub<&'a Ratio<T>> for Ratio<T>

where T: Clone + Integer,

type Output = Ratio<T>

impl<'a, T> Sub<&'a OrderedFloat<T>> for OrderedFloat<T>

where T: Sub<&'a T>,

type Output = OrderedFloat<<T as Sub<&'a T>>::Output>

impl<'a, T> Sub<&'a T> for &'a OrderedFloat<T>

where &'a T: Sub,

type Output = OrderedFloat<<&'a T as Sub>::Output>

impl<'a, T> Sub<&'a T> for Complex<T>

where T: Clone + Num,

type Output = Complex<T>

impl<'a, T> Sub<&'a T> for Ratio<T>

where T: Clone + Integer,

type Output = Ratio<T>

impl<'a, T> Sub<&'a T> for OrderedFloat<T>

where T: Sub<&'a T>,

type Output = OrderedFloat<<T as Sub<&'a T>>::Output>

impl<'a, T> Sub<Complex<T>> for &'a Complex<T>

where T: Clone + Num,

type Output = Complex<T>

impl<'a, T> Sub<Ratio<T>> for &'a Ratio<T>

where T: Clone + Integer,

type Output = Ratio<T>

impl<'a, T> Sub<OrderedFloat<T>> for &'a OrderedFloat<T>

where &'a T: Sub<T>,

type Output = OrderedFloat<<&'a T as Sub<T>>::Output>

impl<'a, T> Sub<T> for &'a Complex<T>

where T: Clone + Num,

type Output = Complex<T>

impl<'a, T> Sub<T> for &'a Ratio<T>

where T: Clone + Integer,

type Output = Ratio<T>

impl<'a, T> Sub<T> for &'a OrderedFloat<T>

where &'a T: Sub<T>,

type Output = OrderedFloat<<&'a T as Sub<T>>::Output>

impl<'lhs, 'rhs, T, const N: usize> Sub<&'rhs Simd<T, N>> for &'lhs Simd<T, N>

where T: SimdElement, Simd<T, N>: Sub<Output = Simd<T, N>>, LaneCount<N>: SupportedLaneCount,

type Output = Simd<T, N>

impl<T> Sub for &NotNan<T>

where T: Float,

type Output = NotNan<T>

impl<T> Sub for Complex<T>

where T: Clone + Num,

type Output = Complex<T>

impl<T> Sub for Ratio<T>

where T: Clone + Integer,

type Output = Ratio<T>

impl<T> Sub for NotNan<T>

where T: Float,

type Output = NotNan<T>

impl<T> Sub for OrderedFloat<T>

where T: Sub,

type Output = OrderedFloat<<T as Sub>::Output>

impl<T> Sub<&NotNan<T>> for NotNan<T>

where T: Float,

type Output = NotNan<T>

impl<T> Sub<&T> for &NotNan<T>

where T: Float,

type Output = NotNan<T>

impl<T> Sub<&T> for NotNan<T>

where T: Float,

type Output = NotNan<T>

impl<T> Sub<NotNan<T>> for &NotNan<T>

where T: Float,

type Output = NotNan<T>

impl<T> Sub<T> for &NotNan<T>

where T: Float,

type Output = NotNan<T>

impl<T> Sub<T> for Complex<T>

where T: Clone + Num,

type Output = Complex<T>

impl<T> Sub<T> for Ratio<T>

where T: Clone + Integer,

type Output = Ratio<T>

impl<T> Sub<T> for NotNan<T>

where T: Float,

Subtracts a float directly.

Panics if the provided value is NaN or the computation results in NaN

type Output = NotNan<T>

impl<T> Sub<T> for OrderedFloat<T>

where T: Sub,

type Output = OrderedFloat<<T as Sub>::Output>

impl<T, A> Sub<&BTreeSet<T, A>> for &BTreeSet<T, A>

where T: Ord + Clone, A: Allocator + Clone,

type Output = BTreeSet<T, A>

impl<T, S1, S2> Sub<&IndexSet<T, S2>> for &IndexSet<T, S1>

where T: Eq + Hash + Clone, S1: BuildHasher + Default, S2: BuildHasher,

type Output = IndexSet<T, S1>

impl<T, S> Sub<&HashSet<T, S>> for &std::collections::hash::set::HashSet<T, S>

where T: Eq + Hash + Clone, S: BuildHasher + Default,

type Output = HashSet<T, S>

impl<T, S> Sub<&HashSet<T, S>> for &hashbrown::set::HashSet<T, S>

where T: Eq + Hash + Clone, S: BuildHasher + Default,

type Output = HashSet<T, S>

impl<T, const N: usize> Sub<&Simd<T, N>> for Simd<T, N>

where T: SimdElement, Simd<T, N>: Sub<Output = Simd<T, N>>, LaneCount<N>: SupportedLaneCount,

type Output = Simd<T, N>

impl<T, const N: usize> Sub<Simd<T, N>> for &Simd<T, N>

where T: SimdElement, Simd<T, N>: Sub<Output = Simd<T, N>>, LaneCount<N>: SupportedLaneCount,

type Output = Simd<T, N>

impl<Tz> Sub for Date<Tz>

where Tz: TimeZone,

type Output = TimeDelta

impl<Tz> Sub for DateTime<Tz>

where Tz: TimeZone,

type Output = TimeDelta

impl<Tz> Sub<&DateTime<Tz>> for DateTime<Tz>

where Tz: TimeZone,

type Output = TimeDelta

impl<Tz> Sub<Duration> for DateTime<Tz>

where Tz: TimeZone,

Subtract std::time::Duration from DateTime.

As a part of Chrono’s [leap second handling] the subtraction assumes that there is no leap second ever, except when the DateTime itself represents a leap second in which case the assumption becomes that there is exactly a single leap second ever.

Panics

Panics if the resulting date would be out of range. Consider using DateTime<Tz>::checked_sub_signed to get an Option instead.

type Output = DateTime<Tz>

impl<Tz> Sub<Months> for DateTime<Tz>

where Tz: TimeZone,

Subtract Months from DateTime.

The result will be clamped to valid days in the resulting month, see DateTime<Tz>::checked_sub_months for details.

Panics

Panics if:

• The resulting date would be out of range.
• The local time at the resulting date does not exist or is ambiguous, for example during a daylight saving time transition.

Strongly consider using DateTime<Tz>::checked_sub_months to get an Option instead.

type Output = DateTime<Tz>

impl<Tz> Sub<Days> for DateTime<Tz>

where Tz: TimeZone,

Subtract Days from DateTime.

Panics

Panics if:

• The resulting date would be out of range.
• The local time at the resulting date does not exist or is ambiguous, for example during a daylight saving time transition.

Strongly consider using DateTime<Tz>::checked_sub_days to get an Option instead.

type Output = DateTime<Tz>

impl<Tz> Sub<FixedOffset> for DateTime<Tz>

where Tz: TimeZone,

Subtract FixedOffset from the datetime value of DateTime (offset remains unchanged).

Panics

Panics if the resulting date would be out of range.

type Output = DateTime<Tz>

impl<Tz> Sub<TimeDelta> for Date<Tz>

where Tz: TimeZone,

type Output = Date<Tz>

impl<Tz> Sub<TimeDelta> for DateTime<Tz>

where Tz: TimeZone,

Subtract TimeDelta from DateTime.

This is the same as the addition with a negated TimeDelta.

As a part of Chrono’s [leap second handling] the subtraction assumes that there is no leap second ever, except when the DateTime itself represents a leap second in which case the assumption becomes that there is exactly a single leap second ever.

Panics

Panics if the resulting date would be out of range. Consider using DateTime<Tz>::checked_sub_signed to get an Option instead.

type Output = DateTime<Tz>

impl<U> Sub<B1> for UInt<U, B0>

where U: Unsigned + Sub<B1>, <U as Sub<B1>>::Output: Unsigned,

UInt<U, B0> - B1 = UInt<U - B1, B1>

type Output = UInt<<U as Sub<B1>>::Output, B1>

impl<U> Sub<NInt<U>> for Z0

where U: Unsigned + NonZero,

Z0 - N = P

type Output = PInt<U>

impl<U> Sub<PInt<U>> for Z0

where U: Unsigned + NonZero,

Z0 - P = N

type Output = NInt<U>

impl<U> Sub<Z0> for NInt<U>

where U: Unsigned + NonZero,

NInt - Z0 = NInt

type Output = NInt<U>

impl<U> Sub<Z0> for PInt<U>

where U: Unsigned + NonZero,

PInt - Z0 = PInt

type Output = PInt<U>

impl<U, B> Sub<B0> for UInt<U, B>

where U: Unsigned, B: Bit,

UInt - B0 = UInt

type Output = UInt<U, B>

impl<U, B> Sub<B1> for UInt<UInt<U, B>, B1>

where U: Unsigned, B: Bit,

UInt<U, B1> - B1 = UInt<U, B0>

type Output = UInt<UInt<U, B>, B0>

impl<Ul, Bl, Ur> Sub<Ur> for UInt<Ul, Bl>

where Ul: Unsigned, Bl: Bit, Ur: Unsigned, UInt<Ul, Bl>: PrivateSub<Ur>, <UInt<Ul, Bl> as PrivateSub<Ur>>::Output: Trim,

Subtracting unsigned integers. We just do our PrivateSub and then Trim the output.

type Output = <<UInt<Ul, Bl> as PrivateSub<Ur>>::Output as Trim>::Output

impl<Ul, Ur> Sub<NInt<Ur>> for NInt<Ul>

where Ul: Unsigned + NonZero, Ur: Unsigned + NonZero + Cmp<Ul> + PrivateIntegerAdd<<Ur as Cmp<Ul>>::Output, Ul>,

N(Ul) - N(Ur): We resolve this with our PrivateAdd

type Output = <Ur as PrivateIntegerAdd<<Ur as Cmp<Ul>>::Output, Ul>>::Output

impl<Ul, Ur> Sub<NInt<Ur>> for PInt<Ul>

where Ul: Unsigned + NonZero + Add<Ur>, Ur: Unsigned + NonZero, <Ul as Add<Ur>>::Output: Unsigned + NonZero,

P(Ul) - N(Ur) = P(Ul + Ur)

type Output = PInt<<Ul as Add<Ur>>::Output>

impl<Ul, Ur> Sub<PInt<Ur>> for NInt<Ul>

where Ul: Unsigned + NonZero + Add<Ur>, Ur: Unsigned + NonZero, <Ul as Add<Ur>>::Output: Unsigned + NonZero,

N(Ul) - P(Ur) = N(Ul + Ur)

type Output = NInt<<Ul as Add<Ur>>::Output>

impl<Ul, Ur> Sub<PInt<Ur>> for PInt<Ul>

where Ul: Unsigned + NonZero + Cmp<Ur> + PrivateIntegerAdd<<Ul as Cmp<Ur>>::Output, Ur>, Ur: Unsigned + NonZero,

P(Ul) - P(Ur): We resolve this with our PrivateAdd

type Output = <Ul as PrivateIntegerAdd<<Ul as Cmp<Ur>>::Output, Ur>>::Output

impl<Vl, Al, Vr, Ar> Sub<TArr<Vr, Ar>> for TArr<Vl, Al>

where Vl: Sub<Vr>, Al: Sub<Ar>,

type Output = TArr<<Vl as Sub<Vr>>::Output, <Al as Sub<Ar>>::Output>

impl<const N: usize> Sub for Simd<f32, N>

where f32: SimdElement, LaneCount<N>: SupportedLaneCount,

type Output = Simd<f32, N>

impl<const N: usize> Sub for Simd<f64, N>

where f64: SimdElement, LaneCount<N>: SupportedLaneCount,

type Output = Simd<f64, N>

impl<const N: usize> Sub for Simd<i8, N>

where i8: SimdElement, LaneCount<N>: SupportedLaneCount,

type Output = Simd<i8, N>

impl<const N: usize> Sub for Simd<i16, N>

where i16: SimdElement, LaneCount<N>: SupportedLaneCount,

type Output = Simd<i16, N>

impl<const N: usize> Sub for Simd<i32, N>

where i32: SimdElement, LaneCount<N>: SupportedLaneCount,

type Output = Simd<i32, N>

impl<const N: usize> Sub for Simd<i64, N>

where i64: SimdElement, LaneCount<N>: SupportedLaneCount,

type Output = Simd<i64, N>

impl<const N: usize> Sub for Simd<isize, N>

where isize: SimdElement, LaneCount<N>: SupportedLaneCount,

type Output = Simd<isize, N>

impl<const N: usize> Sub for Simd<u8, N>

where u8: SimdElement, LaneCount<N>: SupportedLaneCount,

type Output = Simd<u8, N>

impl<const N: usize> Sub for Simd<u16, N>

where u16: SimdElement, LaneCount<N>: SupportedLaneCount,

type Output = Simd<u16, N>

impl<const N: usize> Sub for Simd<u32, N>

where u32: SimdElement, LaneCount<N>: SupportedLaneCount,

type Output = Simd<u32, N>

impl<const N: usize> Sub for Simd<u64, N>

where u64: SimdElement, LaneCount<N>: SupportedLaneCount,

type Output = Simd<u64, N>

impl<const N: usize> Sub for Simd<usize, N>

where usize: SimdElement, LaneCount<N>: SupportedLaneCount,

type Output = Simd<usize, N>