Benign crates 2,034,360 installs Download

ra_ap_tt 0.0.312

“A `TokenTree` data structure for rust-analyzer.”

Basename is uppercase README.mdCaret or XOR expression text
SHA-25647451c6724a3a1af3da7822c5e3fd8d07ff28c74d5e300f3a6d6484d2fe9f8f8
MaleculeMd₂(InPa)

Evidence

English function-word token "the" lines 1–6
1:6… tt` crate defines a `TokenTree` data structure: this is the interface (both
2//! input and output) of macros.
3//!
4//! The `TokenTree` is semantically a tree, but for performance reasons it is stored as a flat structure.
5
6#![cfg_attr(feature = "in-rust-tree", fe …
imports buffer::Cursor lines 14–34
14:14… rustc_lexer;
15
16pub mod buffer;
17pub mod iter;
18
19use std::fmt;
20
21use buffer::Cursor;
22use intern::Symbol;
23use stdx::{impl_from, itertools::Itertools as _};
24
25pub use span::Span;
26pub use text_size::{TextRange, TextSize};
27
28pub use self::iter::{TtElement, TtIter};
29
30pub const MAX_GLUED_PUNCT_LEN: usize = 3;
⋯4 lines
assert! macro lines 282–286
282:36… ree() {
283 Some(_) => {
284 assert!(
285 self.unclosed_subtree_indices.is_empty(),
286 "attempt to …
assert_eq! macro lines 477–482
477:58… e in `SubtreeView`");
478 };
479 assert_eq!(
480 subtree.usize_len(),
481 tts.len() - 1,
482 "subtree m …
imports rustc_lexer::LiteralKind lines 581–587
581:44… pan) -> Literal
582where
583 Span: Copy,
584{
585 use rustc_lexer::LiteralKind;
586
587 let token = rustc_lexer::tokenize(text, rustc_lexer::FrontmatterAllowed::No).next_tuple() …

No evidence locations were recorded for this file. Raw result

Keyboard shortcuts on this page: j for the next sample, k for the previous one, x to go back to the feed, d to download the original bytes, r to re-queue the sample for analysis.