rust/crates/ra_syntax/src/algo.rs

44 lines
1.4 KiB
Rust
Raw Normal View History

2018-08-11 11:28:59 +02:00
pub mod visit;
2018-08-07 17:28:30 +02:00
2019-01-07 14:15:47 +01:00
use rowan::TransparentNewType;
2019-01-08 18:44:31 +01:00
use crate::{SyntaxNode, TextRange, TextUnit, AstNode};
2018-08-07 17:28:30 +02:00
pub use rowan::LeafAtOffset;
2018-08-07 17:28:30 +02:00
2019-01-07 14:15:47 +01:00
pub fn find_leaf_at_offset(node: &SyntaxNode, offset: TextUnit) -> LeafAtOffset<&SyntaxNode> {
match node.0.leaf_at_offset(offset) {
LeafAtOffset::None => LeafAtOffset::None,
2019-01-07 14:15:47 +01:00
LeafAtOffset::Single(n) => LeafAtOffset::Single(SyntaxNode::from_repr(n)),
LeafAtOffset::Between(l, r) => {
LeafAtOffset::Between(SyntaxNode::from_repr(l), SyntaxNode::from_repr(r))
}
2018-08-07 17:28:30 +02:00
}
}
2019-01-08 18:47:37 +01:00
/// Finds a node of specific Ast type at offset. Note that this is slightly
/// impercise: if the cursor is strictly betwen two nodes of the desired type,
/// as in
///
/// ```no-run
/// struct Foo {}|struct Bar;
/// ```
///
/// then the left node will be silently prefered.
2019-01-08 18:44:31 +01:00
pub fn find_node_at_offset<N: AstNode>(syntax: &SyntaxNode, offset: TextUnit) -> Option<&N> {
find_leaf_at_offset(syntax, offset).find_map(|leaf| leaf.ancestors().find_map(N::cast))
}
2019-01-07 14:15:47 +01:00
pub fn find_covering_node(root: &SyntaxNode, range: TextRange) -> &SyntaxNode {
SyntaxNode::from_repr(root.0.covering_node(range))
2018-08-07 17:28:30 +02:00
}
pub fn generate<T>(seed: Option<T>, step: impl Fn(&T) -> Option<T>) -> impl Iterator<Item = T> {
2018-08-12 17:50:16 +02:00
::itertools::unfold(seed, move |slot| {
slot.take().map(|curr| {
*slot = step(&curr);
curr
})
})
}