mirror of https://github.com/helix-editor/helix
Implement m / match_brackets (using tree sitter).
parent
bd607b4cbd
commit
73c92a0bc1
@ -0,0 +1,34 @@
|
||||
use crate::{Range, Rope, Selection, Syntax};
|
||||
|
||||
// const PAIRS: &[(char, char)] = &[('(', ')'), ('{', '}'), ('[', ']')];
|
||||
// limit matching pairs to only ( ) { } [ ] < >
|
||||
|
||||
pub fn find(syntax: &Syntax, doc: &Rope, pos: usize) -> Option<usize> {
|
||||
let tree = syntax.root_layer.tree.as_ref().unwrap();
|
||||
|
||||
let byte_pos = doc.char_to_byte(pos);
|
||||
|
||||
// most naive implementation: find the innermost syntax node, if we're at the edge of a node,
|
||||
// return the other edge.
|
||||
|
||||
let mut node = match tree
|
||||
.root_node()
|
||||
.named_descendant_for_byte_range(byte_pos, byte_pos)
|
||||
{
|
||||
Some(node) => node,
|
||||
None => return None,
|
||||
};
|
||||
|
||||
let start_byte = node.start_byte();
|
||||
let end_byte = node.end_byte() - 1; // it's end exclusive
|
||||
|
||||
if start_byte == byte_pos {
|
||||
return Some(doc.byte_to_char(end_byte));
|
||||
}
|
||||
|
||||
if end_byte == byte_pos {
|
||||
return Some(doc.byte_to_char(start_byte));
|
||||
}
|
||||
|
||||
None
|
||||
}
|
Loading…
Reference in New Issue