2016-10-23 13:27:49 +00:00
|
|
|
// implements the unary operator "op &T"
|
|
|
|
// based on "op T" where T is expected to be `Copy`able
|
|
|
|
macro_rules! forward_ref_unop {
|
2023-04-16 06:49:27 +00:00
|
|
|
(impl $imp:ident, $method:ident for $t:ty) => {
|
|
|
|
forward_ref_unop!(impl $imp, $method for $t,
|
2021-10-21 21:03:18 +00:00
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]);
|
|
|
|
};
|
2017-01-29 13:31:47 +00:00
|
|
|
(impl $imp:ident, $method:ident for $t:ty, #[$attr:meta]) => {
|
|
|
|
#[$attr]
|
2019-02-18 03:42:36 +00:00
|
|
|
impl $imp for &$t {
|
2016-10-23 13:27:49 +00:00
|
|
|
type Output = <$t as $imp>::Output;
|
|
|
|
|
|
|
|
#[inline]
|
|
|
|
fn $method(self) -> <$t as $imp>::Output {
|
|
|
|
$imp::$method(*self)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// implements binary operators "&T op U", "T op &U", "&T op &U"
|
|
|
|
// based on "T op U" where T and U are expected to be `Copy`able
|
|
|
|
macro_rules! forward_ref_binop {
|
2023-04-16 06:49:27 +00:00
|
|
|
(impl $imp:ident, $method:ident for $t:ty, $u:ty) => {
|
|
|
|
forward_ref_binop!(impl $imp, $method for $t, $u,
|
2021-10-21 21:03:18 +00:00
|
|
|
#[stable(feature = "rust1", since = "1.0.0")]);
|
|
|
|
};
|
2017-01-29 13:31:47 +00:00
|
|
|
(impl $imp:ident, $method:ident for $t:ty, $u:ty, #[$attr:meta]) => {
|
|
|
|
#[$attr]
|
2016-10-23 13:27:49 +00:00
|
|
|
impl<'a> $imp<$u> for &'a $t {
|
|
|
|
type Output = <$t as $imp<$u>>::Output;
|
|
|
|
|
|
|
|
#[inline]
|
2023-11-23 16:54:06 +00:00
|
|
|
#[track_caller]
|
2016-10-23 13:27:49 +00:00
|
|
|
fn $method(self, other: $u) -> <$t as $imp<$u>>::Output {
|
|
|
|
$imp::$method(*self, other)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-01-29 13:31:47 +00:00
|
|
|
#[$attr]
|
2019-03-10 03:10:28 +00:00
|
|
|
impl $imp<&$u> for $t {
|
2016-10-23 13:27:49 +00:00
|
|
|
type Output = <$t as $imp<$u>>::Output;
|
|
|
|
|
|
|
|
#[inline]
|
2023-11-23 16:54:06 +00:00
|
|
|
#[track_caller]
|
2019-03-10 03:10:28 +00:00
|
|
|
fn $method(self, other: &$u) -> <$t as $imp<$u>>::Output {
|
2016-10-23 13:27:49 +00:00
|
|
|
$imp::$method(self, *other)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-01-29 13:31:47 +00:00
|
|
|
#[$attr]
|
2019-03-10 03:10:28 +00:00
|
|
|
impl $imp<&$u> for &$t {
|
2016-10-23 13:27:49 +00:00
|
|
|
type Output = <$t as $imp<$u>>::Output;
|
|
|
|
|
|
|
|
#[inline]
|
2023-11-23 16:54:06 +00:00
|
|
|
#[track_caller]
|
2019-03-10 03:10:28 +00:00
|
|
|
fn $method(self, other: &$u) -> <$t as $imp<$u>>::Output {
|
2016-10-23 13:27:49 +00:00
|
|
|
$imp::$method(*self, *other)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2017-09-03 02:50:01 +00:00
|
|
|
|
|
|
|
// implements "T op= &U", based on "T op= U"
|
|
|
|
// where U is expected to be `Copy`able
|
|
|
|
macro_rules! forward_ref_op_assign {
|
|
|
|
(impl $imp:ident, $method:ident for $t:ty, $u:ty) => {
|
|
|
|
forward_ref_op_assign!(impl $imp, $method for $t, $u,
|
2017-09-21 19:46:17 +00:00
|
|
|
#[stable(feature = "op_assign_builtins_by_ref", since = "1.22.0")]);
|
2017-09-03 02:50:01 +00:00
|
|
|
};
|
|
|
|
(impl $imp:ident, $method:ident for $t:ty, $u:ty, #[$attr:meta]) => {
|
|
|
|
#[$attr]
|
2019-03-10 03:10:28 +00:00
|
|
|
impl $imp<&$u> for $t {
|
2017-09-03 02:50:01 +00:00
|
|
|
#[inline]
|
2023-11-23 16:54:06 +00:00
|
|
|
#[track_caller]
|
2019-03-10 03:10:28 +00:00
|
|
|
fn $method(&mut self, other: &$u) {
|
2017-09-03 02:50:01 +00:00
|
|
|
$imp::$method(self, *other);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2019-02-02 09:34:36 +00:00
|
|
|
|
2024-07-15 11:26:30 +00:00
|
|
|
/// Creates a zero-size type similar to a closure type, but named.
|
2024-06-10 14:03:00 +00:00
|
|
|
macro_rules! impl_fn_for_zst {
|
|
|
|
($(
|
|
|
|
$( #[$attr: meta] )*
|
|
|
|
struct $Name: ident impl$( <$( $lifetime : lifetime ),+> )? Fn =
|
|
|
|
|$( $arg: ident: $ArgTy: ty ),*| -> $ReturnTy: ty
|
|
|
|
$body: block;
|
|
|
|
)+) => {
|
|
|
|
$(
|
|
|
|
$( #[$attr] )*
|
|
|
|
struct $Name;
|
|
|
|
|
|
|
|
impl $( <$( $lifetime ),+> )? Fn<($( $ArgTy, )*)> for $Name {
|
|
|
|
#[inline]
|
|
|
|
extern "rust-call" fn call(&self, ($( $arg, )*): ($( $ArgTy, )*)) -> $ReturnTy {
|
|
|
|
$body
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
impl $( <$( $lifetime ),+> )? FnMut<($( $ArgTy, )*)> for $Name {
|
|
|
|
#[inline]
|
|
|
|
extern "rust-call" fn call_mut(
|
|
|
|
&mut self,
|
|
|
|
($( $arg, )*): ($( $ArgTy, )*)
|
|
|
|
) -> $ReturnTy {
|
|
|
|
Fn::call(&*self, ($( $arg, )*))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
impl $( <$( $lifetime ),+> )? FnOnce<($( $ArgTy, )*)> for $Name {
|
|
|
|
type Output = $ReturnTy;
|
|
|
|
|
|
|
|
#[inline]
|
|
|
|
extern "rust-call" fn call_once(self, ($( $arg, )*): ($( $ArgTy, )*)) -> $ReturnTy {
|
|
|
|
Fn::call(&self, ($( $arg, )*))
|
|
|
|
}
|
|
|
|
}
|
|
|
|
)+
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-03-02 00:06:06 +00:00
|
|
|
/// A macro for defining `#[cfg]` if-else statements.
|
|
|
|
///
|
|
|
|
/// `cfg_if` is similar to the `if/elif` C preprocessor macro by allowing definition of a cascade
|
|
|
|
/// of `#[cfg]` cases, emitting the implementation which matches first.
|
|
|
|
///
|
|
|
|
/// This allows you to conveniently provide a long list `#[cfg]`'d blocks of code without having to
|
|
|
|
/// rewrite each clause multiple times.
|
|
|
|
///
|
|
|
|
/// # Example
|
|
|
|
///
|
2022-05-03 09:33:56 +00:00
|
|
|
/// ```ignore(cannot-test-this-because-non-exported-macro)
|
2022-03-02 00:06:06 +00:00
|
|
|
/// cfg_if! {
|
|
|
|
/// if #[cfg(unix)] {
|
|
|
|
/// fn foo() { /* unix specific functionality */ }
|
|
|
|
/// } else if #[cfg(target_pointer_width = "32")] {
|
|
|
|
/// fn foo() { /* non-unix, 32-bit functionality */ }
|
|
|
|
/// } else {
|
|
|
|
/// fn foo() { /* fallback implementation */ }
|
|
|
|
/// }
|
|
|
|
/// }
|
|
|
|
///
|
|
|
|
/// # fn main() {}
|
|
|
|
/// ```
|
|
|
|
// This is a copy of `cfg_if!` from the `cfg_if` crate.
|
|
|
|
// The recursive invocations should use $crate if this is ever exported.
|
|
|
|
macro_rules! cfg_if {
|
|
|
|
// match if/else chains with a final `else`
|
|
|
|
(
|
|
|
|
$(
|
|
|
|
if #[cfg( $i_meta:meta )] { $( $i_tokens:tt )* }
|
|
|
|
) else+
|
|
|
|
else { $( $e_tokens:tt )* }
|
|
|
|
) => {
|
|
|
|
cfg_if! {
|
|
|
|
@__items () ;
|
|
|
|
$(
|
|
|
|
(( $i_meta ) ( $( $i_tokens )* )) ,
|
|
|
|
)+
|
|
|
|
(() ( $( $e_tokens )* )) ,
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
// Internal and recursive macro to emit all the items
|
|
|
|
//
|
|
|
|
// Collects all the previous cfgs in a list at the beginning, so they can be
|
|
|
|
// negated. After the semicolon is all the remaining items.
|
|
|
|
(@__items ( $( $_:meta , )* ) ; ) => {};
|
|
|
|
(
|
|
|
|
@__items ( $( $no:meta , )* ) ;
|
|
|
|
(( $( $yes:meta )? ) ( $( $tokens:tt )* )) ,
|
|
|
|
$( $rest:tt , )*
|
|
|
|
) => {
|
|
|
|
// Emit all items within one block, applying an appropriate #[cfg]. The
|
|
|
|
// #[cfg] will require all `$yes` matchers specified and must also negate
|
|
|
|
// all previous matchers.
|
|
|
|
#[cfg(all(
|
|
|
|
$( $yes , )?
|
|
|
|
not(any( $( $no ),* ))
|
|
|
|
))]
|
|
|
|
cfg_if! { @__identity $( $tokens )* }
|
|
|
|
|
|
|
|
// Recurse to emit all other items in `$rest`, and when we do so add all
|
|
|
|
// our `$yes` matchers to the list of `$no` matchers as future emissions
|
|
|
|
// will have to negate everything we just matched as well.
|
|
|
|
cfg_if! {
|
|
|
|
@__items ( $( $no , )* $( $yes , )? ) ;
|
|
|
|
$( $rest , )*
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
// Internal macro to make __apply work out right for different match types,
|
|
|
|
// because of how macros match/expand stuff.
|
|
|
|
(@__identity $( $tokens:tt )* ) => {
|
|
|
|
$( $tokens )*
|
|
|
|
};
|
|
|
|
}
|