C++BoostArray与Unordered使用介绍

#include <boost/array.hpp>
#include <string>
#include <alGorithm>
#include <iOStream>
int main()
{
  typedef boost::array<std::string, 3> array;
  array a;
  a[0] = "cat";
  a.at(1) = "shark";
  *a.rbegin() = "spider";
  std::sort(a.begin(), a.end());
  for (const std::string &s : a)
    std::cout << s << '\n';
  std::cout << a.size() << '\n';
  std::cout << a.max_size() << '\n';
}

#include <boost/unordered_set.hpp>
#include <string>
#include <iostream>
int main()
{
  typedef boost::unordered_set<std::string> unordered_set;
  unordered_set set;
  set.emplace("cat");
  set.emplace("shark");
  set.emplace("spider");
  for (const std::string &s : set)
    std::cout << s << '\n';
  std::cout << set.size() << '\n';
  std::cout << set.max_size() << '\n';
  std::cout << std::boolalpha << (set.find("cat") != set.end()) << '\n';
  std::cout << set.count("shark") << '\n';
}

#include <boost/unordered_map.hpp>
#include <string>
#include <iostream>
int main()
{
  typedef boost::unordered_map<std::string, int> unordered_map;
  unordered_map map;
  map.emplace("cat", 4);
  map.emplace("shark", 0);
  map.emplace("spider", 8);
  for (const auto &p : map)
    std::cout << p.first << ";" << p.second << '\n';
  std::cout << map.size() << '\n';
  std::cout << map.max_size() << '\n';
  std::cout << std::boolalpha << (map.find("cat") != map.end()) << '\n';
  std::cout << map.count("shark") << '\n';
}

#include <boost/unordered_set.hpp>
#include <string>
#include <cstddef>
struct animal
{
  std::string name;
  int legs;
};
bool operator==(const animal &lhs, const animal &rhs)
{
  return lhs.name == rhs.name && lhs.legs == rhs.legs;
}
std::size_t hash_value(const animal &a)
{
  std::size_t seed = 0;
  boost::hash_combine(seed, a.name);
  boost::hash_combine(seed, a.legs);
  return seed;
}
int main()
{
  typedef boost::unordered_set<animal> unordered_set;
  unordered_set animals;
  animals.insert({"cat", 4});
  animals.insert({"shark", 0});
  animals.insert({"spider", 8});
}