devela::all

Struct Frac

Source 
#[repr(transparent)]
pub struct Frac<T>(pub T);
Expand description

Provides comprehensive fractional operations on T, most of them const.

It’s implemented for:

  • arrays: [i8; 2]… [u128; 2]; [Int<i8>; 2]… [Int<u128>; 2].

The documentation is the same for all bit sizes. For example these are:

  • Methods for [i32; 2]: core; for [Int<i32>; 2]: core.

Tuple Fields§

§0: T

Implementations§

Source§

impl Frac<[i8; 2]>

Available on crate feature _int_i8 only.
Source

pub const fn numerator(self) -> i8 ⓘ

Returns the numerator (the first number of the sequence).

Source

pub const fn num(self) -> i8 ⓘ

Alias of numerator.

Source

pub const fn denominator(self) -> i8 ⓘ

Returns the denominator (the second number of the sequence).

Source

pub const fn den(self) -> i8 ⓘ

Alias of denominator.

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([2_i8, 1]).is_valid()];
assert![!Frac([2_i8, 0]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([2_i8, 3]).is_proper()];
assert![!Frac([3_i8, 3]).is_proper()];
assert![!Frac([4_i8, 3]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[i8; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> i8 ⓘ

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<i8>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [i8; 2]) -> Result<Frac<[i8; 2]>>

Adds two fractions.

Source§

impl Frac<[Int<i8>; 2]>

Available on crate feature _int_i8 only.
Source

pub const fn numerator(self) -> Int<i8>

Returns the numerator (the first number of the sequence).

Source

pub const fn denominator(self) -> Int<i8>

Returns the denominator (the second number of the sequence).

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([Int(2_i8), Int(1)]).is_valid()];
assert![!Frac([Int(2_i8), Int(0)]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([Int(2_i8), Int(3)]).is_proper()];
assert![!Frac([Int(3_i8), Int(3)]).is_proper()];
assert![!Frac([Int(4_i8), Int(3)]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[Int<i8>; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> Int<i8>

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<Int<i8>>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [Int<i8>; 2]) -> Result<Frac<[Int<i8>; 2]>>

Adds two fractions.

Source§

impl Frac<[i16; 2]>

Available on crate feature _int_i16 only.
Source

pub const fn numerator(self) -> i16 ⓘ

Returns the numerator (the first number of the sequence).

Source

pub const fn num(self) -> i16 ⓘ

Alias of numerator.

Source

pub const fn denominator(self) -> i16 ⓘ

Returns the denominator (the second number of the sequence).

Source

pub const fn den(self) -> i16 ⓘ

Alias of denominator.

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([2_i16, 1]).is_valid()];
assert![!Frac([2_i16, 0]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([2_i16, 3]).is_proper()];
assert![!Frac([3_i16, 3]).is_proper()];
assert![!Frac([4_i16, 3]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[i16; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> i16 ⓘ

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<i16>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [i16; 2]) -> Result<Frac<[i16; 2]>>

Adds two fractions.

Source§

impl Frac<[Int<i16>; 2]>

Available on crate feature _int_i16 only.
Source

pub const fn numerator(self) -> Int<i16>

Returns the numerator (the first number of the sequence).

Source

pub const fn denominator(self) -> Int<i16>

Returns the denominator (the second number of the sequence).

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([Int(2_i16), Int(1)]).is_valid()];
assert![!Frac([Int(2_i16), Int(0)]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([Int(2_i16), Int(3)]).is_proper()];
assert![!Frac([Int(3_i16), Int(3)]).is_proper()];
assert![!Frac([Int(4_i16), Int(3)]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[Int<i16>; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> Int<i16>

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<Int<i16>>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [Int<i16>; 2]) -> Result<Frac<[Int<i16>; 2]>>

Adds two fractions.

Source§

impl Frac<[i32; 2]>

Available on crate feature _int_i32 only.
Source

pub const fn numerator(self) -> i32 ⓘ

Returns the numerator (the first number of the sequence).

Source

pub const fn num(self) -> i32 ⓘ

Alias of numerator.

Source

pub const fn denominator(self) -> i32 ⓘ

Returns the denominator (the second number of the sequence).

Source

pub const fn den(self) -> i32 ⓘ

Alias of denominator.

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([2_i32, 1]).is_valid()];
assert![!Frac([2_i32, 0]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([2_i32, 3]).is_proper()];
assert![!Frac([3_i32, 3]).is_proper()];
assert![!Frac([4_i32, 3]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[i32; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> i32 ⓘ

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<i32>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [i32; 2]) -> Result<Frac<[i32; 2]>>

Adds two fractions.

Source§

impl Frac<[Int<i32>; 2]>

Available on crate feature _int_i32 only.
Source

pub const fn numerator(self) -> Int<i32>

Returns the numerator (the first number of the sequence).

Source

pub const fn denominator(self) -> Int<i32>

Returns the denominator (the second number of the sequence).

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([Int(2_i32), Int(1)]).is_valid()];
assert![!Frac([Int(2_i32), Int(0)]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([Int(2_i32), Int(3)]).is_proper()];
assert![!Frac([Int(3_i32), Int(3)]).is_proper()];
assert![!Frac([Int(4_i32), Int(3)]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[Int<i32>; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> Int<i32>

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<Int<i32>>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [Int<i32>; 2]) -> Result<Frac<[Int<i32>; 2]>>

Adds two fractions.

Source§

impl Frac<[i64; 2]>

Available on crate feature _int_i64 only.
Source

pub const fn numerator(self) -> i64 ⓘ

Returns the numerator (the first number of the sequence).

Source

pub const fn num(self) -> i64 ⓘ

Alias of numerator.

Source

pub const fn denominator(self) -> i64 ⓘ

Returns the denominator (the second number of the sequence).

Source

pub const fn den(self) -> i64 ⓘ

Alias of denominator.

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([2_i64, 1]).is_valid()];
assert![!Frac([2_i64, 0]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([2_i64, 3]).is_proper()];
assert![!Frac([3_i64, 3]).is_proper()];
assert![!Frac([4_i64, 3]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[i64; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> i64 ⓘ

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<i64>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [i64; 2]) -> Result<Frac<[i64; 2]>>

Adds two fractions.

Source§

impl Frac<[Int<i64>; 2]>

Available on crate feature _int_i64 only.
Source

pub const fn numerator(self) -> Int<i64>

Returns the numerator (the first number of the sequence).

Source

pub const fn denominator(self) -> Int<i64>

Returns the denominator (the second number of the sequence).

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([Int(2_i64), Int(1)]).is_valid()];
assert![!Frac([Int(2_i64), Int(0)]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([Int(2_i64), Int(3)]).is_proper()];
assert![!Frac([Int(3_i64), Int(3)]).is_proper()];
assert![!Frac([Int(4_i64), Int(3)]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[Int<i64>; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> Int<i64>

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<Int<i64>>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [Int<i64>; 2]) -> Result<Frac<[Int<i64>; 2]>>

Adds two fractions.

Source§

impl Frac<[i128; 2]>

Available on crate feature _int_i128 only.
Source

pub const fn numerator(self) -> i128 ⓘ

Returns the numerator (the first number of the sequence).

Source

pub const fn num(self) -> i128 ⓘ

Alias of numerator.

Source

pub const fn denominator(self) -> i128 ⓘ

Returns the denominator (the second number of the sequence).

Source

pub const fn den(self) -> i128 ⓘ

Alias of denominator.

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([2_i128, 1]).is_valid()];
assert![!Frac([2_i128, 0]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([2_i128, 3]).is_proper()];
assert![!Frac([3_i128, 3]).is_proper()];
assert![!Frac([4_i128, 3]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[i128; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> i128 ⓘ

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<i128>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [i128; 2]) -> Result<Frac<[i128; 2]>>

Adds two fractions.

Source§

impl Frac<[Int<i128>; 2]>

Available on crate feature _int_i128 only.
Source

pub const fn numerator(self) -> Int<i128>

Returns the numerator (the first number of the sequence).

Source

pub const fn denominator(self) -> Int<i128>

Returns the denominator (the second number of the sequence).

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([Int(2_i128), Int(1)]).is_valid()];
assert![!Frac([Int(2_i128), Int(0)]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([Int(2_i128), Int(3)]).is_proper()];
assert![!Frac([Int(3_i128), Int(3)]).is_proper()];
assert![!Frac([Int(4_i128), Int(3)]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[Int<i128>; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> Int<i128>

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<Int<i128>>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [Int<i128>; 2]) -> Result<Frac<[Int<i128>; 2]>>

Adds two fractions.

Source§

impl Frac<[isize; 2]>

Available on crate feature _int_isize only.
Source

pub const fn numerator(self) -> isize ⓘ

Returns the numerator (the first number of the sequence).

Source

pub const fn num(self) -> isize ⓘ

Alias of numerator.

Source

pub const fn denominator(self) -> isize ⓘ

Returns the denominator (the second number of the sequence).

Source

pub const fn den(self) -> isize ⓘ

Alias of denominator.

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([2_isize, 1]).is_valid()];
assert![!Frac([2_isize, 0]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([2_isize, 3]).is_proper()];
assert![!Frac([3_isize, 3]).is_proper()];
assert![!Frac([4_isize, 3]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[isize; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> isize ⓘ

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<isize>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [isize; 2]) -> Result<Frac<[isize; 2]>>

Adds two fractions.

Source§

impl Frac<[Int<isize>; 2]>

Available on crate feature _int_isize only.
Source

pub const fn numerator(self) -> Int<isize>

Returns the numerator (the first number of the sequence).

Source

pub const fn denominator(self) -> Int<isize>

Returns the denominator (the second number of the sequence).

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([Int(2_isize), Int(1)]).is_valid()];
assert![!Frac([Int(2_isize), Int(0)]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([Int(2_isize), Int(3)]).is_proper()];
assert![!Frac([Int(3_isize), Int(3)]).is_proper()];
assert![!Frac([Int(4_isize), Int(3)]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[Int<isize>; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> Int<isize>

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<Int<isize>>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [Int<isize>; 2]) -> Result<Frac<[Int<isize>; 2]>>

Adds two fractions.

Source§

impl Frac<[u8; 2]>

Available on crate feature _int_u8 only.
Source

pub const fn numerator(self) -> u8 ⓘ

Returns the numerator (the first number of the sequence).

Source

pub const fn num(self) -> u8 ⓘ

Alias of numerator.

Source

pub const fn denominator(self) -> u8 ⓘ

Returns the denominator (the second number of the sequence).

Source

pub const fn den(self) -> u8 ⓘ

Alias of denominator.

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([2_u8, 1]).is_valid()];
assert![!Frac([2_u8, 0]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([2_u8, 3]).is_proper()];
assert![!Frac([3_u8, 3]).is_proper()];
assert![!Frac([4_u8, 3]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[u8; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> u8 ⓘ

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<u8>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [u8; 2]) -> Result<Frac<[u8; 2]>>

Adds two fractions.

Source§

impl Frac<[Int<u8>; 2]>

Available on crate feature _int_u8 only.
Source

pub const fn numerator(self) -> Int<u8>

Returns the numerator (the first number of the sequence).

Source

pub const fn denominator(self) -> Int<u8>

Returns the denominator (the second number of the sequence).

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([Int(2_u8), Int(1)]).is_valid()];
assert![!Frac([Int(2_u8), Int(0)]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([Int(2_u8), Int(3)]).is_proper()];
assert![!Frac([Int(3_u8), Int(3)]).is_proper()];
assert![!Frac([Int(4_u8), Int(3)]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[Int<u8>; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> Int<u8>

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<Int<u8>>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [Int<u8>; 2]) -> Result<Frac<[Int<u8>; 2]>>

Adds two fractions.

Source§

impl Frac<[u16; 2]>

Available on crate feature _int_u16 only.
Source

pub const fn numerator(self) -> u16 ⓘ

Returns the numerator (the first number of the sequence).

Source

pub const fn num(self) -> u16 ⓘ

Alias of numerator.

Source

pub const fn denominator(self) -> u16 ⓘ

Returns the denominator (the second number of the sequence).

Source

pub const fn den(self) -> u16 ⓘ

Alias of denominator.

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([2_u16, 1]).is_valid()];
assert![!Frac([2_u16, 0]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([2_u16, 3]).is_proper()];
assert![!Frac([3_u16, 3]).is_proper()];
assert![!Frac([4_u16, 3]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[u16; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> u16 ⓘ

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<u16>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [u16; 2]) -> Result<Frac<[u16; 2]>>

Adds two fractions.

Source§

impl Frac<[Int<u16>; 2]>

Available on crate feature _int_u16 only.
Source

pub const fn numerator(self) -> Int<u16>

Returns the numerator (the first number of the sequence).

Source

pub const fn denominator(self) -> Int<u16>

Returns the denominator (the second number of the sequence).

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([Int(2_u16), Int(1)]).is_valid()];
assert![!Frac([Int(2_u16), Int(0)]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([Int(2_u16), Int(3)]).is_proper()];
assert![!Frac([Int(3_u16), Int(3)]).is_proper()];
assert![!Frac([Int(4_u16), Int(3)]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[Int<u16>; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> Int<u16>

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<Int<u16>>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [Int<u16>; 2]) -> Result<Frac<[Int<u16>; 2]>>

Adds two fractions.

Source§

impl Frac<[u32; 2]>

Available on crate feature _int_u32 only.
Source

pub const fn numerator(self) -> u32 ⓘ

Returns the numerator (the first number of the sequence).

Source

pub const fn num(self) -> u32 ⓘ

Alias of numerator.

Source

pub const fn denominator(self) -> u32 ⓘ

Returns the denominator (the second number of the sequence).

Source

pub const fn den(self) -> u32 ⓘ

Alias of denominator.

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([2_u32, 1]).is_valid()];
assert![!Frac([2_u32, 0]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([2_u32, 3]).is_proper()];
assert![!Frac([3_u32, 3]).is_proper()];
assert![!Frac([4_u32, 3]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[u32; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> u32 ⓘ

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<u32>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [u32; 2]) -> Result<Frac<[u32; 2]>>

Adds two fractions.

Source§

impl Frac<[Int<u32>; 2]>

Available on crate feature _int_u32 only.
Source

pub const fn numerator(self) -> Int<u32>

Returns the numerator (the first number of the sequence).

Source

pub const fn denominator(self) -> Int<u32>

Returns the denominator (the second number of the sequence).

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([Int(2_u32), Int(1)]).is_valid()];
assert![!Frac([Int(2_u32), Int(0)]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([Int(2_u32), Int(3)]).is_proper()];
assert![!Frac([Int(3_u32), Int(3)]).is_proper()];
assert![!Frac([Int(4_u32), Int(3)]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[Int<u32>; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> Int<u32>

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<Int<u32>>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [Int<u32>; 2]) -> Result<Frac<[Int<u32>; 2]>>

Adds two fractions.

Source§

impl Frac<[u64; 2]>

Available on crate feature _int_u64 only.
Source

pub const fn numerator(self) -> u64 ⓘ

Returns the numerator (the first number of the sequence).

Source

pub const fn num(self) -> u64 ⓘ

Alias of numerator.

Source

pub const fn denominator(self) -> u64 ⓘ

Returns the denominator (the second number of the sequence).

Source

pub const fn den(self) -> u64 ⓘ

Alias of denominator.

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([2_u64, 1]).is_valid()];
assert![!Frac([2_u64, 0]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([2_u64, 3]).is_proper()];
assert![!Frac([3_u64, 3]).is_proper()];
assert![!Frac([4_u64, 3]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[u64; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> u64 ⓘ

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<u64>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [u64; 2]) -> Result<Frac<[u64; 2]>>

Adds two fractions.

Source§

impl Frac<[Int<u64>; 2]>

Available on crate feature _int_u64 only.
Source

pub const fn numerator(self) -> Int<u64>

Returns the numerator (the first number of the sequence).

Source

pub const fn denominator(self) -> Int<u64>

Returns the denominator (the second number of the sequence).

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([Int(2_u64), Int(1)]).is_valid()];
assert![!Frac([Int(2_u64), Int(0)]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([Int(2_u64), Int(3)]).is_proper()];
assert![!Frac([Int(3_u64), Int(3)]).is_proper()];
assert![!Frac([Int(4_u64), Int(3)]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[Int<u64>; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> Int<u64>

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<Int<u64>>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [Int<u64>; 2]) -> Result<Frac<[Int<u64>; 2]>>

Adds two fractions.

Source§

impl Frac<[u128; 2]>

Available on crate feature _int_u128 only.
Source

pub const fn numerator(self) -> u128 ⓘ

Returns the numerator (the first number of the sequence).

Source

pub const fn num(self) -> u128 ⓘ

Alias of numerator.

Source

pub const fn denominator(self) -> u128 ⓘ

Returns the denominator (the second number of the sequence).

Source

pub const fn den(self) -> u128 ⓘ

Alias of denominator.

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([2_u128, 1]).is_valid()];
assert![!Frac([2_u128, 0]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([2_u128, 3]).is_proper()];
assert![!Frac([3_u128, 3]).is_proper()];
assert![!Frac([4_u128, 3]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[u128; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> u128 ⓘ

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<u128>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [u128; 2]) -> Result<Frac<[u128; 2]>>

Adds two fractions.

Source§

impl Frac<[Int<u128>; 2]>

Available on crate feature _int_u128 only.
Source

pub const fn numerator(self) -> Int<u128>

Returns the numerator (the first number of the sequence).

Source

pub const fn denominator(self) -> Int<u128>

Returns the denominator (the second number of the sequence).

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([Int(2_u128), Int(1)]).is_valid()];
assert![!Frac([Int(2_u128), Int(0)]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([Int(2_u128), Int(3)]).is_proper()];
assert![!Frac([Int(3_u128), Int(3)]).is_proper()];
assert![!Frac([Int(4_u128), Int(3)]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[Int<u128>; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> Int<u128>

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<Int<u128>>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [Int<u128>; 2]) -> Result<Frac<[Int<u128>; 2]>>

Adds two fractions.

Source§

impl Frac<[usize; 2]>

Available on crate feature _int_usize only.
Source

pub const fn numerator(self) -> usize ⓘ

Returns the numerator (the first number of the sequence).

Source

pub const fn num(self) -> usize ⓘ

Alias of numerator.

Source

pub const fn denominator(self) -> usize ⓘ

Returns the denominator (the second number of the sequence).

Source

pub const fn den(self) -> usize ⓘ

Alias of denominator.

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([2_usize, 1]).is_valid()];
assert![!Frac([2_usize, 0]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([2_usize, 3]).is_proper()];
assert![!Frac([3_usize, 3]).is_proper()];
assert![!Frac([4_usize, 3]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[usize; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> usize ⓘ

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<usize>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [usize; 2]) -> Result<Frac<[usize; 2]>>

Adds two fractions.

Source§

impl Frac<[Int<usize>; 2]>

Available on crate feature _int_usize only.
Source

pub const fn numerator(self) -> Int<usize>

Returns the numerator (the first number of the sequence).

Source

pub const fn denominator(self) -> Int<usize>

Returns the denominator (the second number of the sequence).

Source

pub const fn is_valid(self) -> bool

Retuns true if the fraction is valid (denominator != 0).

§Examples
assert![Frac([Int(2_usize), Int(1)]).is_valid()];
assert![!Frac([Int(2_usize), Int(0)]).is_valid()];
Source

pub const fn is_proper(self) -> bool

Returns true if the fraction is proper (numerator.abs() < denominator.abs()).

§Examples
assert![Frac([Int(2_usize), Int(3)]).is_proper()];
assert![!Frac([Int(3_usize), Int(3)]).is_proper()];
assert![!Frac([Int(4_usize), Int(3)]).is_proper()];
Source

pub const fn is_reduced(self) -> bool

Retuns true if the fraction is in the simplest possible form (gcd() == 1).

Source

pub const fn reduce(self) -> Frac<[Int<usize>; 2]>

Simplify a fraction.

Source

pub const fn gcd(self) -> Int<usize>

Returns the GCD between the numerator and the denominator.

Source

pub const fn lcm(self) -> Result<Int<usize>>

Returns the LCM between the numerator and the denominator.

§Errors

Could Overflow.

Source

pub fn add(self, other: [Int<usize>; 2]) -> Result<Frac<[Int<usize>; 2]>>

Adds two fractions.

Trait Implementations§

Source§

impl<T: Binary> Binary for Frac<T>

Source§

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

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

impl<T: Clone> Clone for Frac<T>

Source§

fn clone(&self) -> Self

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<T: Debug> Debug for Frac<T>

Source§

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

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

impl<T: Display> Display for Frac<T>

Source§

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

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

impl<T: Hash> Hash for Frac<T>

Source§

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher. Read more
1.3.0 · Source§

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
Source§

impl<T: Hasher> Hasher for Frac<T>

Source§

fn finish(&self) -> u64 ⓘ

Returns the hash value for the values written so far. Read more
Source§

fn write(&mut self, bytes: &[u8])

Writes some data into this Hasher. Read more
1.3.0 · Source§

fn write_u8(&mut self, i: u8)

Writes a single u8 into this hasher.
1.3.0 · Source§

fn write_u16(&mut self, i: u16)

Writes a single u16 into this hasher.
1.3.0 · Source§

fn write_u32(&mut self, i: u32)

Writes a single u32 into this hasher.
1.3.0 · Source§

fn write_u64(&mut self, i: u64)

Writes a single u64 into this hasher.
1.26.0 · Source§

fn write_u128(&mut self, i: u128)

Writes a single u128 into this hasher.
1.3.0 · Source§

fn write_usize(&mut self, i: usize)

Writes a single usize into this hasher.
1.3.0 · Source§

fn write_i8(&mut self, i: i8)

Writes a single i8 into this hasher.
1.3.0 · Source§

fn write_i16(&mut self, i: i16)

Writes a single i16 into this hasher.
1.3.0 · Source§

fn write_i32(&mut self, i: i32)

Writes a single i32 into this hasher.
1.3.0 · Source§

fn write_i64(&mut self, i: i64)

Writes a single i64 into this hasher.
1.26.0 · Source§

fn write_i128(&mut self, i: i128)

Writes a single i128 into this hasher.
1.3.0 · Source§

fn write_isize(&mut self, i: isize)

Writes a single isize into this hasher.
Source§

fn write_length_prefix(&mut self, len: usize)

🔬This is a nightly-only experimental API. (hasher_prefixfree_extras)
Writes a length prefix into this hasher, as part of being prefix-free. Read more
Source§

fn write_str(&mut self, s: &str)

🔬This is a nightly-only experimental API. (hasher_prefixfree_extras)
Writes a single str into this hasher. Read more
Source§

impl<T: LowerExp> LowerExp for Frac<T>

Source§

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

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

impl<T: LowerHex> LowerHex for Frac<T>

Source§

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

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

impl<T: Octal> Octal for Frac<T>

Source§

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

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

impl<T: UpperExp> UpperExp for Frac<T>

Source§

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

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

impl<T: UpperHex> UpperHex for Frac<T>

Source§

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

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

impl<T: Copy> Copy for Frac<T>

Auto Trait Implementations§

§

impl<T> Freeze for Frac<T>
where T: Freeze,

§

impl<T> RefUnwindSafe for Frac<T>
where T: RefUnwindSafe,

§

impl<T> Send for Frac<T>
where T: Send,

§

impl<T> Sync for Frac<T>
where T: Sync,

§

impl<T> Unpin for Frac<T>
where T: Unpin,

§

impl<T> UnwindSafe for Frac<T>
where T: UnwindSafe,

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
§

impl<T> ArchivePointee for T

§

type ArchivedMetadata = ()

The archived version of the pointer metadata for this type.
§

fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata

Converts some archived metadata to the pointer metadata for itself.
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> ByteSized for T

Source§

const BYTE_ALIGN: usize = _

The alignment of this type in bytes.
Source§

const BYTE_SIZE: usize = _

The size of this type in bytes.
Source§

fn byte_align(&self) -> usize ⓘ

Returns the alignment of this type in bytes.
Source§

fn byte_size(&self) -> usize ⓘ

Returns the size of this type in bytes. Read more
Source§

fn ptr_size_ratio(&self) -> [usize; 2]

Returns the size ratio between Ptr::BYTES and BYTE_SIZE. Read more
Source§

impl<T, R> Chain<R> for T
where T: ?Sized,

Source§

fn chain<F>(self, f: F) -> R
where F: FnOnce(Self) -> R, Self: Sized,

Chain a function which takes the parameter by value.
Source§

fn chain_ref<F>(&self, f: F) -> R
where F: FnOnce(&Self) -> R,

Chain a function which takes the parameter by shared reference.
Source§

fn chain_mut<F>(&mut self, f: F) -> R
where F: FnOnce(&mut Self) -> R,

Chain a function which takes the parameter by exclusive reference.
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dst: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
Source§

impl<T> ExtAny for T
where T: Any + ?Sized,

Source§

fn type_id() -> TypeId

Returns the TypeId of Self. Read more
Source§

fn type_of(&self) -> TypeId

Returns the TypeId of self. Read more
Source§

fn type_name(&self) -> &'static str ⓘ

Returns the type name of self. Read more
Source§

fn type_is<T: 'static>(&self) -> bool

Returns true if Self is of type T. Read more
Source§

fn as_any_ref(&self) -> &dyn Any
where Self: Sized,

Upcasts &self as &dyn Any. Read more
Source§

fn as_any_mut(&mut self) -> &mut dyn Any
where Self: Sized,

Upcasts &mut self as &mut dyn Any. Read more
Source§

fn as_any_box(self: Box<Self>) -> Box<dyn Any>
where Self: Sized,

Upcasts Box<self> as Box<dyn Any>. Read more
Source§

fn downcast_ref<T: 'static>(&self) -> Option<&T> ⓘ

Available on crate feature unsafe_layout only.
Returns some shared reference to the inner value if it is of type T. Read more
Source§

fn downcast_mut<T: 'static>(&mut self) -> Option<&mut T> ⓘ

Available on crate feature unsafe_layout only.
Returns some exclusive reference to the inner value if it is of type T. Read more
Source§

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

Source§

const NEEDS_DROP: bool = _

Know whether dropping values of this type matters, in compile-time.
Source§

fn mem_align_of<T>() -> usize ⓘ

Returns the minimum alignment of the type in bytes. Read more
Source§

fn mem_align_of_val(&self) -> usize ⓘ

Returns the alignment of the pointed-to value in bytes. Read more
Source§

fn mem_size_of<T>() -> usize ⓘ

Returns the size of a type in bytes. Read more
Source§

fn mem_size_of_val(&self) -> usize ⓘ

Returns the size of the pointed-to value in bytes. Read more
Source§

fn mem_copy(&self) -> Self
where Self: Copy,

Bitwise-copies a value. Read more
Source§

fn mem_needs_drop(&self) -> bool

Returns true if dropping values of this type matters. Read more
Source§

fn mem_drop(self)
where Self: Sized,

Drops self by running its destructor. Read more
Source§

fn mem_forget(self)
where Self: Sized,

Forgets about self without running its destructor. Read more
Source§

fn mem_replace(&mut self, other: Self) -> Self
where Self: Sized,

Replaces self with other, returning the previous value of self. Read more
Source§

fn mem_take(&mut self) -> Self
where Self: Default,

Replaces self with its default value, returning the previous value of self. Read more
Source§

fn mem_swap(&mut self, other: &mut Self)
where Self: Sized,

Swaps the value of self and other without deinitializing either one. Read more
Source§

unsafe fn mem_zeroed<T>() -> T

Available on crate feature unsafe_layout only.
Returns the value of type T represented by the all-zero byte-pattern. Read more
Source§

unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst

Available on crate feature unsafe_layout only.
Returns the value of type T represented by the all-zero byte-pattern. Read more
Source§

fn mem_as_bytes(&self) -> &[u8] ⓘ
where Self: Sync + Unpin,

Available on crate feature unsafe_slice only.
View a Sync + Unpin self as &[u8]. Read more
Source§

fn mem_as_bytes_mut(&mut self) -> &mut [u8] ⓘ
where Self: Sync + Unpin,

Available on crate feature unsafe_slice only.
View a Sync + Unpin self as &mut [u8]. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<S> FromSample<S> for S

§

fn from_sample_(s: S) -> S

Source§

impl<T> Hook for T

Source§

fn hook_ref<F>(self, f: F) -> Self
where F: FnOnce(&Self),

Applies a function which takes the parameter by shared reference, and then returns the (possibly) modified owned value. Read more
Source§

fn hook_mut<F>(self, f: F) -> Self
where F: FnOnce(&mut Self),

Applies a function which takes the parameter by exclusive reference, and then returns the (possibly) modified owned value. Read more
§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self> ⓘ

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
§

fn in_current_span(self) -> Instrumented<Self> ⓘ

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
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> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
§

impl<F, T> IntoSample<T> for F
where T: FromSample<F>,

§

fn into_sample(self) -> T

§

impl<T> LayoutRaw for T

§

fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ

Returns the layout of the type.
§

impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
where T: SharedNiching<N1, N2>, N1: Niching<T>, N2: Niching<T>,

§

unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool

Returns whether the given value has been niched. Read more
§

fn resolve_niched(out: Place<NichedOption<T, N1>>)

Writes data to out indicating that a T is niched.
§

impl<T> Pointable for T

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize ⓘ

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
§

impl<T> Pointee for T

§

type Metadata = ()

The metadata type for pointers and references to this type.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

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
§

impl<T, U> ToSample<U> for T
where U: FromSample<T>,

§

fn to_sample_(self) -> U

Source§

impl<T> ToString for T
where T: Display + ?Sized,

Source§

fn to_string(&self) -> String ⓘ

Converts the given value to a String. Read more
Source§

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

Source§

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>,

Source§

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.
§

impl<T> WithSubscriber for T

§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> ⓘ
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
§

fn with_current_subscriber(self) -> WithDispatch<Self> ⓘ

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
§

impl<S, T> Duplex<S> for T
where T: FromSample<S> + ToSample<S>,

§

impl<T> Ungil for T
where T: Send,