box_multiset.hpp

// -*- C++ -*-
//
// Copyright Sylvain Bougerel 2009 - 2013.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file COPYING or copy at
// http://www.boost.org/LICENSE_1_0.txt)

#ifndef SPATIAL_BOX_MULTISET_HPP
#define SPATIAL_BOX_MULTISET_HPP

#include <memory>  // std::allocator
#include "function.hpp"
#include "bits/spatial_check_concept.hpp"
#include "bits/spatial_relaxed_kdtree.hpp"

namespace spatial
{
  template<dimension_type Rank, typename Key,
           typename Compare = bracket_less<Key>,
           typename BalancingPolicy = loose_balancing,
           typename Alloc = std::allocator<Key> >
  class box_multiset
    : public details::Relaxed_kdtree<details::Static_rank<Rank>, const Key,
                                     const Key, Compare, BalancingPolicy, Alloc>
  {
  private:
    typedef typename
    enable_if_c<(Rank & 1u) == 0>::type check_concept_dimension_is_even;

    typedef details::Relaxed_kdtree
    <details::Static_rank<Rank>, const Key, const Key, Compare,
                          BalancingPolicy, Alloc> base_type;
    typedef box_multiset<Rank, Key, Compare, BalancingPolicy, Alloc>  Self;

  public:
    box_multiset() { }

    explicit box_multiset(const Compare& compare)
      : base_type(details::Static_rank<Rank>(), compare)
    { }

    box_multiset(const Compare& compare, const BalancingPolicy& balancing)
      : base_type(details::Static_rank<Rank>(), compare, balancing)
    { }

    box_multiset(const Compare& compare, const BalancingPolicy& balancing,
             const Alloc& alloc)
      : base_type(details::Static_rank<Rank>(), compare, balancing, alloc)
    { }

    box_multiset(const box_multiset& other)
      : base_type(other)
    { }

    box_multiset&
    operator=(const box_multiset& other)
    { return static_cast<Self&>(base_type::operator=(other)); }
  };

  template<typename Key,
           typename Compare,
           typename BalancingPolicy,
           typename Alloc>
  class box_multiset<0, Key, Compare, BalancingPolicy, Alloc>
    : public details::Relaxed_kdtree<details::Dynamic_rank, const Key,
                                     const Key, Compare, BalancingPolicy, Alloc>
  {
  private:
    typedef details::Relaxed_kdtree<details::Dynamic_rank,
                                    const Key, const Key, Compare,
                                    BalancingPolicy, Alloc> base_type;
    typedef box_multiset<0, Key, Compare, BalancingPolicy, Alloc> Self;

  public:
    box_multiset() : base_type(details::Dynamic_rank(2)) { }

    explicit box_multiset(dimension_type dim)
      : base_type(details::Dynamic_rank(dim))
    { except::check_even_rank(dim); }

    box_multiset(dimension_type dim, const Compare& compare)
      : base_type(details::Dynamic_rank(dim), compare)
    { except::check_even_rank(dim); }

    box_multiset(dimension_type dim, const Compare& compare,
           const BalancingPolicy& policy)
      : base_type(details::Dynamic_rank(dim), compare, policy)
    { except::check_even_rank(dim); }

    box_multiset(dimension_type dim, const Compare& compare,
           const BalancingPolicy& policy, const Alloc& alloc)
      : base_type(details::Dynamic_rank(dim), compare, policy, alloc)
    { except::check_even_rank(dim); }

    explicit box_multiset(const Compare& compare)
      : base_type(details::Dynamic_rank(2), compare)
    { }

    box_multiset(const Compare& compare, const BalancingPolicy& policy)
      : base_type(details::Dynamic_rank(2), compare, policy)
    { }

    box_multiset(const Compare& compare, const BalancingPolicy& policy,
           const Alloc& alloc)
      : base_type(details::Dynamic_rank(2), compare, policy, alloc)
    { }

    box_multiset(const box_multiset& other)
      : base_type(other)
    { }

    box_multiset&
    operator=(const box_multiset& other)
    { return static_cast<Self&>(base_type::operator=(other)); }
  };

}

#endif // SPATIAL_BOX_MULTISET_HPP