mirror of https://gitee.com/bigwinds/arangodb
57 lines
2.0 KiB
C++
57 lines
2.0 KiB
C++
////////////////////////////////////////////////////////////////////////////////
|
|
/// DISCLAIMER
|
|
///
|
|
/// Copyright 2014-2017 ArangoDB GmbH, Cologne, Germany
|
|
/// Copyright 2004-2014 triAGENS GmbH, Cologne, Germany
|
|
///
|
|
/// Licensed under the Apache License, Version 2.0 (the "License");
|
|
/// you may not use this file except in compliance with the License.
|
|
/// You may obtain a copy of the License at
|
|
///
|
|
/// http://www.apache.org/licenses/LICENSE-2.0
|
|
///
|
|
/// Unless required by applicable law or agreed to in writing, software
|
|
/// distributed under the License is distributed on an "AS IS" BASIS,
|
|
/// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
/// See the License for the specific language governing permissions and
|
|
/// limitations under the License.
|
|
///
|
|
/// Copyright holder is ArangoDB GmbH, Cologne, Germany
|
|
///
|
|
/// @author Andreas Streichardt
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
#include "ClusterHelpers.h"
|
|
|
|
#include <velocypack/Iterator.h>
|
|
#include <velocypack/velocypack-aliases.h>
|
|
|
|
using namespace arangodb;
|
|
|
|
bool ClusterHelpers::compareServerLists(VPackSlice plan, VPackSlice current) {
|
|
if (!plan.isArray() || !current.isArray()) {
|
|
return false;
|
|
}
|
|
std::vector<std::string> planv, currv;
|
|
for (auto const& srv : VPackArrayIterator(plan)) {
|
|
if (srv.isString()) {
|
|
planv.push_back(srv.copyString());
|
|
}
|
|
}
|
|
for (auto const& srv : VPackArrayIterator(current)) {
|
|
if (srv.isString()) {
|
|
currv.push_back(srv.copyString());
|
|
}
|
|
}
|
|
return compareServerLists(planv, currv);
|
|
}
|
|
|
|
bool ClusterHelpers::compareServerLists(std::vector<std::string> planned,
|
|
std::vector<std::string> current) {
|
|
bool equalLeader =
|
|
!planned.empty() && !current.empty() && planned.front() == current.front();
|
|
std::sort(planned.begin(), planned.end());
|
|
std::sort(current.begin(), current.end());
|
|
return equalLeader && current == planned;
|
|
}
|