container.h

#ifndef __TAN_SRC_BASE_CONTAINER_H__
#define __TAN_SRC_BASE_CONTAINER_H__
 
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <stack>
#include <string>
#include <memory>
#include <functional>
 
template <typename T> using vector = std::vector<T>;
 
using str = std::string;
using str_view = std::string_view;
 
template <typename Key, typename Value, typename Hash = std::hash<Key>>
using umap = std::unordered_map<Key, Value, Hash>;
 
template <typename Key, typename Hash = std::hash<Key>> using uset = std::unordered_set<Key, Hash>;
 
using std::pair;
using std::stack;
 
struct PairHash {
  template <class T1, class T2> std::size_t operator()(const pair<T1, T2> &p) const {
    // https://stackoverflow.com/questions/5889238/why-is-xor-the-default-way-to-combine-hashes/27952689#27952689
    size_t lhs = std::hash<T1>{}(p.first);
    size_t rhs = std::hash<T2>{}(p.second);
    lhs ^= rhs + 0x9e3779b9 + (lhs << 6) + (lhs >> 2);
    return lhs;
  }
};
 
inline bool is_string_in(const str &s, const vector<str> &list) {
  return std::find(list.begin(), list.end(), s) != list.end();
}
 
#endif //__TAN_SRC_BASE_CONTAINER_H__