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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
|
/* -*- mode: c++ -*-
*/
/*
GIFT, a flexible content based image retrieval system.
Copyright (C) 1998, 1999, 2000, 2001, 2002, CUI University of Geneva
Copyright (C) 2003, 2004 Bayreuth University
2005 Bamberg University
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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#ifndef _CPERSISTENTVECTOR
#define _CPERSISTENTVECTOR
#include "libGIFTAcDistanceMatrix/include/uses-declarations.h"
#include <vector>
#include <algorithm>
#include <functional>
#include <iostream>
#include <fstream>
template<class T>
void binary_writer(ostream& outStream,
const T& inToBeWritten){
outStream.write(&inToBeWritten,
sizeof(inToBeWritten));
}
template<class T>
void binary_reader(istream& inStream,
T& inToBeRead){
inStream.read((char*)&inToBeRead,
sizeof(inToBeRead));
}
///
template<class T>
class CPersistentVector:public vector<T>{
///
long mLength;
public:
///
CPersistentVector(long inLength);
///
bool read(istream& inStream);
///
bool read(istream& inStream,
long inNumRecords);
///
bool write(ostream& outStream)const;
///
void init(T const& inDefaultValue);
};
template<class T>
CPersistentVector<T>::CPersistentVector(long inLength):
mLength(inLength),
vector<T>(inLength)
{
}
template<class T>
void CPersistentVector<T>::init(T const& inDefaultValue){
#ifdef V295
constant_void_fun<T> f(inDefaultValue);
this->clear();
this->reserve(mLength);
for(long i=0;
i<mLength;
i++){
this->push_back(f());
}
#else
this->clear();
this->resize(mLength);
fill(this->begin(),this->end(),inDefaultValue);
#endif
}
template<class T>
bool CPersistentVector<T>::read(istream& inStream){
return read(inStream,
mLength);
}
template<class T>
bool CPersistentVector<T>::read(istream& inStream,
long inLength){
this->reserve(inLength);
this->clear();
for(long i=0;
i<inLength;
i++){
T lToBeRead;
binary_reader(inStream,
lToBeRead);
assert(lToBeRead>=0 && lToBeRead<=1);
this->push_back(lToBeRead);
}
mLength=inLength;
return (bool)inStream;
}
template<class T>
bool CPersistentVector<T>::write(ostream& outStream)const{
for(typename CPersistentVector<T>::const_iterator i=this->begin();
i!=this->end();
i++){
binary_writer(outStream,
*i);
}
outStream << flush;
return outStream;
}
#endif
|
