119 lines
2.4 KiB
C++
119 lines
2.4 KiB
C++
/*
|
|
----
|
|
This file is part of SECONDO.
|
|
|
|
Copyright (C) 2011, University in Hagen, Department of Computer Science,
|
|
Database Systems for New Applications.
|
|
|
|
SECONDO 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.
|
|
|
|
SECONDO 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 SECONDO{} if not, write to the Free Software
|
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
----
|
|
|
|
|
|
//[_] [\_]
|
|
|
|
*/
|
|
|
|
#ifndef TUPLESTORE2_H
|
|
#define TUPLESTORE2_H
|
|
|
|
#include "Algebras/Relation-C++/RelationAlgebra.h"
|
|
#include "Algebras/TupleIdentifier/TupleIdentifier.h"
|
|
#include <vector>
|
|
|
|
|
|
class TupleStore2{
|
|
public:
|
|
/*
|
|
~Constructor~
|
|
|
|
The parameter memSite is ignored in this implementation
|
|
|
|
*/
|
|
TupleStore2(const size_t memSize);
|
|
|
|
/*
|
|
~Destructor~
|
|
|
|
*/
|
|
~TupleStore2();
|
|
|
|
/*
|
|
~AppendTuple~
|
|
|
|
Appends a tuple to this TupleStore. The return value can be used to
|
|
access the tuple from the store. The tuple is not changed by this
|
|
operation.
|
|
|
|
*/
|
|
TupleId AppendTuple(Tuple* t);
|
|
|
|
/*
|
|
~GetTuple~
|
|
|
|
Returns the tuple for a given tupleId. If the tuple does not exist,
|
|
0 is returned.
|
|
|
|
*/
|
|
|
|
Tuple* GetTuple(const TupleId id);
|
|
|
|
|
|
class TupleStore2Iterator : public GenericRelationIterator{
|
|
public:
|
|
TupleStore2Iterator(TupleStore2* _buffer): pos(0), buffer(_buffer){
|
|
}
|
|
|
|
Tuple* GetNextTuple(){
|
|
Tuple* res=0;
|
|
if(pos < buffer->elems.size()){
|
|
res = buffer->elems[pos];
|
|
res->IncReference();
|
|
}
|
|
if(res) pos++;
|
|
return res;
|
|
}
|
|
|
|
TupleId GetTupleId() const{
|
|
//cout << " << GetTupleId called" << endl;
|
|
if(pos==0) return 0;
|
|
size_t pos1 = pos -1;
|
|
if(pos1 < buffer->elems.size()){
|
|
return pos1;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
~TupleStore2Iterator(){
|
|
}
|
|
|
|
|
|
private:
|
|
size_t pos;
|
|
TupleStore2* buffer;
|
|
};
|
|
|
|
TupleStore2Iterator* MakeScan() {
|
|
return new TupleStore2Iterator(this);
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
std::vector<Tuple*> elems;
|
|
};
|
|
|
|
#endif
|
|
|