sorted.h File Reference

#include <algorithm>
#include <vector>
#include "absl/algorithm/container.h"
#include "absl/container/flat_hash_map.h"
#include "absl/container/flat_hash_set.h"
#include "google/protobuf/map.h"

Go to the source code of this file.

Namespaces
namespace	operations_research
	In SWIG mode, we don't want anything besides these top-level includes.
namespace	operations_research::math_opt
	An object oriented wrapper for quadratic constraints in ModelStorage.

Functions
template<typename T >
std::vector< T >	operations_research::math_opt::SortedSetElements (const absl::flat_hash_set< T > &elements)
template<typename K , typename V >
std::vector< K >	operations_research::math_opt::MapKeys (const absl::flat_hash_map< K, V > &in_map)
template<typename K , typename V >
std::vector< K >	operations_research::math_opt::MapKeys (const google::protobuf::Map< K, V > &in_map)
template<typename K , typename V >
std::vector< K >	operations_research::math_opt::SortedMapKeys (const absl::flat_hash_map< K, V > &in_map)
template<typename K , typename V >
std::vector< K >	operations_research::math_opt::SortedMapKeys (const google::protobuf::Map< K, V > &in_map)