152 lines
3.4 KiB
C++
152 lines
3.4 KiB
C++
/*
|
|
|
|
1.1.1 Class Implementation
|
|
|
|
----
|
|
This file is part of SECONDO.
|
|
|
|
Copyright (C) 2017,
|
|
Faculty of Mathematics and 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
|
|
----
|
|
|
|
TODO Remove. Obsolete
|
|
|
|
*/
|
|
#include <algorithm>
|
|
#include <random>
|
|
#include <cstdlib>
|
|
|
|
#include "Algebras/DBService2/RelationInfo.hpp"
|
|
|
|
using namespace std;
|
|
|
|
namespace DBService
|
|
{
|
|
|
|
RelationInfo::RelationInfo(const string& dbName,
|
|
const string& relName,
|
|
const string& host,
|
|
const string& port,
|
|
const string& disk) :
|
|
MetadataObject(),
|
|
databaseName(dbName), relationName(relName),
|
|
originalLocation(host, port, "", disk, "", "")
|
|
{}
|
|
|
|
const string& RelationInfo::getDatabaseName() const
|
|
{
|
|
return databaseName;
|
|
}
|
|
|
|
const string& RelationInfo::getRelationName() const
|
|
{
|
|
return relationName;
|
|
}
|
|
|
|
void RelationInfo::addNode(ConnectionID id)
|
|
{
|
|
addNode(id, false);
|
|
}
|
|
|
|
void RelationInfo::addNode(ConnectionID id, bool replicated)
|
|
{
|
|
nodes.push_back(pair<ConnectionID, bool>(id, replicated));
|
|
}
|
|
|
|
void RelationInfo::addNodes(vector<ConnectionID>& nodesToAdd)
|
|
{
|
|
for (std::vector<ConnectionID>::const_iterator i = nodesToAdd.begin();
|
|
i != nodesToAdd.end(); ++i)
|
|
{
|
|
nodes.push_back(pair<ConnectionID, bool>(*i, false));
|
|
}
|
|
}
|
|
|
|
const ReplicaLocations::const_iterator RelationInfo::nodesBegin() const
|
|
{
|
|
return nodes.begin();
|
|
}
|
|
|
|
const ReplicaLocations::const_iterator RelationInfo::nodesEnd() const
|
|
{
|
|
return nodes.end();
|
|
}
|
|
|
|
const size_t RelationInfo::getNodeCount()
|
|
{
|
|
return nodes.size();
|
|
}
|
|
|
|
const string RelationInfo::toString() const
|
|
{
|
|
return RelationInfo::getIdentifier(databaseName, relationName);
|
|
}
|
|
|
|
const LocationInfo& RelationInfo::getOriginalLocation() const
|
|
{
|
|
return originalLocation;
|
|
}
|
|
|
|
const ConnectionID RelationInfo::getRandomReplicaLocation()
|
|
{
|
|
std::random_device rd;
|
|
std::mt19937 g(rd());
|
|
std::shuffle(
|
|
nodes.begin(),
|
|
nodes.end(), g);
|
|
|
|
for(const auto& node : nodes)
|
|
{
|
|
if(node.second)
|
|
{
|
|
return node.first;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
void RelationInfo::updateReplicationStatus(ConnectionID connID, bool replicated)
|
|
{
|
|
for(auto& node : nodes)
|
|
{
|
|
if(node.first == connID)
|
|
{
|
|
node.second = replicated;
|
|
}
|
|
}
|
|
}
|
|
|
|
|
|
void RelationInfo::getAllLocations(std::vector<ConnectionID>& result){
|
|
result.clear();
|
|
for(const auto& node : nodes)
|
|
{
|
|
if(node.second)
|
|
{
|
|
result.push_back(node.first);
|
|
}
|
|
}
|
|
}
|
|
|
|
void RelationInfo::setTransferPortOfOriginalLocation(std::string& newPort)
|
|
{
|
|
originalLocation.setTransferPort(newPort);
|
|
}
|
|
|
|
} /* namespace DBService */
|