sorted_interval_list.h File Reference

#include <cstddef>
#include <cstdint>
#include <iterator>
#include <ostream>
#include <set>
#include <string>
#include <utility>
#include <vector>
#include "absl/container/inlined_vector.h"
#include "absl/types/span.h"
#include "ortools/base/logging.h"

Go to the source code of this file.

Classes
struct	operations_research::ClosedInterval
class	operations_research::Domain
class	operations_research::Domain::DomainIterator
struct	operations_research::Domain::DomainIteratorBeginEnd
struct	operations_research::Domain::DomainIteratorBeginEndWithOwnership
class	operations_research::SortedDisjointIntervalList
struct	operations_research::SortedDisjointIntervalList::IntervalComparator
class	operations_research::ClosedInterval::Iterator
	Implementation details. More...

Namespaces
namespace	operations_research
	In SWIG mode, we don't want anything besides these top-level includes.

Functions
ClosedInterval::Iterator	operations_research::begin (ClosedInterval interval)
ClosedInterval::Iterator	operations_research::end (ClosedInterval interval)
std::ostream &	operations_research::operator<< (std::ostream &out, const ClosedInterval &interval)
std::ostream &	operations_research::operator<< (std::ostream &out, const std::vector< ClosedInterval > &intervals)
bool	operations_research::IntervalsAreSortedAndNonAdjacent (absl::Span< const ClosedInterval > intervals)
std::ostream &	operations_research::operator<< (std::ostream &out, const Domain &domain)
int64_t	operations_research::SumOfKMinValueInDomain (const Domain &domain, int k)
	Returns the sum of smallest k values in the domain.
int64_t	operations_research::SumOfKMaxValueInDomain (const Domain &domain, int k)
	Returns the sum of largest k values in the domain.