2
2
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
4
4
* Copyright (c) 2007 Sun Microsystems, Inc. All Rights Reserved.
6
6
* The contents of this file are subject to the terms of either the GNU Lesser
7
7
* General Public License Version 2.1 only ("LGPL") or the Common Development and
8
8
* Distribution License ("CDDL")(collectively, the "License"). You may not use this
9
9
* file except in compliance with the License. You can obtain a copy of the CDDL at
10
10
* http://www.opensource.org/licenses/cddl1.php and a copy of the LGPLv2.1 at
11
* http://www.opensource.org/licenses/lgpl-license.php. See the License for the
11
* http://www.opensource.org/licenses/lgpl-license.php. See the License for the
12
12
* specific language governing permissions and limitations under the License. When
13
13
* distributing the software, include this License Header Notice in each file and
14
14
* include the full text of the License in the License file as well as the
15
15
* following notice:
17
17
* NOTICE PURSUANT TO SECTION 9 OF THE COMMON DEVELOPMENT AND DISTRIBUTION LICENSE
19
19
* For Covered Software in this distribution, this License shall be governed by the
21
21
* Any litigation relating to this License shall be subject to the jurisdiction of
22
22
* the Federal Courts of the Northern District of California and the state courts
23
23
* of the State of California, with venue lying in Santa Clara County, California.
27
27
* If you wish your version of this file to be governed by only the CDDL or only
28
28
* the LGPL Version 2.1, indicate your decision by adding "[Contributor]" elects to
29
29
* include this software in this distribution under the [CDDL or LGPL Version 2.1]
32
32
* Version 2.1, or to extend the choice of license to its licensees as provided
33
33
* above. However, if you add LGPL Version 2.1 code and therefore, elected the LGPL
34
34
* Version 2 license, then the option applies only if the new code is made subject
35
* to such option by the copyright holder.
35
* to such option by the copyright holder.
38
38
#ifndef _SIM_FILE_MERGE_H
66
66
typedef typename TItemBuf::const_iterator TIBConstIterator;
68
68
file_para(FILE* p_file, size_t start, size_t end)
69
: fp(p_file), cur_offset(start), last_offset(end), runOut(false), buf() {}
71
UnitAndParaInfo& operator*()
73
if (buf.size() == 0) {
74
for (int i=0; i < BUF_SIZE; ++i)
76
buf.push_back(UnitAndParaInfo());
77
UnitAndParaInfo& e = buf.back();
78
e.runOut = runOut = !(e.unit.read(fp, cur_offset, last_offset));
85
file_para& operator++()
93
bool operator< (file_para& another)
95
const UnitAndParaInfo& me = this->operator*();
96
const UnitAndParaInfo& you = *another;
99
return ((char*)&me < (char*)&you);
106
if (me.unit > you.unit) return true;
107
if (me.unit == you.unit) return ((char*)&me < (char*)&you);
69
: fp(p_file), runOut(false), cur_offset(start), last_offset(end),
72
UnitAndParaInfo& operator*(){
73
if (buf.size() == 0) {
74
for (int i = 0; i < BUF_SIZE; ++i) {
75
buf.push_back(UnitAndParaInfo());
76
UnitAndParaInfo& e = buf.back();
77
e.runOut = runOut = !(e.unit.read(fp, cur_offset, last_offset));
84
file_para& operator++(){
91
bool operator<(file_para& another){
92
const UnitAndParaInfo& me = this->operator*();
93
const UnitAndParaInfo& you = *another;
96
return((char *) &me < (char *) &you);
103
if (me.unit > you.unit) return true;
104
if (me.unit == you.unit) return((char *) &me < (char *) &you);
114
static const int BUF_SIZE=1024;
111
static const int BUF_SIZE = 1024;
117
114
size_t cur_offset, last_offset;
132
129
typedef file_para<unit_type> TPara;
133
130
typedef std::vector<TPara*> TParaVec;
135
void addPara(FILE *fp, size_t first_offset, size_t last_offset)
137
paras.push_back(new TPara(fp, first_offset, last_offset));
141
std::make_heap(paras.begin(), paras.end(), PtrCompare<TPara*>());
143
TPara* getBest() //You then have to deal same items form different part
145
std::pop_heap(paras.begin(), paras.end(), PtrCompare<TPara*>());
151
std::push_heap(paras.begin(), paras.end(), PtrCompare<TPara*>());
153
~CMultiWayFileMerger() { for (int i=0; i < paras.size(); ++i) delete paras[i]; }
132
void addPara(FILE *fp, size_t first_offset, size_t last_offset) {
133
paras.push_back(new TPara(fp, first_offset, last_offset));
137
std::make_heap(paras.begin(), paras.end(), PtrCompare<TPara*>());
139
TPara* getBest(){ //You then have to deal same items form different part
140
std::pop_heap(paras.begin(), paras.end(), PtrCompare<TPara*>());
145
std::push_heap(paras.begin(), paras.end(), PtrCompare<TPara*>());
147
~CMultiWayFileMerger() {
148
for (size_t i = 0; i < paras.size(); i++) {