Skip to main content

Module common

Module common 

Source

Structs§

Budget
The limits one pass of the anytime search runs under.
FitOutcome
The result of a fit.
PassReport
What a finished pass tells the schedule.
ScheduleBounds
The largest budget that can matter on a given problem. A pass at this budget is the unrestricted search.
SearchConfig
Settings of a search, and the per-node state derived from them.
Statistics
Counters collected during a search.

Enums§

Leaf
A leaf, as a custom loss sees it.
Loss
The loss a search minimises.
LossInput
What a custom loss receives for a leaf.
PointSelector
Which candidate threshold the search evaluates next inside an interval of candidates.
ScheduleKind
The schedules available, as a parameter.
SearchError
A fit that could not start, or whose loss failed.
SearchStatus
Why the search stopped.
Skipping
Whether the search skips thresholds: the interval pruner, and the skipping and early stops of the depth-2 solver’s scan.

Traits§

BudgetSchedule
Produces the budget of each pass.
LeafLoss
A caller’s leaf loss: (cost, class predicted). The cost of a tree is the sum of the costs of its leaves, and a cost must be non-negative.

Functions§

classification_error
(misclassifications, majority class) of a leaf with the given class counts. Ties go to the highest class index.

Type Aliases§

Cost
The cost of a tree: the sum of the costs of its leaves. For the built-in loss, the number of misclassified instances.