Google OR-Tools v9.12
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
diffn_util.cc File Reference
#include "ortools/sat/diffn_util.h"
#include <stddef.h>
#include <algorithm>
#include <array>
#include <cmath>
#include <cstddef>
#include <cstdint>
#include <limits>
#include <optional>
#include <ostream>
#include <sstream>
#include <string>
#include <string_view>
#include <tuple>
#include <type_traits>
#include <utility>
#include <vector>
#include "absl/algorithm/container.h"
#include "absl/container/btree_set.h"
#include "absl/container/flat_hash_map.h"
#include "absl/container/flat_hash_set.h"
#include "absl/container/inlined_vector.h"
#include "absl/log/check.h"
#include "absl/random/bit_gen_ref.h"
#include "absl/types/optional.h"
#include "absl/types/span.h"
#include "ortools/base/logging.h"
#include "ortools/base/stl_util.h"
#include "ortools/base/strong_vector.h"
#include "ortools/graph/connected_components.h"
#include "ortools/graph/strongly_connected_components.h"
#include "ortools/sat/integer_base.h"
#include "ortools/sat/util.h"
#include "ortools/util/fixed_shape_binary_tree.h"
#include "ortools/util/integer_pq.h"
#include "ortools/util/strong_integers.h"

Go to the source code of this file.

Classes

struct  operations_research::sat::BinaryTreeNode
 
struct  operations_research::sat::SweepLineIntervalTree
 
struct  operations_research::sat::Rectangle32
 

Namespaces

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

Functions

CompactVectorVector< int > operations_research::sat::GetOverlappingRectangleComponents (absl::Span< const Rectangle > rectangles)
 
bool operations_research::sat::ReportEnergyConflict (Rectangle bounding_box, absl::Span< const int > boxes, SchedulingConstraintHelper *x, SchedulingConstraintHelper *y)
 
bool operations_research::sat::BoxesAreInEnergyConflict (absl::Span< const Rectangle > rectangles, absl::Span< const IntegerValue > energies, absl::Span< const int > boxes, Rectangle *conflict)
 
bool operations_research::sat::AnalyzeIntervals (bool transpose, absl::Span< const int > local_boxes, absl::Span< const Rectangle > rectangles, absl::Span< const IntegerValue > rectangle_energies, IntegerValue *x_threshold, IntegerValue *y_threshold, Rectangle *conflict)
 
absl::Span< int > operations_research::sat::FilterBoxesAndRandomize (absl::Span< const Rectangle > cached_rectangles, absl::Span< int > boxes, IntegerValue threshold_x, IntegerValue threshold_y, absl::BitGenRef random)
 
absl::Span< int > operations_research::sat::FilterBoxesThatAreTooLarge (absl::Span< const Rectangle > cached_rectangles, absl::Span< const IntegerValue > energies, absl::Span< int > boxes)
 
void operations_research::sat::ConstructOverlappingSets (absl::Span< IndexedInterval > intervals, CompactVectorVector< int > *result, absl::Span< const int > order)
 
void operations_research::sat::GetOverlappingIntervalComponents (std::vector< IndexedInterval > *intervals, std::vector< std::vector< int > > *components)
 
std::vector< int > operations_research::sat::GetIntervalArticulationPoints (std::vector< IndexedInterval > *intervals)
 
void operations_research::sat::AppendPairwiseRestrictions (absl::Span< const ItemWithVariableSize > items, std::vector< PairwiseRestriction > *result)
 
void operations_research::sat::AppendPairwiseRestrictions (absl::Span< const ItemWithVariableSize > items, absl::Span< const ItemWithVariableSize > other_items, std::vector< PairwiseRestriction > *result)
 
IntegerValue operations_research::sat::Smallest1DIntersection (IntegerValue range_min, IntegerValue range_max, IntegerValue size, IntegerValue interval_min, IntegerValue interval_max)
 
FindRectanglesResult operations_research::sat::FindRectanglesWithEnergyConflictMC (const std::vector< RectangleInRange > &intervals, absl::BitGenRef random, double temperature, double candidate_energy_usage_factor)
 
std::string operations_research::sat::RenderDot (std::optional< Rectangle > bb, absl::Span< const Rectangle > solution, std::string_view extra_dot_payload)
 
std::vector< Rectangleoperations_research::sat::FindEmptySpaces (const Rectangle &bounding_box, std::vector< Rectangle > ocupied_rectangles)
 
std::vector< Rectangleoperations_research::sat::PavedRegionDifference (std::vector< Rectangle > original_region, absl::Span< const Rectangle > area_to_remove)
 
std::vector< std::pair< int, int > > operations_research::sat::FindPartialRectangleIntersectionsImpl (absl::Span< const Rectangle32 > rectangles, int32_t y_max)
 
std::vector< std::pair< int, int > > operations_research::sat::FindPartialRectangleIntersections (absl::Span< const Rectangle > rectangles)
 
std::optional< std::pair< int, int > > operations_research::sat::FindOneIntersectionIfPresent (absl::Span< const Rectangle > rectangles)
 
std::optional< std::pair< int, int > > operations_research::sat::FindOneIntersectionIfPresentWithZeroArea (absl::Span< const Rectangle > rectangles)