Home
last modified time | relevance | path

Searched refs:schild (Results 1 – 25 of 313) sorted by relevance

12345678910>>...13

/dports/textproc/p5-PPI/PPI-1.270/t/
H A Dppi_lexer.t66 isa_ok( $statements[0]->schild(2), 'PPI::Structure::Constructor',
70 isa_ok( $statements[2]->schild(2), 'PPI::Structure::Subscript',
72 isa_ok( $statements[3]->schild(2), 'PPI::Structure::Subscript',
74 isa_ok( $statements[4]->schild(1), 'PPI::Structure::Subscript',
76 isa_ok( $statements[5]->schild(1), 'PPI::Structure::Block',
78 isa_ok( $statements[6]->schild(1), 'PPI::Structure::Block',
80 isa_ok( $statements[7]->schild(1), 'PPI::Structure::Block',
82 isa_ok( $statements[8]->schild(1), 'PPI::Structure::Block',
84 isa_ok( $statements[9]->schild(1), 'PPI::Structure::Block',
94 isa_ok( $statements[14]->schild(0), 'PPI::Structure::Block',
[all …]
H A Dppi_statement_package.t139 isa_ok( $Document->schild(0), 'PPI::Statement::Package', "entire code" );
142 my $got_tokens = [ map { [ ref $_, "$_" ] } $Document->schild(0)->schildren ];
146 isa_ok( $Document->schild(1), 'PPI::Statement', "code prior statement end recognized" );
147 isa_ok( eval { $Document->schild(1)->schild(0) }, 'PPI::Token::Number', "inner code" );
148 is( eval { $Document->schild(1)->schild(0) }, '999', "number correct" );
H A Dppi_statement_include.t269 isa_ok( $Document->schild(0), 'PPI::Statement::Include', $code );
281 my $got_tokens = [ map { [ ref $_, "$_" ] } $Document->schild(0)->schildren() ];
288 isa_ok( $Document->schild(1), 'PPI::Statement', "$code prior statement end recognized" );
289 isa_ok( eval { $Document->schild(1)->schild(0) }, 'PPI::Token::Number', $code );
290 is( eval { $Document->schild(1)->schild(0) }, '999', "$code number correct" );
H A Dppi_statement_sub.t279 isa_ok( $Document->schild(0), 'PPI::Statement::Sub', "entire code" );
281 my $got_tokens = [ map { [ ref $_, "$_" ] } $Document->schild(0)->schildren ];
285 isa_ok( $Document->schild(1), 'PPI::Statement', "prior statement end recognized" );
286 isa_ok( eval { $Document->schild(1)->schild(0) }, 'PPI::Token::Number', "inner code" );
287 is( eval { $Document->schild(1)->schild(0) }, '999', "number correct" );
/dports/textproc/p5-PPI/PPI-1.270/lib/PPI/Statement/
H A DVariable.pm65 my @schild = grep { $_->significant } $self->children;
68 shift @schild if _INSTANCE($schild[0], 'PPI::Token::Label');
71 (_INSTANCE($schild[0], 'PPI::Token::Word') and $schild[0]->content =~ /^(my|local|our|state)$/)
72 ? $schild[0]->content
106 my @schild = grep { $_->significant } $self->children;
107 shift @schild if _INSTANCE($schild[0], 'PPI::Token::Label');
110 if ( _INSTANCE($schild[1], 'PPI::Token::Symbol') ) {
111 return $schild[1];
115 if ( _INSTANCE($schild[1], 'PPI::Structure::List') ) {
116 my $Expression = $schild[1]->schild(0);
H A DSub.pm46 my $child = $_[0]->schild(-1);
78 my $token = $self->schild(1);
84 $token = $self->schild(0);
127 my $lastchild = $self->schild(-1) or return '';
188 my @schild = grep { $_->significant } $self->children;
191 shift @schild if _INSTANCE($schild[0], 'PPI::Token::Label');
194 (_INSTANCE($schild[0], 'PPI::Token::Word') and $schild[0]->content =~ /^(my|our|state)$/)
195 ? $schild[0]->content
H A DInclude.pm68 my $keyword = $self->schild(0) or return undef;
101 my $module = $self->schild(1) or return undef;
116 my $argument = $self->schild(3);
121 my $version = $self->schild(2) or return undef;
178 my $version = $self->schild(1) or return undef;
194 my $version = $self->schild(1) or return undef;
H A DCompound.pm110 my $Element = $self->schild($p) or return undef;
114 $Element = $self->schild(++$p) or return 'label';
120 $Element = $self->schild(++$p) or return $content;
162 my $child = $self->schild(-1) or return '';
/dports/math/jags/JAGS-4.3.0/src/modules/bugs/samplers/
H A DBinomSlicer.cc35 vector<StochasticNode *> const &schild = gv.stochasticChildren(); in canSample() local
36 for (unsigned int i = 0; i < schild.size(); ++i) { in canSample()
37 if (schild[i]->distribution()->name() != "dbin") { in canSample()
40 if (!schild[i]->parents()[1]->isFixed()) { in canSample()
85 vector<StochasticNode *> const &schild = _gv->stochasticChildren(); in logDensity() local
86 for (unsigned int i = 0; i < schild.size(); ++i) { in logDensity()
87 double y = schild[i]->value(_chain)[0]; in logDensity()
88 double p = schild[i]->parents()[0]->value(_chain)[0]; in logDensity()
89 double n = schild[i]->parents()[1]->value(_chain)[0]; in logDensity()
H A DConjugateMNormal.cc51 StochasticNode const *schild = stoch_children[j]; in calBeta() local
52 double const *mu = schild->parents()[0]->value(chain); in calBeta()
53 unsigned int nrow_child = schild->length(); in calBeta()
67 StochasticNode const *schild = stoch_children[j]; in calBeta() local
69 unsigned int nrow_child = schild->length(); in calBeta()
122 for (unsigned int i = 0; i < schild.size(); ++i) { in canSample()
123 if (getDist(schild[i]) != MNORM && getDist(schild[i]) != NORM) { in canSample()
126 if (isBounded(schild[i])) { in canSample()
129 if (gv.isDependent(schild[i]->parents()[1])) { in canSample()
242 double const *Y = schild->value(chain); in update()
[all …]
H A DConjugateWishart.cc47 vector<StochasticNode *> const &schild = gv.stochasticChildren(); in canSample() local
50 for (unsigned int i = 0; i < schild.size(); ++i) { in canSample()
51 if (isBounded(schild[i])) { in canSample()
54 switch(getDist(schild[i])) { in canSample()
56 if (gv.isDependent(schild[i]->parents()[0])) { in canSample()
131 StochasticNode const *schild = stoch_children[i]; in update() local
132 double const *Y = schild->value(chain); in update()
133 double const *mu = schild->parents()[0]->value(chain); in update()
H A DConjugateDirichlet.cc286 vector<StochasticNode *> const &schild = gv.stochasticChildren(); in canSample() local
289 for (unsigned int i = 0; i < schild.size(); ++i) { in canSample()
290 vector<Node const *> const &param = schild[i]->parents(); in canSample()
291 if (isBounded(schild[i])) { in canSample()
294 switch(getDist(schild[i])) { in canSample()
334 vector<StochasticNode *> const &schild = in ConjugateDirichlet() local
338 for (unsigned int s = 0; s < schild.size(); ++s) { in ConjugateDirichlet()
339 smap.insert(pair<StochasticNode const*, int>(schild[s], s)); in ConjugateDirichlet()
412 for (unsigned int i = 0; i < schild.size(); ++i) { in update()
419 N = schild[i]->value(chain); in update()
[all …]
H A DCensored.cc66 vector<StochasticNode *> const &schild = gv.stochasticChildren(); in canSample() local
69 if(schild.size() != 1) in canSample()
73 if (schild[0]->distribution()->name() != "dinterval") in canSample()
75 if (schild[0]->parents()[1] == snode) in canSample()
H A DConjugateBeta.cc49 vector<StochasticNode *> const &schild = gv.stochasticChildren(); in canSample() local
63 for (unsigned int i = 0; i < schild.size(); ++i) { in canSample()
64 if (isBounded(schild[i])) { in canSample()
67 switch(getDist(schild[i])) { in canSample()
69 if (gv.isDependent(schild[i]->parents()[1])) { in canSample()
/dports/math/jags/JAGS-4.3.0/src/modules/mix/samplers/
H A DLDAFactory.cc49 vector<StochasticNode *> const &schild = gv.stochasticChildren(); in checkTopicPrior() local
50 for (unsigned int i = 0; i < schild.size(); ++i) { in checkTopicPrior()
51 if (!isCat(schild[i])) return 0; in checkTopicPrior()
63 for (unsigned int i = 0; i < schild.size(); ++i) { in checkTopicPrior()
65 SingletonGraphView gvi(schild[i], graph); in checkTopicPrior()
78 if (m->parents()[0] != schild[i]) return 0; in checkTopicPrior()
80 if (m->parents()[j] == schild[i]) return 0; in checkTopicPrior()
100 vector<StochasticNode *> const &schild = gv.stochasticChildren(); in checkWordPrior() local
101 for (unsigned int i = 0; i < schild.size(); ++i) { in checkWordPrior()
102 if (!isCat(schild[i])) return 0; in checkWordPrior()
H A DDirichletCatFactory.cc34 vector<StochasticNode *> const &schild = gv.stochasticChildren(); in isCandidate() local
39 if (schild.size() != dchild.size()) return false; in isCandidate()
42 Distribution const *dist0 = schild[0]->distribution(); in isCandidate()
44 for (unsigned int i = 1; i < schild.size(); ++i) { in isCandidate()
45 if (schild[i]->distribution() != dist0) return false; in isCandidate()
/dports/math/jags/JAGS-4.3.0/src/modules/glm/samplers/
H A DScaledWishart.cc143 vector<StochasticNode *> const &schild = gv.stochasticChildren(); in canSample() local
146 for (unsigned int i = 0; i < schild.size(); ++i) { in canSample()
147 if (isBounded(schild[i])) { in canSample()
150 if (schild[i]->distribution()->name() != "dmnorm" && in canSample()
151 schild[i]->distribution()->name() != "dnorm") in canSample()
155 if (schild[i]->parents()[1] != snode) { in canSample()
158 if (gv.isDependent(schild[i]->parents()[0])) { in canSample()
214 vector<StochasticNode *> const &schild = _gv->stochasticChildren(); in update() local
216 for (vector<StochasticNode*>::const_iterator p = schild.begin(); in update()
217 p != schild.end(); ++p) in update()
/dports/textproc/p5-Perl-Critic/Perl-Critic-1.140/lib/Perl/Critic/Policy/Subroutines/
H A DRequireFinalReturn.pm121 my $begin = $final->schild(0);
154 my $begin = $final->schild(0);
182 $first_token = $stmnt->schild( 0 )
206 my $first_token = $stmnt->schild(0) || return;
218 my $first_token = $stmnt->schild(0) || return;
221 my $second_token = $stmnt->schild(1) || return;
224 my $third_token = $stmnt->schild(2) || return;
/dports/textproc/p5-PPIx-Utilities/PPIx-Utilities-1.001000/lib/PPIx/Utilities/
H A DStatement.pm43 my $supposed_constant_function = $element->schild(0)->content();
44 my $declaring_scope = $element->schild(1)->content();
53 return $element->schild(2);
78 my $statement = $follower->schild( 0 ) or return;
/dports/sysutils/triton/Triton-0.8.1/src/libtriton/engines/symbolic/
H A DsymbolicSimplification.cpp197 …auto schild = this->callbacks->processCallbacks(triton::callbacks::SYMBOLIC_SIMPLIFICATION, child); in processSimplification() local
198 ast->setChild(index, schild); in processSimplification()
199 needs_update |= !schild->canReplaceNodeWithoutUpdate(child); in processSimplification()
200 worklist.push_back(schild); in processSimplification()
/dports/textproc/p5-PPIx-Utils/PPIx-Utils-0.003/lib/PPIx/Utils/
H A DTraversal.pm39 my $expr = $sib->schild(0);
41 return $expr->isa('PPI::Statement') ? $expr->schild(0) : $expr;
149 and return $element->schild( 1 );
171 my $supposed_constant_function = $element->schild(0)->content();
172 my $declaring_scope = $element->schild(1)->content();
181 return ($element->schild(2));
210 my $statement = $follower->schild( 0 ) or return();
/dports/textproc/p5-PPI/PPI-1.270/lib/PPI/
H A DLexer.pm724 $Statement->schild(0)->isa('PPI::Structure::Block')
767 my $NextLast = $Statement->schild(-2);
1007 my $Element = $Parent->schild(-1);
1043 my $Element = $Parent->schild(-1);
1062 my $prior = $Parent->schild(-2);
1126 my $Element = $Parent->schild(-1);
1145 my $prior = $Parent->schild(-2);
1155 if ( my $prior = $Parent->schild(-2) ) {
1189 $Parent->schild(2)->isa('PPI::Token::Number')
1385 and my $first = $Parent->schild(0) ) {
[all …]
/dports/textproc/p5-Perl-Critic-Pulp/Perl-Critic-Pulp-99/lib/Perl/Critic/Policy/ValuesAndExpressions/
H A DConstantBeforeLt.pm130 $elem = $elem->schild(2) or return; # could be "use constant" alone
143 $elem = $elem->schild(0)
154 $elem = $elem->schild(0)
159 $elem = $elem->schild(0) or return;
/dports/lang/ruby26/ruby-2.6.9/spec/ruby/core/module/
H A Dancestors_spec.rb28 schild = child.singleton_class
30 schild.ancestors.should include(schild,
/dports/textproc/p5-Perl-Critic-Pulp/Perl-Critic-Pulp-99/lib/Perl/Critic/Policy/CodeLayout/
H A DRequireFinalSemicolon.pm56 my $block_last = $elem->schild(-1)
69 my $bstat_last = $block_last->schild(-1)
371 && ($elem = $elem->schild(0))
426 for ($elem = $elem->schild(2); $elem; $elem = $elem->snext_sibling) {

12345678910>>...13