mirror of https://github.com/Icinga/icinga2.git
101 lines
3.5 KiB
C++
101 lines
3.5 KiB
C++
/******************************************************************************
|
|
* Icinga 2 *
|
|
* Copyright (C) 2012-present Icinga Development Team (http://www.icinga.org) *
|
|
* *
|
|
* 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., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. *
|
|
******************************************************************************/
|
|
|
|
#include "methods/utilityfuncs.h"
|
|
#include "base/scriptfunction.h"
|
|
#include "base/utility.h"
|
|
#include "base/convert.h"
|
|
#include "base/array.h"
|
|
#include "base/dictionary.h"
|
|
#include <boost/regex.hpp>
|
|
#include <algorithm>
|
|
#include <set>
|
|
|
|
using namespace icinga;
|
|
|
|
REGISTER_SCRIPTFUNCTION(regex, &UtilityFuncs::Regex);
|
|
REGISTER_SCRIPTFUNCTION(match, &Utility::Match);
|
|
REGISTER_SCRIPTFUNCTION(len, &UtilityFuncs::Len);
|
|
REGISTER_SCRIPTFUNCTION(union, &UtilityFuncs::Union);
|
|
REGISTER_SCRIPTFUNCTION(intersection, &UtilityFuncs::Intersection);
|
|
|
|
bool UtilityFuncs::Regex(const String& pattern, const String& text)
|
|
{
|
|
boost::regex expr(pattern.GetData());
|
|
boost::smatch what;
|
|
return boost::regex_search(text.GetData(), what, expr);
|
|
}
|
|
|
|
int UtilityFuncs::Len(const Value& value)
|
|
{
|
|
if (value.IsObjectType<Dictionary>()) {
|
|
Dictionary::Ptr dict = value;
|
|
return dict->GetLength();
|
|
} else if (value.IsObjectType<Array>()) {
|
|
Array::Ptr array = value;
|
|
return array->GetLength();
|
|
} else {
|
|
return Convert::ToString(value).GetLength();
|
|
}
|
|
}
|
|
|
|
Array::Ptr UtilityFuncs::Union(const std::vector<Value>& arguments)
|
|
{
|
|
std::set<Value> values;
|
|
|
|
BOOST_FOREACH(const Value& varr, arguments) {
|
|
Array::Ptr arr = varr;
|
|
|
|
BOOST_FOREACH(const Value& value, arr) {
|
|
values.insert(value);
|
|
}
|
|
}
|
|
|
|
Array::Ptr result = make_shared<Array>();
|
|
BOOST_FOREACH(const Value& value, values) {
|
|
result->Add(value);
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
Array::Ptr UtilityFuncs::Intersection(const std::vector<Value>& arguments)
|
|
{
|
|
if (arguments.size() == 0)
|
|
return make_shared<Array>();
|
|
|
|
Array::Ptr result = make_shared<Array>();
|
|
|
|
Array::Ptr arr1 = static_cast<Array::Ptr>(arguments[0])->ShallowClone();
|
|
|
|
for (int i = 1; i < arguments.size(); i++) {
|
|
std::sort(arr1->Begin(), arr1->End());
|
|
|
|
Array::Ptr arr2 = static_cast<Array::Ptr>(arguments[i])->ShallowClone();
|
|
std::sort(arr2->Begin(), arr2->End());
|
|
|
|
result->Resize(std::max(arr1->GetLength(), arr2->GetLength()));
|
|
Array::Iterator it = std::set_intersection(arr1->Begin(), arr1->End(), arr2->Begin(), arr2->End(), result->Begin());
|
|
result->Resize(it - result->Begin());
|
|
arr1 = result;
|
|
}
|
|
|
|
return result;
|
|
}
|