392 lines
8.7 KiB
C++
Executable File
392 lines
8.7 KiB
C++
Executable File
// Copyright (c) 1997 ETH Zurich (Switzerland).
|
|
// All rights reserved.
|
|
//
|
|
// This file is part of CGAL (www.cgal.org).
|
|
// 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 3 of the License, or (at your option) any later version.
|
|
//
|
|
// Licensees holding a valid commercial license may use this file in
|
|
// accordance with the commercial license agreement provided with the software.
|
|
//
|
|
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
|
|
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
|
//
|
|
// $URL$
|
|
// $Id$
|
|
// SPDX-License-Identifier: GPL-3.0+
|
|
//
|
|
//
|
|
// Author(s) : Gabriele Neyer
|
|
|
|
|
|
#ifndef CGAL_RANGE_SEGMENT_TREE_TRAITS_H
|
|
#define CGAL_RANGE_SEGMENT_TREE_TRAITS_H
|
|
|
|
#include <CGAL/license/SearchStructures.h>
|
|
|
|
|
|
#include <CGAL/Point_2.h>
|
|
#include <CGAL/Point_3.h>
|
|
#include <CGAL/predicates_on_points_2.h>
|
|
#include <CGAL/predicates_on_points_3.h>
|
|
#include <utility>
|
|
|
|
namespace CGAL {
|
|
|
|
|
|
template<class Key_1>
|
|
class C_Compare_1{
|
|
public:
|
|
|
|
bool operator()(const Key_1& k1, const Key_1& k2)
|
|
{
|
|
return SMALLER == compare_x(k1,k2);
|
|
}
|
|
};
|
|
|
|
template<class Key_2>
|
|
class C_Compare_2{
|
|
public:
|
|
|
|
bool operator()(const Key_2& k1, const Key_2& k2)
|
|
{
|
|
return SMALLER == compare_y(k1,k2);
|
|
}
|
|
};
|
|
|
|
template<class Key_3>
|
|
class C_Compare_3{
|
|
public:
|
|
|
|
bool operator()(const Key_3& k1, const Key_3& k2)
|
|
{
|
|
return SMALLER == compare_z(k1,k2);
|
|
}
|
|
};
|
|
|
|
|
|
template<class Key_1,class Interval>
|
|
class C_Low_1{
|
|
public:
|
|
Key_1 operator()(const Interval& i)
|
|
{ return i.first;}
|
|
};
|
|
|
|
template<class Key_1,class Interval>
|
|
class C_High_1{
|
|
public:
|
|
Key_1 operator()(const Interval& i)
|
|
{ return i.second;}
|
|
};
|
|
|
|
template<class Key_2,class Interval>
|
|
class C_Low_2{
|
|
public:
|
|
Key_2 operator()(const Interval& i)
|
|
{ return i.first;}
|
|
};
|
|
template<class Key_2,class Interval>
|
|
class C_High_2{
|
|
public:
|
|
Key_2 operator()(const Interval& i)
|
|
{ return i.second;}
|
|
};
|
|
template<class Key_3,class Interval>
|
|
class C_Low_3{
|
|
public:
|
|
Key_3 operator()(const Interval& i)
|
|
{ return i.first;}
|
|
};
|
|
template<class Key_3,class Interval>
|
|
class C_High_3{
|
|
public:
|
|
Key_3 operator()(const Interval& i)
|
|
{ return i.second;}
|
|
};
|
|
|
|
template<class Key_1>
|
|
class C_Key_1{
|
|
public:
|
|
Key_1 operator()(const Key_1& k)
|
|
{ return k;}
|
|
};
|
|
|
|
template<class Key_2>
|
|
class C_Key_2{
|
|
public:
|
|
Key_2 operator()(const Key_2& k)
|
|
{ return k;}
|
|
};
|
|
|
|
|
|
template<class Key_3>
|
|
class C_Key_3{
|
|
public:
|
|
Key_3 operator()(const Key_3& k)
|
|
{ return k;}
|
|
};
|
|
|
|
|
|
template<class Key_1,class Key>
|
|
class T_Key_1{
|
|
public:
|
|
Key_1 operator()(const Key& k)
|
|
{ return k.first;}
|
|
};
|
|
|
|
template<class Key_2,class Key>
|
|
class T_Key_2{
|
|
public:
|
|
Key_2 operator()(const Key& k)
|
|
{ return k.first;}
|
|
};
|
|
|
|
template<class Key_3,class Key>
|
|
class T_Key_3{
|
|
public:
|
|
Key_3 operator()(const Key& k)
|
|
{ return k.first;}
|
|
};
|
|
|
|
|
|
|
|
template <class Rep, class T>
|
|
class Range_tree_map_traits_2{
|
|
public:
|
|
typedef T Value;
|
|
typedef typename Rep::Point_2 Point_2;
|
|
typedef Point_2 Pure_key;
|
|
typedef std::pair<Pure_key, T> Key;
|
|
typedef Point_2 Key_1;
|
|
typedef Point_2 Key_2;
|
|
typedef std::pair<Pure_key, Pure_key> Interval;
|
|
|
|
typedef C_Compare_1<Key_1> compare_1;
|
|
typedef C_Compare_2<Key_2> compare_2;
|
|
typedef C_Low_1<Key_1,Interval> low_1;
|
|
typedef C_High_1<Key_1,Interval> high_1;
|
|
typedef T_Key_1<Key_1,Key> key_1;
|
|
typedef C_Low_2<Key_2,Interval> low_2;
|
|
typedef C_High_2<Key_2,Interval> high_2;
|
|
typedef T_Key_2<Key_2,Key> key_2;
|
|
|
|
};
|
|
|
|
template<class Key_1,class Interval>
|
|
class T_Low_1{
|
|
public:
|
|
Key_1 operator()(const Interval& i)
|
|
{ return i.first.first;}
|
|
};
|
|
|
|
template<class Key_1,class Interval>
|
|
class T_High_1{
|
|
public:
|
|
Key_1 operator()(const Interval& i)
|
|
{ return i.second.first;}
|
|
};
|
|
|
|
template<class Key_2,class Interval>
|
|
class T_Low_2{
|
|
public:
|
|
Key_2 operator()(const Interval& i)
|
|
{ return i.first.first;}
|
|
};
|
|
|
|
template<class Key_2,class Interval>
|
|
class T_High_2{
|
|
public:
|
|
Key_2 operator()(const Interval& i)
|
|
{ return i.second.first;}
|
|
};
|
|
|
|
template<class Key_3,class Interval>
|
|
class T_Low_3{
|
|
public:
|
|
Key_3 operator()(const Interval& i)
|
|
{ return i.first.first;}
|
|
};
|
|
|
|
template<class Key_3,class Interval>
|
|
class T_High_3{
|
|
public:
|
|
Key_3 operator()(const Interval& i)
|
|
{ return i.second.first;}
|
|
};
|
|
|
|
|
|
|
|
template <class Rep, class T>
|
|
class Range_tree_map_traits_3{
|
|
public:
|
|
typedef typename Rep::Point_3 Point_3;
|
|
typedef std::pair<Point_3, T> Key;
|
|
typedef Point_3 Pure_key;
|
|
typedef Point_3 Key_1;
|
|
typedef Point_3 Key_2;
|
|
typedef Point_3 Key_3;
|
|
typedef std::pair<Key,Key> Interval;
|
|
|
|
typedef C_Compare_1<Key_1> compare_1;
|
|
typedef C_Compare_2<Key_2> compare_2;
|
|
typedef C_Compare_3<Key_3> compare_3;
|
|
typedef T_Low_1<Key_1,Interval> low_1;
|
|
typedef T_High_1<Key_1,Interval> high_1;
|
|
typedef T_Key_1<Key_1,Key> key_1;
|
|
typedef T_Low_2<Key_2,Interval> low_2;
|
|
typedef T_High_2<Key_2,Interval> high_2;
|
|
typedef T_Key_2<Key_2,Key> key_2;
|
|
typedef T_Low_3<Key_3,Interval> low_3;
|
|
typedef T_High_3<Key_3,Interval> high_3;
|
|
typedef T_Key_3<Key_3,Key> key_3;
|
|
};
|
|
|
|
template<class Key_1,class Interval>
|
|
class S_Low_1{
|
|
public:
|
|
Key_1 operator()(const Interval& i)
|
|
{ return i.first.first;}
|
|
};
|
|
|
|
template<class Key_1,class Interval>
|
|
class S_High_1{
|
|
public:
|
|
Key_1 operator()(const Interval& i)
|
|
{ return i.first.second;}
|
|
};
|
|
|
|
template<class Key_2,class Interval>
|
|
class S_Low_2{
|
|
public:
|
|
Key_2 operator()(const Interval& i)
|
|
{ return i.first.first;}
|
|
};
|
|
|
|
template<class Key_2,class Interval>
|
|
class S_High_2{
|
|
public:
|
|
Key_2 operator()(const Interval& i)
|
|
{ return i.first.second;}
|
|
};
|
|
|
|
template<class Key_3,class Interval>
|
|
class S_Low_3{
|
|
public:
|
|
Key_3 operator()(const Interval& i)
|
|
{ return i.first.first;}
|
|
};
|
|
|
|
template<class Key_3,class Interval>
|
|
class S_High_3{
|
|
public:
|
|
Key_3 operator()(const Interval& i)
|
|
{ return i.first.second;}
|
|
};
|
|
|
|
|
|
template <class Rep, class T>
|
|
class Segment_tree_map_traits_2{
|
|
public:
|
|
typedef T Value;
|
|
typedef typename Rep::Point_2 Point_2;
|
|
typedef Point_2 Key;
|
|
typedef Point_2 Key_1;
|
|
typedef Point_2 Key_2;
|
|
typedef std::pair<Key,Key> Pure_interval;
|
|
typedef std::pair<Pure_interval, T> Interval;
|
|
|
|
typedef C_Compare_1<Key_1> compare_1;
|
|
typedef C_Compare_2<Key_2> compare_2;
|
|
typedef S_Low_1<Key_1,Interval> low_1;
|
|
typedef S_High_1<Key_1,Interval> high_1;
|
|
typedef C_Key_1<Key_1> key_1;
|
|
typedef S_Low_2<Key_2,Interval> low_2;
|
|
typedef S_High_2<Key_2,Interval> high_2;
|
|
typedef C_Key_2<Key_2> key_2;
|
|
|
|
};
|
|
|
|
|
|
template <class Rep, class T>
|
|
class Segment_tree_map_traits_3{
|
|
public:
|
|
typedef typename Rep::Point_3 Point_3;
|
|
typedef Point_3 Key;
|
|
typedef Point_3 Key_1;
|
|
typedef Point_3 Key_2;
|
|
typedef Point_3 Key_3;
|
|
typedef std::pair<Key,Key> Pure_interval;
|
|
typedef std::pair<Pure_interval,T> Interval;
|
|
|
|
|
|
typedef C_Compare_1<Key_1> compare_1;
|
|
typedef C_Compare_2<Key_2> compare_2;
|
|
typedef C_Compare_3<Key_3> compare_3;
|
|
typedef S_Low_1<Key_1,Interval> low_1;
|
|
typedef S_High_1<Key_1,Interval> high_1;
|
|
typedef C_Key_1<Key_1> key_1;
|
|
typedef S_Low_2<Key_2,Interval> low_2;
|
|
typedef S_High_2<Key_2,Interval> high_2;
|
|
typedef C_Key_2<Key_2> key_2;
|
|
typedef S_Low_3<Key_3,Interval> low_3;
|
|
typedef S_High_3<Key_3,Interval> high_3;
|
|
typedef C_Key_3<Key_3> key_3;
|
|
};
|
|
|
|
|
|
|
|
|
|
template <class Rep>
|
|
class Range_segment_tree_set_traits_3{
|
|
public:
|
|
typedef typename Rep::Point_3 Point_3;
|
|
typedef Point_3 Key;
|
|
typedef Point_3 Key_1;
|
|
typedef Point_3 Key_2;
|
|
typedef Point_3 Key_3;
|
|
typedef std::pair<Key,Key> Interval;
|
|
|
|
typedef C_Compare_1<Key_1> compare_1;
|
|
typedef C_Compare_2<Key_2> compare_2;
|
|
typedef C_Compare_3<Key_3> compare_3;
|
|
typedef C_Low_1<Key_1,Interval> low_1;
|
|
typedef C_High_1<Key_1,Interval> high_1;
|
|
typedef C_Key_1<Key_1> key_1;
|
|
typedef C_Low_2<Key_2,Interval> low_2;
|
|
typedef C_High_2<Key_2,Interval> high_2;
|
|
typedef C_Key_2<Key_2> key_2;
|
|
typedef C_Low_3<Key_3,Interval> low_3;
|
|
typedef C_High_3<Key_3,Interval> high_3;
|
|
typedef C_Key_3<Key_3> key_3;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
template <class Rep>
|
|
class Range_segment_tree_set_traits_2{
|
|
public:
|
|
typedef typename Rep::Point_2 Point_2;
|
|
typedef Point_2 Key;
|
|
typedef Point_2 Key_1;
|
|
typedef Point_2 Key_2;
|
|
typedef std::pair<Key,Key> Interval;
|
|
|
|
typedef C_Compare_1<Key_1> compare_1;
|
|
typedef C_Compare_2<Key_2> compare_2;
|
|
typedef C_Low_1<Key_1,Interval> low_1;
|
|
typedef C_High_1<Key_1,Interval> high_1;
|
|
typedef C_Key_1<Key_1> key_1;
|
|
typedef C_Low_2<Key_2,Interval> low_2;
|
|
typedef C_High_2<Key_2,Interval> high_2;
|
|
typedef C_Key_2<Key_2> key_2;
|
|
|
|
};
|
|
|
|
|
|
|
|
} //namespace CGAL
|
|
#endif // CGAL_RANGE_SEGMENT_TREE_TRAITS_H
|