2012-12-03 18:48:01 -06:00
|
|
|
// Copyright 2012 The Rust Project Developers. See the COPYRIGHT
|
|
|
|
// file at the top-level directory of this distribution and at
|
|
|
|
// http://rust-lang.org/COPYRIGHT.
|
|
|
|
//
|
|
|
|
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
|
|
|
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
|
|
|
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
|
|
|
// option. This file may not be copied, modified, or distributed
|
|
|
|
// except according to those terms.
|
|
|
|
|
2013-09-26 07:54:48 -05:00
|
|
|
/*!
|
|
|
|
*
|
2014-05-19 23:52:24 -05:00
|
|
|
* Overloadable operators
|
2013-12-24 10:08:28 -06:00
|
|
|
*
|
|
|
|
* Implementing these traits allows you to get an effect similar to
|
|
|
|
* overloading operators.
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* The values for the right hand side of an operator are automatically
|
|
|
|
* borrowed, so `a + b` is sugar for `a.add(&b)`.
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
|
|
|
* All of these traits are imported by the prelude, so they are available in
|
|
|
|
* every Rust program.
|
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* # Example
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* This example creates a `Point` struct that implements `Add` and `Sub`, and then
|
|
|
|
* demonstrates adding and subtracting two `Point`s.
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* ```rust
|
2014-05-22 13:28:01 -05:00
|
|
|
* #[deriving(Show)]
|
2013-09-26 07:54:48 -05:00
|
|
|
* struct Point {
|
|
|
|
* x: int,
|
|
|
|
* y: int
|
|
|
|
* }
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* impl Add<Point, Point> for Point {
|
|
|
|
* fn add(&self, other: &Point) -> Point {
|
|
|
|
* Point {x: self.x + other.x, y: self.y + other.y}
|
|
|
|
* }
|
|
|
|
* }
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* impl Sub<Point, Point> for Point {
|
|
|
|
* fn sub(&self, other: &Point) -> Point {
|
|
|
|
* Point {x: self.x - other.x, y: self.y - other.y}
|
|
|
|
* }
|
|
|
|
* }
|
|
|
|
* fn main() {
|
2014-05-22 13:28:01 -05:00
|
|
|
* println!("{}", Point {x: 1, y: 0} + Point {x: 2, y: 3});
|
|
|
|
* println!("{}", Point {x: 1, y: 0} - Point {x: 2, y: 3});
|
2013-09-26 07:54:48 -05:00
|
|
|
* }
|
|
|
|
* ```
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* See the documentation for each trait for a minimum implementation that prints
|
|
|
|
* something to the screen.
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* The `Drop` trait is used to run some code when a value goes out of scope. This
|
|
|
|
* is sometimes called a 'destructor'.
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* # Example
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* A trivial implementation of `Drop`. The `drop` method is called when `_x` goes
|
|
|
|
* out of scope, and therefore `main` prints `Dropping!`.
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* ```rust
|
|
|
|
* struct HasDrop;
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* impl Drop for HasDrop {
|
|
|
|
* fn drop(&mut self) {
|
2014-01-09 04:06:55 -06:00
|
|
|
* println!("Dropping!");
|
2013-09-26 07:54:48 -05:00
|
|
|
* }
|
|
|
|
* }
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* fn main() {
|
|
|
|
* let _x = HasDrop;
|
|
|
|
* }
|
|
|
|
* ```
|
|
|
|
*/
|
2012-11-05 19:50:01 -06:00
|
|
|
#[lang="drop"]
|
|
|
|
pub trait Drop {
|
2014-03-16 17:35:35 -05:00
|
|
|
/// The `drop` method, called when the value goes out of scope.
|
2013-09-16 20:18:07 -05:00
|
|
|
fn drop(&mut self);
|
2012-11-05 19:50:01 -06:00
|
|
|
}
|
|
|
|
|
2013-09-26 07:54:48 -05:00
|
|
|
/**
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
|
|
|
* The `Add` trait is used to specify the functionality of `+`.
|
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* # Example
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* A trivial implementation of `Add`. When `Foo + Foo` happens, it ends up
|
|
|
|
* calling `add`, and therefore, `main` prints `Adding!`.
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* ```rust
|
|
|
|
* struct Foo;
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* impl Add<Foo, Foo> for Foo {
|
|
|
|
* fn add(&self, _rhs: &Foo) -> Foo {
|
2014-01-09 04:06:55 -06:00
|
|
|
* println!("Adding!");
|
2013-09-26 07:54:48 -05:00
|
|
|
* *self
|
|
|
|
* }
|
|
|
|
* }
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* fn main() {
|
|
|
|
* Foo + Foo;
|
|
|
|
* }
|
|
|
|
* ```
|
|
|
|
*/
|
2012-11-28 15:51:50 -06:00
|
|
|
#[lang="add"]
|
|
|
|
pub trait Add<RHS,Result> {
|
2014-03-16 17:35:35 -05:00
|
|
|
/// The method for the `+` operator
|
2013-03-21 23:20:48 -05:00
|
|
|
fn add(&self, rhs: &RHS) -> Result;
|
2012-11-28 15:51:50 -06:00
|
|
|
}
|
|
|
|
|
2014-05-26 12:33:04 -05:00
|
|
|
macro_rules! add_impl(
|
|
|
|
($($t:ty)*) => ($(
|
|
|
|
impl Add<$t, $t> for $t {
|
|
|
|
#[inline]
|
|
|
|
fn add(&self, other: &$t) -> $t { (*self) + (*other) }
|
|
|
|
}
|
|
|
|
)*)
|
|
|
|
)
|
|
|
|
|
|
|
|
add_impl!(uint u8 u16 u32 u64 int i8 i16 i32 i64 f32 f64)
|
|
|
|
|
2013-09-26 07:54:48 -05:00
|
|
|
/**
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
|
|
|
* The `Sub` trait is used to specify the functionality of `-`.
|
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* # Example
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* A trivial implementation of `Sub`. When `Foo - Foo` happens, it ends up
|
|
|
|
* calling `sub`, and therefore, `main` prints `Subtracting!`.
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
|
|
|
* ```rust
|
2013-09-26 07:54:48 -05:00
|
|
|
* struct Foo;
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* impl Sub<Foo, Foo> for Foo {
|
|
|
|
* fn sub(&self, _rhs: &Foo) -> Foo {
|
2014-01-09 04:06:55 -06:00
|
|
|
* println!("Subtracting!");
|
2013-09-26 07:54:48 -05:00
|
|
|
* *self
|
|
|
|
* }
|
|
|
|
* }
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* fn main() {
|
|
|
|
* Foo - Foo;
|
|
|
|
* }
|
|
|
|
* ```
|
|
|
|
*/
|
2012-09-19 20:00:26 -05:00
|
|
|
#[lang="sub"]
|
2012-09-28 14:30:11 -05:00
|
|
|
pub trait Sub<RHS,Result> {
|
2014-03-16 17:35:35 -05:00
|
|
|
/// The method for the `-` operator
|
2013-03-21 23:20:48 -05:00
|
|
|
fn sub(&self, rhs: &RHS) -> Result;
|
2012-09-19 20:00:26 -05:00
|
|
|
}
|
|
|
|
|
2014-05-26 12:33:04 -05:00
|
|
|
macro_rules! sub_impl(
|
|
|
|
($($t:ty)*) => ($(
|
|
|
|
impl Sub<$t, $t> for $t {
|
|
|
|
#[inline]
|
|
|
|
fn sub(&self, other: &$t) -> $t { (*self) - (*other) }
|
|
|
|
}
|
|
|
|
)*)
|
|
|
|
)
|
|
|
|
|
|
|
|
sub_impl!(uint u8 u16 u32 u64 int i8 i16 i32 i64 f32 f64)
|
|
|
|
|
2013-09-26 07:54:48 -05:00
|
|
|
/**
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
|
|
|
* The `Mul` trait is used to specify the functionality of `*`.
|
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* # Example
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* A trivial implementation of `Mul`. When `Foo * Foo` happens, it ends up
|
|
|
|
* calling `mul`, and therefore, `main` prints `Multiplying!`.
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* ```rust
|
|
|
|
* struct Foo;
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* impl Mul<Foo, Foo> for Foo {
|
|
|
|
* fn mul(&self, _rhs: &Foo) -> Foo {
|
2014-01-09 04:06:55 -06:00
|
|
|
* println!("Multiplying!");
|
2013-09-26 07:54:48 -05:00
|
|
|
* *self
|
|
|
|
* }
|
|
|
|
* }
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* fn main() {
|
|
|
|
* Foo * Foo;
|
|
|
|
* }
|
|
|
|
* ```
|
|
|
|
*/
|
2012-09-19 20:00:26 -05:00
|
|
|
#[lang="mul"]
|
2012-09-28 14:30:11 -05:00
|
|
|
pub trait Mul<RHS,Result> {
|
2014-03-16 17:35:35 -05:00
|
|
|
/// The method for the `*` operator
|
2013-03-21 23:20:48 -05:00
|
|
|
fn mul(&self, rhs: &RHS) -> Result;
|
2012-09-19 20:00:26 -05:00
|
|
|
}
|
|
|
|
|
2014-05-26 12:33:04 -05:00
|
|
|
macro_rules! mul_impl(
|
|
|
|
($($t:ty)*) => ($(
|
|
|
|
impl Mul<$t, $t> for $t {
|
|
|
|
#[inline]
|
|
|
|
fn mul(&self, other: &$t) -> $t { (*self) * (*other) }
|
|
|
|
}
|
|
|
|
)*)
|
|
|
|
)
|
|
|
|
|
|
|
|
mul_impl!(uint u8 u16 u32 u64 int i8 i16 i32 i64 f32 f64)
|
|
|
|
|
2013-09-26 07:54:48 -05:00
|
|
|
/**
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
|
|
|
* The `Div` trait is used to specify the functionality of `/`.
|
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* # Example
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* A trivial implementation of `Div`. When `Foo / Foo` happens, it ends up
|
|
|
|
* calling `div`, and therefore, `main` prints `Dividing!`.
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* ```
|
|
|
|
* struct Foo;
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* impl Div<Foo, Foo> for Foo {
|
|
|
|
* fn div(&self, _rhs: &Foo) -> Foo {
|
2014-01-09 04:06:55 -06:00
|
|
|
* println!("Dividing!");
|
2013-09-26 07:54:48 -05:00
|
|
|
* *self
|
|
|
|
* }
|
|
|
|
* }
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* fn main() {
|
|
|
|
* Foo / Foo;
|
|
|
|
* }
|
|
|
|
* ```
|
|
|
|
*/
|
2012-09-19 20:00:26 -05:00
|
|
|
#[lang="div"]
|
2012-09-28 14:30:11 -05:00
|
|
|
pub trait Div<RHS,Result> {
|
2014-03-16 17:35:35 -05:00
|
|
|
/// The method for the `/` operator
|
2013-03-21 23:20:48 -05:00
|
|
|
fn div(&self, rhs: &RHS) -> Result;
|
2012-09-19 20:00:26 -05:00
|
|
|
}
|
|
|
|
|
2014-05-26 12:33:04 -05:00
|
|
|
macro_rules! div_impl(
|
|
|
|
($($t:ty)*) => ($(
|
|
|
|
impl Div<$t, $t> for $t {
|
|
|
|
#[inline]
|
|
|
|
fn div(&self, other: &$t) -> $t { (*self) / (*other) }
|
|
|
|
}
|
|
|
|
)*)
|
|
|
|
)
|
|
|
|
|
|
|
|
div_impl!(uint u8 u16 u32 u64 int i8 i16 i32 i64 f32 f64)
|
|
|
|
|
2013-09-26 07:54:48 -05:00
|
|
|
/**
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
|
|
|
* The `Rem` trait is used to specify the functionality of `%`.
|
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* # Example
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
|
|
|
* A trivial implementation of `Rem`. When `Foo % Foo` happens, it ends up
|
2013-09-26 07:54:48 -05:00
|
|
|
* calling `rem`, and therefore, `main` prints `Remainder-ing!`.
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* ```
|
|
|
|
* struct Foo;
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* impl Rem<Foo, Foo> for Foo {
|
|
|
|
* fn rem(&self, _rhs: &Foo) -> Foo {
|
2014-01-09 04:06:55 -06:00
|
|
|
* println!("Remainder-ing!");
|
2013-09-26 07:54:48 -05:00
|
|
|
* *self
|
|
|
|
* }
|
|
|
|
* }
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* fn main() {
|
|
|
|
* Foo % Foo;
|
|
|
|
* }
|
|
|
|
* ```
|
|
|
|
*/
|
2013-04-21 10:58:53 -05:00
|
|
|
#[lang="rem"]
|
|
|
|
pub trait Rem<RHS,Result> {
|
2014-03-16 17:35:35 -05:00
|
|
|
/// The method for the `%` operator
|
2013-04-21 10:58:53 -05:00
|
|
|
fn rem(&self, rhs: &RHS) -> Result;
|
|
|
|
}
|
2012-09-19 20:00:26 -05:00
|
|
|
|
2014-05-26 12:33:04 -05:00
|
|
|
macro_rules! rem_impl(
|
|
|
|
($($t:ty)*) => ($(
|
|
|
|
impl Rem<$t, $t> for $t {
|
|
|
|
#[inline]
|
|
|
|
fn rem(&self, other: &$t) -> $t { (*self) % (*other) }
|
|
|
|
}
|
|
|
|
)*)
|
|
|
|
)
|
|
|
|
|
|
|
|
macro_rules! rem_float_impl(
|
|
|
|
($t:ty, $fmod:ident) => {
|
|
|
|
impl Rem<$t, $t> for $t {
|
|
|
|
#[inline]
|
|
|
|
fn rem(&self, other: &$t) -> $t {
|
|
|
|
extern { fn $fmod(a: $t, b: $t) -> $t; }
|
|
|
|
unsafe { $fmod(*self, *other) }
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
)
|
|
|
|
|
|
|
|
rem_impl!(uint u8 u16 u32 u64 int i8 i16 i32 i64)
|
|
|
|
rem_float_impl!(f32, fmodf)
|
|
|
|
rem_float_impl!(f64, fmod)
|
|
|
|
|
2013-09-26 07:54:48 -05:00
|
|
|
/**
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
|
|
|
* The `Neg` trait is used to specify the functionality of unary `-`.
|
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* # Example
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
|
|
|
* A trivial implementation of `Neg`. When `-Foo` happens, it ends up calling
|
2013-09-26 07:54:48 -05:00
|
|
|
* `neg`, and therefore, `main` prints `Negating!`.
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* ```
|
|
|
|
* struct Foo;
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* impl Neg<Foo> for Foo {
|
|
|
|
* fn neg(&self) -> Foo {
|
2014-01-09 04:06:55 -06:00
|
|
|
* println!("Negating!");
|
2013-09-26 07:54:48 -05:00
|
|
|
* *self
|
|
|
|
* }
|
|
|
|
* }
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* fn main() {
|
|
|
|
* -Foo;
|
|
|
|
* }
|
|
|
|
* ```
|
|
|
|
*/
|
2012-07-25 21:03:55 -05:00
|
|
|
#[lang="neg"]
|
2012-09-28 14:30:11 -05:00
|
|
|
pub trait Neg<Result> {
|
2014-03-16 17:35:35 -05:00
|
|
|
/// The method for the unary `-` operator
|
2013-03-21 23:20:48 -05:00
|
|
|
fn neg(&self) -> Result;
|
2012-07-25 21:03:55 -05:00
|
|
|
}
|
|
|
|
|
2014-05-26 12:33:04 -05:00
|
|
|
macro_rules! neg_impl(
|
|
|
|
($($t:ty)*) => ($(
|
|
|
|
impl Neg<$t> for $t {
|
|
|
|
#[inline]
|
|
|
|
fn neg(&self) -> $t { -*self }
|
|
|
|
}
|
|
|
|
)*)
|
|
|
|
)
|
|
|
|
|
|
|
|
macro_rules! neg_uint_impl(
|
|
|
|
($t:ty, $t_signed:ty) => {
|
|
|
|
impl Neg<$t> for $t {
|
|
|
|
#[inline]
|
|
|
|
fn neg(&self) -> $t { -(*self as $t_signed) as $t }
|
|
|
|
}
|
|
|
|
}
|
|
|
|
)
|
|
|
|
|
|
|
|
neg_impl!(int i8 i16 i32 i64 f32 f64)
|
|
|
|
|
|
|
|
neg_uint_impl!(uint, int)
|
|
|
|
neg_uint_impl!(u8, i8)
|
|
|
|
neg_uint_impl!(u16, i16)
|
|
|
|
neg_uint_impl!(u32, i32)
|
|
|
|
neg_uint_impl!(u64, i64)
|
|
|
|
|
|
|
|
|
2013-09-26 07:54:48 -05:00
|
|
|
/**
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
|
|
|
* The `Not` trait is used to specify the functionality of unary `!`.
|
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* # Example
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* A trivial implementation of `Not`. When `!Foo` happens, it ends up calling
|
|
|
|
* `not`, and therefore, `main` prints `Not-ing!`.
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* ```
|
|
|
|
* struct Foo;
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* impl Not<Foo> for Foo {
|
|
|
|
* fn not(&self) -> Foo {
|
2014-01-09 04:06:55 -06:00
|
|
|
* println!("Not-ing!");
|
2013-09-26 07:54:48 -05:00
|
|
|
* *self
|
|
|
|
* }
|
|
|
|
* }
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* fn main() {
|
|
|
|
* !Foo;
|
|
|
|
* }
|
|
|
|
* ```
|
|
|
|
*/
|
2013-01-11 11:16:58 -06:00
|
|
|
#[lang="not"]
|
|
|
|
pub trait Not<Result> {
|
2014-03-16 17:35:35 -05:00
|
|
|
/// The method for the unary `!` operator
|
2013-03-21 23:20:48 -05:00
|
|
|
fn not(&self) -> Result;
|
2013-01-11 11:16:58 -06:00
|
|
|
}
|
|
|
|
|
2014-05-26 12:33:04 -05:00
|
|
|
|
|
|
|
macro_rules! not_impl(
|
|
|
|
($($t:ty)*) => ($(
|
|
|
|
impl Not<$t> for $t {
|
|
|
|
#[inline]
|
|
|
|
fn not(&self) -> $t { !*self }
|
|
|
|
}
|
|
|
|
)*)
|
|
|
|
)
|
|
|
|
|
|
|
|
not_impl!(bool uint u8 u16 u32 u64 int i8 i16 i32 i64)
|
|
|
|
|
2013-09-26 07:54:48 -05:00
|
|
|
/**
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
|
|
|
* The `BitAnd` trait is used to specify the functionality of `&`.
|
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* # Example
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* A trivial implementation of `BitAnd`. When `Foo & Foo` happens, it ends up
|
|
|
|
* calling `bitand`, and therefore, `main` prints `Bitwise And-ing!`.
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* ```
|
|
|
|
* struct Foo;
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* impl BitAnd<Foo, Foo> for Foo {
|
|
|
|
* fn bitand(&self, _rhs: &Foo) -> Foo {
|
2014-01-09 04:06:55 -06:00
|
|
|
* println!("Bitwise And-ing!");
|
2013-09-26 07:54:48 -05:00
|
|
|
* *self
|
|
|
|
* }
|
|
|
|
* }
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* fn main() {
|
|
|
|
* Foo & Foo;
|
|
|
|
* }
|
|
|
|
* ```
|
|
|
|
*/
|
2012-09-19 20:00:26 -05:00
|
|
|
#[lang="bitand"]
|
2012-09-28 14:30:11 -05:00
|
|
|
pub trait BitAnd<RHS,Result> {
|
2014-03-16 17:35:35 -05:00
|
|
|
/// The method for the `&` operator
|
2013-03-21 23:20:48 -05:00
|
|
|
fn bitand(&self, rhs: &RHS) -> Result;
|
2012-09-19 20:00:26 -05:00
|
|
|
}
|
|
|
|
|
2014-05-26 12:33:04 -05:00
|
|
|
macro_rules! bitand_impl(
|
|
|
|
($($t:ty)*) => ($(
|
|
|
|
impl BitAnd<$t, $t> for $t {
|
|
|
|
#[inline]
|
|
|
|
fn bitand(&self, rhs: &$t) -> $t { (*self) & (*rhs) }
|
|
|
|
}
|
|
|
|
)*)
|
|
|
|
)
|
|
|
|
|
|
|
|
bitand_impl!(bool uint u8 u16 u32 u64 int i8 i16 i32 i64)
|
|
|
|
|
2013-09-26 07:54:48 -05:00
|
|
|
/**
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
|
|
|
* The `BitOr` trait is used to specify the functionality of `|`.
|
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* # Example
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* A trivial implementation of `BitOr`. When `Foo | Foo` happens, it ends up
|
|
|
|
* calling `bitor`, and therefore, `main` prints `Bitwise Or-ing!`.
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* ```
|
|
|
|
* struct Foo;
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* impl BitOr<Foo, Foo> for Foo {
|
|
|
|
* fn bitor(&self, _rhs: &Foo) -> Foo {
|
2014-01-09 04:06:55 -06:00
|
|
|
* println!("Bitwise Or-ing!");
|
2013-09-26 07:54:48 -05:00
|
|
|
* *self
|
|
|
|
* }
|
|
|
|
* }
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* fn main() {
|
|
|
|
* Foo | Foo;
|
|
|
|
* }
|
|
|
|
* ```
|
|
|
|
*/
|
2012-09-19 20:00:26 -05:00
|
|
|
#[lang="bitor"]
|
2012-09-28 14:30:11 -05:00
|
|
|
pub trait BitOr<RHS,Result> {
|
2014-03-16 17:35:35 -05:00
|
|
|
/// The method for the `|` operator
|
2013-03-21 23:20:48 -05:00
|
|
|
fn bitor(&self, rhs: &RHS) -> Result;
|
2012-09-19 20:00:26 -05:00
|
|
|
}
|
|
|
|
|
2014-05-26 12:33:04 -05:00
|
|
|
macro_rules! bitor_impl(
|
|
|
|
($($t:ty)*) => ($(
|
|
|
|
impl BitOr<$t,$t> for $t {
|
|
|
|
#[inline]
|
|
|
|
fn bitor(&self, rhs: &$t) -> $t { (*self) | (*rhs) }
|
|
|
|
}
|
|
|
|
)*)
|
|
|
|
)
|
|
|
|
|
|
|
|
bitor_impl!(bool uint u8 u16 u32 u64 int i8 i16 i32 i64)
|
|
|
|
|
2013-09-26 07:54:48 -05:00
|
|
|
/**
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
|
|
|
* The `BitXor` trait is used to specify the functionality of `^`.
|
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* # Example
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* A trivial implementation of `BitXor`. When `Foo ^ Foo` happens, it ends up
|
2013-12-14 23:26:09 -06:00
|
|
|
* calling `bitxor`, and therefore, `main` prints `Bitwise Xor-ing!`.
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* ```
|
|
|
|
* struct Foo;
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* impl BitXor<Foo, Foo> for Foo {
|
|
|
|
* fn bitxor(&self, _rhs: &Foo) -> Foo {
|
2014-01-09 04:06:55 -06:00
|
|
|
* println!("Bitwise Xor-ing!");
|
2013-09-26 07:54:48 -05:00
|
|
|
* *self
|
|
|
|
* }
|
|
|
|
* }
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* fn main() {
|
|
|
|
* Foo ^ Foo;
|
|
|
|
* }
|
|
|
|
* ```
|
|
|
|
*/
|
2012-09-19 20:00:26 -05:00
|
|
|
#[lang="bitxor"]
|
2012-09-28 14:30:11 -05:00
|
|
|
pub trait BitXor<RHS,Result> {
|
2014-03-16 17:35:35 -05:00
|
|
|
/// The method for the `^` operator
|
2013-03-21 23:20:48 -05:00
|
|
|
fn bitxor(&self, rhs: &RHS) -> Result;
|
2012-09-19 20:00:26 -05:00
|
|
|
}
|
|
|
|
|
2014-05-26 12:33:04 -05:00
|
|
|
macro_rules! bitxor_impl(
|
|
|
|
($($t:ty)*) => ($(
|
|
|
|
impl BitXor<$t, $t> for $t {
|
|
|
|
#[inline]
|
|
|
|
fn bitxor(&self, other: &$t) -> $t { (*self) ^ (*other) }
|
|
|
|
}
|
|
|
|
)*)
|
|
|
|
)
|
|
|
|
|
|
|
|
bitxor_impl!(bool uint u8 u16 u32 u64 int i8 i16 i32 i64)
|
|
|
|
|
2013-09-26 07:54:48 -05:00
|
|
|
/**
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
|
|
|
* The `Shl` trait is used to specify the functionality of `<<`.
|
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* # Example
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* A trivial implementation of `Shl`. When `Foo << Foo` happens, it ends up
|
|
|
|
* calling `shl`, and therefore, `main` prints `Shifting left!`.
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* ```
|
|
|
|
* struct Foo;
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* impl Shl<Foo, Foo> for Foo {
|
|
|
|
* fn shl(&self, _rhs: &Foo) -> Foo {
|
2014-01-09 04:06:55 -06:00
|
|
|
* println!("Shifting left!");
|
2013-09-26 07:54:48 -05:00
|
|
|
* *self
|
|
|
|
* }
|
|
|
|
* }
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* fn main() {
|
|
|
|
* Foo << Foo;
|
|
|
|
* }
|
|
|
|
* ```
|
|
|
|
*/
|
2012-09-19 20:00:26 -05:00
|
|
|
#[lang="shl"]
|
2012-09-28 14:30:11 -05:00
|
|
|
pub trait Shl<RHS,Result> {
|
2014-03-16 17:35:35 -05:00
|
|
|
/// The method for the `<<` operator
|
2013-03-21 23:20:48 -05:00
|
|
|
fn shl(&self, rhs: &RHS) -> Result;
|
2012-09-19 20:00:26 -05:00
|
|
|
}
|
|
|
|
|
2014-05-26 12:33:04 -05:00
|
|
|
macro_rules! shl_impl(
|
|
|
|
($($t:ty)*) => ($(
|
2014-07-04 01:15:25 -05:00
|
|
|
impl Shl<uint, $t> for $t {
|
2014-04-21 16:58:52 -05:00
|
|
|
#[inline]
|
2014-07-04 01:15:25 -05:00
|
|
|
fn shl(&self, other: &uint) -> $t {
|
|
|
|
(*self) << (*other)
|
2014-04-21 16:58:52 -05:00
|
|
|
}
|
|
|
|
}
|
2014-05-26 12:33:04 -05:00
|
|
|
)*)
|
|
|
|
)
|
|
|
|
|
|
|
|
shl_impl!(uint u8 u16 u32 u64 int i8 i16 i32 i64)
|
|
|
|
|
2013-09-26 07:54:48 -05:00
|
|
|
/**
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
|
|
|
* The `Shr` trait is used to specify the functionality of `>>`.
|
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* # Example
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* A trivial implementation of `Shr`. When `Foo >> Foo` happens, it ends up
|
|
|
|
* calling `shr`, and therefore, `main` prints `Shifting right!`.
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* ```
|
|
|
|
* struct Foo;
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* impl Shr<Foo, Foo> for Foo {
|
|
|
|
* fn shr(&self, _rhs: &Foo) -> Foo {
|
2014-01-09 04:06:55 -06:00
|
|
|
* println!("Shifting right!");
|
2013-09-26 07:54:48 -05:00
|
|
|
* *self
|
|
|
|
* }
|
|
|
|
* }
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* fn main() {
|
|
|
|
* Foo >> Foo;
|
|
|
|
* }
|
|
|
|
* ```
|
|
|
|
*/
|
2012-09-19 20:00:26 -05:00
|
|
|
#[lang="shr"]
|
2012-09-28 14:30:11 -05:00
|
|
|
pub trait Shr<RHS,Result> {
|
2014-03-16 17:35:35 -05:00
|
|
|
/// The method for the `>>` operator
|
2013-03-21 23:20:48 -05:00
|
|
|
fn shr(&self, rhs: &RHS) -> Result;
|
2012-09-19 20:00:26 -05:00
|
|
|
}
|
|
|
|
|
2014-05-26 12:33:04 -05:00
|
|
|
macro_rules! shr_impl(
|
|
|
|
($($t:ty)*) => ($(
|
2014-07-04 01:15:25 -05:00
|
|
|
impl Shr<uint, $t> for $t {
|
2014-04-21 16:58:52 -05:00
|
|
|
#[inline]
|
2014-07-04 01:15:25 -05:00
|
|
|
fn shr(&self, other: &uint) -> $t { (*self) >> (*other) }
|
2014-04-21 16:58:52 -05:00
|
|
|
}
|
2014-05-26 12:33:04 -05:00
|
|
|
)*)
|
|
|
|
)
|
|
|
|
|
|
|
|
shr_impl!(uint u8 u16 u32 u64 int i8 i16 i32 i64)
|
|
|
|
|
2013-09-26 07:54:48 -05:00
|
|
|
/**
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
|
|
|
* The `Index` trait is used to specify the functionality of indexing operations
|
2014-07-03 16:32:41 -05:00
|
|
|
* like `arr[idx]` when used in an immutable context.
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* # Example
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
|
|
|
* A trivial implementation of `Index`. When `Foo[Foo]` happens, it ends up
|
2013-09-26 07:54:48 -05:00
|
|
|
* calling `index`, and therefore, `main` prints `Indexing!`.
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* ```
|
|
|
|
* struct Foo;
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* impl Index<Foo, Foo> for Foo {
|
2014-07-03 16:32:41 -05:00
|
|
|
* fn index<'a>(&'a self, _rhs: &Foo) -> &'a Foo {
|
2014-01-09 04:06:55 -06:00
|
|
|
* println!("Indexing!");
|
2014-07-03 16:32:41 -05:00
|
|
|
* self
|
2013-09-26 07:54:48 -05:00
|
|
|
* }
|
|
|
|
* }
|
2013-09-27 11:57:52 -05:00
|
|
|
*
|
2013-09-26 07:54:48 -05:00
|
|
|
* fn main() {
|
|
|
|
* Foo[Foo];
|
|
|
|
* }
|
|
|
|
* ```
|
|
|
|
*/
|
2012-11-28 15:51:50 -06:00
|
|
|
#[lang="index"]
|
|
|
|
pub trait Index<Index,Result> {
|
2014-03-16 17:35:35 -05:00
|
|
|
/// The method for the indexing (`Foo[Bar]`) operation
|
2014-07-03 16:32:41 -05:00
|
|
|
fn index<'a>(&'a self, index: &Index) -> &'a Result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
*
|
|
|
|
* The `IndexMut` trait is used to specify the functionality of indexing
|
|
|
|
* operations like `arr[idx]`, when used in a mutable context.
|
|
|
|
*
|
|
|
|
* # Example
|
|
|
|
*
|
|
|
|
* A trivial implementation of `IndexMut`. When `Foo[Foo]` happens, it ends up
|
|
|
|
* calling `index`, and therefore, `main` prints `Indexing!`.
|
|
|
|
*
|
|
|
|
* ```
|
|
|
|
* struct Foo;
|
|
|
|
*
|
|
|
|
* impl IndexMut<Foo, Foo> for Foo {
|
|
|
|
* fn index_mut<'a>(&'a mut self, _rhs: &Foo) -> &'a mut Foo {
|
|
|
|
* println!("Indexing!");
|
|
|
|
* self
|
|
|
|
* }
|
|
|
|
* }
|
|
|
|
*
|
|
|
|
* fn main() {
|
|
|
|
* &mut Foo[Foo];
|
|
|
|
* }
|
|
|
|
* ```
|
|
|
|
*/
|
|
|
|
#[lang="index_mut"]
|
|
|
|
pub trait IndexMut<Index,Result> {
|
|
|
|
/// The method for the indexing (`Foo[Bar]`) operation
|
|
|
|
fn index_mut<'a>(&'a mut self, index: &Index) -> &'a mut Result;
|
2012-11-28 15:51:50 -06:00
|
|
|
}
|
2013-07-22 18:50:17 -05:00
|
|
|
|
2014-03-16 17:35:35 -05:00
|
|
|
/**
|
|
|
|
*
|
|
|
|
* The `Deref` trait is used to specify the functionality of dereferencing
|
|
|
|
* operations like `*v`.
|
|
|
|
*
|
|
|
|
* # Example
|
|
|
|
*
|
|
|
|
* A struct with a single field which is accessible via dereferencing the
|
|
|
|
* struct.
|
|
|
|
*
|
|
|
|
* ```
|
|
|
|
* struct DerefExample<T> {
|
|
|
|
* value: T
|
|
|
|
* }
|
|
|
|
*
|
|
|
|
* impl<T> Deref<T> for DerefExample<T> {
|
|
|
|
* fn deref<'a>(&'a self) -> &'a T {
|
|
|
|
* &self.value
|
|
|
|
* }
|
|
|
|
* }
|
|
|
|
*
|
|
|
|
* fn main() {
|
|
|
|
* let x = DerefExample { value: 'a' };
|
|
|
|
* assert_eq!('a', *x);
|
|
|
|
* }
|
|
|
|
* ```
|
|
|
|
*/
|
2014-02-26 15:02:35 -06:00
|
|
|
#[lang="deref"]
|
|
|
|
pub trait Deref<Result> {
|
2014-03-16 17:35:35 -05:00
|
|
|
/// The method called to dereference a value
|
2014-02-26 15:02:35 -06:00
|
|
|
fn deref<'a>(&'a self) -> &'a Result;
|
|
|
|
}
|
|
|
|
|
2014-03-16 17:35:35 -05:00
|
|
|
/**
|
|
|
|
*
|
|
|
|
* The `DerefMut` trait is used to specify the functionality of dereferencing
|
|
|
|
* mutably like `*v = 1;`
|
|
|
|
*
|
|
|
|
* # Example
|
|
|
|
*
|
|
|
|
* A struct with a single field which is modifiable via dereferencing the
|
|
|
|
* struct.
|
|
|
|
*
|
|
|
|
* ```
|
|
|
|
* struct DerefMutExample<T> {
|
|
|
|
* value: T
|
|
|
|
* }
|
|
|
|
*
|
|
|
|
* impl<T> Deref<T> for DerefMutExample<T> {
|
|
|
|
* fn deref<'a>(&'a self) -> &'a T {
|
|
|
|
* &self.value
|
|
|
|
* }
|
|
|
|
* }
|
|
|
|
*
|
|
|
|
* impl<T> DerefMut<T> for DerefMutExample<T> {
|
|
|
|
* fn deref_mut<'a>(&'a mut self) -> &'a mut T {
|
|
|
|
* &mut self.value
|
|
|
|
* }
|
|
|
|
* }
|
|
|
|
*
|
|
|
|
* fn main() {
|
|
|
|
* let mut x = DerefMutExample { value: 'a' };
|
|
|
|
* *x = 'b';
|
|
|
|
* assert_eq!('b', *x);
|
|
|
|
* }
|
|
|
|
* ```
|
|
|
|
*/
|
2014-02-26 15:02:35 -06:00
|
|
|
#[lang="deref_mut"]
|
|
|
|
pub trait DerefMut<Result>: Deref<Result> {
|
2014-03-16 17:35:35 -05:00
|
|
|
/// The method called to mutably dereference a value
|
2014-02-26 15:02:35 -06:00
|
|
|
fn deref_mut<'a>(&'a mut self) -> &'a mut Result;
|
|
|
|
}
|
|
|
|
|
2014-06-01 18:35:01 -05:00
|
|
|
/// A version of the call operator that takes an immutable receiver.
|
|
|
|
#[lang="fn"]
|
|
|
|
pub trait Fn<Args,Result> {
|
|
|
|
/// This is called when the call operator is used.
|
2014-05-29 00:26:56 -05:00
|
|
|
#[rust_call_abi_hack]
|
2014-06-01 18:35:01 -05:00
|
|
|
fn call(&self, args: Args) -> Result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// A version of the call operator that takes a mutable receiver.
|
|
|
|
#[lang="fn_mut"]
|
|
|
|
pub trait FnMut<Args,Result> {
|
|
|
|
/// This is called when the call operator is used.
|
2014-05-29 00:26:56 -05:00
|
|
|
#[rust_call_abi_hack]
|
2014-06-01 18:35:01 -05:00
|
|
|
fn call_mut(&mut self, args: Args) -> Result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// A version of the call operator that takes a by-value receiver.
|
|
|
|
#[lang="fn_once"]
|
|
|
|
pub trait FnOnce<Args,Result> {
|
|
|
|
/// This is called when the call operator is used.
|
2014-05-29 00:26:56 -05:00
|
|
|
#[rust_call_abi_hack]
|
2014-06-01 18:35:01 -05:00
|
|
|
fn call_once(self, args: Args) -> Result;
|
|
|
|
}
|
2014-05-29 00:26:56 -05:00
|
|
|
|
2014-07-23 21:57:30 -05:00
|
|
|
macro_rules! def_fn_mut(
|
|
|
|
($($args:ident)*) => (
|
|
|
|
impl<Result$(,$args)*>
|
|
|
|
FnMut<($($args,)*),Result>
|
|
|
|
for extern "Rust" fn($($args: $args,)*) -> Result {
|
|
|
|
#[rust_call_abi_hack]
|
|
|
|
#[allow(uppercase_variables)]
|
|
|
|
fn call_mut(&mut self, args: ($($args,)*)) -> Result {
|
|
|
|
let ($($args,)*) = args;
|
|
|
|
(*self)($($args,)*)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
)
|
|
|
|
)
|
|
|
|
|
|
|
|
def_fn_mut!()
|
|
|
|
def_fn_mut!(A0)
|
|
|
|
def_fn_mut!(A0 A1)
|
|
|
|
def_fn_mut!(A0 A1 A2)
|
|
|
|
def_fn_mut!(A0 A1 A2 A3)
|
|
|
|
def_fn_mut!(A0 A1 A2 A3 A4)
|
|
|
|
def_fn_mut!(A0 A1 A2 A3 A4 A5)
|
|
|
|
def_fn_mut!(A0 A1 A2 A3 A4 A5 A6)
|
|
|
|
def_fn_mut!(A0 A1 A2 A3 A4 A5 A6 A7)
|
|
|
|
def_fn_mut!(A0 A1 A2 A3 A4 A5 A6 A7 A8)
|
|
|
|
def_fn_mut!(A0 A1 A2 A3 A4 A5 A6 A7 A8 A9)
|
|
|
|
def_fn_mut!(A0 A1 A2 A3 A4 A5 A6 A7 A8 A9 A10)
|
|
|
|
def_fn_mut!(A0 A1 A2 A3 A4 A5 A6 A7 A8 A9 A10 A11)
|
|
|
|
def_fn_mut!(A0 A1 A2 A3 A4 A5 A6 A7 A8 A9 A10 A11 A12)
|
|
|
|
def_fn_mut!(A0 A1 A2 A3 A4 A5 A6 A7 A8 A9 A10 A11 A12 A13)
|
|
|
|
def_fn_mut!(A0 A1 A2 A3 A4 A5 A6 A7 A8 A9 A10 A11 A12 A13 A14)
|
|
|
|
def_fn_mut!(A0 A1 A2 A3 A4 A5 A6 A7 A8 A9 A10 A11 A12 A13 A14 A15)
|
|
|
|
|