BigInteger/OptimizedArrayList.h at master · maxLundin/BigInteger · GitHub

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
//
// Created by max on 15.05.18.
//

#pragma once

#include <vector>
#include <memory>
#include <cassert>
#include <cstring>

using std::shared_ptr;
using std::vector;

class OptimizedArrayList {
public:

    OptimizedArrayList();

    OptimizedArrayList &operator=(OptimizedArrayList const &other);

    OptimizedArrayList(OptimizedArrayList const &other);

    OptimizedArrayList(OptimizedArrayList  &&other) noexcept;

    OptimizedArrayList(std::initializer_list<uint32_t> list);

    ~OptimizedArrayList();

    size_t size() const;

    uint32_t back() const;

    void push_back(uint32_t x);

    void pop_back();

    uint32_t &operator[](size_t ind);

    uint32_t const &operator[](size_t ind) const;

    void resize(size_t len);

    void clear();

    typedef uint32_t *iterator;
    typedef const uint32_t *const_iterator;
    typedef std::reverse_iterator<iterator> reverse_iterator;
    typedef std::reverse_iterator<const_iterator> const_reverse_iterator;

    iterator begin() {
        make_unique();
        if (!isSmall) {
            return data.big->data();
        } else {
            return &data.small;
        }
    }

    iterator end() {
        make_unique();
        if (!isSmall) {
            return data.big->data() + _size;
        } else {
            return (&data.small) + 1;
        }
    }

    const_iterator begin() const {
        if (!isSmall) {
            return data.big->data();
        } else {
            return &data.small;
        }
    }

    const_iterator end() const {
        if (!isSmall) {
            return data.big->data() + _size;
        } else {
            return (&data.small) + 1;
        }
    }

    const_reverse_iterator rend() const {
        return const_reverse_iterator(begin());
    }

    const_reverse_iterator rbegin() const {
        return const_reverse_iterator(end());
    }

    reverse_iterator rend() {
        return reverse_iterator(begin());
    }

    reverse_iterator rbegin() {
        return reverse_iterator(end());
    }

private:
    union data {
        uint32_t small;
        shared_ptr<vector<uint32_t>> big;

        data() {};

        ~data() {};
    };

    data data;
    size_t _size;
    bool isSmall;


    void make_big();

    void make_unique();
};