Home
last modified time | relevance | path

Searched refs:DTree (Results 1 – 25 of 97) sorted by relevance

1234

/dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/det/
H A Ddtree.hpp46 class DTree class
59 DTree();
66 DTree(const DTree& obj);
73 DTree& operator=(const DTree& obj);
80 DTree(DTree&& obj);
87 DTree& operator=(DTree&& obj);
97 DTree(const StatType& maxVals,
109 DTree(MatType& data);
148 ~DTree();
276 DTree* left;
[all …]
H A Ddt_utils.hpp34 void PrintLeafMembership(DTree<MatType, TagType>* dtree,
49 void PrintVariableImportance(const DTree<MatType, TagType>* dtree,
66 DTree<MatType, TagType>* Trainer(MatType& dataset,
103 PathCacher(PathFormat fmt, DTree<MatType, int>* tree);
109 void Enter(const DTree<MatType, int>* node,
110 const DTree<MatType, int>* parent);
116 void Leave(const DTree<MatType, int>* node,
117 const DTree<MatType, int>* parent);
H A Ddtree_impl.hpp153 DTree<MatType, TagType>::DTree() : in DTree() function in DTree
171 DTree<MatType, TagType>::DTree(const DTree& obj) : in DTree() function in DTree
193 DTree<MatType, TagType>& DTree<MatType, TagType>::operator=( in operator =()
227 DTree<MatType, TagType>::DTree(DTree&& obj): in DTree() function in DTree
263 DTree<MatType, TagType>& DTree<MatType, TagType>::operator=( in operator =()
264 DTree<MatType, TagType>&& obj) in operator =()
315 DTree<MatType, TagType>::DTree(const StatType& maxVals, in DTree() function in DTree
337 DTree<MatType, TagType>::DTree(MatType & data) : in DTree() function in DTree
359 DTree<MatType, TagType>::DTree(const StatType& maxVals, in DTree() function in DTree
383 DTree<MatType, TagType>::DTree(const StatType& maxVals, in DTree() function in DTree
[all …]
H A Ddt_utils_impl.hpp23 void PrintLeafMembership(DTree<MatType, int>* dtree, in PrintLeafMembership()
71 void PrintVariableImportance(const DTree<MatType, TagType>* dtree, in PrintVariableImportance()
110 DTree<MatType, TagType>* Trainer(MatType& dataset, in Trainer()
118 DTree<MatType, TagType>* dtree = new DTree<MatType, TagType>(dataset); in Trainer()
213 DTree<MatType, TagType> cvDTree(train); in Trainer()
287 dtree = new DTree<MatType, TagType>(dataset); in Trainer()
323 PathCacher::PathCacher(PathCacher::PathFormat fmt, DTree<MatType, int>* dtree) : in PathCacher()
334 void PathCacher::Enter(const DTree<MatType, int>* node, in Enter()
335 const DTree<MatType, int>* parent) in Enter()
349 void PathCacher::Leave(const DTree<MatType, int>* /* node */, in Leave()
[all …]
H A Ddet_main.cpp79 PARAM_MODEL_IN(DTree<>, "input_model", "Trained density estimation "
81 PARAM_MODEL_OUT(DTree<>, "output_model", "Output to save trained "
152 DTree<arma::mat, int>* tree; in mlpackMain()
193 tree = IO::GetParam<DTree<arma::mat>*>("input_model"); in mlpackMain()
308 IO::GetParam<DTree<arma::mat>*>("output_model") = tree; in mlpackMain()
/dports/math/cadabra2/cadabra2-2.3.6.8/frontend/gtkmm/
H A DNotebookWindow.hh46 virtual void add_cell(const DTree&, DTree::iterator, bool) override;
47 virtual void remove_cell(const DTree&, DTree::iterator) override;
49 virtual void update_cell(const DTree&, DTree::iterator) override;
50 virtual void position_cursor(const DTree&, DTree::iterator, int pos) override;
51 virtual size_t get_cursor_position(const DTree&, DTree::iterator) override;
53 void select_range(const DTree&, DTree::iterator, int start, int len);
117 DTree::iterator current_cell;
120 DTree::iterator selected_cell;
256 bool cell_got_focus(DTree::iterator, int);
266 void dim_output_cells(DTree::iterator it);
[all …]
H A DCodeInput.hh26 CodeInput(DTree::iterator, Glib::RefPtr<Gtk::TextBuffer>, double scale, const Prefs& prefs);
32 CodeInput(DTree::iterator, const std::string&, double scale, const Prefs& prefs);
38 exp_input_tv(DTree::iterator, Glib::RefPtr<Gtk::TextBuffer>, double scale);
47 sigc::signal1<bool, DTree::iterator> content_execute;
48 sigc::signal1<bool, DTree::iterator> content_changed;
49 sigc::signal3<bool, std::string, int, DTree::iterator> content_insert;
50 sigc::signal3<bool, int, int, DTree::iterator> content_erase;
51 sigc::signal1<bool, DTree::iterator> cell_got_focus;
52 sigc::signal2<bool, DTree::iterator, int> complete_request;
58 DTree::iterator datacell;
H A DTeXView.hh22 TeXView(TeXEngine&, DTree::iterator, int hmargin=25);
27 sigc::signal1<bool, DTree::iterator> show_hide_requested;
29 DTree::iterator datacell;
H A DNotebookWindow.cc767 void NotebookWindow::add_cell(const DTree& tr, DTree::iterator it, bool visible) in add_cell()
896 DTree::iterator parent = DTree::parent(it); in add_cell()
942 void NotebookWindow::remove_cell(const DTree& doc, DTree::iterator it) in remove_cell()
962 DTree::iterator parent = DTree::parent(it); in remove_cell()
1031 void NotebookWindow::update_cell(const DTree&, DTree::iterator it) in update_cell() argument
1047 void NotebookWindow::position_cursor(const DTree&, DTree::iterator it, int pos) in position_cursor() argument
1072 void NotebookWindow::select_range(const DTree&, DTree::iterator it, int start, int len) in select_range() argument
1094 size_t NotebookWindow::get_cursor_position(const DTree&, DTree::iterator it) in get_cursor_position() argument
1208 auto parent=DTree::parent(it); in cell_toggle_visibility()
1341 DTree::sibling_iterator sib=doc.begin(it); in cell_content_execute()
[all …]
/dports/math/cadabra2/cadabra2-2.3.6.8/core/
H A DDataCell.hh108 typedef tree<DataCell> DTree; typedef
113 std::string JSON_serialise(const DTree&);
114 void JSON_recurse(const DTree&, DTree::iterator, nlohmann::json&);
118 void JSON_deserialise(const std::string&, DTree&);
119 void JSON_in_recurse(DTree& doc, DTree::iterator loc, const nlohmann::json& cells);
123 std::string export_as_HTML(const DTree& doc, bool for_embedding=false, bool
125 void HTML_recurse(const DTree& doc, DTree::iterator it, std::ostringstream& str,
137 …std::string export_as_LaTeX(const DTree& doc, const std::string& image_file_base, bool for_embeddi…
138 void LaTeX_recurse(const DTree& doc, DTree::iterator it, std::ostringstream& str,
145 std::string export_as_python(const DTree& doc);
[all …]
H A DDataCell.cc174 void cadabra::HTML_recurse(const DTree& doc, DTree::iterator it, std::ostringstream& str, in HTML_recurse()
245 DTree::sibling_iterator sib=doc.begin(it); in HTML_recurse()
301 void cadabra::JSON_recurse(const DTree& doc, DTree::iterator it, nlohmann::json& json) in JSON_recurse()
360 DTree::sibling_iterator sib=doc.begin(it); in JSON_recurse()
387 DTree::iterator doc_it = doc.set_head(top); in JSON_deserialise()
400 void cadabra::JSON_in_recurse(DTree& doc, DTree::iterator loc, const nlohmann::json& cells) in JSON_in_recurse()
406 DTree::iterator last=doc.end(); in JSON_in_recurse()
534 void cadabra::LaTeX_recurse(const DTree& doc, DTree::iterator it, std::ostringstream& str, in LaTeX_recurse()
622 DTree::sibling_iterator sib=doc.begin(it); in LaTeX_recurse()
656 void cadabra::python_recurse(const DTree& doc, DTree::iterator it, std::ostringstream& str) in python_recurse()
[all …]
H A Dcadabra2cadabra.cc36 cadabra::DTree doc; in main()
/dports/math/cadabra2/cadabra2-2.3.6.8/client_server/
H A DGUIBase.hh23 virtual void update_cell(const DTree&, DTree::iterator)=0;
31 virtual void remove_cell(const DTree&, DTree::iterator)=0;
47 virtual void add_cell(const DTree&, DTree::iterator, bool visible)=0;
52 virtual void position_cursor(const DTree&, DTree::iterator, int)=0;
56 virtual size_t get_cursor_position(const DTree&, DTree::iterator)=0;
H A DActions.hh52 DTree::iterator ref;
74 DTree::iterator newref;
97 DTree::iterator newref;
115 DTree::iterator this_cell;
138 DTree removed_tree;
139 DTree::iterator reference_parent_cell;
156 DTree::iterator newref; // the newly created cell
178 DTree::iterator this_cell;
203 DTree::iterator this_cell;
227 DTree::iterator this_cell;
H A DComputeThread.hh66 void execute_cell(DTree::iterator);
87 bool complete(DTree::iterator, int pos, int alternative);
115 std::map<DataCell::id_t, DTree::iterator> running_cells;
H A DDocumentThread.hh87 …std::pair<DTree::iterator, size_t> find_string(DTree::iterator start_it, size_t start_pos, const s…
134 DTree doc;
H A DDocumentThread.cc53 DTree::iterator doc_it = doc.set_head(top); in new_document()
59 DTree::iterator one_it = doc.append_child(doc_it, one); in new_document()
106 DTree::iterator doc_it=doc.begin(); in build_visual_representation()
137 std::pair<DTree::iterator, size_t> DocumentThread::find_string(DTree::iterator start_it, size_t sta… in find_string()
140 DTree::iterator doc_it=start_it; in find_string()
H A DActions.cc88 DTree::sibling_iterator sib=ref; in execute()
113 DTree::sibling_iterator sib=ref; in execute()
165 removed_tree=DTree(ref); in execute()
173 DTree::iterator newcell; in revert()
/dports/math/cadabra2/cadabra2-2.3.6.8/frontend/osx/Cadabra/Cadabra/
H A DNotebookWindow.hh29 virtual void add_cell(const DTree&, DTree::iterator, bool visible) override;
30 virtual void remove_cell(const DTree&, DTree::iterator) override;
31 virtual void update_cell(const DTree&, DTree::iterator) override;
32 virtual void position_cursor(const DTree&, DTree::iterator) override;
H A DNotebookWindow.mm23 void NotebookWindow::add_cell(const DTree &tr, DTree::iterator it, bool visible)
62 void NotebookWindow::remove_cell(const DTree&, DTree::iterator)
67 void NotebookWindow::update_cell(const DTree&, DTree::iterator)
72 void NotebookWindow::position_cursor(const DTree&, DTree::iterator)
/dports/math/ogdf/OGDF/include/ogdf/energybased/dtree/
H A DDTree.h40 class DTree
48 explicit DTree(int numPoints) in DTree() function
57 ~DTree() in ~DTree()
180 void DTree<IntType, Dim>::allocate(int n) in allocate()
191 void DTree<IntType, Dim>::deallocate() in deallocate()
207 void DTree<IntType, Dim>::prepareMortonOrder() in prepareMortonOrder()
221 void DTree<IntType, Dim>::sortMortonNumbers() in sortMortonNumbers()
230 void DTree<IntType, Dim>::prepareNodeLayer() in prepareNodeLayer()
350 void DTree<IntType, Dim>::linkNodes() in linkNodes()
357 int DTree<IntType, Dim>::countPoints(int curr) const in countPoints()
[all …]
/dports/biology/cd-hit/cdhit-4.8.1/cd-hit-auxtools/mintlib/
H A DminMap.cxx35 DTree::DTree( bool hs ) in DTree() function in DTree
47 DTree::~DTree() in ~DTree()
52 void DTree::Clear() in Clear()
66 DNode* DTree::Insert( DNode *node ) in Insert()
94 DNode* DTree::First() in First()
96 const DTree *tree = this; in First()
101 const DTree *tree = this; in Next()
104 const DNode* DTree::First()const in First()
130 void DTree::DeleteTree( DNode *node ) in DeleteTree()
179 void DTree::InsertNode( DNode *node ) in InsertNode()
[all …]
H A DminMap.hxx43 struct DTree struct
53 DTree( bool hashing = false ); argument
54 virtual ~DTree();
109 struct DMap : public DTree
114 DMap( const DMap & other ) : DTree( other.hashing ){ this->operator=( other ); } in DMap()
129 return (DKeyValue*) this->DTree::Insert( (DNode*) node ); in Insert()
135 DKeyValue* First(){ return (DKeyValue*) DTree::First(); } in First()
136 DKeyValue* Next( const DKeyValue *node ){ return (DKeyValue*) DTree::Next( node ); } in Next()
137 const DKeyValue* First()const{ return (DKeyValue*) DTree::First(); } in First()
138 const DKeyValue* Next( const DKeyValue *node )const{ return (DKeyValue*) DTree::Next( node ); } in Next()
[all …]
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/tests/
H A Ddet_test.cpp47 DTree<arma::mat> tree(testData);
101 DTree<arma::mat> testDTree(testData);
131 DTree<arma::mat> testDTree(testData);
162 DTree<arma::sp_mat> testDTree(testData);
243 DTree<arma::mat> testDTree(testData);
298 DTree<arma::mat> testDTree(testData);
332 DTree<arma::mat> testDTree(testData);
375 DTree<arma::mat> testDTree(testData);
521 DTree<arma::mat> *testDTree = new DTree<arma::mat>(testData);
633 DTree<arma::mat> *testDTree = new DTree<arma::mat>(testData);
[all …]
/dports/graphics/opencv/opencv-4.5.3/modules/objdetect/src/
H A Dcascadedetect.hpp173 struct DTree struct in cv::CV_FINAL::Data
208 std::vector<DTree> classifiers;
494 CascadeClassifierImpl::Data::DTree* cascadeWeaks = &cascade.data.classifiers[0]; in predictOrdered()
505 CascadeClassifierImpl::Data::DTree& weak = cascadeWeaks[stage.first + wi]; in predictOrdered()
538 CascadeClassifierImpl::Data::DTree* cascadeWeaks = &cascade.data.classifiers[0]; in predictCategorical()
549 CascadeClassifierImpl::Data::DTree& weak = cascadeWeaks[stage.first + wi]; in predictCategorical()

1234