newtype_ops/

lib.rs

// Copyright 2016 Michael Lamparski
//
// Licensed under WTFPL-2.0 (see file COPYING).

//! # newtype-ops
//!
//! An attempt to provide a macro for mass-forwarding impls for newtypes.
//!
//! Is currently "usable" for wrappers around primitives and some awkward special cases.
//!
//! There is comprehensive documentation on the [`newtype_ops`] macro.

#![no_std]

#![cfg_attr(feature = "debug-trace-macros", feature(trace_macros))]
#[cfg(feature = "debug-trace-macros")] trace_macros!(true);

/// A macro for mass-forwarding operator impls on newtypes.
///
/// Some examples:
///
/// ```rust
/// use newtype_ops::newtype_ops;
///
/// // derive everything under the sun
/// pub struct Foo(pub i32);
/// newtype_ops! { [Foo] integer {:=} {^&}Self {^&}{Self i32} }
///
/// // derive everything under the sun for floats
/// pub struct Bar(pub f32);
/// newtype_ops! { [Bar] arithmetic {:=} {^&}Self {^&}{Self f32} }
/// ```

/// These two impls are equivalent to this:
///
/// ```rust
/// # use newtype_ops::newtype_ops;
/// # pub struct Foo(pub i32);
/// # pub struct Bar(pub f32);
/// newtype_ops! { [Foo] {add sub mul div rem neg
///                       not bitand bitor bitxor} {:=} {^&}Self {^&}{Self i32} }
/// newtype_ops! { [Bar] {add sub mul div rem neg} {:=} {^&}Self {^&}{Self f32} }
/// ```

/// Which are in turn equivalent to this;
/// every braced portion is expanded in a cartesian product of the tokens inside.
/// To give you a feel for what the various parts of the syntax stand for, the
/// impls are labeled in comments.
///
/// ```rust
/// # use newtype_ops::newtype_ops;
/// # pub struct Foo(pub i32);
/// # pub struct Bar(pub f32);
/// newtype_ops! { [Foo] add : ^Self ^Self } // impl Add<Foo>  for Foo { ... }
/// newtype_ops! { [Foo] add : ^Self ^i32  } // impl Add<i32>  for Foo { ... }
/// newtype_ops! { [Foo] add : ^Self &Self } // impl Add<&Foo> for Foo { ... }
/// newtype_ops! { [Foo] add : ^Self &i32  } // impl Add<&i32> for Foo { ... }
/// newtype_ops! { [Foo] add : &Self ^Self } // impl Add<Foo>  for &Foo { ... }
/// newtype_ops! { [Foo] add : &Self ^i32  } // impl Add<i32>  for &Foo { ... }
/// newtype_ops! { [Foo] add : &Self &Self } // impl Add<&Foo> for &Foo { ... }
/// newtype_ops! { [Foo] add : &Self &i32  } // impl Add<&i32> for &Foo { ... }
/// newtype_ops! { [Foo] add = ^Self ^Self } // impl AddAssign<Foo> for Foo { ... }
/// newtype_ops! { [Foo] add = ^Self ^i32  } // impl AddAssign<i32> for Foo { ... }
/// newtype_ops! { [Foo] add = ^Self &Self } // Silently ignored [b]
/// newtype_ops! { [Foo] add = ^Self &i32  } // Silently ignored [b]
/// newtype_ops! { [Foo] add = &Self ^Self } // Silently ignored [a]
/// newtype_ops! { [Foo] add = &Self ^i32  } // Silently ignored [a]
/// newtype_ops! { [Foo] add = &Self &Self } // Silently ignored [a]
/// newtype_ops! { [Foo] add = &Self &i32  } // Silently ignored [a]
/// // ... Sub impls ...
/// // ... Mul impls ...
/// // ... Div impls ...
/// // ... Rem impls ...
/// newtype_ops! { [Foo] neg : ^Self ^Self } // impl Neg for Foo { ... }
/// newtype_ops! { [Foo] neg : ^Self ^i32  } // Silently ignored [c]
/// newtype_ops! { [Foo] neg : ^Self &Self } // Silently ignored [c]
/// newtype_ops! { [Foo] neg : ^Self &i32  } // Silently ignored [c]
/// newtype_ops! { [Foo] neg : &Self ^Self } // impl Neg for &Foo { ... }
/// newtype_ops! { [Foo] neg : &Self ^i32  } // Silently ignored [c]
/// newtype_ops! { [Foo] neg : &Self &Self } // Silently ignored [c]
/// newtype_ops! { [Foo] neg : &Self &i32  } // Silently ignored [c]
/// newtype_ops! { [Foo] neg = ^Self ^Self } // Silently ignored [a]
/// newtype_ops! { [Foo] neg = ^Self ^i32  } // Silently ignored [a]
/// newtype_ops! { [Foo] neg = ^Self &Self } // Silently ignored [a]
/// newtype_ops! { [Foo] neg = ^Self &i32  } // Silently ignored [a]
/// newtype_ops! { [Foo] neg = &Self ^Self } // Silently ignored [a]
/// newtype_ops! { [Foo] neg = &Self ^i32  } // Silently ignored [a]
/// newtype_ops! { [Foo] neg = &Self &Self } // Silently ignored [a]
/// newtype_ops! { [Foo] neg = &Self &i32  } // Silently ignored [a]
/// ```

