mkutils 0.1.117

Utility methods, traits, and types.
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

use crate::{
    rope::{
        chunk::Chunk,
        chunk_summary::{ChunkSummary, Length, LengthExtendedGraphemes, LengthLines},
        extended_grapheme_iter::ExtendedGraphemeIter,
        line::Line,
        rope::Rope,
    },
    utils::Utils,
};
use getset::CopyGetters;
use mkutils_macros::Constructor;
use zed_sum_tree::{Bias, Cursor, Dimensions};

type Dims = Dimensions<LengthLines, ChunkSummary>;

#[derive(Constructor, CopyGetters)]
#[get_copy = "pub"]
pub struct Atom<'r> {
    extended_grapheme: &'r str,
    offset: Length,
}

#[derive(Constructor)]
pub struct Atoms<'r> {
    chunk_extended_grapheme_iter: Option<ExtendedGraphemeIter<'r>>,
    chunk_cursor: Cursor<'r, 'static, Chunk, Dims>,
    rope_offset: Length,
}

impl<'r> Atoms<'r> {
    const BIAS: Bias = Bias::Left;

    #[must_use]
    pub fn from_rope(rope: &'r Rope, target_line_offset: LengthLines) -> Self {
        let chunk_sum_tree = rope.sum_tree();
        let mut chunk_cursor = chunk_sum_tree.cursor::<Dims>(Rope::CONTEXT);

        chunk_cursor.seek(&target_line_offset, Self::BIAS);

        let Dimensions(_line_offset, chunk_summary, ()) = chunk_cursor.start();
        let mut rope_offset = chunk_summary.len();

        'outer: while let Some(chunk) = chunk_cursor.next_iter() {
            let mut chunk_extended_grapheme_iter = chunk.extended_grapheme_iter();

            while rope_offset.lines() != target_line_offset {
                if let Some(length_advanced) = chunk_extended_grapheme_iter.advance_to_start_of_next_line() {
                    rope_offset.saturating_add_assign(&length_advanced);
                } else {
                    rope_offset.saturating_add_assign(&chunk_extended_grapheme_iter.advance_to_end_of_chunk());

                    continue 'outer;
                }
            }

            return Self::new(chunk_extended_grapheme_iter.some(), chunk_cursor, rope_offset);
        }

        Self::new(None, chunk_cursor, chunk_sum_tree.summary().len())
    }

    #[must_use]
    pub const fn rope_offset(&self) -> Length {
        self.rope_offset
    }

    fn next_chunk(&mut self) {
        let Some(chunk) = self.chunk_cursor.next_iter() else {
            self.chunk_extended_grapheme_iter = None;

            return;
        };

        self.chunk_extended_grapheme_iter = chunk.extended_grapheme_iter().some();
    }

    pub fn advance_within_line(
        &mut self,
        mut len_extended_graphemes: LengthExtendedGraphemes,
    ) -> Result<Length, Length> {
        let mut total_length_advanced = Length::ZERO;

        while let Some(chunk_extended_grapheme_iter) = &mut self.chunk_extended_grapheme_iter {
            match chunk_extended_grapheme_iter.advance_within_line(len_extended_graphemes) {
                Ok(length_advanced) => {
                    self.rope_offset.saturating_add_assign(&length_advanced);
                    total_length_advanced.saturating_add_assign(&length_advanced);
                    len_extended_graphemes.saturating_sub_assign(&length_advanced.extended_graphemes());

                    return total_length_advanced.ok();
                }
                Err(length_advanced) => {
                    self.rope_offset.saturating_add_assign(&length_advanced);
                    total_length_advanced.saturating_add_assign(&length_advanced);
                    len_extended_graphemes.saturating_sub_assign(&length_advanced.extended_graphemes());
                }
            }

            self.next_chunk();
        }

        total_length_advanced.err()
    }

    // NOTE: returns [Ok(...)] if we've successfully advanced to the start of the next line and [Err(...)] otherwise
    pub fn advance_to_start_of_next_line(&mut self) -> Result<Length, Length> {
        let mut total_length_advanced = Length::ZERO;

        while let Some(chunk_extended_grapheme_iter) = &mut self.chunk_extended_grapheme_iter {
            if let Some(length_advanced) = chunk_extended_grapheme_iter.advance_to_start_of_next_line() {
                self.rope_offset.saturating_add_assign(&length_advanced);
                total_length_advanced.saturating_add_assign(&length_advanced);

                return total_length_advanced.ok();
            }

            let length_advanced = chunk_extended_grapheme_iter.advance_to_end_of_chunk();

            self.rope_offset.saturating_add_assign(&length_advanced);
            total_length_advanced.saturating_add_assign(&length_advanced);
            self.next_chunk();
        }

        total_length_advanced.err()
    }

    pub const fn line<'a>(&'a mut self) -> Line<'r, 'a> {
        Line::new(self)
    }
}

impl<'r> Iterator for Atoms<'r> {
    type Item = Atom<'r>;

    fn next(&mut self) -> Option<Self::Item> {
        while let Some(chunk_extended_grapheme_iter) = &mut self.chunk_extended_grapheme_iter {
            if let Some(extended_grapheme) = chunk_extended_grapheme_iter.next() {
                let length_advanced = Length::from_extended_grapheme(extended_grapheme);
                let atom = Atom::new(extended_grapheme, self.rope_offset).some();

                self.rope_offset.saturating_add_assign(&length_advanced);

                return atom;
            }

            self.next_chunk();
        }

        None
    }
}