/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/corelib/test/ |
H A D | test_ncbi_tree.cpp | 97 TTree* tr = new TTree(0); in s_TEST_Tree() 103 TTree* sr = new TTree(0); in s_TEST_Tree() 109 TTree* ur = new TTree(0); in s_TEST_Tree() 144 TTree* tr2 = new TTree(*tr); in s_TEST_Tree() 164 TTree* t = *it; in s_TEST_Tree() 192 TTree* str = tr = new TTree(0); in s_TEST_Tree() 247 std::unique_ptr<TTree> root( new TTree(0) ); in s_TEST_CountNodes() 270 assert( root->CountNodes(0, TTree::fOnlyLeafs | TTree::fCumulative) == 0 ); in s_TEST_CountNodes() 275 assert( root->CountNodes(1, TTree::fOnlyLeafs | TTree::fCumulative) == 0 ); in s_TEST_CountNodes() 280 assert( root->CountNodes(2, TTree::fOnlyLeafs | TTree::fCumulative) == 5 ); in s_TEST_CountNodes() [all …]
|
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/algo/tree/test/ |
H A D | test_algo_tree.cpp | 99 TTree* orig = new TTree(0); in s_TEST_TreeOperations() 107 TTree* corr = new TTree(11); in s_TEST_TreeOperations() 161 TTree* tr = new TTree(0); in s_TEST_Tree() 167 TTree* sr = new TTree(0); in s_TEST_Tree() 171 TTree* ur = new TTree(0); in s_TEST_Tree() 222 TTree* tr2 = new TTree(*tr); in s_TEST_Tree() 242 TTree* t = *it; in s_TEST_Tree() 270 TTree* str = tr = new TTree(0); in s_TEST_Tree() 360 TTree* tr = new TTree(0); in s_TEST_IdTreeOperations() 484 TTree* tr = new TTree(TTreePair(0, 0)); in s_TEST_IdTree() [all …]
|
/dports/biology/seqan/seqan-library-2.4.0/include/seqan/index/ |
H A D | index_fm_right_array_binary_tree_iterator.h | 102 template <typename TTree, typename TIterSpec> 111 TTree * waveletTreeStructure; 124 template <typename TTree, typename TSpec> 196 template <typename TTree, typename TIterSpec> 197 inline TTree & 203 template <typename TTree, typename TIterSpec> 204 inline TTree & 253 template <typename TTree, typename TIterSpec> 300 inline typename Size<TTree>::Type 329 inline typename Size<TTree>::Type [all …]
|
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/include/seqan/index/ |
H A D | index_fm_right_array_binary_tree_iterator.h | 102 template <typename TTree, typename TIterSpec> 111 TTree * waveletTreeStructure; 124 template <typename TTree, typename TSpec> 196 template <typename TTree, typename TIterSpec> 197 inline TTree & 203 template <typename TTree, typename TIterSpec> 204 inline TTree & 253 template <typename TTree, typename TIterSpec> 300 inline typename Size<TTree>::Type 329 inline typename Size<TTree>::Type [all …]
|
/dports/biology/pbseqan/seqan-21d95d737d8decb5cc3693b9065d81e831e7f57d/include/seqan/index/ |
H A D | index_fm_right_array_binary_tree_iterator.h | 102 template <typename TTree, typename TIterSpec> 111 TTree * waveletTreeStructure; 124 template <typename TTree, typename TSpec> 196 template <typename TTree, typename TIterSpec> 197 inline TTree & 203 template <typename TTree, typename TIterSpec> 204 inline TTree & 253 template <typename TTree, typename TIterSpec> 300 inline typename Size<TTree>::Type 329 inline typename Size<TTree>::Type [all …]
|
/dports/mail/rspamd/rspamd-3.1/contrib/lua-lpeg/ |
H A D | lptree.c | 55 static void fixonecall (lua_State *L, int postable, TTree *g, TTree *t) { in fixonecall() 80 TTree *t1 = sib1(tree); in correctassociativity() 101 static void finalfix (lua_State *L, int postable, TTree *g, TTree *t) { in finalfix() 391 static TTree *seqaux (TTree *tree, TTree *sib, int sibsize) { in seqaux() 425 TTree *tree, *nd; in numtree() 444 TTree *tree; in getpatt() 588 TTree *tree; in lp_star() 683 TTree *tree; in lp_behind() 722 static TTree *auxemptycap (TTree *tree, int cap) { in auxemptycap() 853 TTree *tree; in lp_matchtime() [all …]
|
/dports/devel/lua-lpeg/lpeg-1.0.2/ |
H A D | lptree.c | 54 static void fixonecall (lua_State *L, int postable, TTree *g, TTree *t) { in fixonecall() 79 TTree *t1 = sib1(tree); in correctassociativity() 100 static void finalfix (lua_State *L, int postable, TTree *g, TTree *t) { in finalfix() 389 static TTree *seqaux (TTree *tree, TTree *sib, int sibsize) { in seqaux() 423 TTree *tree, *nd; in numtree() 442 TTree *tree; in getpatt() 586 TTree *tree; in lp_star() 681 TTree *tree; in lp_behind() 721 static TTree *auxemptycap (TTree *tree, int cap) { in auxemptycap() 853 TTree *tree; in lp_matchtime() [all …]
|
/dports/audio/moony-lv2/moony-0.36.0/lpeg-1.0.2/ |
H A D | lptree.c | 54 static void fixonecall (lua_State *L, int postable, TTree *g, TTree *t) { in fixonecall() 79 TTree *t1 = sib1(tree); in correctassociativity() 100 static void finalfix (lua_State *L, int postable, TTree *g, TTree *t) { in finalfix() 389 static TTree *seqaux (TTree *tree, TTree *sib, int sibsize) { in seqaux() 423 TTree *tree, *nd; in numtree() 442 TTree *tree; in getpatt() 586 TTree *tree; in lp_star() 681 TTree *tree; in lp_behind() 721 static TTree *auxemptycap (TTree *tree, int cap) { in auxemptycap() 853 TTree *tree; in lp_matchtime() [all …]
|
/dports/mail/rspamd-devel/rspamd-93430bb/contrib/lua-lpeg/ |
H A D | lptree.c | 55 static void fixonecall (lua_State *L, int postable, TTree *g, TTree *t) { in fixonecall() 80 TTree *t1 = sib1(tree); in correctassociativity() 101 static void finalfix (lua_State *L, int postable, TTree *g, TTree *t) { in finalfix() 391 static TTree *seqaux (TTree *tree, TTree *sib, int sibsize) { in seqaux() 425 TTree *tree, *nd; in numtree() 444 TTree *tree; in getpatt() 588 TTree *tree; in lp_star() 683 TTree *tree; in lp_behind() 722 static TTree *auxemptycap (TTree *tree, int cap) { in auxemptycap() 853 TTree *tree; in lp_matchtime() [all …]
|
/dports/editors/textadept/lpeg-1.0.2/ |
H A D | lptree.c | 54 static void fixonecall (lua_State *L, int postable, TTree *g, TTree *t) { in fixonecall() 79 TTree *t1 = sib1(tree); in correctassociativity() 100 static void finalfix (lua_State *L, int postable, TTree *g, TTree *t) { in finalfix() 389 static TTree *seqaux (TTree *tree, TTree *sib, int sibsize) { in seqaux() 423 TTree *tree, *nd; in numtree() 442 TTree *tree; in getpatt() 586 TTree *tree; in lp_star() 681 TTree *tree; in lp_behind() 721 static TTree *auxemptycap (TTree *tree, int cap) { in auxemptycap() 853 TTree *tree; in lp_matchtime() [all …]
|
/dports/editors/textadept/lua-5.3.5/src/lib/ |
H A D | lptree.c | 54 static void fixonecall (lua_State *L, int postable, TTree *g, TTree *t) { in fixonecall() 79 TTree *t1 = sib1(tree); in correctassociativity() 100 static void finalfix (lua_State *L, int postable, TTree *g, TTree *t) { in finalfix() 389 static TTree *seqaux (TTree *tree, TTree *sib, int sibsize) { in seqaux() 423 TTree *tree, *nd; in numtree() 442 TTree *tree; in getpatt() 586 TTree *tree; in lp_star() 681 TTree *tree; in lp_behind() 721 static TTree *auxemptycap (TTree *tree, int cap) { in auxemptycap() 853 TTree *tree; in lp_matchtime() [all …]
|
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/include/algo/phy_tree/ |
H A D | dist_methods.hpp | 56 typedef TPhyTreeNode TTree; typedef in CDistMethods 104 static TTree *NjTree(const TMatrix& dist_mat, 108 static TTree *FastMeTree(const TMatrix& dist_mat, 115 static void ZeroNegativeBranches(TTree* node); 126 static TTree* RerootTree(TTree* tree, TTree* node = NULL); 135 static TTree* x_FindLargestEdge(TTree* tree, TTree* best_node);
|
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/algo/phy_tree/ |
H A D | dist_methods.cpp | 144 TTree *tree = new TTree; in NjTree() 184 TTree::TNodeList_I it2 = it1; in NjTree() 198 TTree *new_node = new TTree; in NjTree() 226 TTree::TNodeList_I it2 = it1; in NjTree() 234 TTree *rv = tree->DetachNode(it1); in NjTree() 240 CDistMethods::TTree* CDistMethods::RerootTree(CDistMethods::TTree* tree, in RerootTree() 246 TTree *new_root = new TTree(); in RerootTree() 268 TTree *leaf = 0; in RerootTree() 286 TTree *parent = node->GetParent(); in RerootTree() 338 CDistMethods::TTree* CDistMethods::x_FindLargestEdge(CDistMethods::TTree* node, in x_FindLargestEdge() [all …]
|
/dports/devel/fpc-fcl-base/fpc-3.2.2/packages/fcl-base/examples/ |
H A D | poolmm2.pp | 29 { TTree } 31 TTree = class 51 { TTree } 53 constructor TTree.Create(AValue, depth: Integer); 59 destructor TTree.Destroy; 65 function TTree.Check: Integer; 81 function TTree.Make(AValue, depth: Integer): PNode; 95 aa, bb, llt: TTree; 107 llt:=TTree.Create(0, MaxDepth); 111 aa:=TTree.Create(i, MinDepth); [all …]
|
/dports/lang/fpc/fpc-3.2.2/packages/fcl-base/examples/ |
H A D | poolmm2.pp | 29 { TTree } 31 TTree = class 51 { TTree } 53 constructor TTree.Create(AValue, depth: Integer); 59 destructor TTree.Destroy; 65 function TTree.Check: Integer; 81 function TTree.Make(AValue, depth: Integer): PNode; 95 aa, bb, llt: TTree; 107 llt:=TTree.Create(0, MaxDepth); 111 aa:=TTree.Create(i, MinDepth); [all …]
|
/dports/lang/fpc-source/fpc-3.2.2/packages/fcl-base/examples/ |
H A D | poolmm2.pp | 29 { TTree } 31 TTree = class 51 { TTree } 53 constructor TTree.Create(AValue, depth: Integer); 59 destructor TTree.Destroy; 65 function TTree.Check: Integer; 81 function TTree.Make(AValue, depth: Integer): PNode; 95 aa, bb, llt: TTree; 107 llt:=TTree.Create(0, MaxDepth); 111 aa:=TTree.Create(i, MinDepth); [all …]
|
/dports/security/nmap/nmap-7.91/ |
H A D | lpeg.c | 186 typedef struct TTree { struct 194 } TTree; typedef 204 TTree tree[1]; 1737 TTree *rule; in codegrammar() 1765 static int codeseq1 (CompileState *compst, TTree *p1, TTree *p2, in codeseq1() 2315 static TTree *seqaux (TTree *tree, TTree *sib, int sibsize) { in seqaux() 2391 TTree *tree; in getpatt() 2652 TTree *tree; in lp_star() 2747 TTree *tree; in lp_behind() 2907 TTree *tree; in lp_matchtime() [all …]
|
/dports/devel/tex-web2c/texlive-20150521-source/texk/web2c/luatexdir/luapeg/ |
H A D | lpeg.c | 1446 TTree *rule; in codegrammar() 1474 static int codeseq1 (CompileState *compst, TTree *p1, TTree *p2, in codeseq1() 2226 static void finalfix (lua_State *L, int postable, TTree *g, TTree *t) { in finalfix() 2511 static TTree *seqaux (TTree *tree, TTree *sib, int sibsize) { in seqaux() 2545 TTree *tree, *nd; in numtree() 2564 TTree *tree; in getpatt() 2708 TTree *tree; in lp_star() 2803 TTree *tree; in lp_behind() 2842 static TTree *auxemptycap (TTree *tree, int cap) { in auxemptycap() 2975 TTree *tree; in lp_matchtime() [all …]
|
/dports/devel/tex-synctex/texlive-20150521-source/texk/web2c/luatexdir/luapeg/ |
H A D | lpeg.c | 1446 TTree *rule; in codegrammar() 1474 static int codeseq1 (CompileState *compst, TTree *p1, TTree *p2, in codeseq1() 2226 static void finalfix (lua_State *L, int postable, TTree *g, TTree *t) { in finalfix() 2511 static TTree *seqaux (TTree *tree, TTree *sib, int sibsize) { in seqaux() 2545 TTree *tree, *nd; in numtree() 2564 TTree *tree; in getpatt() 2708 TTree *tree; in lp_star() 2803 TTree *tree; in lp_behind() 2842 static TTree *auxemptycap (TTree *tree, int cap) { in auxemptycap() 2975 TTree *tree; in lp_matchtime() [all …]
|
/dports/japanese/tex-ptex/texlive-20150521-source/texk/web2c/luatexdir/luapeg/ |
H A D | lpeg.c | 1446 TTree *rule; in codegrammar() 1474 static int codeseq1 (CompileState *compst, TTree *p1, TTree *p2, in codeseq1() 2226 static void finalfix (lua_State *L, int postable, TTree *g, TTree *t) { in finalfix() 2511 static TTree *seqaux (TTree *tree, TTree *sib, int sibsize) { in seqaux() 2545 TTree *tree, *nd; in numtree() 2564 TTree *tree; in getpatt() 2708 TTree *tree; in lp_star() 2803 TTree *tree; in lp_behind() 2842 static TTree *auxemptycap (TTree *tree, int cap) { in auxemptycap() 2975 TTree *tree; in lp_matchtime() [all …]
|
/dports/print/tex-basic-engines/texlive-20150521-source/texk/web2c/luatexdir/luapeg/ |
H A D | lpeg.c | 1446 TTree *rule; in codegrammar() 1474 static int codeseq1 (CompileState *compst, TTree *p1, TTree *p2, in codeseq1() 2226 static void finalfix (lua_State *L, int postable, TTree *g, TTree *t) { in finalfix() 2511 static TTree *seqaux (TTree *tree, TTree *sib, int sibsize) { in seqaux() 2545 TTree *tree, *nd; in numtree() 2564 TTree *tree; in getpatt() 2708 TTree *tree; in lp_star() 2803 TTree *tree; in lp_behind() 2842 static TTree *auxemptycap (TTree *tree, int cap) { in auxemptycap() 2975 TTree *tree; in lp_matchtime() [all …]
|
/dports/print/tex-aleph/texlive-20150521-source/texk/web2c/luatexdir/luapeg/ |
H A D | lpeg.c | 1446 TTree *rule; in codegrammar() 1474 static int codeseq1 (CompileState *compst, TTree *p1, TTree *p2, in codeseq1() 2226 static void finalfix (lua_State *L, int postable, TTree *g, TTree *t) { in finalfix() 2511 static TTree *seqaux (TTree *tree, TTree *sib, int sibsize) { in seqaux() 2545 TTree *tree, *nd; in numtree() 2564 TTree *tree; in getpatt() 2708 TTree *tree; in lp_star() 2803 TTree *tree; in lp_behind() 2842 static TTree *auxemptycap (TTree *tree, int cap) { in auxemptycap() 2975 TTree *tree; in lp_matchtime() [all …]
|
/dports/print/tex-luatex/texlive-20150521-source/texk/web2c/luatexdir/luapeg/ |
H A D | lpeg.c | 1446 TTree *rule; in codegrammar() 1474 static int codeseq1 (CompileState *compst, TTree *p1, TTree *p2, in codeseq1() 2226 static void finalfix (lua_State *L, int postable, TTree *g, TTree *t) { in finalfix() 2511 static TTree *seqaux (TTree *tree, TTree *sib, int sibsize) { in seqaux() 2545 TTree *tree, *nd; in numtree() 2564 TTree *tree; in getpatt() 2708 TTree *tree; in lp_star() 2803 TTree *tree; in lp_behind() 2842 static TTree *auxemptycap (TTree *tree, int cap) { in auxemptycap() 2975 TTree *tree; in lp_matchtime() [all …]
|
/dports/print/tex-xetex/texlive-20150521-source/texk/web2c/luatexdir/luapeg/ |
H A D | lpeg.c | 1446 TTree *rule; in codegrammar() 1474 static int codeseq1 (CompileState *compst, TTree *p1, TTree *p2, in codeseq1() 2226 static void finalfix (lua_State *L, int postable, TTree *g, TTree *t) { in finalfix() 2511 static TTree *seqaux (TTree *tree, TTree *sib, int sibsize) { in seqaux() 2545 TTree *tree, *nd; in numtree() 2564 TTree *tree; in getpatt() 2708 TTree *tree; in lp_star() 2803 TTree *tree; in lp_behind() 2842 static TTree *auxemptycap (TTree *tree, int cap) { in auxemptycap() 2975 TTree *tree; in lp_matchtime() [all …]
|
/dports/math/vtk9/VTK-9.1.0/Common/ExecutionModel/ |
H A D | vtkSimpleScalarTree.cxx | 147 vtkScalarRange<double>* TTree; in BuildTree() local 149 this->Tree = TTree = new vtkScalarRange<double>[this->TreeSize]; in BuildTree() 152 TTree[i].min = VTK_DOUBLE_MAX; in BuildTree() 153 TTree[i].max = -VTK_DOUBLE_MAX; in BuildTree() 160 tree = TTree + offset + node; in BuildTree() 194 parent = TTree + parentOffset + node; in BuildTree() 197 tree = TTree + offset + leaf; in BuildTree() 223 vtkScalarRange<double>* TTree = static_cast<vtkScalarRange<double>*>(this->Tree); in InitTraversal() local 230 if (TTree[0].min > scalarValue || TTree[0].max < scalarValue) in InitTraversal() 382 vtkScalarRange<double>* TTree = static_cast<vtkScalarRange<double>*>(this->Tree); in GetNumberOfCellBatches() local [all …]
|