/dports/biology/phyml/phyml-3.3.20200621/src/ |
H A D | date.h | 37 void DATE_List_Of_Nodes_Younger_Than(t_node *a, t_node *d, phydbl lim, t_ll **list, t_tree *tree); 38 void DATE_List_Of_Nodes_And_Ancestors_Younger_Than(t_node *a, t_node *d, phydbl lim, t_ll **list, t… 39 t_ll *DATE_List_Of_Regraft_Nodes(t_node *prune, t_node *prune_daughter, phydbl *t_min, phydbl *t_ma…
|
H A D | utilities.h | 477 }t_ll; typedef 2337 void List_Of_Regraft_Nodes(t_node *a, t_node *d, phydbl time_thresh, t_ll *list, t_tree *tree); 2338 void Push_Bottom_Linked_List(void *what, t_ll **list, bool remove_duplicates); 2339 void Remove_From_Linked_List(t_ll *elem, void *val, t_ll **list); 2340 int Linked_List_Len(t_ll *list); 2341 void *Linked_List_Elem(int pos, t_ll *ll); 2343 t_ll *Get_List_Of_Reachable_Tips(t_node *a, t_node *d, t_tree *tree); 2344 void Get_List_Of_Reachable_Tips_Post(t_node *a, t_node *d, t_ll **list, t_tree *tree); 2345 phydbl Length_Of_Path_Between_List_Of_Tips(t_ll *tips0, t_ll *tips1, matrix *mat);
|
H A D | make.h | 80 t_ll *Make_Linked_List();
|
H A D | free.h | 91 void Free_Linked_List(t_ll *t);
|
H A D | init.h | 72 void Init_Linked_List(t_ll *list);
|
H A D | io.h | 28 void Print_List(t_ll *list);
|
H A D | date.c | 1120 void DATE_List_Of_Nodes_Younger_Than(t_node *a, t_node *d, phydbl lim, t_ll **list, t_tree *tree) in DATE_List_Of_Nodes_Younger_Than() 1147 void DATE_List_Of_Nodes_And_Ancestors_Younger_Than(t_node *a, t_node *d, phydbl lim, t_ll **list, t… in DATE_List_Of_Nodes_And_Ancestors_Younger_Than() 1177 t_ll *DATE_List_Of_Regraft_Nodes(t_node *prune, t_node *prune_daughter, phydbl *t_min, phydbl *t_ma… in DATE_List_Of_Regraft_Nodes() 1181 t_ll *out,*in,*ll; in DATE_List_Of_Regraft_Nodes()
|
H A D | make.c | 1694 t_ll *Make_Linked_List() in Make_Linked_List() 1696 t_ll *list; in Make_Linked_List() 1699 list = (t_ll *)mCalloc(1,sizeof(t_ll)); in Make_Linked_List()
|
H A D | free.c | 754 void Free_Linked_List(t_ll *t) in Free_Linked_List() 756 t_ll *next,*ll; in Free_Linked_List()
|
H A D | utilities.c | 11232 t_ll *loc; in Linked_List_Elem() 11272 int Linked_List_Len(t_ll *list) in Linked_List_Len() 11275 t_ll *loc; in Linked_List_Len() 11297 t_ll *new,*ll; in Push_Bottom_Linked_List() 11315 new = (t_ll *)mCalloc(1,sizeof(t_ll)); in Push_Bottom_Linked_List() 11526 void Remove_From_Linked_List(t_ll *elem, void *val, t_ll **list) in Remove_From_Linked_List() 11528 t_ll *ll; in Remove_From_Linked_List() 11543 t_ll *mm,*newhead; in Remove_From_Linked_List() 11594 t_ll *list; in Get_List_Of_Reachable_Tips() 11625 phydbl Length_Of_Path_Between_List_Of_Tips(t_ll *tips0, t_ll *tips1, matrix *mat) in Length_Of_Path_Between_List_Of_Tips() [all …]
|
H A D | spr.c | 460 t_ll *e_ll = tree->edge_list->head; in Test_All_Spr_Targets() 461 t_ll *n_ll = tree->node_list->head; in Test_All_Spr_Targets() 2105 t_ll *regraft_nd_list; in Prune_Regraft_Time_Tree()
|
H A D | slfv.c | 824 t_ll *ldsk_list,*dum_ll; in SLFV_Simulate_Forward_Core()
|
H A D | io.c | 3077 void Print_List(t_ll *list) in Print_List() 3079 t_ll *ll; in Print_List()
|
H A D | init.c | 3688 void Init_Linked_List(t_ll *list) in Init_Linked_List()
|
H A D | mcmc.c | 4843 t_ll *regraft_nd_list; in MCMC_Prune_Regraft() 5476 t_ll *regraft_nd_list; in MCMC_Prune_Regraft_Local()
|
/dports/cad/magic/magic-8.3.245/sim/ |
H A D | SimExtract.c | 299 Point t_ll; /* Lower-leftmost point of 'gate' region */ member 345 r1.r_ll = trans->t_ll;
|
/dports/audio/gnuspeechsa/gnuspeechsa-0.1.5/data/en/ |
H A D | MainDictionary | 7588 battle 'b_aa.t_ll%ab 9102 birtle 'b_er_r.t_ll%ca 45679 kirtle 'k_er_r.t_ll%a 47543 little 'l_i.t_ll%cda 48857 mantel 'm_aa_n.t_ll%a 51492 myrtle 'm_er_r.t_ll%a 51635 natal 'n_e_i.t_ll%c 56113 pintle 'p_i_n.t_ll%a 68776 title 't_ah_i.t_ll%ab 68959 tootle 't_uu.t_ll%b [all …]
|