![]() |
Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
|
#include <stdint.h>#include <cstdint>#include <iterator>#include <utility>#include "absl/container/flat_hash_map.h"#include "absl/types/span.h"#include "google/protobuf/message.h"#include "ortools/base/logging.h"#include "ortools/base/map_util.h"#include "ortools/base/types.h"#include "ortools/math_opt/core/arrow_operator_proxy.h"#include "ortools/math_opt/core/sparse_vector.h"#include "ortools/math_opt/sparse_containers.pb.h"Go to the source code of this file.
Classes | |
| class | operations_research::math_opt::SparseVectorView< T > |
| class | operations_research::math_opt::SparseVectorView< T >::const_iterator |
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. | |
Typedefs | |
| template<typename SparseVector> | |
| using | operations_research::math_opt::sparse_value_type |
Functions | |
| template<typename Collection, typename T = typename Collection::value_type> | |
| SparseVectorView< T > | operations_research::math_opt::MakeView (absl::Span< const int64_t > ids, const Collection &values) |
| template<typename T> | |
| SparseVectorView< const T * > | operations_research::math_opt::MakeView (const google::protobuf::RepeatedField< int64_t > &ids, const google::protobuf::RepeatedPtrField< T > &values) |
| template<typename SparseVectorProto, typename T = sparse_value_type<SparseVectorProto>> | |
| SparseVectorView< T > | operations_research::math_opt::MakeView (const SparseVectorProto &sparse_vector) |
| template<typename T> | |
| SparseVectorView< T > | operations_research::math_opt::MakeView (const SparseVector< T > &sparse_vector) |