src/dynamic_buffer_iterator.cc


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

#include "dynamic_buffer_iterator.hh"

namespace Kakoune
{

DynamicBufferIterator::DynamicBufferIterator(const Buffer& buffer,
                                             BufferPos position)
    : BufferIterator(buffer, position)
{
    register_ifp();
}

DynamicBufferIterator::DynamicBufferIterator(DynamicBufferIterator&& other)
    : BufferIterator(other)
{
    register_ifp();
}

DynamicBufferIterator::DynamicBufferIterator(const BufferIterator& other)
    : BufferIterator(other)
{
    register_ifp();
}

DynamicBufferIterator& DynamicBufferIterator::operator=(const BufferIterator& other)
{
    unregister_ifn();
    BufferIterator::operator=(other);
    register_ifp();

    return *this;
}

DynamicBufferIterator::~DynamicBufferIterator()
{
    unregister_ifn();
}

void DynamicBufferIterator::on_modification(const BufferModification& modification)
{
    if (*this < modification.position)
        return;

    size_t length = modification.content.length();
    if (modification.type == BufferModification::Erase)
    {
        // do not move length on the other side of the inequality,
        // as modification.position + length may be after buffer end
        if (*this - length <= modification.position)
            BufferIterator::operator=(modification.position);
        else
            *this -= length;
    }
    else
    {
        assert(modification.type == BufferModification::Insert);
        *this += length;
    }
}

void DynamicBufferIterator::register_ifp()
{
    if (is_valid())
        const_cast<Buffer&>(buffer()).register_modification_listener(this);
}

void DynamicBufferIterator::unregister_ifn()
{
    if (is_valid())
        const_cast<Buffer&>(buffer()).unregister_modification_listener(this);
}

}