/// **_Holy blazing swordfish,_** you should reply,
/// _why are so many impls silently ignored?_
///
/// Well, a couple of reasons.  They're labeled:
///
/// * `[a]`: **They're nonsense/impossible,** yet cartesian products generate them.
/// * `[b]`: **For not very good reasons.** <br />
///          `AddAssign<&Bar>` and `AddAssign<&i32>` are certainly possible.
///          However, the majority of newtype wrappers are likely around primitives,
///          and primitive types are mysteriously missing `XyzAssign` impls for borrowed args.
///          Simply put, I forbade these so that the invocation at the top of the page *works.*
/// * `[c]`: **Shortcomings in implementation.** <br />
///          Obviously `Neg` doesn't care about an argument type,
///          but gets paired with a whole bunch of them anyways
///          thanks to the cartesian product design.
///          The labeled invocations are thus ignored to avoid generating
///          multiple conflicting impls.

// The next line -- an empty '///' -- seems to be necessary for the subheading to appear...
///
/// ## Other notes:
///
/// There are four words which stand in for **groups of operators:**
///
/// * `arithmetic` is equivalent to `{add sub mul div rem neg}`
/// * `arith_ring` is equivalent to `{add sub mul neg}`
/// * `bitwise` is equivalent to `{bitand bitor bitxor not}`
/// * `integer` is equivalent to `{arithmetic bitwise}`
///
/// There are also **word equivalents** for `:` (`normal`) and `=` (`assign`).
///
/// **There are deliberately NOT operator shortcuts** such as `+` for `add`,
/// because it is too easy to accidentally embed a comment delimiter: `{+-*/%}`
///
/// **The caret `^` before value types can be omitted.**
/// Its raison d'être is to give you something to put in a cartesian product.
///
/// ```rust
/// # use newtype_ops::newtype_ops;
/// # pub struct Foo(pub i32);
/// # pub struct Bar(pub f32);
/// newtype_ops! { [Bar] add : Self Self }
/// ```

/// You can omit the final type, in which case it is inferred to be `Self`.
/// This is for the sake of unary ops, but it currently also affects others...
///
/// ```rust
/// # use newtype_ops::newtype_ops;
/// # pub struct Bar(pub f32);
/// newtype_ops! { [Bar] neg : Self } // Allowed
/// newtype_ops! { [Bar] add : Self } // Also allowed (but discouraged; may change)
/// ```

/// The implemented type is bracketed (a) to help parse it,
/// and (b) so that it can use a cartesian product,
/// which currently operates specifically on token trees.
/// E.g. this is valid:
///
/// ```rust
/// # use newtype_ops::newtype_ops;
/// pub mod foo {
///     pub struct Foo(pub i32);
/// }
/// pub struct Bar(pub i32);
/// pub struct Generic<T>(T);
///
/// newtype_ops! { {[foo::Foo] [Bar] [Generic<i32>]} arithmetic {:=} Self Self }
/// ```

/// The output type can also be anything arbitrary like `foo::Foo` or `Generic<i32>`,
/// so long as `self.0` (`&self.0` for `&Self` receivers) implements `Add` for that type.
/// However, be careful with cartesian products;
/// `{Self i32}` only works because `Self` and `i32` are individual token trees.
/// `{foo::Foo Generic<i32>}` will fail miserably.
///
/// The `Index`, `Deref`, and `Fn` trait hierarchies are considered in-scope for future additions,
/// but hell if I know how to fit them into the existing interface.

#[macro_export(local_inner_macros)]
macro_rules! newtype_ops {
    ($($rest:tt)*) => { newtype_ops__!{ @product::next($($rest)*) -> () }};
}

