/dports/net/freeswitch/freeswitch-1.10.3.-release/libs/sofia-sip/libsofia-sip-ua/su/sofia-sip/ |
H A D | rbtree.h | 148 dad = parent(node); assert(dad); \ 163 dad = parent(node); assert(dad); \ 406 for (dad = node; dad; dad = parent(dad)) \ 415 else for (dad = right(node); left(dad); dad = left(dad)) \ 418 kid = left(dad) ? left(dad) : right(dad); \ 437 left(parent(dad)) = dad; \ 439 right(parent(dad)) = dad; \ 444 parent(left(dad)) = dad; \ 447 parent(right(dad)) = dad; \ 480 for (dad = parent(node); dad && node == right(dad); dad = parent(node)) \ [all …]
|
/dports/net/sofia-sip/sofia-sip-1.13.4/libsofia-sip-ua/su/sofia-sip/ |
H A D | rbtree.h | 148 dad = parent(node); assert(dad); \ 163 dad = parent(node); assert(dad); \ 406 for (dad = node; dad; dad = parent(dad)) \ 415 else for (dad = right(node); left(dad); dad = left(dad)) \ 418 kid = left(dad) ? left(dad) : right(dad); \ 437 left(parent(dad)) = dad; \ 439 right(parent(dad)) = dad; \ 444 parent(left(dad)) = dad; \ 447 parent(right(dad)) = dad; \ 480 for (dad = parent(node); dad && node == right(dad); dad = parent(node)) \ [all …]
|
/dports/biology/iqtree/IQ-TREE-2.0.6/tree/ |
H A D | mtree.h | 277 int sortTaxa(Node *node = NULL, Node *dad = NULL); 287 Node *node = NULL, Node *dad = NULL); 343 void initializeTree(Node *node = NULL, Node* dad = NULL); 376 double treeDepth(Node *node = NULL, Node *dad = NULL); 400 int getNumTaxa(Node *node = NULL, Node *dad = NULL); 573 Node *node, Node* dad); 626 void assignLeafID(Node *node = NULL, Node *dad = NULL); 790 Node *findFirstTaxon(Node *node = NULL, Node *dad = NULL); 863 int freeNode(Node *node = NULL, Node *dad = NULL); 886 Node *node = NULL, Node *dad = NULL); [all …]
|
H A D | phylotree.h | 205 Node *node, *dad, *left_node, *right_node; member 301 PhyloNode *dad; variable 305 TraversalInfo(PhyloNeighbor *dad_branch, PhyloNode *dad) { in TraversalInfo() argument 306 this->dad = dad; in TraversalInfo() 629 void computeReversePartialParsimony(PhyloNode *node, PhyloNode *dad); 810 void sortNeighborBySubtreeSize(PhyloNode *node, PhyloNode *dad); 1788 PhyloNode *node = NULL, PhyloNode *dad = NULL); 1876 void reinsertLeaf(Node *leaf, Node *node, Node *dad); 1891 void randomizeNeighbors(Node *node = NULL, Node *dad = NULL); 2000 void assignLeafNames(Node *node = NULL, Node *dad = NULL); [all …]
|
/dports/dns/doc/doc-2.2.3/ |
H A D | doc | 200 set dad="." 202 set dad = $dad[1] ## sed variants do different things with p 254 cat DNsrv.${dad} > $dom.$dad.ns 278 if (("$dad" != ".") && ("$dad" != "")) then 281 set dad=`echo $dad | sed "s/[a-zA-Z0-9-]*.//p"` 283 set dad="." 285 set dad = $dad[1] ## sed variants do different things with p 299 echo "## Nameservers for $dad (dig ns $dad):" >> logXX.$dom 439 if (("$dad" != ".") && ("$dad" != "")) then 442 set dad=`echo $dad | sed "s/[a-zA-Z0-9-]*.//p"` [all …]
|
/dports/math/p5-AI-Genetic/AI-Genetic-0.05/Genetic/ |
H A D | OpCrossover.pm | 17 my ($prob, $mom, $dad) = @_; 25 @$dad[$ind .. $#{$dad}]); 26 my @c2 = (@$dad[0 .. $ind - 1], 27 @$mom[$ind .. $#{$dad}]); 41 my ($prob, $mom, $dad) = @_; 51 @$dad[$ind1 .. $ind2 - 1], 56 @$dad[$ind2 .. $#{$dad}]); 70 my ($prob, $mom, $dad) = @_; 75 for my $i (0 .. $#{$dad}) { 78 push @c2 => $dad->[$i]; [all …]
|
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/src/Common/ |
H A D | pack_array.c | 55 if (dad->size > 0){ in pack_double_array_desc() 57 send_int_array(dad->list, dad->size); in pack_double_array_desc() 58 send_int_array(dad->stat, dad->size); in pack_double_array_desc() 68 if (dad->size > 0){ in unpack_double_array_desc() 70 dad->list = (int *) malloc(dad->size * ISIZE); in unpack_double_array_desc() 71 receive_int_array(dad->list, dad->size); in unpack_double_array_desc() 73 dad->list = NULL; in unpack_double_array_desc() 75 dad->stat = (int *) malloc(dad->size * ISIZE); in unpack_double_array_desc() 76 receive_int_array(dad->stat, dad->size); in unpack_double_array_desc() 78 dad->list = NULL; in unpack_double_array_desc() [all …]
|
/dports/lang/racket/racket-8.3/share/pkgs/racklog/tests/ |
H A D | bible.rkt | 58 (define dad-kids-test 88 (define dad-kids-test-2 102 (define dad-kids-test-3 103 ;looks like dad-kids-test-2, but dad is now 115 (define dad-kids-test-4 121 (%let (dad kids x) 125 dad-kids))))) 130 (define dad-kids-test-5 134 ;each dad 136 (%let (dad kids x) [all …]
|
/dports/biology/sra-tools/sra-tools-2.11.0/ncbi-vdb/libs/vdb/ |
H A D | wcursor.c | 605 else if ( self -> dad . state > vcReady || self -> dad . start_id < self -> dad . end_id ) in VTableWriteCursorSetRowId() 693 self -> dad . end_id = self -> dad . row_id + 1; in VTableWriteCursorCommitRow() 767 if ( self -> dad . end_id >= self -> dad . row_id ) in VTableWriteCursorRepeatRow() 1069 pb . cnt = self -> dad . end_id - self -> dad . start_id; in VCursorFlushPageNoThread() 1073 self -> dad . start_id = self -> dad . end_id; in VCursorFlushPageNoThread() 1074 self -> dad . end_id = self -> dad . row_id + 1; in VCursorFlushPageNoThread() 1154 self -> dad . start_id = self -> dad . end_id; in VCursorFlushPageThread() 1155 self -> dad . end_id = self -> dad . row_id + 1; in VCursorFlushPageThread() 1236 if ( self -> dad . start_id == self -> dad . end_id ) in VCursorFlushPageInt() 1241 assert ( self -> dad . end_id == self -> dad . row_id ); in VCursorFlushPageInt() [all …]
|
/dports/biology/ncbi-vdb/ncbi-vdb-2.11.0/libs/vdb/ |
H A D | wcursor.c | 605 else if ( self -> dad . state > vcReady || self -> dad . start_id < self -> dad . end_id ) in VTableWriteCursorSetRowId() 693 self -> dad . end_id = self -> dad . row_id + 1; in VTableWriteCursorCommitRow() 767 if ( self -> dad . end_id >= self -> dad . row_id ) in VTableWriteCursorRepeatRow() 1069 pb . cnt = self -> dad . end_id - self -> dad . start_id; in VCursorFlushPageNoThread() 1073 self -> dad . start_id = self -> dad . end_id; in VCursorFlushPageNoThread() 1074 self -> dad . end_id = self -> dad . row_id + 1; in VCursorFlushPageNoThread() 1154 self -> dad . start_id = self -> dad . end_id; in VCursorFlushPageThread() 1155 self -> dad . end_id = self -> dad . row_id + 1; in VCursorFlushPageThread() 1236 if ( self -> dad . start_id == self -> dad . end_id ) in VCursorFlushPageInt() 1241 assert ( self -> dad . end_id == self -> dad . row_id ); in VCursorFlushPageInt() [all …]
|
/dports/biology/sra-tools/sra-tools-2.11.0/ncbi-vdb/libs/krypto/ |
H A D | cipher-vec.c | 62 KCipher dad; member 183 memmove (self->dad.encrypt_ivec, ivec, self->dad.block_size); in CMEMBER() 196 memmove (self->dad.decrypt_ivec, ivec, self->dad.block_size); in CMEMBER() 355 (pin += self->dad.block_size), (pout += self->dad.block_size)) in CMEMBER() 371 (pin += self->dad.block_size), (pout += self->dad.block_size)) in CMEMBER() 401 (pin += self->dad.block_size), (pout += self->dad.block_size)) in CMEMBER() 431 (pin += self->dad.block_size), (pout += self->dad.block_size)) in CMEMBER() 470 (pin += self->dad.block_size), (pout += self->dad.block_size)) in CMEMBER() 503 (pin += self->dad.block_size), (pout += self->dad.block_size)) in CMEMBER() 695 KCipher * dad = &self->dad; in CMEMBER() local [all …]
|
H A D | cipher-byte.c | 58 KCipher dad; member 125 memmove (self->dad.encrypt_ivec, ivec, self->dad.block_size); in MEMBER() 137 memmove (self->dad.decrypt_ivec, ivec, self->dad.block_size); in MEMBER() 281 memmove (block, self->dad.encrypt_ivec, self->dad.block_size); in MEMBER() 298 memmove (self->dad.encrypt_ivec, block, self->dad.block_size); in MEMBER() 327 memmove (ivec, self->dad.decrypt_ivec, self->dad.block_size); in MEMBER() 344 memmove (self->dad.decrypt_ivec, ivec, self->dad.block_size); in MEMBER() 462 KCipher * dad = &self->dad; in MEMBER() local 471 dad->decrypt_key = ((uint8_t *)dad->encrypt_key) + key_size; in MEMBER() 472 dad->encrypt_ivec = ((uint8_t *)dad->decrypt_key) + key_size; in MEMBER() [all …]
|
/dports/biology/ncbi-vdb/ncbi-vdb-2.11.0/libs/krypto/ |
H A D | cipher-vec.c | 62 KCipher dad; member 183 memmove (self->dad.encrypt_ivec, ivec, self->dad.block_size); in CMEMBER() 196 memmove (self->dad.decrypt_ivec, ivec, self->dad.block_size); in CMEMBER() 355 (pin += self->dad.block_size), (pout += self->dad.block_size)) in CMEMBER() 371 (pin += self->dad.block_size), (pout += self->dad.block_size)) in CMEMBER() 401 (pin += self->dad.block_size), (pout += self->dad.block_size)) in CMEMBER() 431 (pin += self->dad.block_size), (pout += self->dad.block_size)) in CMEMBER() 470 (pin += self->dad.block_size), (pout += self->dad.block_size)) in CMEMBER() 503 (pin += self->dad.block_size), (pout += self->dad.block_size)) in CMEMBER() 695 KCipher * dad = &self->dad; in CMEMBER() local [all …]
|
H A D | cipher-byte.c | 58 KCipher dad; member 125 memmove (self->dad.encrypt_ivec, ivec, self->dad.block_size); in MEMBER() 137 memmove (self->dad.decrypt_ivec, ivec, self->dad.block_size); in MEMBER() 281 memmove (block, self->dad.encrypt_ivec, self->dad.block_size); in MEMBER() 298 memmove (self->dad.encrypt_ivec, block, self->dad.block_size); in MEMBER() 327 memmove (ivec, self->dad.decrypt_ivec, self->dad.block_size); in MEMBER() 344 memmove (self->dad.decrypt_ivec, ivec, self->dad.block_size); in MEMBER() 462 KCipher * dad = &self->dad; in MEMBER() local 471 dad->decrypt_key = ((uint8_t *)dad->encrypt_key) + key_size; in MEMBER() 472 dad->encrypt_ivec = ((uint8_t *)dad->decrypt_key) + key_size; in MEMBER() [all …]
|
/dports/net/freeswitch/freeswitch-1.10.3.-release/libs/sofia-sip/libsofia-sip-ua/url/ |
H A D | urlmap.c | 143 dad = um->um_dad; assert(dad); in red_black_balance_insert() 160 dad = um->um_dad; assert(dad); in red_black_balance_insert() 389 for (dad = um; dad; dad = dad->um_dad) in url_map_remove() 400 else for (dad = um->um_right; dad->um_left; dad = dad->um_left) in url_map_remove() 403 kid = dad->um_left ? dad->um_left : dad->um_right; in url_map_remove() 422 dad->um_dad->um_left = dad; in url_map_remove() 424 dad->um_dad->um_right = dad; in url_map_remove() 429 dad->um_left->um_dad = dad; in url_map_remove() 432 dad->um_right->um_dad = dad; in url_map_remove() 459 for (dad = um->um_dad; dad && um == dad->um_right; dad = um->um_dad) in url_map_succ() [all …]
|
/dports/net/sofia-sip/sofia-sip-1.13.4/libsofia-sip-ua/url/ |
H A D | urlmap.c | 143 dad = um->um_dad; assert(dad); in red_black_balance_insert() 160 dad = um->um_dad; assert(dad); in red_black_balance_insert() 389 for (dad = um; dad; dad = dad->um_dad) in url_map_remove() 400 else for (dad = um->um_right; dad->um_left; dad = dad->um_left) in url_map_remove() 403 kid = dad->um_left ? dad->um_left : dad->um_right; in url_map_remove() 422 dad->um_dad->um_left = dad; in url_map_remove() 424 dad->um_dad->um_right = dad; in url_map_remove() 429 dad->um_left->um_dad = dad; in url_map_remove() 432 dad->um_right->um_dad = dad; in url_map_remove() 459 for (dad = um->um_dad; dad && um == dad->um_right; dad = um->um_dad) in url_map_succ() [all …]
|
/dports/devel/libsmpp34/libsmpp34-1.10/test_pdu/ |
H A D | submit_multi_test.c | 48 dad_t dad; in main() local 53 memset(&dad, 0, sizeof(dad_t)); in main() 69 dad.value.sme.dest_addr_ton = 0; in main() 70 dad.value.sme.dest_addr_npi = 0; in main() 71 snprintf((char*)dad.value.sme.destination_addr, in main() 73 build_dad( &(b.dest_addr_def), &dad ); in main() 76 snprintf((char*)dad.value.dl_name, sizeof(dad.value.dl_name),"%s","list_name_01"); in main() 77 build_dad( &(b.dest_addr_def), &dad ); in main() 80 dad.value.sme.dest_addr_ton = 2; in main() 81 dad.value.sme.dest_addr_npi = 1; in main() [all …]
|
/dports/editors/biew/biew-610/tools/lzss/ |
H A D | lzssutil.c | 91 dad[r] = dad[p]; lson[r] = lson[p]; rson[r] = rson[p]; in InsertNode() 92 dad[lson[p]] = r; dad[rson[p]] = r; in InsertNode() 93 if (rson[dad[p]] == p) rson[dad[p]] = r; in InsertNode() 110 rson[dad[q]] = lson[q]; dad[lson[q]] = dad[q]; in DeleteNode() 115 dad[q] = dad[p]; in DeleteNode() 116 if (rson[dad[p]] == p) rson[dad[p]] = q; else lson[dad[p]] = q; in DeleteNode() 117 dad[p] = NIL; in DeleteNode() 141 if(dad) PFREE(dad); in Encode() 233 PFREE(dad); in Encode() 272 if(dad) PFREE(dad); in Decode() [all …]
|
/dports/biology/sra-tools/sra-tools-2.11.0/tools/sra-sort/ |
H A D | csra-tbl.c | 68 TablePairDestroy ( & self -> dad, ctx ); in cSRATblPairWhack() 451 pt = & self -> dad . thread; in cSRATblPairPostCopyAlign() 564 TRY ( TablePairExplode ( & self -> dad, ctx ) ) in cSRATblPairPreExplodeSeq() 570 self -> dad . last_excl - self -> dad . first_id ) ) in cSRATblPairPreExplodeSeq() 627 MetaPair *meta = self -> dad . meta; in cSRATblPairPostCopySeq() 731 tbl -> dad . exclude_col_names = exclude_cols; in cSRATblPairMakeRef() 734 return & tbl -> dad; in cSRATblPairMakeRef() 762 return & tbl -> dad; in cSRATblPairMakeAlign() 792 tbl -> dad . large_col_names = large_cols; in cSRATblPairMakeSeq() 793 tbl -> dad . exclude_meta = exclude_meta; in cSRATblPairMakeSeq() [all …]
|
/dports/games/freedink-data/freedink-data-1.08.20170409/dink/Story/ |
H A D | S4-H2.c | 23 int &dad; in main() local 35 &dad = create_sprite(405, 148, 0, 0, 0); in main() 36 &temp4hold = &dad; in main() 37 sp_brain(&dad, 16); in main() 38 sp_base_walk(&dad, 410); in main() 39 sp_speed(&dad, 1); in main() 40 sp_timing(&dad, 0); in main() 42 sp_pseq(&dad, 411); in main() 43 sp_pframe(&dad, 1); in main() 44 sp_script(&dad, "s4-h2p2"); in main() [all …]
|
/dports/graphics/leptonica/leptonica-1.76.0/src/ |
H A D | dnafunc1.c | 79 l_dnaJoin(L_DNA *dad, in l_dnaJoin() argument 89 if (!dad) in l_dnaJoin() 128 L_DNA *da, *dad; in l_dnaaFlattenToDna() local 145 return dad; in l_dnaaFlattenToDna() 229 L_DNA *da3, *dad; in l_dnaUnionByAset() local 245 return dad; in l_dnaUnionByAset() 260 L_DNA *dad; in l_dnaRemoveDupsByAset() local 282 return dad; in l_dnaRemoveDupsByAset() 339 return dad; in l_dnaIntersectionByAset() 388 L_DNA *dad; in l_dnaDiffAdjValues() local [all …]
|
/dports/games/quake2-lights/quake2-lights-1/lights/src/ace/ |
H A D | acebot_compress.c | 53 for (i = 0; i < N; i++) dad[i] = NIL; in InitTree() 84 dad[r] = dad[p]; lson[r] = lson[p]; rson[r] = rson[p]; in InsertNode() 85 dad[lson[p]] = r; dad[rson[p]] = r; in InsertNode() 86 if (rson[dad[p]] == p) rson[dad[p]] = r; in InsertNode() 88 dad[p] = NIL; /* remove p */ in InsertNode() 102 rson[dad[q]] = lson[q]; dad[lson[q]] = dad[q]; in DeleteNode() 103 lson[q] = lson[p]; dad[lson[p]] = q; in DeleteNode() 105 rson[q] = rson[p]; dad[rson[p]] = q; in DeleteNode() 107 dad[q] = dad[p]; in DeleteNode() 108 if (rson[dad[p]] == p) rson[dad[p]] = q; else lson[dad[p]] = q; in DeleteNode() [all …]
|
/dports/games/qudos/QuDos-0.40.1-src/src/mods/xatrix/ace/ |
H A D | acebot_compress.c | 52 for (i = 0; i < N; i++) dad[i] = NIL; in InitTree() 83 dad[r] = dad[p]; lson[r] = lson[p]; rson[r] = rson[p]; in InsertNode() 84 dad[lson[p]] = r; dad[rson[p]] = r; in InsertNode() 85 if (rson[dad[p]] == p) rson[dad[p]] = r; in InsertNode() 87 dad[p] = NIL; /* remove p */ in InsertNode() 101 rson[dad[q]] = lson[q]; dad[lson[q]] = dad[q]; in DeleteNode() 102 lson[q] = lson[p]; dad[lson[p]] = q; in DeleteNode() 104 rson[q] = rson[p]; dad[rson[p]] = q; in DeleteNode() 106 dad[q] = dad[p]; in DeleteNode() 107 if (rson[dad[p]] == p) rson[dad[p]] = q; else lson[dad[p]] = q; in DeleteNode() [all …]
|
/dports/games/qudos/QuDos-0.40.1-src/src/mods/zaero/ace/ |
H A D | acebot_compress.c | 52 for (i = 0; i < N; i++) dad[i] = NIL; in InitTree() 83 dad[r] = dad[p]; lson[r] = lson[p]; rson[r] = rson[p]; in InsertNode() 84 dad[lson[p]] = r; dad[rson[p]] = r; in InsertNode() 85 if (rson[dad[p]] == p) rson[dad[p]] = r; in InsertNode() 87 dad[p] = NIL; /* remove p */ in InsertNode() 101 rson[dad[q]] = lson[q]; dad[lson[q]] = dad[q]; in DeleteNode() 102 lson[q] = lson[p]; dad[lson[p]] = q; in DeleteNode() 104 rson[q] = rson[p]; dad[rson[p]] = q; in DeleteNode() 106 dad[q] = dad[p]; in DeleteNode() 107 if (rson[dad[p]] == p) rson[dad[p]] = q; else lson[dad[p]] = q; in DeleteNode() [all …]
|
/dports/games/qudos/QuDos-0.40.1-src/src/mods/rogue/ace/ |
H A D | acebot_compress.c | 52 for (i = 0; i < N; i++) dad[i] = NIL; in InitTree() 83 dad[r] = dad[p]; lson[r] = lson[p]; rson[r] = rson[p]; in InsertNode() 84 dad[lson[p]] = r; dad[rson[p]] = r; in InsertNode() 85 if (rson[dad[p]] == p) rson[dad[p]] = r; in InsertNode() 87 dad[p] = NIL; /* remove p */ in InsertNode() 101 rson[dad[q]] = lson[q]; dad[lson[q]] = dad[q]; in DeleteNode() 102 lson[q] = lson[p]; dad[lson[p]] = q; in DeleteNode() 104 rson[q] = rson[p]; dad[rson[p]] = q; in DeleteNode() 106 dad[q] = dad[p]; in DeleteNode() 107 if (rson[dad[p]] == p) rson[dad[p]] = q; else lson[dad[p]] = q; in DeleteNode() [all …]
|