|
|
| version 1.14, 2001/02/20 18:45:52 | version 1.19, 2001/02/23 09:43:15 |
|---|---|
| Line 11 | Line 11 |
| Array::Array(Pool& apool, int initial_rows) : | Array::Array(Pool& apool, int initial_rows) : |
| Pooled(apool) { | Pooled(apool) { |
| head=tail=static_cast<Chunk *>( | head=tail=static_cast<Chunk *>( |
| pool().malloc(sizeof(int)+sizeof(Chunk::Row)*initial_rows+sizeof(Chunk *))); | malloc(sizeof(int)+sizeof(Chunk::Row)*initial_rows+sizeof(Chunk *))); |
| head->count=initial_rows; | head->count=initial_rows; |
| append_here=head->rows; | append_here=head->rows; |
| link_row=&head->rows[initial_rows]; | link_row=&head->rows[initial_rows]; |
| Line 24 Array::Array(Pool& apool, int initial_ro | Line 24 Array::Array(Pool& apool, int initial_ro |
| void Array::expand(int chunk_rows) { | void Array::expand(int chunk_rows) { |
| Chunk *chunk=tail=static_cast<Chunk *>( | Chunk *chunk=tail=static_cast<Chunk *>( |
| pool().malloc(sizeof(int)+sizeof(Chunk::Row)*chunk_rows+sizeof(Chunk *))); | malloc(sizeof(int)+sizeof(Chunk::Row)*chunk_rows+sizeof(Chunk *))); |
| chunk->count=chunk_rows; | chunk->count=chunk_rows; |
| link_row->link=chunk; | link_row->link=chunk; |
| append_here=chunk->rows; | append_here=chunk->rows; |
| Line 33 void Array::expand(int chunk_rows) { | Line 33 void Array::expand(int chunk_rows) { |
| } | } |
| Array& Array::operator += (const Item *src) { | Array& Array::operator += (Item *src) { |
| if(chunk_is_full()) | if(chunk_is_full()) |
| expand(tail->count*CR_GROW_PERCENT/100); | expand(tail->count*CR_GROW_PERCENT/100); |
| Line 43 Array& Array::operator += (const Item *s | Line 43 Array& Array::operator += (const Item *s |
| return *this; | return *this; |
| } | } |
| const Array::Item *Array::get(int index) const { | Array::Item *Array::get(int index) const { |
| if(!(index>=0 && index<size())) { | if(!(index>=0 && index<size())) { |
| pool().exception().raise(0, 0, 0, | THROW(0, 0, 0, |
| "Array::get(%d) out of range [0..%d]", index, size()-1); | "Array::get(%d) out of range [0..%d]", index, size()-1); |
| return 0; | return 0; |
| } | } |
| Line 66 const Array::Item *Array::get(int index) | Line 66 const Array::Item *Array::get(int index) |
| return cache_chunk->rows[index-cache_chunk_base].item; | return cache_chunk->rows[index-cache_chunk_base].item; |
| } | } |
| Array& Array::append_array(const Array& src) { | void Array::put(int index, Item *item) { |
| int src_used_rows=src.fused_rows; | if(!(index>=0 && index<size())) { |
| THROW(0, 0, 0, | |
| "Array::put(%d) out of range [0..%d]", index, size()-1); | |
| return; | |
| } | |
| // if they ask index to the left of cached position, forget cache | |
| if(index<cache_chunk_base) { | |
| cache_chunk_base=0; | |
| cache_chunk=head; | |
| } | |
| // navigate to chunk with "index" row | |
| while(!(index>=cache_chunk_base && index<cache_chunk_base+cache_chunk->count)) { | |
| int count=cache_chunk->count; | |
| cache_chunk_base+=count; | |
| cache_chunk=cache_chunk->rows[count].link; | |
| } | |
| cache_chunk->rows[index-cache_chunk_base].item=item; | |
| } | |
| Array& Array::append_array(const Array& src, int offset) { | |
| int src_rows_to_copy=src.fused_rows-offset; | |
| int last_chunk_rows_left=link_row-append_here; | int last_chunk_rows_left=link_row-append_here; |
| // our last chunk too small for src to fit? | // our last chunk too small for src to fit? |
| if(src_used_rows>last_chunk_rows_left) { | if(src_rows_to_copy>last_chunk_rows_left) { |
| // shrink last chunk to used rows | // shrink last chunk to used rows |
| tail->count-=last_chunk_rows_left; | tail->count-=last_chunk_rows_left; |
| link_row=append_here; | link_row=append_here; |
| // append new src_used_rows-ed chunk | // append new src_used_rows-ed chunk |
| expand(src_used_rows); | expand(src_rows_to_copy); |
| } | } |
| Chunk *src_chunk=src.head; | Chunk *src_chunk=src.head; |
| Chunk::Row *dest_rows=append_here; | Chunk::Row *dest_rows=append_here; |
| int rows_left_to_copy=src_used_rows; | int rows_left_to_copy=src.fused_rows; |
| int rows_left_to_skip=offset; | |
| while(true) { | while(true) { |
| int src_count=src_chunk->count; | int src_count=src_chunk->count; |
| Chunk *next_chunk=src_chunk->rows[src_count].link; | Chunk *next_chunk=src_chunk->rows[src_count].link; |
| if(next_chunk) { | if(next_chunk) { |
| // not last source chunk | // not last source chunk |
| // taking it all | // taking it all |
| memcpy(dest_rows, src_chunk->rows, sizeof(Chunk::Row)*src_count); | int rows_to_copy_now=src_count-rows_left_to_skip; |
| dest_rows+=src_count; | if(rows_to_copy_now>0) |
| memcpy(dest_rows, src_chunk->rows+rows_left_to_skip, | |
| sizeof(Chunk::Row)*rows_to_copy_now); | |
| else | |
| rows_left_to_skip-=src_count; | |
| dest_rows+=rows_to_copy_now; | |
| rows_left_to_copy-=src_count; | rows_left_to_copy-=src_count; |
| src_chunk=next_chunk; | src_chunk=next_chunk; |
| } else { | } else { |
| // the last source chunk | // the last source chunk |
| // taking only those rows of chunk that _left_to_copy | // taking only those rows of chunk that _left_to_copy |
| memcpy(dest_rows, src_chunk->rows, sizeof(Chunk::Row)*rows_left_to_copy); | int rows_to_copy_now=rows_left_to_copy-rows_left_to_skip; |
| if(rows_to_copy_now>0) | |
| memcpy(dest_rows, src_chunk->rows+rows_left_to_skip, | |
| sizeof(Chunk::Row)*rows_to_copy_now); | |
| break; | break; |
| } | } |
| } | } |
| append_here+=src_used_rows; | append_here+=src_rows_to_copy; |
| fused_rows+=src_used_rows; | fused_rows+=src_rows_to_copy; |
| return *this; | return *this; |
| } | } |