Annotation of parser3/src/include/pa_array.h, revision 1.57.2.27.2.8
1.24 paf 1: /** @file
1.57.2.2 paf 2: Parser: Array & Array_iterator classes decls.
1.26 paf 3:
1.57.2.16 paf 4: Copyright (c) 2001-2003 ArtLebedev Group (http://www.artlebedev.com)
1.53 paf 5: Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru)
1.1 paf 6: */
7:
1.24 paf 8: #ifndef PA_ARRAY_H
9: #define PA_ARRAY_H
1.54 paf 10:
1.57.2.27.2.8! (paf 11:: static const char* IDENT_ARRAY_H="$Date: 2003/03/26 18:52:49 $";
1.24 paf 12:
1.57.2.25 paf 13: // includes
14:
15: #include "pa_memory.h"
1.57.2.3 paf 16: #include "pa_exception.h"
1.24 paf 17:
1.57.2.25 paf 18: // forwards
1.42 parser 19:
1.57.2.25 paf 20: template<typename T> class Array_iterator;
1.24 paf 21:
1.57.2.25 paf 22: /// Simple Array
1.57.2.2 paf 23: template<typename T> class Array: public PA_Object {
1.1 paf 24:
1.57.2.9 paf 25: friend class Array_iterator<T>;
1.57.2.2 paf 26:
1.57.2.13 paf 27: protected:
28:
29: /// elements[growing size] here
30: T *felements;
31:
1.57.2.2 paf 32: // allocated size
1.57.2.27.2.7 (paf 33:: size_t fallocated;
1.1 paf 34:
1.57.2.13 paf 35: // array size
1.57.2.27.2.7 (paf 36:: size_t fused;
1.57.2.13 paf 37:
1.57.2.2 paf 38: public:
39: typedef T element_type;
1.7 paf 40:
1.57.2.27.2.2 (paf 41:: Array(int initial=3):
1.57.2.27 paf 42: fallocated(initial>3?initial:3),
1.57.2.2 paf 43: fused(0)
44: {
1.57.2.27.2.2 (paf 45:: felements=static_cast<T*>(malloc(fallocated*sizeof(T)));
1.57.2.2 paf 46: }
1.24 paf 47:
1.57.2.2 paf 48: /// how many items are in Array
1.57.2.27.2.7 (paf 49:: size_t count() const { return fused; }
1.57.2.2 paf 50: /// append to array
51: Array& operator += (T src) {
52: if(is_full())
1.57.2.27.2.4 (paf 53:: expand(2);
1.24 paf 54:
1.57.2.2 paf 55: felements[fused++]=src;
1.37 paf 56:
1.57.2.2 paf 57: return *this;
1.34 paf 58: }
1.35 paf 59:
1.57.2.2 paf 60: /// append other Array portion to this one. starting from offset
61: Array& append(const Array& src, int offset=0, int limit=0) {
1.57.2.25 paf 62: if(offset<0) {
1.57.2.4 paf 63: throw Exception(0,
1.57.2.27.2.3 (paf 64:: 0,
1.57.2.25 paf 65: "Array::append(offset=%d) out <0", offset);
66: //return Nothing; // never
1.57.2.2 paf 67: }
68: // fix limit
69: {
70: int m=src.count()-offset;
71: if(!m || limit<0)
72: return *this;
73: if(!limit || limit>m)
74: limit=m;
75: }
1.29 paf 76:
1.57.2.23 paf 77: int delta=limit-(fallocated-fused);
78: if(delta>0)
79: expand(delta);
80:
81: T* from=&src.felements[offset];
82: T* to=&felements[fused];
83: T* from_end=from+limit;
84: while(from<from_end)
85: *to++=*from++;
86:
87: fused+=limit;
1.57.2.4 paf 88: return *this;
1.57.2.2 paf 89: }
1.49 paf 90:
1.57.2.27.2.7 (paf 91:: /// quick version of get index-element [use in tight places when sure]
1.57.2.27.2.8! (paf 92:: T unchecked_get(size_t index) const {
1.57.2.27.2.7 (paf 93:: return felements[index];
94:: }
95::
1.57.2.27.2.8! (paf 96:: size_t check(const char* name, size_t index) const {
1.57.2.27.2.7 (paf 97:: size_t lcount=count();
98:: if(!(index>=0 && index<lcount)) {
1.57.2.4 paf 99: throw Exception(0,
1.57.2.27.2.3 (paf 100:: 0,
1.57.2.27.2.8! (paf 101:: "Array::%s(%d) out of range [0..%d]", name, index, lcount-1);
! 102:: return 0; // never
1.57.2.2 paf 103: }
1.57.2.27.2.8! (paf 104:: return index;
! 105:: }
1.29 paf 106:
1.57.2.27.2.8! (paf 107:: /// get index-element
! 108:: T get(size_t index) const {
! 109:: return unchecked_get(check("get", index));
1.57.2.2 paf 110: }
1.57.2.12 paf 111:
1.57.2.27.2.8! (paf 112:: T operator [](size_t index) const { return get(index); }
! 113::
! 114:: /*/// get the reference to index-element
! 115:: T& get_ref(size_t index) {
! 116:: return felements[check("get_ref", index)];
! 117:: }*/
1.32 paf 118:
1.57.2.2 paf 119: /// put index-element
1.57.2.27.2.8! (paf 120:: void put(size_t index, T element) {
! 121:: felements[check("put", index)]=element;
1.57.2.2 paf 122: }
1.1 paf 123:
1.7 paf 124:
1.57.2.2 paf 125: /// iterate over all elements
1.57.2.6 paf 126: template<typename I> void for_each(void (*callback)(T, I), I info) const {
1.57.2.2 paf 127: T *last=felements+fused;
128: for(T *current=felements; current<last; current++)
129: callback(*current, info);
130: }
1.1 paf 131:
1.57.2.2 paf 132: /// iterate over all elements until condition becomes true, return that element
1.57.2.6 paf 133: template<typename I> T first_that(bool (*callback)(T, I), I info) const {
1.57.2.2 paf 134: T *last=felements+fused;
135: for(T *current=felements; current<last; current++)
136: if(callback(*current, info))
137: return *current;
1.7 paf 138:
1.57.2.20 paf 139: return T(0);
1.57.2.2 paf 140: }
1.1 paf 141:
1.57.2.3 paf 142: protected:
1.1 paf 143:
1.57.2.2 paf 144: bool is_full() {
145: return fused == fallocated;
146: }
1.57.2.27.2.5 (paf 147:: void expand(size_t delta) {
148:: size_t new_allocated=fallocated+delta;
149:: felements = (T *)realloc(felements, new_allocated*sizeof(T));
1.57.2.22 paf 150: memset(&felements[fallocated], 0, delta*sizeof(T));
1.57.2.27.2.5 (paf 151:: fallocated=new_allocated;
1.1 paf 152: }
1.2 paf 153:
1.1 paf 154: private: //disabled
155:
1.57.2.27.2.6 (paf 156:: Array(const Array&) {}
1.12 paf 157: Array& operator = (const Array&) { return *this; }
1.57.2.5 paf 158: };
159:
1.42 parser 160:
1.57.2.27.2.1 (paf 161:: /** Array iterator, usage:
162:: @code
163:: // Array<T> a;
164:: Array_iterator<T> i(a);
165:: while(i.has_next()) {
166:: T& element=i.next();
167:: ...
168:: }
169:: @endcode
170:: */
1.57.2.2 paf 171: template<typename T> class Array_iterator {
172:
1.57.2.27.2.1 (paf 173:: const Array<T>& farray;
174:: T *fcurrent;
175:: T *flast;
176::
177:: public:
178::
179:: Array_iterator(const Array<T>& aarray): farray(aarray) {
180:: fcurrent=farray.felements;
181:: flast=farray.felements+farray.count();
182:: }
183::
184:: /// there are still elements
185:: bool has_next() {
186:: return fcurrent<flast;
187:: }
188::
189:: /// quickly extracts next Array element
1.57.2.27.2.8! (paf 190:: const T next() {
1.57.2.27.2.1 (paf 191:: return *(fcurrent++);
192:: }
193::
194:: };
195::
196:: /** Nonconst array iterator, usage:
197:: @code
198:: // Array<T> a;
199:: Array_iterator<T> i(a);
200:: while(i.has_next()) {
201:: T& element=i.next();
202:: ...
203:: }
204:: @endcode
205:: */
206:: template<typename T> class Array_modifing_iterator {
207::
1.57.2.9 paf 208: Array<T>& farray;
1.57.2.2 paf 209: T *fcurrent;
210: T *flast;
211:
1.42 parser 212: public:
213:
1.57.2.27.2.1 (paf 214:: Array_modifing_iterator(Array<T>& aarray): farray(aarray) {
1.57.2.9 paf 215: fcurrent=farray.felements;
216: flast=farray.felements+farray.count();
1.42 parser 217: }
218:
219: /// there are still elements
220: bool has_next() {
1.57.2.2 paf 221: return fcurrent<flast;
1.42 parser 222: }
223:
1.57.2.2 paf 224: /// quickly extracts next Array element
1.57.2.27.2.8! (paf 225:: T next() {
1.57.2.9 paf 226: return *(fcurrent++);
1.42 parser 227: }
228:
1.1 paf 229: };
230:
231: #endif
E-mail:
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to pa_array.h CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [parser3project] / parser3 / src / include