SortedVector.hpp

Go to the documentation of this file.

// ANNA - Anna is Not Nothingness Anymore                                                         //
//                                                                                                //
// (c) Copyright 2005-2015 Eduardo Ramos Testillano & Francisco Ruiz Rayo                         //
//                                                                                                //
// See project site at http://redmine.teslayout.com/projects/anna-suite                           //
// See accompanying file LICENSE or copy at http://www.teslayout.com/projects/public/anna.LICENSE //


#ifndef anna_core_util_SortedVector_hpp
#define anna_core_util_SortedVector_hpp

#include <map>

#include <anna/core/RuntimeException.hpp>
#include <anna/config/defines.hpp>

namespace anna {

template < typename T, typename SortBy, typename TKey = int > class SortedVector : public std::map <TKey, T*> {
public:
  typedef typename std::map <TKey, T*> container;
  typedef typename container::iterator iterator;
  typedef typename container::const_iterator const_iterator;
  typedef typename container::value_type value_type;

  SortedVector() {;}

  explicit SortedVector(const SortedVector& other) :
    container(other) {}

  virtual ~SortedVector() { container::clear(); }

  bool contains(const T* t) const
  {
    if(t == NULL)
      return false;

    TKey key(SortBy::value(t));
    return find(key) != NULL;
  }

  bool add(T* t)
  noexcept(false) {
    if(t == NULL)
      return false;

    TKey key(SortBy::value(t));
    value_type v(key, t);
    std::pair <iterator, bool> result = container::insert(v);
    return result.second;
  }

  bool erase(T* t)
  noexcept(false) {
    if(t == NULL)
      return false;

    bool result = false;
    TKey key(SortBy::value(t));
    iterator ii = container::find(key);

    if(ii != container::end()) {
      container::erase(ii);
      result = true;
    }

    return result;
  }

  T* find(const TKey key)
  {
    iterator ii = container::find(key);
    return (ii == container::end()) ? NULL : ii->second;
  }

  const T* find(const TKey key) const {
    return const_cast <SortedVector <T, SortBy, TKey>*>(this)->find(key);
  }

  static T* data(iterator ii) { return ii->second; }

  static const T* data(const_iterator ii) { return ii->second; }
};

}

#endif