#[macro_export(local_inner_macros)]
#[doc(hidden)]
macro_rules! newtype_ops__ {

    //----------------------
    // @product:  Handles the behavior of {} products

    (@product::next({$($token:tt)+} $($rest:tt)*) -> $args:tt) => {
        newtype_ops__!{ @product::unpack({$($token)+} $($rest)*) -> $args }};
    (@product::next( $token:tt $($rest:tt)*) -> $args:tt) => {
        newtype_ops__!{ @product::single($token $($rest)*) -> $args }};
    (@product::next() -> $args:tt) => {
        newtype_ops__!{ @interpret$args }};

    // Add one token to the argument list.
    (@product::single($token:tt $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @product::next($($rest)*) -> ($($args)* $token) }};

    // Each direct product in the invocation incurs a fixed number of recursions
    //   as we replicate things to the correct depth.
    // Compress all unparsed text into a single tt so we can match it without a repetition.
    (@product::unpack({$($token:tt)*} $($rest:tt)*) -> $args:tt) => {
        newtype_ops__!{ @product::unpack_2({$($token)*} [$($rest)*]) -> $args }};
    // Replicate macro for each token:
    (@product::unpack_2({$($token:tt)*} $rest:tt) -> $args:tt) => {
        $( newtype_ops__!{ @product::unpack_3($token $rest) -> $args } )* };
    // Expand the unparsed arguments back to normal.
    // (using single instead of next avoids reparsing a nested {} as another direct product,
    //  as I am uncertain that such behavior would be useful)
    (@product::unpack_3($token:tt [$($rest:tt)*]) -> $args:tt) => {
        newtype_ops__!{ @product::single($token $($rest)*) -> $args }};

    //----------------------
    // @interpret:  Parses individual arguments, expands internally-defined groups.

    (@interpret($($rest:tt)*)) => { newtype_ops__!{ @interpret::type($($rest)*) -> () }};

    (@interpret::type([$($T:tt)*] $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::oper($($rest)*) -> ($($args)* {value_ty:[$($T)*]}) }};

    (@interpret::oper(arithmetic $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::oper(add $($rest)*) -> ($($args)*) }
        newtype_ops__!{ @interpret::oper(sub $($rest)*) -> ($($args)*) }
        newtype_ops__!{ @interpret::oper(mul $($rest)*) -> ($($args)*) }
        newtype_ops__!{ @interpret::oper(div $($rest)*) -> ($($args)*) }
        newtype_ops__!{ @interpret::oper(rem $($rest)*) -> ($($args)*) }
        newtype_ops__!{ @interpret::oper(neg $($rest)*) -> ($($args)*) }
    };

    // API NOTE:
    //  Purposefully not named 'all' because such a name would also imply support for Index,
    //  Deref, and the Fn traits if I ever get to adding them. (and an option which provides
    //  both e.g. Mul and Index will probably have no applicable types)
    (@interpret::oper(integer $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::oper(bitand $($rest)*) -> ($($args)*) }
        newtype_ops__!{ @interpret::oper(bitor  $($rest)*) -> ($($args)*) }
        newtype_ops__!{ @interpret::oper(bitxor $($rest)*) -> ($($args)*) }
        newtype_ops__!{ @interpret::oper(not $($rest)*) -> ($($args)*) }
        newtype_ops__!{ @interpret::oper(add $($rest)*) -> ($($args)*) }
        newtype_ops__!{ @interpret::oper(sub $($rest)*) -> ($($args)*) }
        newtype_ops__!{ @interpret::oper(mul $($rest)*) -> ($($args)*) }
        newtype_ops__!{ @interpret::oper(div $($rest)*) -> ($($args)*) }
        newtype_ops__!{ @interpret::oper(rem $($rest)*) -> ($($args)*) }
        newtype_ops__!{ @interpret::oper(neg $($rest)*) -> ($($args)*) }
    };

    (@interpret::oper(arith_ring $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::oper(add $($rest)*) -> ($($args)*) }
        newtype_ops__!{ @interpret::oper(sub $($rest)*) -> ($($args)*) }
        newtype_ops__!{ @interpret::oper(mul $($rest)*) -> ($($args)*) }
        newtype_ops__!{ @interpret::oper(neg $($rest)*) -> ($($args)*) }
    };

    (@interpret::oper(bitwise $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::oper(bitand $($rest)*) -> ($($args)*) }
        newtype_ops__!{ @interpret::oper(bitor  $($rest)*) -> ($($args)*) }
        newtype_ops__!{ @interpret::oper(bitxor $($rest)*) -> ($($args)*) }
        newtype_ops__!{ @interpret::oper(not    $($rest)*) -> ($($args)*) }
    };

    // NOTE: The original plan was to allow +*-/%^&| here but it is too easy to
    //       accidentally put * and / together and end up making your life hell. :V
    //
    // Commas would be nice, e.g. {+,-,*,/,%,^,|,&} but it's tough to fit that into
    // @product() without exposing some cleverly-hidden warts and/or enabling unbounded
    // recursion.
    (@interpret::oper(add $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::mode($($rest)*) -> (
            $($args)* {kind:binary}
            {traits:[[::core::ops::Add][::core::ops::AddAssign]]}
            {methods:[[add][add_assign]]}
        )}};

    (@interpret::oper(sub $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::mode($($rest)*) -> (
            $($args)* {kind:binary}
            {traits:[[::core::ops::Sub][::core::ops::SubAssign]]}
            {methods:[[sub][sub_assign]]}
        )}};

    (@interpret::oper(mul $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::mode($($rest)*) -> (
            $($args)* {kind:binary}
            {traits:[[::core::ops::Mul][::core::ops::MulAssign]]}
            {methods:[[mul][mul_assign]]}
        )}};

    (@interpret::oper(div $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::mode($($rest)*) -> (
            $($args)* {kind:binary}
            {traits:[[::core::ops::Div][::core::ops::DivAssign]]}
            {methods:[[div][div_assign]]}
        )}};

    (@interpret::oper(rem $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::mode($($rest)*) -> (
            $($args)* {kind:binary}
            {traits:[[::core::ops::Rem][::core::ops::RemAssign]]}
            {methods:[[rem][rem_assign]]}
        )}};

    (@interpret::oper(neg $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::mode($($rest)*) -> (
            $($args)* {kind:unary}
            {traits:[[::core::ops::Neg]]}
            {methods:[[neg]]}
        )}};

    (@interpret::oper(bitand $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::mode($($rest)*) -> (
            $($args)* {kind:binary}
            {traits:[[::core::ops::BitAnd][::core::ops::BitAndAssign]]}
            {methods:[[bitand][bitand_assign]]}
        )}};

    (@interpret::oper(bitor $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::mode($($rest)*) -> (
            $($args)* {kind:binary}
            {traits:[[::core::ops::BitOr][::core::ops::BitOrAssign]]}
            {methods:[[bitor][bitor_assign]]}
        )}};

    (@interpret::oper(bitxor $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::mode($($rest)*) -> (
            $($args)* {kind:binary}
            {traits:[[::core::ops::BitXor][::core::ops::BitXorAssign]]}
            {methods:[[bitxor][bitxor_assign]]}
        )}};

    (@interpret::oper(not $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::mode($($rest)*) -> (
            $($args)* {kind:unary}
            {traits:[[::core::ops::Not]]}
            {methods:[[not]]}
        )}};

    // or 'pure', but that's a reserved keyword and some editors give it scare-highlighting
    (@interpret::mode(normal $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::self($($rest)*) -> ($($args)* {mode:normal}) }};
    (@interpret::mode(assign $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::self($($rest)*) -> ($($args)* {mode:assign}) }};
    (@interpret::mode(: $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::self($($rest)*) -> ($($args)* {mode:normal}) }};
    (@interpret::mode(= $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::self($($rest)*) -> ($($args)* {mode:assign}) }};

    (@interpret::self(&Self $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::other($($rest)*) -> ($($args)* {recv_form:[&x.0]}) }};
    (@interpret::self(^Self $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::other($($rest)*) -> ($($args)* {recv_form:[x.0]}) }};
    (@interpret::self(Self $($rest:tt)*) -> ($($args:tt)*)) => {
        newtype_ops__!{ @interpret::other($($rest)*) -> ($($args)* {recv_form:[x.0]}) }};

    // NOTE: here, we take advantage of the fact that the second type
    //       is the final argument in two ways:
    //  1. To allow it to be easily omitted for unary ops.
    //  2. To allow it to be an arbitrary type without requiring delimiters around it.
    //     (the first type is always Self, so no inconsistency is felt)
    // FIXME: This is a sucky thing to take advantage of because it
    //        means we can't do cartesian product.

    // operations between two newtypes
    (@interpret::other(&Self) -> ($($args:tt)*)) => {
        newtype_ops__!{ @postprocess($($args)* {arg:[#ref]} {arg_form:[&x.0]}) }};
    (@interpret::other(^Self) -> ($($args:tt)*)) => {
        newtype_ops__!{ @postprocess($($args)* {arg:[#value]} {arg_form:[x.0]}) }};
    (@interpret::other(Self) -> ($($args:tt)*)) => {
        newtype_ops__!{ @postprocess($($args)* {arg:[#value]} {arg_form:[x.0]}) }};
    (@interpret::other() -> ($($args:tt)*)) => {
        newtype_ops__!{ @postprocess($($args)* {arg:[#value]} {arg_form:[x.0]}) }};
    // operations between newtype and another type U for which (T or &T):Add<U>.
    (@interpret::other(^$($rest:tt)+) -> ($($args:tt)*)) => {
        newtype_ops__!{ @postprocess($($args)* {arg:[$($rest)*]} {arg_form:[x]}) }};
    (@interpret::other($($rest:tt)+) -> ($($args:tt)*)) => {
        newtype_ops__!{ @postprocess($($args)* {arg:[$($rest)*]} {arg_form:[x]}) }};

    //----------------------
    // @postprocess

    (@postprocess(
        $value_ty:tt $kind:tt $traits:tt $methods:tt $mode:tt $recv_form:tt $arg:tt $arg_form:tt
    )) => {
        newtype_ops__!{ @postprocess::blacklist(
            [$mode $kind $recv_form $arg_form $arg] // for @postprocess::blacklist
            [$arg $value_ty $recv_form]             // for @postprocess::true_types
            $traits $methods $recv_form $arg_form // initial list for @postprocess::almost_there
        ) }
    };

    // HACK: some arguments render other arguments inert; for instance, an impl for 'neg'
    //       has no argument type.  Bad combos do result from the cartesian product syntax,
    //       and unfortunately we cannot just ignore the nonsensical arguments because then
    //       we wil end up producing multiple conflicting impls.
    // Therefore, for each case where an argument is rendered nonsensical, only one of its
    // possible values will be accepted.  Anything else is—with apologies—silently ignored.

    // Make 'unary' require 'normal'
    // At the same time, fold mode into kind for three possible values: unary, binary, assign
    (@postprocess::blacklist([{mode:assign} {kind:unary}  $($more:tt)*] $($rest:tt)*)) => {
        };
    (@postprocess::blacklist([{mode:assign} {kind:binary} $($more:tt)*] $($rest:tt)*)) => {
        newtype_ops__!{ @postprocess::blacklist([{kind:assign} $($more)*] $($rest)*) }};
    (@postprocess::blacklist([{mode:normal} {kind:unary} $($more:tt)*] $($rest:tt)*)) => {
        newtype_ops__!{ @postprocess::blacklist([{kind:unary} $($more)*] $($rest)*) }};
    (@postprocess::blacklist([{mode:normal} {kind:binary} $($more:tt)*] $($rest:tt)*)) => {
        newtype_ops__!{ @postprocess::blacklist([{kind:binary} $($more)*] $($rest)*) }};

    // Make assign require a '^Self' receiver  (form = [x.0])
    (@postprocess::blacklist([{kind:assign} {recv_form:[&x.0]} $arg_form:tt $arg:tt] $($rest:tt)*)) => { };
    // Make 'unary' require a '^Self' argument
    (@postprocess::blacklist([{kind:unary} $recv_form:tt {arg_form:[&x.0]} $arg:tt] $($rest:tt)*)) => { };
    (@postprocess::blacklist([{kind:unary} $recv_form:tt {arg_form:[x]}    $arg:tt] $($rest:tt)*)) => { };

    // FIXME: Awful hack:
    // We deliberately ignore TraitAssign impls where the argument is borrowed, to make mass impls
    //  involving primitive wrapped types easier. (the standard library primitives lack impls
    //  for AddAssign<&Self> and etc.)
    // This obviously has nasty consequences for newtype wrappers around non-primitives for which
    //  such impls potentially *could* be valid.
    (@postprocess::blacklist([{kind:assign} $recv_form:tt $arg_form:tt {arg:[#ref]}] $($rest:tt)*)) => { };
    (@postprocess::blacklist([{kind:assign} $recv_form:tt $arg_form:tt {arg:[&$($arg:tt)+]}] $($rest:tt)*)) => { };

    (@postprocess::blacklist([{kind:$kind:tt} $($dropped:tt)*] $($rest:tt)*)) => {
        newtype_ops__!{ @postprocess::true_types($($rest)* {kind: $kind}) }};

    // Replace the #value and #ref placeholders with Self-based types
    (@postprocess::true_types(
        [{arg:[#value]} {value_ty:[$($T:tt)*]} $recv_form:tt] $($rest:tt)*
    )) => { newtype_ops__!{ @postprocess::true_types::2(
        [{value_ty:[$($T)*]} $recv_form {arg:[$($T)*]}] $($rest)*
    )}};
    (@postprocess::true_types(
        [{arg:[#ref]} {value_ty:[$($T:tt)*]} $recv_form:tt] $($rest:tt)*
    )) => { newtype_ops__!{ @postprocess::true_types::2(
        [{value_ty:[$($T)*]} $recv_form {arg:[&$($T)*]}] $($rest)*
    )}};
    (@postprocess::true_types(
        [{arg:[$($arg:tt)*]} {value_ty:[$($T:tt)*]} $recv_form:tt] $($rest:tt)*
    )) => { newtype_ops__!{ @postprocess::true_types::2(
        [{value_ty:[$($T)*]} $recv_form {arg:[$($arg)*]}] $($rest)*
    )}};

    // Generate lifetimes.
    (@postprocess::true_types::2(
        [{value_ty:[$($T:tt)*]} {recv_form:[&$($recv_form:tt)*]} {arg:[&$($arg:tt)*]}] $($rest:tt)*
    )) => {
        newtype_ops__!{ @postprocess::almost_there(
            $($rest)* {tpars:[<'a,'b>]} {recv:[&'a $($T)*]} {arg:[&'b $($arg)*]} {out:[$($T)*]}
        )}
    };

    (@postprocess::true_types::2(
        [{value_ty:[$($T:tt)*]} {recv_form:[&$($recv_form:tt)*]} {arg:[$($arg:tt)*]}] $($rest:tt)*
    )) => {
        newtype_ops__!{ @postprocess::almost_there(
            $($rest)* {tpars:[<'a>]} {recv:[&'a $($T)*]} {arg:[$($arg)*]} {out:[$($T)*]}
        )}
    };

    (@postprocess::true_types::2(
        [{value_ty:[$($T:tt)*]} {recv_form:[$($recv_form:tt)*]} {arg:[&$($arg:tt)*]}] $($rest:tt)*
    )) => {
        newtype_ops__!{ @postprocess::almost_there(
            $($rest)* {tpars:[<'b>]} {recv:[$($T)*]} {arg:[&'b $($arg)*]} {out:[$($T)*]}
        )}
    };

    (@postprocess::true_types::2(
        [{value_ty:[$($T:tt)*]} {recv_form:[$($recv_form:tt)*]} {arg:[$($arg:tt)*]}] $($rest:tt)*
    )) => {
        newtype_ops__!{ @postprocess::almost_there(
            $($rest)* {tpars:[]} {recv:[$($T)*]} {arg:[$($arg)*]} {out:[$($T)*]}
        )}
    };

    // at this stage we explicitly match the labels in each argument to ensure everything
    //  in order (literally)
    (@postprocess::almost_there(
        {traits:$traits:tt} {methods:$methods:tt}
        {recv_form:$recv_form:tt} {arg_form:$arg_form:tt}
        {kind:$kind:tt}                                               // from blacklist
        {tpars:$tpars:tt} {recv:$Recv:tt} {arg:$Arg:tt} {out:$Out:tt} // from true_types
    )) => {
        newtype_ops__!{
            @impl::$kind
            traits:$traits methods:$methods
            tpars:$tpars recv:$Recv arg:$Arg out:$Out
            forms:[$recv_form $arg_form]
        }
    };

    (@impl::unary
        traits:[[$($Trait:tt)*]]
        methods:[[$meth:ident]]
        tpars:[$($tpars:tt)*] recv:[$Recv:ty] arg:$_Arg:tt out:[$Out:path]
        forms:[[$($form1:tt)*] $_form2:tt]
    ) => {
        impl$($tpars)* $($Trait)* for $Recv {
            type Output = $Out;
            fn $meth(self) -> $Out {
                let this = self;
                $Out(
                    newtype_ops__!(@helper::delegate [$($form1)*] [this] [0]).$meth()
                )
            }
        }
    };

    (@impl::binary
        traits:[[$($Trait:tt)*] $_TraitAssign:tt]
        methods:[[$meth:ident] $_meth_assign:tt]
        tpars:[$($tpars:tt)*] recv:[$Recv:ty] arg:[$Arg:ty] out:[$Out:path]
        forms:[[$($form1:tt)*][$($form2:tt)*]]
    ) => {
        impl$($tpars)* $($Trait)*<$Arg> for $Recv {
            type Output = $Out;
            fn $meth(self, other: $Arg) -> $Out {
                let this = self;
                $Out(
                    newtype_ops__!(@helper::delegate [$($form1)*]  [this] [0])
                    .$meth(
                    newtype_ops__!(@helper::delegate [$($form2)*] [other] [0])
                    )
                )
            }
        }
    };

    (@impl::assign
        traits:[$_Trait:tt [$($TraitAssign:tt)*]]
        methods:[$_meth:tt [$meth_assign:ident]]
        tpars:[$($tpars:tt)*] recv:[$Recv:ty] arg:[$Arg:ty] out:$_Out:tt
        forms:[$_form1:tt [$($form2:tt)*]]
    ) => {
        impl$($tpars)* $($TraitAssign)*<$Arg> for $Recv {
            fn $meth_assign(&mut self, other: $Arg) {
                let this = self;
                newtype_ops__!(@helper::delegate   [&mut x.0]  [this] [0])
                .$meth_assign(
                newtype_ops__!(@helper::delegate [$($form2)*] [other] [0])
                )
            }
        }
    };

    (@helper::delegate [&mut x.0] [$id:ident] [$fld:tt]) => { &mut $id.$fld };
    (@helper::delegate     [&x.0] [$id:ident] [$fld:tt]) => {     &$id.$fld };
    (@helper::delegate      [x.0] [$id:ident] [$fld:tt]) => {      $id.$fld };
    (@helper::delegate        [x] [$id:ident] [$fld:tt]) => {           $id };
}

#[cfg(test)]
mod tests {

    // test:
    //  * All possible impls for a primitive element
    //  * A Cartesian product in many dimensions
    //  * A type that is more than one token tree long (foo::Foo)
    //  * Self types that do not derive Copy/Clone
    mod broad_1 {
        mod foo {
            #[derive(Eq,PartialEq,Debug)]
            pub struct Foo(pub i32);
        }
        #[derive(Eq,PartialEq,Debug)]
        pub struct Bar(pub i32);

        newtype_ops!{ {[foo::Foo][Bar]} integer {:=} {^&}Self {^&}{Self i32} }

        use self::foo::Foo;
        #[test]
        fn test() {

            // check that all desired impls work
            assert_eq!(Foo(5), Foo(2) + Foo(3));
            assert_eq!(Foo(5), Foo(2) + &Foo(3));
            assert_eq!(Foo(5), &Foo(2) + Foo(3));
            assert_eq!(Foo(5), &Foo(2) + &Foo(3));

            assert_eq!(Foo(4), Foo(8) / 2);
            assert_eq!(Foo(4), &Foo(8) / 2);
            assert_eq!(Foo(4), Foo(8) / &2);
            assert_eq!(Foo(4), &Foo(8) / &2);

            assert_eq!(Foo(-3), -Foo(3));
            assert_eq!(Foo(-3), -&Foo(3));

            // check that Bar was not neglected
            assert_eq!(Bar(5), Bar(2) + Bar(3));

            let mut foo = Foo(4);
            foo += 2;
            assert_eq!(foo, Foo(6));
            foo += Foo(2);
            assert_eq!(foo, Foo(8));
        }
    }

    // test:
    //  * Element (not just Self) types that do not derive Copy/Clone
    //  * That multiple layers of indirection are possible.
    mod proper_forwarding {

        #[derive(Eq,PartialEq,Debug)]
        pub struct Inner(pub i32);
        #[derive(Eq,PartialEq,Debug)]
        pub struct Foo(pub Inner);

        newtype_ops!{ [Inner] {add div neg} {assign normal} {^&}Self {^&}{Self i32}   }
        newtype_ops!{ [Foo]   {add div neg} {assign normal} {^&}Self {^&}{Self Inner i32} }

        #[test]
        fn test() {
            let foo = |x| Foo(Inner(x));

            // check that all desired impls work
            assert_eq!(foo(4), foo(8) / foo(2));
            assert_eq!(foo(4), foo(8) / &foo(2));
            assert_eq!(foo(4), &foo(8) / foo(2));
            assert_eq!(foo(4), &foo(8) / &foo(2));

            assert_eq!(foo(4), foo(8) / Inner(2));
            assert_eq!(foo(4), &foo(8) / Inner(2));
            assert_eq!(foo(4), foo(8) / &Inner(2));
            assert_eq!(foo(4), &foo(8) / &Inner(2));

            assert_eq!(foo(4), foo(8) / 2);
            assert_eq!(foo(4), &foo(8) / 2);
            assert_eq!(foo(4), foo(8) / &2);
            assert_eq!(foo(4), &foo(8) / &2);

            assert_eq!(foo(-3), -foo(3));
            assert_eq!(foo(-3), -&foo(3));

            let mut x = foo(4);
            x += foo(2);
            assert_eq!(x, foo(6));
            x += Inner(2);
            assert_eq!(x, foo(8));
            x += 2;
            assert_eq!(x, foo(10));
        }
    }

    // test:
    //  * that the right names link to the right operations
    mod op_bindings {
        // Make a separate struct for each operator to ensure that the right token
        //  generates implementations for the right trait.
        macro_rules! make_structs {
            ($($T:ident),*) => {$(
                #[derive(Eq,PartialEq,Debug,Copy,Clone)]
                pub struct $T(pub i32);
                impl From<i32> for $T {
                    fn from(x: i32) -> $T { $T(x) }
                }
            )*};
        }
        // (each struct will be named after its std::ops trait)
        make_structs!{ Add, Sub, Mul, Div, Rem, BitAnd, BitOr, BitXor, Neg, Not }

        newtype_ops!{ [Add]    add    {assign normal} Self Self }
        newtype_ops!{ [Sub]    sub    {assign normal} Self Self }
        newtype_ops!{ [Mul]    mul    {assign normal} Self Self }
        newtype_ops!{ [Div]    div    {assign normal} Self Self }
        newtype_ops!{ [Rem]    rem    {assign normal} Self Self }
        newtype_ops!{ [BitAnd] bitand {assign normal} Self Self }
        newtype_ops!{ [BitOr]  bitor  {assign normal} Self Self }
        newtype_ops!{ [BitXor] bitxor {assign normal} Self Self }
        newtype_ops!{ [Neg]    neg    {assign normal} Self }
        newtype_ops!{ [Not]    not    {assign normal} Self }

        // Tests on operator output ensure the right methods of the underlying type are invoked.
        fn run_binary_tests<T,F1,G1,F2,G2>(int_func: F1, foo_func: G1, int_eq: F2, foo_eq: G2)
        where
            T: ::core::fmt::Debug + From<i32> + Eq,
            F1: Fn(i32, i32) -> i32, G1: Fn(T, T) -> T,
            F2: Fn(&mut i32, i32),   G2: Fn(&mut T, T),
        {
            for a in 1..10 {
                for b in 1..10 {
                    let expected: T = int_func(a, b).into();
                    let actual:   T = foo_func(a.into(), b.into());
                    assert_eq!(actual, expected, "ouchie");

                    let expected: T = { let mut x = a; int_eq(&mut x, b); x }.into();
                    let actual:   T = { let mut x = a.into(); foo_eq(&mut x, b.into()); x };
                    assert_eq!(actual, expected, "eihcuo");
                }
            }
        }

        fn run_unary_tests<T,F,G>(int_func: F, foo_func: G)
        where T: ::core::fmt::Debug + From<i32> + Eq, F: Fn(i32) -> i32, G: Fn(T) -> T
        {
            for a in 1..10 {
                let expected: T = int_func(a).into();
                let actual:   T = foo_func(a.into());
                assert_eq!(actual, expected, "ouchie");
            }
        }

        #[test]
        fn test() {
            run_binary_tests::<Add   ,_,_,_,_>(|a,b| a + b, |a,b| a + b, |a,b| *a += b, |a,b| *a += b);
            run_binary_tests::<Sub   ,_,_,_,_>(|a,b| a - b, |a,b| a - b, |a,b| *a -= b, |a,b| *a -= b);
            run_binary_tests::<Mul   ,_,_,_,_>(|a,b| a * b, |a,b| a * b, |a,b| *a *= b, |a,b| *a *= b);
            run_binary_tests::<Div   ,_,_,_,_>(|a,b| a / b, |a,b| a / b, |a,b| *a /= b, |a,b| *a /= b);
            run_binary_tests::<Rem   ,_,_,_,_>(|a,b| a % b, |a,b| a % b, |a,b| *a %= b, |a,b| *a %= b);
            run_binary_tests::<BitAnd,_,_,_,_>(|a,b| a & b, |a,b| a & b, |a,b| *a &= b, |a,b| *a &= b);
            run_binary_tests::<BitOr ,_,_,_,_>(|a,b| a | b, |a,b| a | b, |a,b| *a |= b, |a,b| *a |= b);
            run_binary_tests::<BitXor,_,_,_,_>(|a,b| a ^ b, |a,b| a ^ b, |a,b| *a ^= b, |a,b| *a ^= b);
            run_unary_tests::<Neg,_,_>(|a| -a, |a| -a);
            run_unary_tests::<Not,_,_>(|a| !a, |a| !a);
        }

        // ensure that the above tests are capable of failure.  (How meta.)
        #[test] #[should_panic(expected = "ouchie")]
        fn bad_binary() {
            run_binary_tests::<Add   ,_,_,_,_>(|a,b| a * b, |a,b| a + b, |a,b| *a += b, |a,b| *a += b);
        }

        #[test] #[should_panic(expected = "eihcuo")]
        fn bad_assign() {
            run_binary_tests::<Add   ,_,_,_,_>(|a,b| a + b, |a,b| a + b, |a,b| *a *= b, |a,b| *a += b);
        }

        #[test] #[should_panic(expected = "ouchie")]
        fn bad_unary() {
            run_unary_tests::<Neg,_,_>(|a| !a, |a| -a);
        }
    }
}