Home
last modified time | relevance | path

Searched refs:sib (Results 1 – 25 of 2369) sorted by relevance

12345678910>>...95

/dports/textproc/p5-Perl-Critic/Perl-Critic-1.140/lib/Perl/Critic/Policy/InputOutput/
H A DRequireBracedFileHandleWithPrint.pm37 my @sib;
39 $sib[0] = $elem->snext_sibling();
40 return if !$sib[0];
44 my $expr = $sib[0]->schild(0);
46 $sib[0] = $expr->schild(0);
47 return if !$sib[0];
50 $sib[1] = $sib[0]->next_sibling();
51 return if !$sib[1];
52 $sib[2] = $sib[1]->next_sibling();
53 return if !$sib[2];
[all …]
/dports/sysutils/uefi-edk2-bhyve-csm/uefi-edk2-aa8d718/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/h/
H A DPCCTSAST.cpp157 sib = this; in ast_find_all()
175 sib=sib->down(); in ast_find_all()
179 sib=sib->right(); in ast_find_all()
192 else if ( sib->right()!=NULL ) *cursor = sib->right(); in ast_find_all()
194 return sib; in ast_find_all()
201 sib=sib->down(); in ast_find_all()
216 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match()
234 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match_partial()
249 ScanAST *sib; in scanmatch() local
254 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in scanmatch()
[all …]
/dports/devel/cccc/cccc-3.1.6/pccts/h/
H A DPCCTSAST.cpp157 sib = this; in ast_find_all()
175 sib=sib->down(); in ast_find_all()
179 sib=sib->right(); in ast_find_all()
192 else if ( sib->right()!=NULL ) *cursor = sib->right(); in ast_find_all()
194 return sib; in ast_find_all()
201 sib=sib->down(); in ast_find_all()
216 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match()
234 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match_partial()
249 ScanAST *sib; in scanmatch() local
254 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in scanmatch()
[all …]
/dports/print/lilypond/lilypond-2.22.1/Documentation/snippets/new/
H A Dstaff-headword.ly32 sib16-.^\markup {\dynamic p \italic grazioso} do-. mib( re)-. do-. sib-. |
51 r8\p <sol sib mib>16-. <sol sib mib>-. <sol sib mib>8-. <sol sib mib>-. |
52 r8 <sol sib mib>16-. <sol sib mib>-. <sol sib mib>8-. <sol sib mib>-. |
53 r8 <lab sib re>16-. <lab sib re>-. <lab sib re>8-. <lab sib re>-. |
54 r8 <lab sib re>16-. <lab sib re>-. <lab sib re>8-. <lab sib re>-. |
55 r8 <sol sib mib>16-. <sol sib mib>-. <sol sib mib>8-. <sol sib mib>-. |
63 sib-. r |
65 sib, r |
75 \transpose sib do'
/dports/print/lilypond-devel/lilypond-2.23.5/Documentation/snippets/new/
H A Dstaff-headword.ly32 sib16-.^\markup {\dynamic p \italic grazioso} do-. mib( re)-. do-. sib-. |
51 r8\p <sol sib mib>16-. <sol sib mib>-. <sol sib mib>8-. <sol sib mib>-. |
52 r8 <sol sib mib>16-. <sol sib mib>-. <sol sib mib>8-. <sol sib mib>-. |
53 r8 <lab sib re>16-. <lab sib re>-. <lab sib re>8-. <lab sib re>-. |
54 r8 <lab sib re>16-. <lab sib re>-. <lab sib re>8-. <lab sib re>-. |
55 r8 <sol sib mib>16-. <sol sib mib>-. <sol sib mib>8-. <sol sib mib>-. |
63 sib-. r |
65 sib, r |
75 \transpose sib do'
/dports/sysutils/cdrdao/cdrdao-1.2.4/pccts/h/
H A DPCCTSAST.cpp158 sib = this; in ast_find_all()
176 sib=sib->down(); in ast_find_all()
180 sib=sib->right(); in ast_find_all()
193 else if ( sib->right()!=NULL ) *cursor = sib->right(); in ast_find_all()
195 return sib; in ast_find_all()
202 sib=sib->down(); in ast_find_all()
217 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match()
235 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match_partial()
254 ScanAST *sib; in scanmatch() local
259 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in scanmatch()
[all …]
/dports/emulators/qemu42/qemu-4.2.1/roms/edk2/BaseTools/Source/C/VfrCompile/Pccts/h/
H A DPCCTSAST.cpp158 sib = this; in ast_find_all()
176 sib=sib->down(); in ast_find_all()
180 sib=sib->right(); in ast_find_all()
193 else if ( sib->right()!=NULL ) *cursor = sib->right(); in ast_find_all()
195 return sib; in ast_find_all()
202 sib=sib->down(); in ast_find_all()
217 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match()
235 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match_partial()
254 ScanAST *sib; in scanmatch() local
259 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in scanmatch()
[all …]
/dports/emulators/qemu/qemu-6.2.0/roms/edk2/BaseTools/Source/C/VfrCompile/Pccts/h/
H A DPCCTSAST.cpp158 sib = this; in ast_find_all()
176 sib=sib->down(); in ast_find_all()
180 sib=sib->right(); in ast_find_all()
193 else if ( sib->right()!=NULL ) *cursor = sib->right(); in ast_find_all()
195 return sib; in ast_find_all()
202 sib=sib->down(); in ast_find_all()
217 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match()
235 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match_partial()
254 ScanAST *sib; in scanmatch() local
259 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in scanmatch()
[all …]
/dports/emulators/qemu5/qemu-5.2.0/roms/edk2/BaseTools/Source/C/VfrCompile/Pccts/h/
H A DPCCTSAST.cpp158 sib = this; in ast_find_all()
176 sib=sib->down(); in ast_find_all()
180 sib=sib->right(); in ast_find_all()
193 else if ( sib->right()!=NULL ) *cursor = sib->right(); in ast_find_all()
195 return sib; in ast_find_all()
202 sib=sib->down(); in ast_find_all()
217 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match()
235 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match_partial()
254 ScanAST *sib; in scanmatch() local
259 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in scanmatch()
[all …]
/dports/sysutils/uefi-edk2-bhyve-csm/uefi-edk2-aa8d718/BaseTools/Source/C/VfrCompile/Pccts/h/
H A DPCCTSAST.cpp158 sib = this; in ast_find_all()
176 sib=sib->down(); in ast_find_all()
180 sib=sib->right(); in ast_find_all()
193 else if ( sib->right()!=NULL ) *cursor = sib->right(); in ast_find_all()
195 return sib; in ast_find_all()
202 sib=sib->down(); in ast_find_all()
217 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match()
235 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match_partial()
254 ScanAST *sib; in scanmatch() local
259 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in scanmatch()
[all …]
/dports/sysutils/uefi-edk2-bhyve/edk2-edk2-stable202102/BaseTools/Source/C/VfrCompile/Pccts/h/
H A DPCCTSAST.cpp158 sib = this; in ast_find_all()
176 sib=sib->down(); in ast_find_all()
180 sib=sib->right(); in ast_find_all()
193 else if ( sib->right()!=NULL ) *cursor = sib->right(); in ast_find_all()
195 return sib; in ast_find_all()
202 sib=sib->down(); in ast_find_all()
217 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match()
235 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match_partial()
254 ScanAST *sib; in scanmatch() local
259 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in scanmatch()
[all …]
/dports/sysutils/uefi-edk2-qemu/edk2-edk2-stable201911/BaseTools/Source/C/VfrCompile/Pccts/h/
H A DPCCTSAST.cpp158 sib = this; in ast_find_all()
176 sib=sib->down(); in ast_find_all()
180 sib=sib->right(); in ast_find_all()
193 else if ( sib->right()!=NULL ) *cursor = sib->right(); in ast_find_all()
195 return sib; in ast_find_all()
202 sib=sib->down(); in ast_find_all()
217 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match()
235 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match_partial()
254 ScanAST *sib; in scanmatch() local
259 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in scanmatch()
[all …]
/dports/emulators/qemu-utils/qemu-4.2.1/roms/edk2/BaseTools/Source/C/VfrCompile/Pccts/h/
H A DPCCTSAST.cpp158 sib = this; in ast_find_all()
176 sib=sib->down(); in ast_find_all()
180 sib=sib->right(); in ast_find_all()
193 else if ( sib->right()!=NULL ) *cursor = sib->right(); in ast_find_all()
195 return sib; in ast_find_all()
202 sib=sib->down(); in ast_find_all()
217 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match()
235 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match_partial()
254 ScanAST *sib; in scanmatch() local
259 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in scanmatch()
[all …]
/dports/emulators/qemu-guest-agent/qemu-5.0.1/roms/edk2/BaseTools/Source/C/VfrCompile/Pccts/h/
H A DPCCTSAST.cpp158 sib = this; in ast_find_all()
176 sib=sib->down(); in ast_find_all()
180 sib=sib->right(); in ast_find_all()
193 else if ( sib->right()!=NULL ) *cursor = sib->right(); in ast_find_all()
195 return sib; in ast_find_all()
202 sib=sib->down(); in ast_find_all()
217 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match()
235 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match_partial()
254 ScanAST *sib; in scanmatch() local
259 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in scanmatch()
[all …]
/dports/sysutils/edk2/edk2-edk2-stable202102/BaseTools/Source/C/VfrCompile/Pccts/h/
H A DPCCTSAST.cpp158 sib = this; in ast_find_all()
176 sib=sib->down(); in ast_find_all()
180 sib=sib->right(); in ast_find_all()
193 else if ( sib->right()!=NULL ) *cursor = sib->right(); in ast_find_all()
195 return sib; in ast_find_all()
202 sib=sib->down(); in ast_find_all()
217 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match()
235 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match_partial()
254 ScanAST *sib; in scanmatch() local
259 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in scanmatch()
[all …]
/dports/emulators/qemu60/qemu-6.0.0/roms/edk2/BaseTools/Source/C/VfrCompile/Pccts/h/
H A DPCCTSAST.cpp158 sib = this; in ast_find_all()
176 sib=sib->down(); in ast_find_all()
180 sib=sib->right(); in ast_find_all()
193 else if ( sib->right()!=NULL ) *cursor = sib->right(); in ast_find_all()
195 return sib; in ast_find_all()
202 sib=sib->down(); in ast_find_all()
217 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match()
235 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in match_partial()
254 ScanAST *sib; in scanmatch() local
259 for (sib=t; sib!=NULL&&u!=NULL; sib=sib->right(), u=u->right()) in scanmatch()
[all …]
/dports/print/lilypond-devel/lilypond-2.23.5/Documentation/snippets/
H A Dstaff-headword.ly40 sib16-.^\markup {\dynamic p \italic grazioso} do-. mib( re)-. do-. sib-. |
59 r8\p <sol sib mib>16-. <sol sib mib>-. <sol sib mib>8-. <sol sib mib>-. |
60 r8 <sol sib mib>16-. <sol sib mib>-. <sol sib mib>8-. <sol sib mib>-. |
61 r8 <lab sib re>16-. <lab sib re>-. <lab sib re>8-. <lab sib re>-. |
62 r8 <lab sib re>16-. <lab sib re>-. <lab sib re>8-. <lab sib re>-. |
63 r8 <sol sib mib>16-. <sol sib mib>-. <sol sib mib>8-. <sol sib mib>-. |
71 sib-. r |
73 sib, r |
83 \transpose sib do'
/dports/print/lilypond/lilypond-2.22.1/Documentation/snippets/
H A Dstaff-headword.ly40 sib16-.^\markup {\dynamic p \italic grazioso} do-. mib( re)-. do-. sib-. |
59 r8\p <sol sib mib>16-. <sol sib mib>-. <sol sib mib>8-. <sol sib mib>-. |
60 r8 <sol sib mib>16-. <sol sib mib>-. <sol sib mib>8-. <sol sib mib>-. |
61 r8 <lab sib re>16-. <lab sib re>-. <lab sib re>8-. <lab sib re>-. |
62 r8 <lab sib re>16-. <lab sib re>-. <lab sib re>8-. <lab sib re>-. |
63 r8 <sol sib mib>16-. <sol sib mib>-. <sol sib mib>8-. <sol sib mib>-. |
71 sib-. r |
73 sib, r |
83 \transpose sib do'
/dports/math/cadabra2/cadabra2-2.3.6.8/core/algorithms/
H A Dlr_tensor.cc24 tab1=sib; in can_apply()
26 tab2=sib; in can_apply()
30 ++sib; in can_apply()
34 sib=tr.begin(it); in can_apply()
40 tab1=sib; in can_apply()
42 tab2=sib; in can_apply()
46 ++sib; in can_apply()
98 ++sib; in do_filledtableau()
119 ++sib; in do_tableau()
121 sib=tr.begin(tab2); in do_tableau()
[all …]
/dports/math/cadabra2/cadabra2-2.3.6.8/core/
H A DDisplayTeX.cc60 ++sib; in needs_brackets()
147 ++sib; in print_other()
212 ++sib; in print_tableau()
250 ++sib; in print_ftableau()
513 ++sib; in print_wedgeproduct()
529 ++sib; in print_arrowlike()
538 ++sib; in print_dot()
724 ++sib; in print_intlike()
743 ++sib; in print_intlike()
769 ++sib; in print_equalitylike()
[all …]
/dports/devel/p5-Heap/Heap-0.80/lib/Heap/
H A DBinomial.pm179 $$mpred = $mel->{sib};
273 $$p = $el->{sib};
289 my $sib = shift;
295 sib => $sib,
308 $next = $el->{sib};
348 $prev = \$cur->{sib};
364 $cur->{sib} = $next->{sib};
388 $cur->{sib} = $next->{sib};
407 my $sib = $child->{sib};
408 $child->{sib} = $$h2;
[all …]
/dports/math/spooles-mpich/spooles.2.2/Tree/src/
H A Djustify.c76 sib = tree->sib ; in Tree_leftJustifyI()
84 nexti = sib[i] ; in Tree_leftJustifyI()
96 sib[i] = j ; in Tree_leftJustifyI()
107 nexti = sib[i] ; in Tree_leftJustifyI()
117 sib[prev] = i ; in Tree_leftJustifyI()
119 sib[i] = j ; in Tree_leftJustifyI()
157 sib = tree->sib ; in Tree_leftJustifyD()
177 sib[i] = j ; in Tree_leftJustifyD()
188 nexti = sib[i] ; in Tree_leftJustifyD()
198 sib[prev] = i ; in Tree_leftJustifyD()
[all …]
/dports/math/spooles-mpich/spooles.2.2_SHARED/Tree/src/
H A Djustify.c76 sib = tree->sib ; in Tree_leftJustifyI()
84 nexti = sib[i] ; in Tree_leftJustifyI()
96 sib[i] = j ; in Tree_leftJustifyI()
107 nexti = sib[i] ; in Tree_leftJustifyI()
117 sib[prev] = i ; in Tree_leftJustifyI()
119 sib[i] = j ; in Tree_leftJustifyI()
157 sib = tree->sib ; in Tree_leftJustifyD()
177 sib[i] = j ; in Tree_leftJustifyD()
188 nexti = sib[i] ; in Tree_leftJustifyD()
198 sib[prev] = i ; in Tree_leftJustifyD()
[all …]
/dports/math/spooles/spooles.2.2_SHARED/Tree/src/
H A Djustify.c76 sib = tree->sib ; in Tree_leftJustifyI()
84 nexti = sib[i] ; in Tree_leftJustifyI()
96 sib[i] = j ; in Tree_leftJustifyI()
107 nexti = sib[i] ; in Tree_leftJustifyI()
117 sib[prev] = i ; in Tree_leftJustifyI()
119 sib[i] = j ; in Tree_leftJustifyI()
157 sib = tree->sib ; in Tree_leftJustifyD()
177 sib[i] = j ; in Tree_leftJustifyD()
188 nexti = sib[i] ; in Tree_leftJustifyD()
198 sib[prev] = i ; in Tree_leftJustifyD()
[all …]
/dports/math/spooles/spooles.2.2/Tree/src/
H A Djustify.c76 sib = tree->sib ; in Tree_leftJustifyI()
84 nexti = sib[i] ; in Tree_leftJustifyI()
96 sib[i] = j ; in Tree_leftJustifyI()
107 nexti = sib[i] ; in Tree_leftJustifyI()
117 sib[prev] = i ; in Tree_leftJustifyI()
119 sib[i] = j ; in Tree_leftJustifyI()
157 sib = tree->sib ; in Tree_leftJustifyD()
177 sib[i] = j ; in Tree_leftJustifyD()
188 nexti = sib[i] ; in Tree_leftJustifyD()
198 sib[prev] = i ; in Tree_leftJustifyD()
[all …]

12345678910>>...95