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
|
/** @file chert_lazytable.h
* @brief Subclass of ChertTable for deriving lazy tables from.
*/
/* Copyright (C) 2009 Olly Betts
*
* This program 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 2 of the License, or
* (at your option) any later version.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef XAPIAN_INCLUDED_CHERT_LAZYTABLE_H
#define XAPIAN_INCLUDED_CHERT_LAZYTABLE_H
#include "chert_table.h"
class ChertLazyTable : public ChertTable {
public:
/** Create a new lazy table.
*
* @param name_ The table's name.
* @param path The path for the table.
* @param readonly true if the table is read-only, else false.
* @param z_strategy zlib strategy.
*/
ChertLazyTable(const char * name_, const std::string & path, bool readonly,
int z_strategy)
: ChertTable(name_, path, readonly, z_strategy, true) { }
/** Lazy version of ChertTable::create_and_open().
*
* This method isn't virtual, but we never call it such that it needs to
* be.
*/
void create_and_open(unsigned int blocksize) {
// This table is created lazily, so erase it in case we're overwriting
// an existing database which has this table.
ChertTable::erase();
ChertTable::set_block_size(blocksize);
}
};
#endif // XAPIAN_INCLUDED_CHERT_LAZYTABLE_H
|
