marrySTL/vector.h at master · MemoriesOff/marrySTL · 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
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
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
#ifndef VECTOR_H_INCLUDED
#define VECTOR_H_INCLUDED

#include "alloc.h"
#include "stl_construct.h"

namespace marrySTL
{
    template<class T,class Alloc=alloc<T>>
    class vector
    {
    public:
        //形别定义
        typedef T   value_type;
        typedef T*  pointer;
        typedef T*  iterator;
        typedef T&  reference;
        typedef const T* const_pointer;
        typedef const T& const_reference;
        typedef size_t size_type;
        typedef ptrdiff_t diffrence_type;
    protected:

        Alloc date_allocator;  //空间配置器
        pointer start;   //使用空间头
        pointer finish;  //使用空间尾
        pointer end_of_storage; //可用空间尾
    public:
        //析构函数
        ~vector()
        {
            destroy(start,finish);
            date_allocator.deallocate(start,end_of_storage-start);
        }
        vector():start(0),finish(0),end_of_storage(0){};

        vector(size_type n)
        {
            start= date_allocator.allocate(n);
            pointer first=start;
            finish=first+n;
            end_of_storage=first+n;
        }

        vector(size_type n,const T& value)
        {
            start= date_allocator.allocate(n);
            pointer first=start;
            for(;n>0;n--)
            {
                *first= value;
                first++;
            }
            end_of_storage=first;
            finish=end_of_storage;
        }

        iterator begin()
        {
            return start;
        }

        const_pointer begin()const
        {
            return start;
        }


        iterator end()
        {
            return finish;
        }

        const_pointer end()const
        {
            return finish;
        }


        size_type size() const
        {
            return finish-start;
        }


        void insert(iterator position,int n,const_reference x)
        {
            pointer nowstart;
            pointer nowfinish;
            pointer i,j;
            int k;
            if((finish+n)>end_of_storage)
            {
                nowstart=date_allocator.allocate(size()+n);
                nowfinish=nowstart;
                i=start;
                for(;i<position;i++,nowfinish++)
                {
                    *nowfinish=*i;
                }
                for(k=0;k<n;k++)
                {
                    *nowfinish=x;
                    nowfinish++;
                }
                for(;i!=finish;i++)
                {
                    *nowfinish=*i;
                    nowfinish++;
                }
                destroy(start,finish);
                date_allocator.deallocate(start,end_of_storage-start);
                start=nowstart;
                finish=nowfinish;
                end_of_storage=finish;
            }else{
                nowstart=position;
                nowfinish=++finish;
                for(;nowfinish!=nowstart;nowfinish--)
                {

                    *nowfinish=*(nowfinish-1);
                }
                *nowfinish=x;
            }
        }
        void pop_back()
        {
            finish--;
        }


        reference operator[](size_type n)
        {
            return *(start+n);
        }

        const_reference operator[] (size_type n) const
        {
            return  *(start+n);
        }

        void push_back(const T& val)
        {
            insert(finish,1,val);
        }

        iterator erase ( iterator position )
        {
            pointer nowfinish,nowstart;
            nowstart=position;
            nowfinish=--finish;
            for(;nowfinish!=nowstart;nowstart++)
            {
                *nowstart=*(nowstart+1);
            }
            return position;
        }
        iterator erase ( iterator first, iterator last )
        {
            pointer nowfinish,nowstart;
            int num=last-first+1;
            nowstart=first;
            finish=finish-num;
            nowfinish=finish;
            for(;nowfinish!=nowstart;nowstart++)
            {
                *nowstart=*(nowstart+num);
            }
            return first;
        }

    };
}


#endif // VECTOR_H_INCLUDED