用于EagleEye3.0 规则集漏报和误报测试的示例项目,项目收集于github和gitee
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 

95 lines
3.4 KiB

/* Copyright (c) 2015, 2017, Oracle and/or its affiliates. All rights reserved.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License, version 2.0,
as published by the Free Software Foundation.
This program is also distributed with certain software (including
but not limited to OpenSSL) that is licensed under separate terms,
as designated in a particular file or component or in included license
documentation. The authors of MySQL hereby grant you an additional
permission to link the program and your derivative works with the
separately licensed software that they have included with MySQL.
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, version 2.0, 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 <stddef.h>
#include <boost/concept/usage.hpp>
#include <boost/iterator/iterator_facade.hpp>
#include <boost/move/utility_core.hpp>
#include <boost/range/adaptor/argument_fwd.hpp>
#include <boost/range/adaptor/filtered.hpp>
#include <boost/range/adaptor/indexed.hpp>
#include <boost/range/adaptor/transformed.hpp>
#include <utility>
#include <vector>
#include "sql/item_geofunc.h"
#include "sql/item_geofunc_internal.h"
struct Rtree_value_maker {
typedef std::pair<BG_box, size_t> result_type;
template <typename T>
result_type operator()(T const &v) const {
BG_box box;
make_bg_box(v.value(), &box);
return result_type(box, v.index());
}
};
struct Is_rtree_box_valid {
typedef std::pair<BG_box, size_t> Rtree_entry;
bool operator()(Rtree_entry const &re) const {
return is_box_valid(re.first);
}
};
void make_rtree(const BG_geometry_collection::Geometry_list &gl,
Rtree_index *rtree) {
Rtree_index temp_rtree(gl | boost::adaptors::indexed() |
boost::adaptors::transformed(Rtree_value_maker()) |
boost::adaptors::filtered(Is_rtree_box_valid()));
rtree->swap(temp_rtree);
}
/*
A functor to make an rtree value entry from an array element of
Boost.Geometry model type.
*/
struct Rtree_value_maker_bggeom {
typedef std::pair<BG_box, size_t> result_type;
template <typename T>
result_type operator()(T const &v) const {
BG_box box;
boost::geometry::envelope(v.value(), box);
return result_type(box, v.index());
}
};
template <typename MultiGeometry>
void make_rtree_bggeom(const MultiGeometry &mg, Rtree_index *rtree) {
Rtree_index temp_rtree(
mg | boost::adaptors::indexed() |
boost::adaptors::transformed(Rtree_value_maker_bggeom()) |
boost::adaptors::filtered(Is_rtree_box_valid()));
rtree->swap(temp_rtree);
}
// Explicit template instantiation
template void make_rtree_bggeom<Gis_multi_line_string>(
const Gis_multi_line_string &, Rtree_index *);
template void make_rtree_bggeom<Gis_multi_point>(const Gis_multi_point &,
Rtree_index *);
template void make_rtree_bggeom<Gis_multi_polygon>(const Gis_multi_polygon &,
Rtree_index *);