mini_map.hpp

Go to the documentation of this file.

#pragma once
 
#include "utils_io.hpp"
#include "utils_macros.hpp"
 
namespace netdem {
 
template <typename T_key, typename T_val> struct Pair {
public:
  T_key first;
  T_val second;
 
  Pair() {}
  Pair(const T_key &key, const T_key &val) : first(key), second(val) {}
};
 
template <typename T_key, typename T_val> class MiniMap {
public:
  const Pair<T_key, T_val> *begin() const { return &(pair_list.front()); }
 
  Pair<T_key, T_val> *begin() { return &(pair_list.front()); }
 
  const Pair<T_key, T_val> *end() const { return &(pair_list.back()) + 1; }
 
  Pair<T_key, T_val> *end() { return &(pair_list.back()) + 1; }
 
  void erase(Pair<T_key, T_val> *it) {
    *it = pair_list.back();
    pair_list.pop_back();
  }
 
  void erase(const T_key &key) {
    auto it = find(key);
    erase(it);
  }
 
  const Pair<T_key, T_val> *find(const T_key &key) const {
    for (auto &pair_item : pair_list) {
      if (pair_item.first == key) {
        return &pair_item;
      }
    }
    return end();
  }
 
  Pair<T_key, T_val> *find(const T_key &key) {
    for (auto &pair_item : pair_list) {
      if (pair_item.first == key) {
        return &pair_item;
      }
    }
    return end();
  }
 
  int size() const { return pair_list.size(); };
 
  int size() { return pair_list.size(); };
 
  const T_val &operator[](const T_key &key) const {
    auto it = find(key);
    if (it != end()) {
      return it->second;
    } else {
      IO::PrintError("in MiniMap[], key not exist");
      return pair_list.back().second;
    }
  }
 
  T_val &operator[](const T_key &key) {
    auto it = find(key);
    if (it != end()) {
      return it->second;
    } else {
      pair_list.emplace_back();
      pair_list.back().first = key;
      pair_list.back().second = T_val();
      return pair_list.back().second;
    }
  }
 
  const T_val &at(const T_key &key) const {
    auto it = find(key);
    if (it != end()) {
      return it->second;
    } else {
      IO::PrintError("in MiniMap[], key not exist");
      return pair_list.back().second;
    }
  }
 
  T_val &at(const T_key &key) {
    auto it = find(key);
    if (it != end()) {
      return it->second;
    } else {
      IO::PrintError("in MiniMap[], key not exist");
      return pair_list.back().second;
    }
  }
 
  void clear() { pair_list.clear(); }
 
private:
  VecXT<Pair<T_key, T_val>> pair_list;
};
 
} // namespace netdem