|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Example: meeting scheduler and 1D segment intersection. More...
Go to the source code of this file.
Functions | |
| void | meeting_scheduler () |
| Scenario 1: Meeting scheduler — detect conflicts. | |
| void | segment_intersection () |
| Scenario 2: 1D segment intersection. | |
| int | main () |
Example: meeting scheduler and 1D segment intersection.
Definition in file interval_tree_example.cc.
| int main | ( | ) |
Definition at line 148 of file interval_tree_example.cc.
References meeting_scheduler(), and segment_intersection().
| void meeting_scheduler | ( | ) |
Scenario 1: Meeting scheduler — detect conflicts.
Definition at line 44 of file interval_tree_example.cc.
References Aleph::divide_and_conquer_partition_dp(), and Aleph::DynIntervalTree< T, Compare >::insert().
Referenced by main().
| void segment_intersection | ( | ) |
Scenario 2: 1D segment intersection.
Definition at line 98 of file interval_tree_example.cc.
References Aleph::divide_and_conquer_partition_dp(), Aleph::DynIntervalTree< T, Compare >::find_all_overlaps(), Aleph::DynIntervalTree< T, Compare >::insert_dup(), Aleph::DynIntervalTree< T, Compare >::verify(), and y.
Referenced by main().