Home
last modified time | relevance | path

Searched refs:father (Results 1 – 25 of 4711) sorted by relevance

12345678910>>...189

/dports/devel/gaul/gaul-devel-0.1849-0/src/
H A Dga_crossover.c54 if (!father || !mother || !son || !daughter) in ga_singlepoint_crossover_integer_chromosome()
86 if (!father || !mother || !son || !daughter) in ga_doublepoint_crossover_integer_chromosome()
103 memcpy(son, father, location1*sizeof(int)); in ga_doublepoint_crossover_integer_chromosome()
132 if (!father || !mother || !son || !daughter) in ga_crossover_integer_singlepoints()
164 if (!father || !mother || !son || !daughter) in ga_crossover_integer_doublepoints()
206 ga_copy_data(pop, son, father, i); in ga_crossover_integer_mixing()
213 ga_copy_data(pop, daughter, father, i); in ga_crossover_integer_mixing()
475 ga_copy_data(pop, son, father, i); in ga_crossover_boolean_mixing()
561 ga_copy_data(pop, son, father, i); in ga_crossover_char_mixing()
649 ga_copy_data(pop, son, father, i); in ga_crossover_double_mixing()
[all …]
H A Dga_mutate.c55 if (!father || !son) die("Null pointer to entity structure passed"); in ga_mutate_integer_singlepoint_drift()
69 ga_copy_data(pop, son, father, i); in ga_mutate_integer_singlepoint_drift()
120 ga_copy_data(pop, son, father, i); in ga_mutate_integer_singlepoint_randomize()
271 ga_copy_data(pop, son, father, i); in ga_mutate_boolean_singlepoint()
358 ga_copy_data(pop, son, father, i); in ga_mutate_char_singlepoint_drift()
467 ga_copy_data(pop, son, father, i); in ga_mutate_char_singlepoint_randomize()
563 ga_copy_data(pop, son, father, i); in ga_mutate_printable_singlepoint_drift()
614 ga_copy_data(pop, son, father, i); in ga_mutate_printable_singlepoint_randomize()
767 ga_copy_data(pop, son, father, i); in ga_mutate_bitstring_singlepoint()
855 ga_copy_data(pop, son, father, i); in ga_mutate_double_singlepoint_drift()
[all …]
H A Dgaul.h363 entity *father, entity *mother,
369 entity *father, entity *mother,
372 entity *father, entity *mother,
375 entity *father, entity *mother,
379 entity *father, entity *mother,
382 entity *father, entity *mother,
385 entity *father, entity *mother,
390 entity *father, entity *mother,
396 entity *father, entity *mother,
420 entity *father, entity *son );
[all …]
/dports/databases/grass7/grass-7.8.6/raster/r.li/r.li.daemon/
H A Davl.c313 s->father = r->father; in avl_rotation_ll()
324 r->father = s; in avl_rotation_ll()
328 b->father = r; in avl_rotation_ll()
338 s->father = r->father; in avl_rotation_rr()
353 b->father = r; in avl_rotation_rr()
365 t->father = r->father; in avl_rotation_lr()
386 b->father = s; in avl_rotation_lr()
388 g->father = r; in avl_rotation_lr()
400 t->father = r->father; in avl_rotation_rl()
421 b->father = r; in avl_rotation_rl()
[all …]
H A DavlID.c290 s->father = r->father; in avlID_rotation_ll()
301 r->father = s; in avlID_rotation_ll()
305 b->father = r; in avlID_rotation_ll()
315 s->father = r->father; in avlID_rotation_rr()
330 b->father = r; in avlID_rotation_rr()
342 t->father = r->father; in avlID_rotation_lr()
363 b->father = s; in avlID_rotation_lr()
365 g->father = r; in avlID_rotation_lr()
377 t->father = r->father; in avlID_rotation_rl()
398 b->father = r; in avlID_rotation_rl()
[all …]
/dports/biology/viennarna/ViennaRNA-2.4.18/src/Cluster/
H A Dtreeplot.c136 Node *father; in W2Phylo() local
154 father->size = father->left->size+father->right->size; in W2Phylo()
157 father->left->father = father; in W2Phylo()
158 father->right->father = father; in W2Phylo()
162 father->whoami = -1; in W2Phylo()
164 return father; in W2Phylo()
197 Node *father; in Nj2Phylo() local
235 father->size = father->left->size + father->right->size; in Nj2Phylo()
236 father->left->father = father; in Nj2Phylo()
237 father->right->father = father; in Nj2Phylo()
[all …]
/dports/math/dune-fem/dune-fem-d1c625e6d51167d0cce57de6adcef21f548a8f82/dune/fem/space/common/
H A Dadaptcallbackhandle.hh122 void preCoarsening ( const Entity &father ) const in preCoarsening()
124 if( isValidEntity( father ) ) in preCoarsening()
129 const int childLevel = father.level() + 1; in preCoarsening()
133 restrictLocal( father, *it, initialize ); in preCoarsening()
136 rpOp_.restrictFinalize( father ); in preCoarsening()
142 if( isValidEntity( father ) ) in restrictLocal()
150 void postRefinement ( const Entity &father ) const in postRefinement()
152 if( isValidEntity( father ) ) in postRefinement()
157 const int childLevel = father.level() + 1; in postRefinement()
161 prolongLocal( father, *it, initialize ); in postRefinement()
[all …]
H A Drestrictprolonginterface.hh83 void restrictLocal ( const Entity &father, const Entity &son, in restrictLocal() argument
92 void restrictFinalize(const Entity &father) const in restrictFinalize()
106 void prolongLocal ( const Entity &father, const Entity &son, in prolongLocal() argument
178 return (indexSet.index( father ) == indexSet.index( son )); in entitiesAreCopies()
191 void restrictFinalize( const Entity& father ) const {} in restrictFinalize()
261 assert( !father.isLeaf() ); in restrictLocal()
283 targetLf_.bind( father ); in restrictLocal()
287 assert( father == targetLf_.entity() ); in restrictLocal()
293 void restrictFinalize(const Entity &father) const in restrictFinalize()
309 assert( !father.isLeaf() ); in prolongLocal()
[all …]
/dports/math/gecode/gecode-0916a1a/contribs/qecode/
H A DWorkManager.cc191 if (father.isDummy() && (father.id() != S.id())) { in returnWork()
222 father.detach(i); in returnWork()
231 father.attach(ret); in returnWork()
237 father.attach(ret); in returnWork()
245 updateFalse(father); in returnWork()
249 updateFalse(father); in returnWork()
292 father.detach(father.degree()-1); in updateTrue()
294 father.attach(s); in updateTrue()
296 updateTrue(father); in updateTrue()
327 father.detach(father.degree()-1); in updateFalse()
[all …]
/dports/math/dune-grid/dune-grid-de36e4b4e99da4cd7a120a39779345e701821115/dune/grid/common/
H A Dadaptcallback.hh52 void preCoarsening ( const Entity &father ) in preCoarsening() argument
54 asImp().preCoarsening( father ); in preCoarsening()
62 void postRefinement ( const Entity &father ) in postRefinement() argument
64 asImp().postRefinement( father ); in postRefinement()
74 asImp().prolongLocal( father, son, initialize ); in prolongLocal()
105 void preCoarsening ( const Entity &father );
106 void postRefinement ( const Entity &father );
129 _a.restrictLocal(father,son,initialize); in restrictLocal()
130 _b.restrictLocal(father,son,initialize); in restrictLocal()
137 _a.prolongLocal(father,son,initialize); in prolongLocal()
[all …]
/dports/security/p5-Net-SAML/zxid-1.42/
H A Dzxlib.c257 if (father) { in zx_ref_len_attr()
283 if (father) { in zx_new_len_attr()
437 if (father) { in zx_add_kid()
459 for (father = father->kids; in zx_add_kid_before()
460 father->g.n && father->g.n->tok != before; in zx_add_kid_before()
461 father = (struct zx_elem_s*)father->g.n) ; in zx_add_kid_before()
476 father = father->kids; in zx_add_kid_after_sa_Issuer()
499 for (father = father->kids; in zx_replace_kid()
500 father->g.n && father->g.n->tok != kid->g.tok; in zx_replace_kid()
501 father = (struct zx_elem_s*)father->g.n) ; in zx_replace_kid()
[all …]
/dports/math/SCIP/scip-7.0.3/examples/VRP/src/
H A Dpqueue.h57 father(NULL) in node()
88 node* father; variable
229 for (node* n = item, *f = n->father; f != NULL; n = f, f = n->father) in remove()
241 if ( item->father ) in remove()
344 n1->father = n1_father->father; in swap_with_father()
345 n1_father->father = n1; in swap_with_father()
348 n1->left-> father = n1; in swap_with_father()
350 n1->right->father = n1; in swap_with_father()
355 if ( n1->father ) in swap_with_father()
358 n1->father->left = n1; in swap_with_father()
[all …]
/dports/games/gogui/gogui-1.4.10/test/junit/src/net/sf/gogui/game/
H A DNodeTest.java52 Node father = new Node(); in testIsChildOf() local
56 father.append(child1); in testIsChildOf()
58 father.append(child2); in testIsChildOf()
65 Node father = new Node(); in testMakeFirstChild() local
68 father.append(child1); in testMakeFirstChild()
69 father.append(child2); in testMakeFirstChild()
77 Node father = new Node(); in testRemoveChild() local
81 father.append(child1); in testRemoveChild()
85 father.append(child1); in testRemoveChild()
86 father.append(child2); in testRemoveChild()
[all …]
/dports/databases/p5-DBIx-Class/DBIx-Class-0.082842/t/sqlmaker/
H A Dlegacy_joins.t16 [ { father => 'person' }, { 'father.person_id' => 'child.father_id' }, ],
19 my $match = 'person child JOIN person father ON ( father.person_id = '
32 [ { father => 'person' },
33 { 'father.person_id' => 'child.father_id' }
39 $match = 'person mother JOIN (person child JOIN person father ON ('
40 . ' father.person_id = child.father_id )) ON ( mother.person_id = '
51 [ { father => 'person', -join_type => 'inner' }, { 'father.person_id' => 'child.father_id' }, ],
54 $match = 'person child INNER JOIN person father ON ( father.person_id = '
69 { 'father.person_id' => 'child.father_id' }
87 [ { father => 'person' }, { 'father.person_id' => \'!= child.father_id' }, ],
[all …]
/dports/misc/vxl/vxl-3.3.2/contrib/prip/vmap/
H A Dvbl_controlled_partition.cxx16 elements_[i].father=i; in initialise()
26 elements_[i].father=arg.elements_[i].father ; in operator =()
37 while (tmp1!=elements_[tmp1].father) in set_as_representative()
39 int tmp2 = elements_[tmp1].father ; in set_as_representative()
40 elements_[tmp1].father=i ; in set_as_representative()
43 elements_[tmp1].father=i ; in set_as_representative()
50 while (tmp1!=elements_[tmp1].father) in representative()
52 tmp1=elements_[tmp1].father ; in representative()
55 while (tmp2!=elements_[tmp2].father) in representative()
57 int tmp3 = elements_[tmp2].father ; in representative()
[all …]
/dports/audio/musicpd/mpd-0.23.6/src/lib/upnp/
H A DUtil.cxx48 std::string father = s; in path_getfather() local
51 if (father.empty()) in path_getfather()
54 if (father.back() == '/') { in path_getfather()
56 if (father.length() == 1) in path_getfather()
57 return father; in path_getfather()
58 father.erase(father.length()-1); in path_getfather()
61 auto slp = father.rfind('/'); in path_getfather()
65 father.erase(slp); in path_getfather()
66 path_catslash(father); in path_getfather()
67 return father; in path_getfather()
/dports/math/dune-grid/dune-grid-de36e4b4e99da4cd7a120a39779345e701821115/dune/grid/test/
H A Dcheckgeometryinfather.hh62 Entity father = eIt->father(); in checkGeometryInFather() local
65 checkGeometry( father.geometry() ); in checkGeometryInFather()
67 while ( father.hasFather() ) in checkGeometryInFather()
69 if( father.level() == 0 ) in checkGeometryInFather()
71 Entity grandPa = father.father(); in checkGeometryInFather()
83 if( father != *sons ) in checkGeometryInFather()
94 father = grandPa; in checkGeometryInFather()
113 Entity father = sons->father(); in checkGeometryInFather() local
115 while ( father.hasFather() ) in checkGeometryInFather()
117 father = father.father(); in checkGeometryInFather()
[all …]
/dports/editors/calligraplan/calligraplan-3.3.0/src/plugins/schedulers/rcps/3rdparty/LibRCPS/src/
H A Dops.c24 son[i] = father[i]; in sched_crossover()
25 done[father[i]] = 1; in sched_crossover()
42 if (!done[father[i]]) { in sched_crossover()
76 son[i] = father[i]; in sched_crossover2()
77 done[father[i]] = 1; in sched_crossover2()
95 son[i] = father[j]; in sched_crossover2()
96 done[father[j]] = 1; in sched_crossover2()
112 done[father[j]] = 1; in sched_crossover2()
178 son[j] = father[j]; in crossover()
200 son[j] = father[j]; in crossover2()
[all …]
/dports/biology/viennarna/ViennaRNA-2.4.18/src/RNAlocmin/
H A Dbarrier_tree.cpp40 void union_set(int father, int child) { in union_set() argument
42 u = find(father); in union_set()
61 if (nodes[i].father == -1) return i; in findfather()
119 int father = min(i, j); in make_tree() local
128 if (it->first == child) nodes[it->second].father = father; in make_tree()
135 nodes[child].father = father; in make_tree()
142 union_set(father, child); in make_tree()
157 int old_father = nodes[child].father; in add_father()
164 nodes[child].father = father; in add_father()
166 nodes[father].children.insert(child); in add_father()
[all …]
/dports/math/hipmcl/azadcse-hipmcl-e20476acc473/src/
H A DCC.h89 FullyDistVec<IT, IT> grandfather = father(father); // find grandparents in StarCheck()
93 grandfather.EWiseOut(father, in StarCheck()
171 father.Set(finalhooks); in ConditionalHook()
214 father.Set(finalhooks); in UnconditionalHook()
220 FullyDistVec<IT, IT> grandfather = father(father); in Shortcut()
264 cclabel = father; in LabelCC()
269 cclabel = cclabel(father); in LabelCC()
289 ConditionalHook(A, father); in CC()
290 UnconditionalHook(A, father); in CC()
291 Shortcut(father); in CC()
[all …]
/dports/math/combblas/CombBLAS_beta_16_2/Applications/
H A DCC.h89 FullyDistVec<IT, IT> grandfather = father(father); // find grandparents in StarCheck()
93 grandfather.EWiseOut(father, in StarCheck()
171 father.Set(finalhooks); in ConditionalHook()
214 father.Set(finalhooks); in UnconditionalHook()
220 FullyDistVec<IT, IT> grandfather = father(father); in Shortcut()
264 cclabel = father; in LabelCC()
269 cclabel = cclabel(father); in LabelCC()
289 ConditionalHook(A, father); in CC()
290 UnconditionalHook(A, father); in CC()
291 Shortcut(father); in CC()
[all …]
/dports/math/igraph/igraph-0.9.5/src/paths/
H A Dunweighted.c280 long int *father; in igraph_get_shortest_paths() local
311 if (father == 0) { in igraph_get_shortest_paths()
314 IGRAPH_FINALLY(igraph_free, father); in igraph_get_shortest_paths()
343 if (father[ (long int) from ] < 0) { in igraph_get_shortest_paths()
346 father[ (long int)from ] = 1; in igraph_get_shortest_paths()
356 if (father[neighbor] > 0) { in igraph_get_shortest_paths()
361 father[neighbor] = edge + 2; in igraph_get_shortest_paths()
375 if (father[i] <= 0) { in igraph_get_shortest_paths()
393 if (father[i] <= 1) { in igraph_get_shortest_paths()
421 if (father[node] > 0) { in igraph_get_shortest_paths()
[all …]
/dports/biology/bamutil/bamUtil-1.0.15/libStatGen/general/
H A DPedigreeTrim.cpp101 if (discardable[p.father->traverse]) in Trim()
111 int father = p.father->traverse; in Trim() local
114 if (mates[father] == -1 && mates[mother] == -1) in Trim()
116 mates[father] = mother, in Trim()
117 mates[mother] = father; in Trim()
119 else if (mates[father] != mother) in Trim()
121 if (mates[father] >= 0) in Trim()
122 mates[mates[father]] = -2; in Trim()
128 mates[father] = -2; in Trim()
131 offspring[father]++; in Trim()
[all …]
/dports/math/dune-fem/dune-fem-d1c625e6d51167d0cce57de6adcef21f548a8f82/dune/fempy/grid/
H A Dvirtualizedrestrictprolong.hh46 …virtual void restrictLocal ( const Element &father, const Element &child, bool initialize ) const …
47 virtual void restrictFinalize ( const Element &father ) const = 0;
48 …virtual void prolongLocal ( const Element &father, const Element &child, bool initialize ) const =…
73 …estrictLocal ( const Element &father, const Element &child, bool initialize ) const override { imp… in restrictLocal()
74 …virtual void restrictFinalize ( const Element &father ) const override { impl().restrictFinalize( in restrictFinalize()
75 …prolongLocal ( const Element &father, const Element &child, bool initialize ) const override { imp… in prolongLocal()
104 …id restrictLocal ( const Element &father, const Element &child, bool initialize ) const { impl_->r… in restrictLocal()
105 void restrictFinalize ( const Element &father ) const { impl_->restrictFinalize( father ); } in restrictFinalize()
106 …void prolongLocal ( const Element &father, const Element &child, bool initialize ) const { impl_->… in prolongLocal()
/dports/lang/yap/yap-6.2.2/packages/pyswip/
H A DREADME37 >>> prolog.assertz("father(michael,john)")
38 >>> prolog.assertz("father(michael,gina)")
39 >>> list(prolog.query("father(michael,X)"))
44 michael is the father of john
45 michael is the father of gina
61 prolog.assertz("father(michael,john)")
62 prolog.assertz("father(michael,gina)")
77 father = Functor("father", 2)
79 call(assertz(father("michael","john")))
80 call(assertz(father("michael","gina")))
[all …]

12345678910>>...189