rust/crates/ra_tt/src/lib.rs

170 lines
4.0 KiB
Rust
Raw Normal View History

//! `tt` crate defines a `TokenTree` data structure: this is the interface (both
//! input and output) of macros. It closely mirrors `proc_macro` crate's
//! `TokenTree`.
2019-01-31 12:29:04 -06:00
2019-01-31 12:09:43 -06:00
macro_rules! impl_froms {
($e:ident: $($v:ident), *) => {
$(
impl From<$v> for $e {
fn from(it: $v) -> $e {
$e::$v(it)
}
}
)*
}
}
2019-01-31 08:16:02 -06:00
use std::fmt;
2019-01-31 04:40:05 -06:00
use smol_str::SmolStr;
2019-01-30 14:02:27 -06:00
2019-02-11 12:31:54 -06:00
/// Represents identity of the token.
///
/// For hygiene purposes, we need to track which expanded tokens originated from
/// which source tokens. We do it by assigning an distinct identity to each
/// source token and making sure that identities are preserved during macro
/// expansion.
2019-02-11 10:28:39 -06:00
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)]
pub struct TokenId(pub u32);
impl TokenId {
pub const fn unspecified() -> TokenId {
TokenId(!0)
}
}
2019-02-12 11:57:13 -06:00
#[derive(Debug, Clone, PartialEq, Eq)]
2019-01-31 04:40:05 -06:00
pub enum TokenTree {
2019-01-30 14:02:27 -06:00
Leaf(Leaf),
Subtree(Subtree),
}
2019-01-30 14:58:52 -06:00
impl_froms!(TokenTree: Leaf, Subtree);
2019-01-30 14:02:27 -06:00
2019-02-12 11:57:13 -06:00
#[derive(Debug, Clone, PartialEq, Eq)]
2019-01-31 04:40:05 -06:00
pub enum Leaf {
2019-01-30 14:02:27 -06:00
Literal(Literal),
Punct(Punct),
Ident(Ident),
}
2019-01-30 14:58:52 -06:00
impl_froms!(Leaf: Literal, Punct, Ident);
2019-01-30 14:02:27 -06:00
2019-02-12 11:57:13 -06:00
#[derive(Debug, Clone, PartialEq, Eq)]
2019-01-31 04:40:05 -06:00
pub struct Subtree {
pub delimiter: Delimiter,
pub token_trees: Vec<TokenTree>,
2019-01-30 14:02:27 -06:00
}
2019-02-11 10:19:23 -06:00
#[derive(Clone, Copy, Debug, PartialEq, Eq)]
2019-01-31 04:40:05 -06:00
pub enum Delimiter {
2019-01-30 14:02:27 -06:00
Parenthesis,
Brace,
Bracket,
None,
}
2019-02-12 11:57:13 -06:00
#[derive(Debug, Clone, PartialEq, Eq)]
2019-01-31 04:40:05 -06:00
pub struct Literal {
pub text: SmolStr,
2019-01-30 14:02:27 -06:00
}
2019-01-31 09:51:17 -06:00
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
2019-01-31 04:40:05 -06:00
pub struct Punct {
pub char: char,
2019-01-31 09:51:17 -06:00
pub spacing: Spacing,
}
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum Spacing {
Alone,
Joint,
2019-01-30 14:02:27 -06:00
}
2019-02-12 11:57:13 -06:00
#[derive(Debug, Clone, PartialEq, Eq)]
2019-01-31 04:40:05 -06:00
pub struct Ident {
pub text: SmolStr,
2019-02-11 10:28:39 -06:00
pub id: TokenId,
2019-01-30 14:02:27 -06:00
}
2019-01-31 08:16:02 -06:00
impl fmt::Display for TokenTree {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
match self {
TokenTree::Leaf(it) => fmt::Display::fmt(it, f),
TokenTree::Subtree(it) => fmt::Display::fmt(it, f),
}
}
}
impl fmt::Display for Subtree {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
let (l, r) = match self.delimiter {
Delimiter::Parenthesis => ("(", ")"),
Delimiter::Brace => ("{", "}"),
Delimiter::Bracket => ("[", "]"),
Delimiter::None => ("", ""),
};
2019-01-31 09:51:17 -06:00
f.write_str(l)?;
let mut needs_space = false;
for tt in self.token_trees.iter() {
if needs_space {
f.write_str(" ")?;
}
needs_space = true;
match tt {
TokenTree::Leaf(Leaf::Punct(p)) => {
needs_space = p.spacing == Spacing::Alone;
fmt::Display::fmt(p, f)?
}
tt => fmt::Display::fmt(tt, f)?,
}
}
f.write_str(r)?;
Ok(())
2019-01-31 08:16:02 -06:00
}
}
impl fmt::Display for Leaf {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
match self {
Leaf::Ident(it) => fmt::Display::fmt(it, f),
Leaf::Literal(it) => fmt::Display::fmt(it, f),
Leaf::Punct(it) => fmt::Display::fmt(it, f),
}
}
}
impl fmt::Display for Ident {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
fmt::Display::fmt(&self.text, f)
}
}
impl fmt::Display for Literal {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
fmt::Display::fmt(&self.text, f)
}
}
impl fmt::Display for Punct {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
fmt::Display::fmt(&self.char, f)
}
}
impl Subtree {
/// Count the number of tokens recursively
pub fn count(&self) -> usize {
let children_count = self
.token_trees
.iter()
.map(|c| match c {
TokenTree::Subtree(c) => c.count(),
_ => 0,
})
.sum::<usize>();
self.token_trees.len() + children_count
}
}
2019-05-21 23:30:36 -05:00
pub mod buffer;