1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799
//! [![github]](https://github.com/dtolnay/tt-call) [![crates-io]](https://crates.io/crates/tt-call) [![docs-rs]](https://docs.rs/tt-call)
//!
//! [github]: https://img.shields.io/badge/github-8da0cb?style=for-the-badge&labelColor=555555&logo=github
//! [crates-io]: https://img.shields.io/badge/crates.io-fc8d62?style=for-the-badge&labelColor=555555&logo=rust
//! [docs-rs]: https://img.shields.io/badge/docs.rs-66c2a5?style=for-the-badge&labelColor=555555&logo=docs.rs
//!
//! <br>
//!
//! **This library is an attempt at seeding an ecosystem of high-quality modular
//! interoperable tt-muncher building blocks.**
//!
//! Tt-munching is a powerful technique for parsing macro\_rules input grammars
//! of significant complexity. In building more and more sophisticated
//! tt-muncher macros it becomes valuable to share code for dealing with certain
//! common input patterns, rather than reimplementing support for those patterns
//! in a low quality and poorly tested way each time.
//!
//! The core macros provided by this library are **[`tt_call!`]** and
//! **[`tt_return!`]**. Together these provide a flexible way to propagate input
//! and output tokens along a recursive descent call hierarchy. One may also
//! view them as a flexible library-only stable implementation of eager
//! expansion for macro\_rules.
//!
//! [`tt_call!`]: macro.tt_call.html
//! [`tt_return!`]: macro.tt_return.html
//!
//! ```toml
//! [dependencies]
//! tt-call = "1.0"
//! ```
//!
//! *Version requirement: tt-call requires a Rust compiler version 1.31 or
//! newer.*
//!
//!
//! ## Calling convention rules
//!
//! - **Macros that conform to tt-call must be invoked with curly braces.**
//!
//! ```
//! # macro_rules! some_macro {
//! # () => {};
//! # }
//! #
//! some_macro! {
//! /* ... */
//! }
//! ```
//!
//! The Rust grammar is very particular about punctuation after
//! parenthesized and square bracketed macro invocations. In expression or
//! type position they must not be followed by a semicolon. In item or
//! statement position they are required to be followed by a semicolon. The
//! inconsistency is applied transitively to any helper macros they forward
//! to, and means that parenthesized and square bracketed macro invocations
//! must decide whether to support expression and type position only or item
//! and statement position only. They cannot support both, which is a
//! problem for broadly applicable macro building blocks.
//!
//! There is no such punctuation requirement after curly brace invocations.
//! Consistently using curly braces makes the same macro building blocks
//! usable in any syntactic position.
//!
//! - **Input and output values must be passed in the following key-value
//! form.**
//!
//! ```
//! # macro_rules! some_macro {
//! # {
//! $key:ident = [{ $($value:tt)* }]
//! # } => {};
//! # }
//! ```
//!
//! This is enforced by the `tt_call!` and `tt_return!` macros. The
//! consistency is important for composability and makes it possible to
//! write higher-order macros that operate on the input or output of an
//! arbitrary tt-call macro.
//!
//! Except in libraries intended specifically as tt-call building blocks,
//! generally tt-call macros will be private `#[doc(hidden)]` helpers with a
//! user-facing non-tt-call entry point. Thus the rigid key-value syntax
//! need not be exposed to users of the public macro.
//!
//! - **Before its key-value inputs, every rule must accept a `$caller:tt`.**
//!
//! This is an opaque tt bundle used by `tt_call!` and `tt_return!` to
//! record the call hierarchy. A `tt_return!` accepts a `$caller` to return
//! back to.
//!
//! - **Every rule must expand to exactly one macro invocation and nothing
//! else.**
//!
//! Output tokens are expected to be returned through `tt_return!`.
//! Expanding to nothing, expanding to more than one macro invocation, or
//! expanding to anything other than a macro invocation are not permitted.
//!
//!
//! ## Examples
//!
//! Just as a flavor of the syntax, one of the rules from the implementation of
//! the built-in [`tt_replace!`] macro is written as follows. The macro takes in
//! a token stream and for each token that matches a given predicate it replaces
//! that token with a given replacement sequence of tokens. For example the
//! caller may want to replace the token `self` with the single token `__value`.
//!
//! The rule shown here is responsible for performing one step of the
//! replacement. It matches one token of input in `$first:tt`, uses [`tt_if!`]
//! to invoke the predicate with `$first` as input, recurses with an accumulated
//! copy of the replacement tokens if the predicate returns true, and recurses
//! on the remaining tokens with `$first` preserved unchanged if the predicate
//! returns false.
//!
//! [`tt_replace!`]: macro.tt_replace.html
//! [`tt_if!`]: macro.tt_if.html
//!
//! ```
//! # macro_rules! ignore {
//! {
//! $caller:tt
//! condition = [{ $condition:ident }]
//! replace_with = [{ $($with:tt)* }]
//! tokens = [{ $($tokens:tt)* }]
//! rest = [{ $first:tt $($rest:tt)* }]
//! } => {
//! tt_if! {
//! condition = [{ $condition }]
//! input = [{ $first }]
//! true = [{
//! private_replace! {
//! $caller
//! condition = [{ $condition }]
//! replace_with = [{ $($with)* }]
//! tokens = [{ $($tokens)* $($with)* }]
//! rest = [{ $($rest)* }]
//! }
//! }]
//! false = [{
//! private_replace! {
//! $caller
//! condition = [{ $condition }]
//! replace_with = [{ $($with)* }]
//! tokens = [{ $($tokens)* $first }]
//! rest = [{ $($rest)* }]
//! }
//! }]
//! }
//! };
//! # }
//! ```
//!
//! Here is another macro rule selected from `tt_replace!`. This one matches if
//! the tt-muncher has reached the end of its input. It returns the finished
//! tokens back to the caller using `tt_return!`.
//!
//! ```
//! # macro_rules! ignore {
//! {
//! $caller:tt
//! condition = [{ $condition:ident }]
//! replace_with = [{ $($with:tt)* }]
//! tokens = [{ $($tokens:tt)* }]
//! rest = [{ }]
//! } => {
//! tt_return! {
//! $caller
//! tokens = [{ $($tokens)* }]
//! }
//! };
//! # }
//! ```
//!
//! One example of a caller-provided predicate for `tt_replace!` could be
//! written as follows. This predicate determines whether the input token is
//! lowercase `self`.
//!
//! ```
//! macro_rules! is_lowercase_self {
//! // Input token is `self`.
//! {
//! $caller:tt
//! input = [{ self }]
//! } => {
//! tt_return! {
//! $caller
//! is = [{ true }]
//! }
//! };
//!
//! // Input token is anything other than `self`.
//! {
//! $caller:tt
//! input = [{ $other:tt }]
//! } => {
//! tt_return! {
//! $caller
//! is = [{ false }]
//! }
//! };
//! }
//! ```
//!
//! From here, calling `tt_replace!` with our `is_lowercase_self!` as the
//! condition predicate can be used to implement a fanciful syntax for unary
//! closures: `closure!(self + 1)` should expand to `|__value| __value + 1`.
//!
//! Notice that this user-facing `closure!` macro does not follow the tt-call
//! calling convention. Internally though it uses several tt-call helpers as
//! building blocks.
//!
//! ```
//! # macro_rules! tt_call {
//! # ($($ignore:tt)*) => {
//! # 2
//! # };
//! # }
//! #
//! macro_rules! closure {
//! ($($expr:tt)+) => {
//! |__value| tt_call! {
//! macro = [{ tt_replace }]
//! condition = [{ is_lowercase_self }]
//! replace_with = [{ __value }]
//! input = [{ $($expr)+ }]
//! }
//! };
//! }
//!
//! fn main() {
//! let add_one = closure!(self + 1);
//! println!("{}", add_one(1));
//! }
//! ```
//!
//!
//! ## Motivation
//!
//! This may seem like a lot of ceremony around what should be very simple macro
//! calls. After all, couldn't we write `is_lowercase_self` in a much more
//! straightforward way as follows?
//!
//! ```
//! macro_rules! is_lowercase_self {
//! (self) => { true };
//! ($other:tt) => { false };
//! }
//!
//! fn main() {
//! println!("{}", is_lowercase_self!(self)); // true
//! println!("{}", is_lowercase_self!(not_self)); // false
//! }
//! ```
//!
//! Qualified yes. As written, the simpler `is_lowercase_self!` behaves as it
//! looks like it should.
//!
//! But suppose we want to build `tt_replace!` or similar macro that needs to
//! invoke `is_lowercase_self!` as a helper. There is no way to do it with this
//! simpler one. No matter what our macro does, there is no way for it to expand
//! `is_lowercase_self!` before expanding itself. If it expands itself first,
//! there is no way for it to use the expansion of `is_lowercase_self!` to
//! decide whether the current token is supposed to be replaced.
//!
//! The `tt_call!` and `tt_return!` abstraction along with `$caller:tt` tracking
//! of the call hierarchy are critical to building composable macros that freely
//! pass around arbitrary tokens and return in a way that can inform expansion
//! of their caller.
//!
//! A future eager expansion feature for declarative macros may render the
//! tt-call approach unnecessary. Eager expansion is listed as an unresolved
//! question in the [tracking issue for declarative macros 2.0][tracking] but is
//! believed to be quite a ways out, if it ever happens. And even then it is not
//! clear whether it is desirable to allow macros expanding to arbitrary tokens.
//! Today macros always expand to an expression, item, statement, type, or
//! pattern. Eager expansion does not automatically mean that the restriction
//! would be lifted to allow a macro that expands to arbitrary tokens such as `!
//! @ #`. The token tree calling convention provides working eager expansion
//! today with support for passing and returning arbitrary token streams.
//!
//! [tracking]: https://github.com/rust-lang/rust/issues/39412
//!
//! And function-like procedural macros once those are stable? It is going to
//! depend on your choice of syntax for the macro input whether a procedural
//! macro is a better choice, but note that they present their own DIY parsing
//! adventures and can be even nastier than tt-call once you get the hang of
//! both. In addition, procedural macros must be defined in a separate crate
//! from the rest of your library so they are not well suited for quick one-off
//! helper macros.
//!
//!
//! ## Design philosphy
//!
//! As may be no surprise by this point, the calling convention design
//! prioritizes scalability and composability over conciseness. A reader
//! familiar with the calling convention (maybe you, six months after writing
//! the macro) should be able to look at any individual tt-call rule by itself
//! and comfortably read off what it does top to bottom and identify its
//! purpose.
//!
//!
//! ## Links
//!
//! - The code that implements `closure!(self + 1)`, all of which is shown
//! above, can be found all together in [`examples/replace.rs`].
//!
//! - As a more elaborate example of a tt-call macro,
//! [`examples/comma_separated.rs`] demonstrates a macro that does primitive
//! name mangling of Rust types. It uses [`parse_type!`] which is a tt-call
//! version of `$:ty`.
//!
//! ```
//! # macro_rules! mangle_type_names {
//! # ($($ignore:tt)*) => {
//! # &[
//! # "_std_fs_File",
//! # "_ref_mut_str",
//! # "_impl_Display",
//! # "_fn_s_ref_str_to_String",
//! # ]
//! # };
//! # }
//! #
//! static MANGLED: &[&str] = mangle_type_names! {
//! std::fs::File,
//! &'a mut str,
//! impl Display,
//! fn(s: &str) -> String,
//! };
//!
//! fn main() {
//! assert_eq!(MANGLED, [
//! "_std_fs_File",
//! "_ref_mut_str",
//! "_impl_Display",
//! "_fn_s_ref_str_to_String",
//! ]);
//! }
//! ```
//!
//! [`examples/replace.rs`]: https://github.com/dtolnay/tt-call/blob/master/examples/replace.rs
//! [`examples/comma_separated.rs`]: https://github.com/dtolnay/tt-call/blob/master/examples/comma_separated.rs
//! [`parse_type!`]: macro.parse_type.html
#![no_std]
#![doc(html_root_url = "https://docs.rs/tt-call/1.0.9")]
#![allow(clippy::module_name_repetitions, clippy::needless_doctest_main)]
mod predicate;
mod replace;
mod rust;
mod unexpected;
// In general it is not possible today in Rust to produce good error messages
// and good error spans at the same time. See:
//
// https://github.com/rust-lang/rust/issues/44535
//
// Within this crate we prefer to produce errors with the right span, even if
// the message is not good. This scales much better to large input token
// streams.
/// Evaluate a tt-call macro and return its output to a given return
/// destination.
///
/// # Input
///
/// The input must start with an argument called `macro` which provides the name
/// of the macro for `tt_call!` to invoke.
///
/// - `macro = [{` name of macro to call `}]`
///
/// After that there may be any number of key-value pairs to be passed as
/// arguments to the macro being called.
///
/// - **`$(`**<br>
///   arbitrary key `= [{` arbitrary tokens `}]`<br>
/// **`)*`**
///
/// Finally a specification of the macro invocation to which this call should
/// return its output.
///
/// - `~~>` name of return destination macro `! {`<br>
///   arbitrary tokens<br>
/// `}`
///
/// # Examples
///
/// ```
/// use tt_call::{tt_call, tt_is_ident};
///
/// macro_rules! print_is_ident {
/// {
/// token = [{ $token:tt }]
/// is_ident = [{ true }]
/// } => {
/// println!("turns out `{}` is an ident", stringify!($token));
/// };
///
/// {
/// token = [{ $token:tt }]
/// is_ident = [{ false }]
/// } => {
/// println!("nope, `{}` is not an ident", stringify!($token));
/// };
/// }
///
/// fn main() {
/// tt_call! {
/// macro = [{ tt_is_ident }]
/// input = [{ foo }]
/// ~~> print_is_ident! {
/// token = [{ foo }]
/// }
/// }
/// }
/// ```
///
/// If the invoked macro provides the entirety of the input to the return
/// destination macro, then the `!` and argument list may be omitted.
///
/// ```
/// use tt_call::{tt_call, tt_is_ident};
///
/// macro_rules! print_is_ident {
/// {
/// is_ident = [{ true }]
/// } => {
/// println!("that token is an ident");
/// };
///
/// {
/// is_ident = [{ false }]
/// } => {
/// println!("nope, not an ident");
/// };
/// }
///
/// fn main() {
/// tt_call! {
/// macro = [{ tt_is_ident }]
/// input = [{ foo }]
/// ~~> print_is_ident
/// }
/// }
/// ```
///
/// And if the invoked macro produces exactly one output value and we just want
/// to expand to that output value, the destination macro may be omitted
/// entirely.
///
/// ```
/// use tt_call::{tt_call, tt_is_ident};
///
/// fn main() {
/// let is_ident = tt_call! {
/// macro = [{ tt_is_ident }]
/// input = [{ foo }]
/// };
/// println!("{}", is_ident); // prints true or false
/// }
/// ```
#[macro_export]
macro_rules! tt_call {
// Call macro and expand into the tokens of its one return value.
{
macro = [{ $($m:ident)::* }]
$(
$input:ident = [{ $($tokens:tt)* }]
)*
} => {
$($m)::* ! {
(__tt_call_private $crate::tt_identity_return! {})
$(
$input = [{ $($tokens)* }]
)*
}
};
// Call macro and pass its return values to the given return destination.
{
macro = [{ $($m:ident)::* }]
$(
$input:ident = [{ $($tokens:tt)* }]
)*
~~> $($return:ident)::*
} => {
$($m)::* ! {
(__tt_call_private $($return)::* ! {})
$(
$input = [{ $($tokens)* }]
)*
}
};
// Call macro and append its return values onto the invocation of the given
// return destination without caller.
{
macro = [{ $($m:ident)::* }]
$(
$input:ident = [{ $($tokens:tt)* }]
)*
~~> $($return:ident)::* ! {
$(
$name:ident = [{ $($state:tt)* }]
)*
}
} => {
$($m)::* ! {
(__tt_call_private $($return)::* ! {
$(
$name = [{ $($state)* }]
)*
})
$(
$input = [{ $($tokens)* }]
)*
}
};
// Call macro and append its return values onto the invocation of the given
// return destination with caller.
{
macro = [{ $($m:ident)::* }]
$(
$input:ident = [{ $($tokens:tt)* }]
)*
~~> $($return:ident)::* ! {
$caller:tt
$(
$name:ident = [{ $($state:tt)* }]
)*
}
} => {
$($m)::* ! {
(__tt_call_private $($return)::* ! {
$caller
$(
$name = [{ $($state)* }]
)*
})
$(
$input = [{ $($tokens)* }]
)*
}
};
}
#[doc(hidden)]
#[macro_export]
macro_rules! tt_identity_return {
// Macro returned one value.
{
$name:ident = [{ $($output:tt)* }]
} => {
$($output)*
};
// Macro parsed the entire input and returned one value.
{
$name:ident = [{ $($output:tt)* }]
rest = [{ }]
} => {
$($output)*
};
// Unexpected: macro failed to parse the entire input.
{
$name:ident = [{ $($output:tt)* }]
rest = [{ $($unexpected:tt)* }]
} => {
$crate::error_unexpected! {
$($unexpected)*
}
};
}
/// Return zero or more output values to the caller macro.
///
/// # Input
///
/// The `tt_return!` invocation should be given a `$caller` to return to and a
/// sequence of zero or more named return values.
///
/// - **`$(`**<br>
///   arbitrary key `= [{` arbitrary tokens `}]`<br>
/// **`)*`**
///
/// # Example
///
/// ```
/// use tt_call::{tt_call, tt_return};
///
/// macro_rules! is_lowercase_self {
/// // Input token is `self`.
/// {
/// $caller:tt
/// input = [{ self }]
/// } => {
/// tt_return! {
/// $caller
/// is = [{ true }]
/// }
/// };
///
/// // Input token is anything other than `self`.
/// {
/// $caller:tt
/// input = [{ $other:tt }]
/// } => {
/// tt_return! {
/// $caller
/// is = [{ false }]
/// }
/// };
/// }
///
/// fn main() {
/// let is = tt_call! {
/// macro = [{ is_lowercase_self }]
/// input = [{ self }]
/// };
/// println!("{}", is);
/// }
/// ```
#[macro_export]
macro_rules! tt_return {
{
$caller:tt
$(
$output:ident = [{ $($tokens:tt)* }]
)*
} => {
$crate::private_return! {
$caller
$(
$output = [{ $($tokens)* }]
)*
}
};
}
#[doc(hidden)]
#[macro_export]
macro_rules! private_return {
{
(__tt_call_private $($caller:ident)::* ! { $($state:tt)* })
$($append:tt)*
} => {
$($caller)::* ! {
$($state)*
$($append)*
}
};
}
/// Evaluate a condition and expand to one or the other of two branches.
///
/// # Input
///
/// - `condition = [{` name of predicate macro to invoke `}]`
/// - `input = [{` arbitrary tokens to pass as input to the predicate `}]`
/// - `true = [{` tokens to expand to if the predicate returns true `}]`
/// - `false = [{` and if the predicate returns false `}]`
///
/// The predicate macro must accept a single input value named `input`. It is
/// expected to return a single output value which may have any name but must
/// hold the tokens `true` or `false`. For example the built-in `tt_is_comma!`
/// predicate expands to `is_comma = [{ true }]` or `is_comma = [{ false }]`.
///
/// # Example
///
/// ```
/// use tt_call::{tt_call, tt_if, tt_is_comma, tt_return};
///
/// macro_rules! parse_until_comma {
/// ($($input:tt)*) => {
/// tt_call! {
/// macro = [{ parse_until_comma_helper }]
/// before_comma = [{ }]
/// tokens = [{ $($input)* }]
/// }
/// };
/// }
///
/// macro_rules! parse_until_comma_helper {
/// {
/// $caller:tt
/// before_comma = [{ $($before:tt)* }]
/// tokens = [{ $first:tt $($rest:tt)* }]
/// } => {
/// tt_if! {
/// condition = [{ tt_is_comma }]
/// input = [{ $first }]
/// true = [{
/// tt_return! {
/// $caller
/// before_comma = [{ $($before)* }]
/// }
/// }]
/// false = [{
/// parse_until_comma_helper! {
/// $caller
/// before_comma = [{ $($before)* $first }]
/// tokens = [{ $($rest)* }]
/// }
/// }]
/// }
/// };
/// }
///
/// fn main() {
/// assert_eq!(3, parse_until_comma!(1 + 2, three, four));
/// }
/// ```
#[macro_export]
macro_rules! tt_if {
{
condition = [{ $($condition:ident)::* }]
input = [{ $($input:tt)* }]
true = [{ $($then:tt)* }]
false = [{ $($else:tt)* }]
} => {
$crate::tt_call! {
macro = [{ $($condition)::* }]
input = [{ $($input)* }]
~~> $crate::private_if_branch! {
true = [{ $($then)* }]
false = [{ $($else)* }]
}
}
};
}
#[doc(hidden)]
#[macro_export]
macro_rules! private_if_branch {
// Branch condition returned true.
{
true = [{ $($then:tt)* }]
false = [{ $($else:tt)* }]
$condition:ident = [{ true }]
} => {
$($then)*
};
// Branch condition returned false.
{
true = [{ $($then:tt)* }]
false = [{ $($else:tt)* }]
$condition:ident = [{ false }]
} => {
$($else)*
};
}
/// Print arbitrary output values returned by a tt-call macro. This is valuable
/// for debugging.
/// <sup>**[tt-call]**</sup>
///
/// # Example
///
/// ```
/// use tt_call::{parse_type, tt_call, tt_debug};
///
/// fn main() {
/// tt_call! {
/// macro = [{ parse_type }]
/// input = [{ Vec<u8>, compressed=false }]
/// ~~> tt_debug
/// }
/// }
/// ```
///
/// The output is:
///
/// ```text
/// type = [{ Vec < u8 > }]
/// rest = [{ , compressed = false }]
/// ```
#[macro_export]
macro_rules! tt_debug {
{
$(
$output:ident = [{ $($tokens:tt)* }]
)*
} => {
$(
println!(
"{}",
concat!(
stringify!($output),
" = [{ ",
stringify!($($tokens)*),
" }]",
)
);
)*
}
}