Struct ocl_core::Int3
[−]
pub struct Int3(_);
Methods
impl Int3
impl Int3
Methods from Deref<Target=[i32]>
fn len(&self) -> usize
1.0.0
fn is_empty(&self) -> bool
1.0.0
fn first(&self) -> Option<&T>
1.0.0
Returns the first element of a slice, or None
if it is empty.
Examples
let v = [10, 40, 30]; assert_eq!(Some(&10), v.first()); let w: &[i32] = &[]; assert_eq!(None, w.first());
fn first_mut(&mut self) -> Option<&mut T>
1.0.0
Returns a mutable pointer to the first element of a slice, or None
if it is empty.
Examples
let x = &mut [0, 1, 2]; if let Some(first) = x.first_mut() { *first = 5; } assert_eq!(x, &[5, 1, 2]);
fn split_first(&self) -> Option<(&T, &[T])>
1.5.0
Returns the first and all the rest of the elements of a slice, or None
if it is empty.
Examples
let x = &[0, 1, 2]; if let Some((first, elements)) = x.split_first() { assert_eq!(first, &0); assert_eq!(elements, &[1, 2]); }
fn split_first_mut(&mut self) -> Option<(&mut T, &mut [T])>
1.5.0
Returns the first and all the rest of the elements of a slice, or None
if it is empty.
Examples
let x = &mut [0, 1, 2]; if let Some((first, elements)) = x.split_first_mut() { *first = 3; elements[0] = 4; elements[1] = 5; } assert_eq!(x, &[3, 4, 5]);
fn split_last(&self) -> Option<(&T, &[T])>
1.5.0
Returns the last and all the rest of the elements of a slice, or None
if it is empty.
Examples
let x = &[0, 1, 2]; if let Some((last, elements)) = x.split_last() { assert_eq!(last, &2); assert_eq!(elements, &[0, 1]); }
fn split_last_mut(&mut self) -> Option<(&mut T, &mut [T])>
1.5.0
Returns the last and all the rest of the elements of a slice, or None
if it is empty.
Examples
let x = &mut [0, 1, 2]; if let Some((last, elements)) = x.split_last_mut() { *last = 3; elements[0] = 4; elements[1] = 5; } assert_eq!(x, &[4, 5, 3]);
fn last(&self) -> Option<&T>
1.0.0
Returns the last element of a slice, or None
if it is empty.
Examples
let v = [10, 40, 30]; assert_eq!(Some(&30), v.last()); let w: &[i32] = &[]; assert_eq!(None, w.last());
fn last_mut(&mut self) -> Option<&mut T>
1.0.0
Returns a mutable pointer to the last item in the slice.
Examples
let x = &mut [0, 1, 2]; if let Some(last) = x.last_mut() { *last = 10; } assert_eq!(x, &[0, 1, 10]);
fn get<I>(&self, index: I) -> Option<&I::Output> where I: SliceIndex<T>
1.0.0
Returns a reference to an element or subslice depending on the type of index.
- If given a position, returns a reference to the element at that
position or
None
if out of bounds. - If given a range, returns the subslice corresponding to that range,
or
None
if out of bounds.
Examples
let v = [10, 40, 30]; assert_eq!(Some(&40), v.get(1)); assert_eq!(Some(&[10, 40][..]), v.get(0..2)); assert_eq!(None, v.get(3)); assert_eq!(None, v.get(0..4));
fn get_mut<I>(&mut self, index: I) -> Option<&mut I::Output> where I: SliceIndex<T>
1.0.0
Returns a mutable reference to an element or subslice depending on the
type of index (see get
) or None
if the index is out of bounds.
Examples
let x = &mut [0, 1, 2]; if let Some(elem) = x.get_mut(1) { *elem = 42; } assert_eq!(x, &[0, 42, 2]);
unsafe fn get_unchecked<I>(&self, index: I) -> &I::Output where I: SliceIndex<T>
1.0.0
Returns a reference to an element or subslice, without doing bounds checking. So use it very carefully!
Examples
let x = &[1, 2, 4]; unsafe { assert_eq!(x.get_unchecked(1), &2); }
unsafe fn get_unchecked_mut<I>(&mut self, index: I) -> &mut I::Output where I: SliceIndex<T>
1.0.0
Returns a mutable reference to an element or subslice, without doing bounds checking. So use it very carefully!
Examples
let x = &mut [1, 2, 4]; unsafe { let elem = x.get_unchecked_mut(1); *elem = 13; } assert_eq!(x, &[1, 13, 4]);
fn as_ptr(&self) -> *const T
1.0.0
Returns a raw pointer to the slice's buffer.
The caller must ensure that the slice outlives the pointer this function returns, or else it will end up pointing to garbage.
Modifying the container referenced by this slice may cause its buffer to be reallocated, which would also make any pointers to it invalid.
Examples
let x = &[1, 2, 4]; let x_ptr = x.as_ptr(); unsafe { for i in 0..x.len() { assert_eq!(x.get_unchecked(i), &*x_ptr.offset(i as isize)); } }
fn as_mut_ptr(&mut self) -> *mut T
1.0.0
Returns an unsafe mutable pointer to the slice's buffer.
The caller must ensure that the slice outlives the pointer this function returns, or else it will end up pointing to garbage.
Modifying the container referenced by this slice may cause its buffer to be reallocated, which would also make any pointers to it invalid.
Examples
let x = &mut [1, 2, 4]; let x_ptr = x.as_mut_ptr(); unsafe { for i in 0..x.len() { *x_ptr.offset(i as isize) += 2; } } assert_eq!(x, &[3, 4, 6]);
fn swap(&mut self, a: usize, b: usize)
1.0.0
Swaps two elements in a slice.
Arguments
- a - The index of the first element
- b - The index of the second element
Panics
Panics if a
or b
are out of bounds.
Examples
let mut v = ["a", "b", "c", "d"]; v.swap(1, 3); assert!(v == ["a", "d", "c", "b"]);
fn reverse(&mut self)
1.0.0
Reverses the order of elements in a slice, in place.
Example
let mut v = [1, 2, 3]; v.reverse(); assert!(v == [3, 2, 1]);
fn iter(&self) -> Iter<T>
1.0.0
Returns an iterator over the slice.
Examples
let x = &[1, 2, 4]; let mut iterator = x.iter(); assert_eq!(iterator.next(), Some(&1)); assert_eq!(iterator.next(), Some(&2)); assert_eq!(iterator.next(), Some(&4)); assert_eq!(iterator.next(), None);
fn iter_mut(&mut self) -> IterMut<T>
1.0.0
Returns an iterator that allows modifying each value.
Examples
let x = &mut [1, 2, 4]; for elem in x.iter_mut() { *elem += 2; } assert_eq!(x, &[3, 4, 6]);
fn windows(&self, size: usize) -> Windows<T>
1.0.0
Returns an iterator over all contiguous windows of length
size
. The windows overlap. If the slice is shorter than
size
, the iterator returns no values.
Panics
Panics if size
is 0.
Example
let slice = ['r', 'u', 's', 't']; let mut iter = slice.windows(2); assert_eq!(iter.next().unwrap(), &['r', 'u']); assert_eq!(iter.next().unwrap(), &['u', 's']); assert_eq!(iter.next().unwrap(), &['s', 't']); assert!(iter.next().is_none());
If the slice is shorter than size
:
let slice = ['f', 'o', 'o']; let mut iter = slice.windows(4); assert!(iter.next().is_none());
fn chunks(&self, size: usize) -> Chunks<T>
1.0.0
Returns an iterator over size
elements of the slice at a
time. The chunks are slices and do not overlap. If size
does
not divide the length of the slice, then the last chunk will
not have length size
.
Panics
Panics if size
is 0.
Example
let slice = ['l', 'o', 'r', 'e', 'm']; let mut iter = slice.chunks(2); assert_eq!(iter.next().unwrap(), &['l', 'o']); assert_eq!(iter.next().unwrap(), &['r', 'e']); assert_eq!(iter.next().unwrap(), &['m']); assert!(iter.next().is_none());
fn chunks_mut(&mut self, chunk_size: usize) -> ChunksMut<T>
1.0.0
Returns an iterator over chunk_size
elements of the slice at a time.
The chunks are mutable slices, and do not overlap. If chunk_size
does
not divide the length of the slice, then the last chunk will not
have length chunk_size
.
Panics
Panics if chunk_size
is 0.
Examples
let v = &mut [0, 0, 0, 0, 0]; let mut count = 1; for chunk in v.chunks_mut(2) { for elem in chunk.iter_mut() { *elem += count; } count += 1; } assert_eq!(v, &[1, 1, 2, 2, 3]);
fn split_at(&self, mid: usize) -> (&[T], &[T])
1.0.0
Divides one slice into two at an index.
The first will contain all indices from [0, mid)
(excluding
the index mid
itself) and the second will contain all
indices from [mid, len)
(excluding the index len
itself).
Panics
Panics if mid > len
.
Examples
let v = [10, 40, 30, 20, 50]; let (v1, v2) = v.split_at(2); assert_eq!([10, 40], v1); assert_eq!([30, 20, 50], v2);
fn split_at_mut(&mut self, mid: usize) -> (&mut [T], &mut [T])
1.0.0
Divides one &mut
into two at an index.
The first will contain all indices from [0, mid)
(excluding
the index mid
itself) and the second will contain all
indices from [mid, len)
(excluding the index len
itself).
Panics
Panics if mid > len
.
Examples
let mut v = [1, 2, 3, 4, 5, 6]; // scoped to restrict the lifetime of the borrows { let (left, right) = v.split_at_mut(0); assert!(left == []); assert!(right == [1, 2, 3, 4, 5, 6]); } { let (left, right) = v.split_at_mut(2); assert!(left == [1, 2]); assert!(right == [3, 4, 5, 6]); } { let (left, right) = v.split_at_mut(6); assert!(left == [1, 2, 3, 4, 5, 6]); assert!(right == []); }
fn split<F>(&self, pred: F) -> Split<T, F> where F: FnMut(&T) -> bool
1.0.0
Returns an iterator over subslices separated by elements that match
pred
. The matched element is not contained in the subslices.
Examples
let slice = [10, 40, 33, 20]; let mut iter = slice.split(|num| num % 3 == 0); assert_eq!(iter.next().unwrap(), &[10, 40]); assert_eq!(iter.next().unwrap(), &[20]); assert!(iter.next().is_none());
If the first element is matched, an empty slice will be the first item returned by the iterator. Similarly, if the last element in the slice is matched, an empty slice will be the last item returned by the iterator:
let slice = [10, 40, 33]; let mut iter = slice.split(|num| num % 3 == 0); assert_eq!(iter.next().unwrap(), &[10, 40]); assert_eq!(iter.next().unwrap(), &[]); assert!(iter.next().is_none());
If two matched elements are directly adjacent, an empty slice will be present between them:
let slice = [10, 6, 33, 20]; let mut iter = slice.split(|num| num % 3 == 0); assert_eq!(iter.next().unwrap(), &[10]); assert_eq!(iter.next().unwrap(), &[]); assert_eq!(iter.next().unwrap(), &[20]); assert!(iter.next().is_none());
fn split_mut<F>(&mut self, pred: F) -> SplitMut<T, F> where F: FnMut(&T) -> bool
1.0.0
Returns an iterator over mutable subslices separated by elements that
match pred
. The matched element is not contained in the subslices.
Examples
let mut v = [10, 40, 30, 20, 60, 50]; for group in v.split_mut(|num| *num % 3 == 0) { group[0] = 1; } assert_eq!(v, [1, 40, 30, 1, 60, 1]);
fn splitn<F>(&self, n: usize, pred: F) -> SplitN<T, F> where F: FnMut(&T) -> bool
1.0.0
Returns an iterator over subslices separated by elements that match
pred
, limited to returning at most n
items. The matched element is
not contained in the subslices.
The last element returned, if any, will contain the remainder of the slice.
Examples
Print the slice split once by numbers divisible by 3 (i.e. [10, 40]
,
[20, 60, 50]
):
let v = [10, 40, 30, 20, 60, 50]; for group in v.splitn(2, |num| *num % 3 == 0) { println!("{:?}", group); }
fn splitn_mut<F>(&mut self, n: usize, pred: F) -> SplitNMut<T, F> where F: FnMut(&T) -> bool
1.0.0
Returns an iterator over subslices separated by elements that match
pred
, limited to returning at most n
items. The matched element is
not contained in the subslices.
The last element returned, if any, will contain the remainder of the slice.
Examples
let mut v = [10, 40, 30, 20, 60, 50]; for group in v.splitn_mut(2, |num| *num % 3 == 0) { group[0] = 1; } assert_eq!(v, [1, 40, 30, 1, 60, 50]);
fn rsplitn<F>(&self, n: usize, pred: F) -> RSplitN<T, F> where F: FnMut(&T) -> bool
1.0.0
Returns an iterator over subslices separated by elements that match
pred
limited to returning at most n
items. This starts at the end of
the slice and works backwards. The matched element is not contained in
the subslices.
The last element returned, if any, will contain the remainder of the slice.
Examples
Print the slice split once, starting from the end, by numbers divisible
by 3 (i.e. [50]
, [10, 40, 30, 20]
):
let v = [10, 40, 30, 20, 60, 50]; for group in v.rsplitn(2, |num| *num % 3 == 0) { println!("{:?}", group); }
fn rsplitn_mut<F>(&mut self, n: usize, pred: F) -> RSplitNMut<T, F> where F: FnMut(&T) -> bool
1.0.0
Returns an iterator over subslices separated by elements that match
pred
limited to returning at most n
items. This starts at the end of
the slice and works backwards. The matched element is not contained in
the subslices.
The last element returned, if any, will contain the remainder of the slice.
Examples
let mut s = [10, 40, 30, 20, 60, 50]; for group in s.rsplitn_mut(2, |num| *num % 3 == 0) { group[0] = 1; } assert_eq!(s, [1, 40, 30, 20, 60, 1]);
fn contains(&self, x: &T) -> bool where T: PartialEq<T>
1.0.0
Returns true
if the slice contains an element with the given value.
Examples
let v = [10, 40, 30]; assert!(v.contains(&30)); assert!(!v.contains(&50));
fn starts_with(&self, needle: &[T]) -> bool where T: PartialEq<T>
1.0.0
Returns true
if needle
is a prefix of the slice.
Examples
let v = [10, 40, 30]; assert!(v.starts_with(&[10])); assert!(v.starts_with(&[10, 40])); assert!(!v.starts_with(&[50])); assert!(!v.starts_with(&[10, 50]));
Always returns true
if needle
is an empty slice:
let v = &[10, 40, 30]; assert!(v.starts_with(&[])); let v: &[u8] = &[]; assert!(v.starts_with(&[]));
fn ends_with(&self, needle: &[T]) -> bool where T: PartialEq<T>
1.0.0
Returns true
if needle
is a suffix of the slice.
Examples
let v = [10, 40, 30]; assert!(v.ends_with(&[30])); assert!(v.ends_with(&[40, 30])); assert!(!v.ends_with(&[50])); assert!(!v.ends_with(&[50, 30]));
Always returns true
if needle
is an empty slice:
let v = &[10, 40, 30]; assert!(v.ends_with(&[])); let v: &[u8] = &[]; assert!(v.ends_with(&[]));
fn binary_search(&self, x: &T) -> Result<usize, usize> where T: Ord
1.0.0
Binary search a sorted slice for a given element.
If the value is found then Ok
is returned, containing the
index of the matching element; if the value is not found then
Err
is returned, containing the index where a matching
element could be inserted while maintaining sorted order.
Example
Looks up a series of four elements. The first is found, with a
uniquely determined position; the second and third are not
found; the fourth could match any position in [1, 4]
.
let s = [0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55]; assert_eq!(s.binary_search(&13), Ok(9)); assert_eq!(s.binary_search(&4), Err(7)); assert_eq!(s.binary_search(&100), Err(13)); let r = s.binary_search(&1); assert!(match r { Ok(1...4) => true, _ => false, });
fn binary_search_by<'a, F>(&'a self, f: F) -> Result<usize, usize> where F: FnMut(&'a T) -> Ordering
1.0.0
Binary search a sorted slice with a comparator function.
The comparator function should implement an order consistent
with the sort order of the underlying slice, returning an
order code that indicates whether its argument is Less
,
Equal
or Greater
the desired target.
If a matching value is found then returns Ok
, containing
the index for the matched element; if no match is found then
Err
is returned, containing the index where a matching
element could be inserted while maintaining sorted order.
Example
Looks up a series of four elements. The first is found, with a
uniquely determined position; the second and third are not
found; the fourth could match any position in [1, 4]
.
let s = [0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55]; let seek = 13; assert_eq!(s.binary_search_by(|probe| probe.cmp(&seek)), Ok(9)); let seek = 4; assert_eq!(s.binary_search_by(|probe| probe.cmp(&seek)), Err(7)); let seek = 100; assert_eq!(s.binary_search_by(|probe| probe.cmp(&seek)), Err(13)); let seek = 1; let r = s.binary_search_by(|probe| probe.cmp(&seek)); assert!(match r { Ok(1...4) => true, _ => false, });
fn binary_search_by_key<'a, B, F>(&'a self, b: &B, f: F) -> Result<usize, usize> where B: Ord, F: FnMut(&'a T) -> B
1.10.0
Binary search a sorted slice with a key extraction function.
Assumes that the slice is sorted by the key, for instance with
sort_by_key
using the same key extraction function.
If a matching value is found then returns Ok
, containing the
index for the matched element; if no match is found then Err
is returned, containing the index where a matching element could
be inserted while maintaining sorted order.
Examples
Looks up a series of four elements in a slice of pairs sorted by
their second elements. The first is found, with a uniquely
determined position; the second and third are not found; the
fourth could match any position in [1, 4]
.
let s = [(0, 0), (2, 1), (4, 1), (5, 1), (3, 1), (1, 2), (2, 3), (4, 5), (5, 8), (3, 13), (1, 21), (2, 34), (4, 55)]; assert_eq!(s.binary_search_by_key(&13, |&(a,b)| b), Ok(9)); assert_eq!(s.binary_search_by_key(&4, |&(a,b)| b), Err(7)); assert_eq!(s.binary_search_by_key(&100, |&(a,b)| b), Err(13)); let r = s.binary_search_by_key(&1, |&(a,b)| b); assert!(match r { Ok(1...4) => true, _ => false, });
fn sort(&mut self) where T: Ord
1.0.0
Sorts the slice.
This sort is stable (i.e. does not reorder equal elements) and O(n log n)
worst-case.
Current implementation
The current algorithm is an adaptive, iterative merge sort inspired by timsort. It is designed to be very fast in cases where the slice is nearly sorted, or consists of two or more sorted sequences concatenated one after another.
Also, it allocates temporary storage half the size of self
, but for short slices a
non-allocating insertion sort is used instead.
Examples
let mut v = [-5, 4, 1, -3, 2]; v.sort(); assert!(v == [-5, -3, 1, 2, 4]);
fn sort_by_key<B, F>(&mut self, f: F) where B: Ord, F: FnMut(&T) -> B
1.7.0
Sorts the slice using f
to extract a key to compare elements by.
This sort is stable (i.e. does not reorder equal elements) and O(n log n)
worst-case.
Current implementation
The current algorithm is an adaptive, iterative merge sort inspired by timsort. It is designed to be very fast in cases where the slice is nearly sorted, or consists of two or more sorted sequences concatenated one after another.
Also, it allocates temporary storage half the size of self
, but for short slices a
non-allocating insertion sort is used instead.
Examples
let mut v = [-5i32, 4, 1, -3, 2]; v.sort_by_key(|k| k.abs()); assert!(v == [1, 2, -3, 4, -5]);
fn sort_by<F>(&mut self, compare: F) where F: FnMut(&T, &T) -> Ordering
1.0.0
Sorts the slice using compare
to compare elements.
This sort is stable (i.e. does not reorder equal elements) and O(n log n)
worst-case.
Current implementation
The current algorithm is an adaptive, iterative merge sort inspired by timsort. It is designed to be very fast in cases where the slice is nearly sorted, or consists of two or more sorted sequences concatenated one after another.
Also, it allocates temporary storage half the size of self
, but for short slices a
non-allocating insertion sort is used instead.
Examples
let mut v = [5, 4, 1, 3, 2]; v.sort_by(|a, b| a.cmp(b)); assert!(v == [1, 2, 3, 4, 5]); // reverse sorting v.sort_by(|a, b| b.cmp(a)); assert!(v == [5, 4, 3, 2, 1]);
fn clone_from_slice(&mut self, src: &[T]) where T: Clone
1.7.0
Copies the elements from src
into self
.
The length of src
must be the same as self
.
Panics
This function will panic if the two slices have different lengths.
Example
let mut dst = [0, 0, 0]; let src = [1, 2, 3]; dst.clone_from_slice(&src); assert!(dst == [1, 2, 3]);
fn copy_from_slice(&mut self, src: &[T]) where T: Copy
1.9.0
Copies all elements from src
into self
, using a memcpy.
The length of src
must be the same as self
.
Panics
This function will panic if the two slices have different lengths.
Example
let mut dst = [0, 0, 0]; let src = [1, 2, 3]; dst.copy_from_slice(&src); assert_eq!(src, dst);
fn to_vec(&self) -> Vec<T> where T: Clone
1.0.0
Copies self
into a new Vec
.
Examples
let s = [10, 40, 30]; let x = s.to_vec(); // Here, `s` and `x` can be modified independently.
fn into_vec(self: Box<[T]>) -> Vec<T>
1.0.0
Converts self
into a vector without clones or allocation.
Examples
let s: Box<[i32]> = Box::new([10, 40, 30]); let x = s.into_vec(); // `s` cannot be used anymore because it has been converted into `x`. assert_eq!(x, vec![10, 40, 30]);
Trait Implementations
impl SubAssign<Int3> for Int3
fn sub_assign(&mut self, rhs: Int3)
The method for the -=
operator
impl Zero for Int3
fn zero() -> Int3
Returns the additive identity element of Self
, 0
. Read more
fn is_zero(&self) -> bool
Returns true
if self
is equal to the additive identity.
impl RemAssign<Int3> for Int3
fn rem_assign(&mut self, rhs: Int3)
The method for the %=
operator
impl DivAssign<Int3> for Int3
fn div_assign(&mut self, rhs: Int3)
The method for the /=
operator
impl Copy for Int3
impl<'a> Neg for &'a Int3
impl Neg for Int3
impl Ord for Int3
fn cmp(&self, other: &Int3) -> Ordering
This method returns an Ordering
between self
and other
. Read more
impl BitXor<Int3> for Int3
type Output = Int3
The resulting type after applying the ^
operator
fn bitxor(self, rhs: Int3) -> Int3
The method for the ^
operator
impl<'a> BitXor<Int3> for &'a Int3
type Output = Int3::Output
The resulting type after applying the ^
operator
fn bitxor(self, rhs: Int3) -> Int3::Output
The method for the ^
operator
impl<'a> BitXor<&'a Int3> for Int3
type Output = Int3::Output
The resulting type after applying the ^
operator
fn bitxor(self, rhs: &'a Int3) -> Int3::Output
The method for the ^
operator
impl<'a, 'b> BitXor<&'a Int3> for &'b Int3
type Output = Int3::Output
The resulting type after applying the ^
operator
fn bitxor(self, rhs: &'a Int3) -> Int3::Output
The method for the ^
operator
impl Eq for Int3
impl Product<Int3> for Int3
fn product<I>(iter: I) -> Int3 where I: Iterator<Item=Int3>
Method which takes an iterator and generates Self
from the elements by multiplying the items. Read more
impl<'a> Product<&'a Int3> for Int3
fn product<I>(iter: I) -> Int3 where I: Iterator<Item=&'a Int3>
Method which takes an iterator and generates Self
from the elements by multiplying the items. Read more
impl ShrAssign<usize> for Int3
fn shr_assign(&mut self, rhs: usize)
impl<'a> Sub<Int3> for &'a Int3
type Output = Int3::Output
The resulting type after applying the -
operator
fn sub(self, rhs: Int3) -> Int3::Output
The method for the -
operator
impl<'a> Sub<&'a Int3> for Int3
type Output = Int3::Output
The resulting type after applying the -
operator
fn sub(self, rhs: &'a Int3) -> Int3::Output
The method for the -
operator
impl<'a, 'b> Sub<&'a Int3> for &'b Int3
type Output = Int3::Output
The resulting type after applying the -
operator
fn sub(self, rhs: &'a Int3) -> Int3::Output
The method for the -
operator
impl Sub<Int3> for Int3
type Output = Int3
The resulting type after applying the -
operator
fn sub(self, rhs: Int3) -> Int3
The method for the -
operator
impl One for Int3
impl<'a> Div<Int3> for &'a Int3
type Output = Int3::Output
The resulting type after applying the /
operator
fn div(self, rhs: Int3) -> Int3::Output
The method for the /
operator
impl<'a> Div<&'a Int3> for Int3
type Output = Int3::Output
The resulting type after applying the /
operator
fn div(self, rhs: &'a Int3) -> Int3::Output
The method for the /
operator
impl<'a, 'b> Div<&'a Int3> for &'b Int3
type Output = Int3::Output
The resulting type after applying the /
operator
fn div(self, rhs: &'a Int3) -> Int3::Output
The method for the /
operator
impl Div<Int3> for Int3
type Output = Int3
The resulting type after applying the /
operator
fn div(self, rhs: Int3) -> Int3
The method for the /
operator
impl Hash for Int3
fn hash<H>(&self, state: &mut H) where H: Hasher
Feeds this value into the state given, updating the hasher as necessary.
fn hash_slice<H>(data: &[Self], state: &mut H) where H: Hasher
1.3.0
Feeds a slice of this type into the state provided.
impl Display for Int3
fn fmt(&self, f: &mut Formatter) -> Result<(), Error>
Formats the value using the given formatter. Read more
impl BitAndAssign<Int3> for Int3
fn bitand_assign(&mut self, rhs: Int3)
The method for the &=
operator
impl BitAnd<Int3> for Int3
type Output = Int3
The resulting type after applying the &
operator
fn bitand(self, rhs: Int3) -> Int3
The method for the &
operator
impl<'a> BitAnd<Int3> for &'a Int3
type Output = Int3::Output
The resulting type after applying the &
operator
fn bitand(self, rhs: Int3) -> Int3::Output
The method for the &
operator
impl<'a> BitAnd<&'a Int3> for Int3
type Output = Int3::Output
The resulting type after applying the &
operator
fn bitand(self, rhs: &'a Int3) -> Int3::Output
The method for the &
operator
impl<'a, 'b> BitAnd<&'a Int3> for &'b Int3
type Output = Int3::Output
The resulting type after applying the &
operator
fn bitand(self, rhs: &'a Int3) -> Int3::Output
The method for the &
operator
impl Debug for Int3
fn fmt(&self, __arg_0: &mut Formatter) -> Result<(), Error>
Formats the value using the given formatter.
impl DerefMut for Int3
impl<'a> Add<Int3> for &'a Int3
type Output = Int3::Output
The resulting type after applying the +
operator
fn add(self, rhs: Int3) -> Int3::Output
The method for the +
operator
impl<'a> Add<&'a Int3> for Int3
type Output = Int3::Output
The resulting type after applying the +
operator
fn add(self, rhs: &'a Int3) -> Int3::Output
The method for the +
operator
impl<'a, 'b> Add<&'a Int3> for &'b Int3
type Output = Int3::Output
The resulting type after applying the +
operator
fn add(self, rhs: &'a Int3) -> Int3::Output
The method for the +
operator
impl Add<Int3> for Int3
type Output = Int3
The resulting type after applying the +
operator
fn add(self, rhs: Int3) -> Int3
The method for the +
operator
impl BitXorAssign<Int3> for Int3
fn bitxor_assign(&mut self, rhs: Int3)
The method for the ^=
operator
impl<'a> Mul<Int3> for &'a Int3
type Output = Int3::Output
The resulting type after applying the *
operator
fn mul(self, rhs: Int3) -> Int3::Output
The method for the *
operator
impl<'a> Mul<&'a Int3> for Int3
type Output = Int3::Output
The resulting type after applying the *
operator
fn mul(self, rhs: &'a Int3) -> Int3::Output
The method for the *
operator
impl<'a, 'b> Mul<&'a Int3> for &'b Int3
type Output = Int3::Output
The resulting type after applying the *
operator
fn mul(self, rhs: &'a Int3) -> Int3::Output
The method for the *
operator
impl Mul<Int3> for Int3
type Output = Int3
The resulting type after applying the *
operator
fn mul(self, rhs: Int3) -> Int3
The method for the *
operator
impl Shr<usize> for Int3
impl PartialEq<Int3> for Int3
fn eq(&self, rhs: &Int3) -> bool
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, other: &Rhs) -> bool
1.0.0
This method tests for !=
.
impl AddAssign<Int3> for Int3
fn add_assign(&mut self, rhs: Int3)
The method for the +=
operator
impl Deref for Int3
impl PartialOrd<Int3> for Int3
fn partial_cmp(&self, __arg_0: &Int3) -> Option<Ordering>
This method returns an ordering between self
and other
values if one exists. Read more
fn lt(&self, __arg_0: &Int3) -> bool
This method tests less than (for self
and other
) and is used by the <
operator. Read more
fn le(&self, __arg_0: &Int3) -> bool
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
fn gt(&self, __arg_0: &Int3) -> bool
This method tests greater than (for self
and other
) and is used by the >
operator. Read more
fn ge(&self, __arg_0: &Int3) -> bool
This method tests greater than or equal to (for self
and other
) and is used by the >=
operator. Read more
impl Not for Int3
type Output = Int3
The resulting type after applying the !
operator
fn not(self) -> Int3
The method for the unary !
operator
impl<'a> Not for &'a Int3
type Output = Int3::Output
The resulting type after applying the !
operator
fn not(self) -> Int3::Output
The method for the unary !
operator
impl BitOr<Int3> for Int3
type Output = Int3
The resulting type after applying the |
operator
fn bitor(self, rhs: Int3) -> Int3
The method for the |
operator
impl<'a> BitOr<Int3> for &'a Int3
type Output = Int3::Output
The resulting type after applying the |
operator
fn bitor(self, rhs: Int3) -> Int3::Output
The method for the |
operator
impl<'a> BitOr<&'a Int3> for Int3
type Output = Int3::Output
The resulting type after applying the |
operator
fn bitor(self, rhs: &'a Int3) -> Int3::Output
The method for the |
operator
impl<'a, 'b> BitOr<&'a Int3> for &'b Int3
type Output = Int3::Output
The resulting type after applying the |
operator
fn bitor(self, rhs: &'a Int3) -> Int3::Output
The method for the |
operator
impl Default for Int3
impl BitOrAssign<Int3> for Int3
fn bitor_assign(&mut self, rhs: Int3)
The method for the |=
operator
impl From<[i32; 3]> for Int3
impl Shl<usize> for Int3
impl ShlAssign<usize> for Int3
fn shl_assign(&mut self, rhs: usize)
impl Sum<Int3> for Int3
fn sum<I>(iter: I) -> Int3 where I: Iterator<Item=Int3>
Method which takes an iterator and generates Self
from the elements by "summing up" the items. Read more
impl<'a> Sum<&'a Int3> for Int3
fn sum<I>(iter: I) -> Int3 where I: Iterator<Item=&'a Int3>
Method which takes an iterator and generates Self
from the elements by "summing up" the items. Read more
impl<'a> Rem<Int3> for &'a Int3
type Output = Int3::Output
The resulting type after applying the %
operator
fn rem(self, rhs: Int3) -> Int3::Output
The method for the %
operator
impl<'a> Rem<&'a Int3> for Int3
type Output = Int3::Output
The resulting type after applying the %
operator
fn rem(self, rhs: &'a Int3) -> Int3::Output
The method for the %
operator
impl<'a, 'b> Rem<&'a Int3> for &'b Int3
type Output = Int3::Output
The resulting type after applying the %
operator
fn rem(self, rhs: &'a Int3) -> Int3::Output
The method for the %
operator
impl Rem<Int3> for Int3
type Output = Int3
The resulting type after applying the %
operator
fn rem(self, rhs: Int3) -> Int3
The method for the %
operator
impl MulAssign<Int3> for Int3
fn mul_assign(&mut self, rhs: Int3)
The method for the *=
operator
impl Clone for Int3
fn clone(&self) -> Int3
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0
Performs copy-assignment from source
. Read more