Annotation of parser3/src/include/pa_array.h, revision 1.57.2.27.2.7
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.7! (paf 11:: static const char* IDENT_ARRAY_H="$Date: 2003/03/26 07:45:22 $";
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]
! 92:: T& unchecked_get(size_t index) const {
! 93:: return felements[index];
! 94:: }
! 95::
1.57.2.2 paf 96: /// get index-element
1.57.2.27.2.7! (paf 97:: T& get(size_t index) const {
! 98:: size_t lcount=count();
! 99:: if(!(index>=0 && index<lcount)) {
1.57.2.4 paf 100: throw Exception(0,
1.57.2.27.2.3 (paf 101:: 0,
1.57.2.27.2.7! (paf 102:: "Array::get(%d) out of range [0..%d]", index, lcount-1);
1.57.2.15 paf 103: return felements[0]; // never
1.57.2.2 paf 104: }
1.29 paf 105:
1.57.2.27.2.7! (paf 106:: return unchecked_get(index);
1.57.2.2 paf 107: }
1.57.2.12 paf 108:
1.57.2.27.2.7! (paf 109:: T& operator [](size_t index) const { return get(index); }
1.32 paf 110:
1.57.2.2 paf 111: /// put index-element
1.57.2.27.2.7! (paf 112:: void put(size_t index, T& element) {
! 113:: size_t lcount=count();
! 114:: if(!(index>=0 && index<lcount)) {
1.57.2.4 paf 115: throw Exception(0,
1.57.2.27.2.3 (paf 116:: 0,
1.57.2.27.2.7! (paf 117:: "Array::put(%d) out of range [0..%d]", index, lcount-1);
1.57.2.2 paf 118: return; // never
119: }
120: felements[index]=element;
121: }
1.1 paf 122:
1.7 paf 123:
1.57.2.2 paf 124: /// iterate over all elements
1.57.2.6 paf 125: template<typename I> void for_each(void (*callback)(T, I), I info) const {
1.57.2.2 paf 126: T *last=felements+fused;
127: for(T *current=felements; current<last; current++)
128: callback(*current, info);
129: }
1.1 paf 130:
1.57.2.2 paf 131: /// iterate over all elements until condition becomes true, return that element
1.57.2.6 paf 132: template<typename I> T first_that(bool (*callback)(T, I), I info) const {
1.57.2.2 paf 133: T *last=felements+fused;
134: for(T *current=felements; current<last; current++)
135: if(callback(*current, info))
136: return *current;
1.7 paf 137:
1.57.2.20 paf 138: return T(0);
1.57.2.2 paf 139: }
1.1 paf 140:
1.57.2.3 paf 141: protected:
1.1 paf 142:
1.57.2.2 paf 143: bool is_full() {
144: return fused == fallocated;
145: }
1.57.2.27.2.5 (paf 146:: void expand(size_t delta) {
147:: size_t new_allocated=fallocated+delta;
148:: felements = (T *)realloc(felements, new_allocated*sizeof(T));
1.57.2.22 paf 149: memset(&felements[fallocated], 0, delta*sizeof(T));
1.57.2.27.2.5 (paf 150:: fallocated=new_allocated;
1.1 paf 151: }
1.2 paf 152:
1.1 paf 153: private: //disabled
154:
1.57.2.27.2.6 (paf 155:: Array(const Array&) {}
1.12 paf 156: Array& operator = (const Array&) { return *this; }
1.57.2.5 paf 157: };
158:
1.42 parser 159:
1.57.2.27.2.1 (paf 160:: /** Array iterator, usage:
161:: @code
162:: // Array<T> a;
163:: Array_iterator<T> i(a);
164:: while(i.has_next()) {
165:: T& element=i.next();
166:: ...
167:: }
168:: @endcode
169:: */
1.57.2.2 paf 170: template<typename T> class Array_iterator {
171:
1.57.2.27.2.1 (paf 172:: const Array<T>& farray;
173:: T *fcurrent;
174:: T *flast;
175::
176:: public:
177::
178:: Array_iterator(const Array<T>& aarray): farray(aarray) {
179:: fcurrent=farray.felements;
180:: flast=farray.felements+farray.count();
181:: }
182::
183:: /// there are still elements
184:: bool has_next() {
185:: return fcurrent<flast;
186:: }
187::
188:: /// quickly extracts next Array element
189:: const T& next() {
190:: return *(fcurrent++);
191:: }
192::
193:: };
194::
195:: /** Nonconst array iterator, usage:
196:: @code
197:: // Array<T> a;
198:: Array_iterator<T> i(a);
199:: while(i.has_next()) {
200:: T& element=i.next();
201:: ...
202:: }
203:: @endcode
204:: */
205:: template<typename T> class Array_modifing_iterator {
206::
1.57.2.9 paf 207: Array<T>& farray;
1.57.2.2 paf 208: T *fcurrent;
209: T *flast;
210:
1.42 parser 211: public:
212:
1.57.2.27.2.1 (paf 213:: Array_modifing_iterator(Array<T>& aarray): farray(aarray) {
1.57.2.9 paf 214: fcurrent=farray.felements;
215: flast=farray.felements+farray.count();
1.42 parser 216: }
217:
218: /// there are still elements
219: bool has_next() {
1.57.2.2 paf 220: return fcurrent<flast;
1.42 parser 221: }
222:
1.57.2.2 paf 223: /// quickly extracts next Array element
1.57.2.17 paf 224: T& next() {
1.57.2.9 paf 225: return *(fcurrent++);
1.42 parser 226: }
227:
1.1 paf 228: };
229:
230: #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