pub struct ExampleParser {Show 19 fields
pub input: PathBuf,
pub support: usize,
pub depth: usize,
pub timeout: f64,
pub metric: f64,
pub restart_interval: f64,
pub max_error: f64,
pub dynamic: bool,
pub max_k: Option<usize>,
pub epsilon: f64,
pub fast_d2: OptimalDepth2Policy,
pub cache: CacheType,
pub print_stats: bool,
pub always_sort: bool,
pub heuristic: SearchHeuristic,
pub step: SearchStepStrategy,
pub result: PathBuf,
pub print_tree: bool,
pub overwrite: bool,
}Expand description
Command line arguments of the anytime examples.
Fields§
§input: PathBufDataset file: one instance per line, label first, binary features
support: usizeMinimum number of instances in each leaf
depth: usizeMaximum depth of the tree
timeout: f64Time limit in seconds
metric: f64Not used by the current examples
restart_interval: f64Length in seconds of one pass of the restart and iterative examples; 0 runs the search uninterrupted and records every improvement
max_error: f64Initial upper bound on the tree error: only strictly better trees are searched. Used by the restart example (warm start from a known tree)
dynamic: boolTop-k example: halve k at each level of the tree (Top-k*)
max_k: Option<usize>Top-k example: stop relaxing at this k instead of the number of features (the incomplete Top-k baseline)
epsilon: f64Step of the gain and purity rules
fast_d2: OptimalDepth2PolicyWhether to use the depth-2 solver
cache: CacheTypeCache of the subproblems
print_stats: boolPrint the search statistics
always_sort: boolSort the features by the heuristic at every node
heuristic: SearchHeuristicHeuristic used to order the features
step: SearchStepStrategyHow the budget of the search rule grows between passes
result: PathBufDirectory where the JSON results are written
print_tree: boolPrint the tree
overwrite: boolOverwrite existing results
Implementations§
Trait Implementations§
Source§impl Args for ExampleParser
impl Args for ExampleParser
Source§fn group_id() -> Option<Id>
fn group_id() -> Option<Id>
ArgGroup::id][crate::ArgGroup::id] for this set of argumentsSource§fn augment_args<'b>(__clap_app: Command) -> Command
fn augment_args<'b>(__clap_app: Command) -> Command
Source§fn augment_args_for_update<'b>(__clap_app: Command) -> Command
fn augment_args_for_update<'b>(__clap_app: Command) -> Command
Command] so it can instantiate self via
[FromArgMatches::update_from_arg_matches_mut] Read moreSource§impl CommandFactory for ExampleParser
impl CommandFactory for ExampleParser
Source§impl Debug for ExampleParser
impl Debug for ExampleParser
Source§impl FromArgMatches for ExampleParser
impl FromArgMatches for ExampleParser
Source§fn from_arg_matches(__clap_arg_matches: &ArgMatches) -> Result<Self, Error>
fn from_arg_matches(__clap_arg_matches: &ArgMatches) -> Result<Self, Error>
Source§fn from_arg_matches_mut(
__clap_arg_matches: &mut ArgMatches,
) -> Result<Self, Error>
fn from_arg_matches_mut( __clap_arg_matches: &mut ArgMatches, ) -> Result<Self, Error>
Source§fn update_from_arg_matches(
&mut self,
__clap_arg_matches: &ArgMatches,
) -> Result<(), Error>
fn update_from_arg_matches( &mut self, __clap_arg_matches: &ArgMatches, ) -> Result<(), Error>
ArgMatches to self.Source§fn update_from_arg_matches_mut(
&mut self,
__clap_arg_matches: &mut ArgMatches,
) -> Result<(), Error>
fn update_from_arg_matches_mut( &mut self, __clap_arg_matches: &mut ArgMatches, ) -> Result<(), Error>
ArgMatches to self.