--- parser3/src/include/pa_array.h 2001/02/20 18:45:51 1.14 +++ parser3/src/include/pa_array.h 2001/03/10 16:34:34 1.21 @@ -1,5 +1,9 @@ /* - $Id: pa_array.h,v 1.14 2001/02/20 18:45:51 paf Exp $ + Parser + Copyright (c) 2001 ArtLebedev Group (http://www.artlebedev.com) + Author: Alexander Petrosyan + + $Id: pa_array.h,v 1.21 2001/03/10 16:34:34 paf Exp $ */ /* @@ -38,10 +42,17 @@ public: Array(Pool& apool, int initial_rows=CR_INITIAL_ROWS_DEFAULT); - int size() const { return fused_rows; } - Array& operator += (const Item *src); - Array& append_array(const Array& src); - const Item *raw_get(int index) const { + int size() const { + // for get and quick_get + cache_chunk_base=0; + cache_chunk=head; + return fused_rows; + } + Array& operator += (Item *src); + // Array replacement + Array& operator += (const Item *src) { return *this+=const_cast(src); } + Array& append_array(const Array& src, int offset=0); + Item *quick_get(int index) const { // considering these true: // index increments from 0 to size()-1 // index>=0 && indexrows[index-cache_chunk_base].item; } - const Item *get(int index) const; + Item *get(int index) const; + void put(int index, Item *item); const char *get_cstr(int index) const { return static_cast(get(index)); } @@ -71,7 +83,7 @@ private: // the number of rows in chunk int count; union Row { - const Item *item; + Item *item; Chunk *link; // link to the next chunk in chain } rows[1]; // next rows are here