Feature Selection Toolbox FST4
UTIA · Czech Academy of Sciences
Loading...
Searching...
No Matches
search_branch_and_bound_improved_threaded.hpp
Go to the documentation of this file.
1#ifndef FSTSEARCHBRANCHANDBOUNDIMPROVEDTHREADED_H
2#define FSTSEARCHBRANCHANDBOUNDIMPROVEDTHREADED_H
3 /*
22=========================================================================
23Copyright and license:
24 * FST4 software (with the exception of any bundled or externally linked
25 third-party components) is Copyright (C) 2000-present Institute of
26 Information Theory and Automation of the Czech Academy of Sciences (UTIA).
27 * FST4 is free software: you can redistribute it and/or modify it under
28 the terms of the GNU Affero General Public License as published by the
29 Free Software Foundation, version 3. The full text of the license is in
30 the file LICENSE in the distribution root and at
31 https://www.gnu.org/licenses/agpl-3.0.html.
32 * FST4 is distributed in the hope that it will be useful, but WITHOUT ANY
33 WARRANTY; without even the implied warranty of MERCHANTABILITY or
34 FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public
35 License for more details.
36 * Closed-source use without the AGPL's copyleft obligations requires a
37 commercial license from UTIA; in case of interest write to
38 utia@utia.cas.cz. LICENSING.md in the distribution root explains both
39 options, the contributor license agreement that every contribution
40 requires, and the contacts (technical questions and pull requests:
41 somol@utia.cas.cz, with "FST" in the subject line).
42========================================================================== */
43
44#include <cassert>
45#include "error.hpp"
46#include "global.hpp"
49
50namespace FST {
51
68template<class RETURNTYPE, typename DIMTYPE, class SUBSET, class CRITERION>
69class Search_Branch_And_Bound_Improved_Threaded : public Search_Branch_And_Bound_Improved<RETURNTYPE,DIMTYPE,SUBSET,CRITERION>{
70public:
75 explicit Search_Branch_And_Bound_Improved_Threaded(const unsigned int max_threads=2)
76 :Search_Branch_And_Bound_Improved<RETURNTYPE,DIMTYPE,SUBSET,CRITERION>(PEvaluatorEngine(new Candidate_Evaluator_Threaded<RETURNTYPE,DIMTYPE,SUBSET,CRITERION>(max_threads)))
77 {assert(max_threads>0); notify("Search_Branch_And_Bound_Improved_Threaded constructor.");}
78 virtual ~Search_Branch_And_Bound_Improved_Threaded() {notify("Search_Branch_And_Bound_Improved_Threaded destructor.");}
79};
80
81} // namespace
82#endif // FSTSEARCHBRANCHANDBOUNDIMPROVEDTHREADED_H ///:~
Implements concurrent evaluation of a criterion on a set of subset candidates.
Implements concurrent evaluation of a criterion on a set of subset candidates.
Definition candidate_evaluator_threaded.hpp:156
DEPRECATED shim: threaded Improved Branch and Bound (IBB) method.
Definition search_branch_and_bound_improved_threaded.hpp:69
Search_Branch_And_Bound_Improved_Threaded(const unsigned int max_threads=2)
Constructs a Search_Branch_And_Bound_Improved configured with a Candidate_Evaluator_Threaded engine o...
Definition search_branch_and_bound_improved_threaded.hpp:75
Search_Branch_And_Bound_Improved< RETURNTYPE, DIMTYPE, SUBSET, CRITERION > parent
base class: the merged Improved B&B search this shim configures with a threaded engine
Definition search_branch_and_bound_improved_threaded.hpp:71
parent::PEvaluatorEngine PEvaluatorEngine
Definition search_branch_and_bound_improved_threaded.hpp:72
Search_Branch_And_Bound_Improved(PEvaluatorEngine engine=PEvaluatorEngine())
engine forwarded to Search_Branch_And_Bound; defaults to sequential in-line evaluation if not supplie...
Definition search_branch_and_bound_improved.hpp:121
parent::PEvaluatorEngine PEvaluatorEngine
shared pointer to the injected evaluation-strategy engine
Definition search_branch_and_bound_improved.hpp:120
FST4 specific error passing class.
Global definitions.
The Feature Selection Toolbox 4 library: every library component – data access, criteria and classifi...
Definition data_accessor.hpp:80
void notify(const std::string msg)
Prints msg followed by a newline via syncout::print(); a no-op unless the preprocessor macro DEBUG is...
Definition global.hpp:112
Implements Improved Branch and Bound (IBB) method, i.e., with fully computed node ordering.
Copyright © 2000–present ÚTIA, Institute of Information Theory and Automation of the Czech Academy of Sciences · Contacts · This site sets no cookies and uses no analytics.