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
|
/*
* This file is part of rasdaman community.
*
* Rasdaman community is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* Rasdaman community is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with rasdaman community. If not, see <http://www.gnu.org/licenses/>.
*
* Copyright 2003, 2004, 2005, 2006, 2007, 2008, 2009 Peter Baumann /
rasdaman GmbH.
*
* For more information please see <http://www.rasdaman.org>
* or contact Peter Baumann via <baumann@rasdaman.com>.
/
/**
* INCLUDE: memblockvec.hh
*
* MODULE: raslib
* CLASS: r_Memory_Block_Vector
*
* COMMENTS:
*
*/
#ifndef _MEMORY_BLOCK_VECTOR_H_
#define _MEMORY_BLOCK_VECTOR_H_
#include "raslib/mddtypes.hh"
//@ManMemo: Module {\bf raslib}
/*@Doc:
Auxiliary class, realizes a set of memory blocks of equal size that can
be extended to any size. Used by some children of r_LinCompStream.
*/
class r_Memory_Block_Vector
{
public:
/// constructor, receiving the size of each memory block and the granularity
/// for extending the number of blocks.
r_Memory_Block_Vector( r_Bytes bsize=4096, unsigned int gran=8 );
/// destructor
~r_Memory_Block_Vector( void );
/// return number of blocks
inline unsigned int get_number( void ) const {return numBlocks;}
/// return block size
inline r_Bytes get_block_size( void ) const {return blockSize;}
/// return granularity
inline unsigned int get_granularity( void ) const {return granularity;}
/// get a block
void* operator[]( unsigned int idx ) const;
/// add a new block and return a pointer to it
void* add( void );
/// free all blocks (but not the vector, call the destructor for that)
void free_data( void );
/// get number of bytes stored. lastFill is the number of bytes used
/// in the last block
r_Bytes get_size( r_Bytes lastFill ) const;
/// Copy the data stored in blocks into linear memory. lastFill is the
/// number of bytes in the last block
void copy_data( void* dest, r_Bytes lastFill ) const;
protected:
/// the array of memory block pointers
void** blocks;
unsigned int numBlocks;
unsigned int maxBlocks;
/// the size of the blocks
r_Bytes blockSize;
/// the granularity
unsigned int granularity;
};
#endif
|
