Home
last modified time | relevance | path

Searched refs:head1 (Results 1 – 6 of 6) sorted by relevance

/external/antlr/antlr-3.4/runtime/Perl5/docs/
Ddesign.pod1 =head1 NAME
5 =head1 ABSTRACT
9 =head1 OVERVIEW
16 =head1 Basic Porting Considerations
59 =head1 SEE ALSO
64 =head1 AUTHOR
/external/ImageMagick/PerlMagick/default/
DMagick.pm.in27 =head1 NAME
31 =head1 SYNOPSIS
42 =head1 DESCRIPTION
57 =head1 AUTHOR
61 =head1 BUGS
65 =head1 SEE ALSO
/external/ImageMagick/PerlMagick/quantum/
Dquantum.pm.in102 =head1 NAME
106 =head1 SYNOPSIS
117 =head1 DESCRIPTION
132 =head1 AUTHOR
136 =head1 BUGS
140 =head1 SEE ALSO
/external/ImageMagick/scripts/
Dformat_c_api_docs484 print( OUT head1("NAME") );
493 print( OUT head1("SYNOPSIS") );
505 print( OUT head1("FUNCTION DESCRIPTIONS") );
582 sub head1 { subroutine
/external/dhcpcd-6.8.2/compat/
Dqueue.h165 #define TAILQ_CONCAT(head1, head2, field) do { \ argument
167 *(head1)->tqh_last = (head2)->tqh_first; \
168 (head2)->tqh_first->field.tqe_prev = (head1)->tqh_last; \
169 (head1)->tqh_last = (head2)->tqh_last; \
/external/skia/src/pathops/
DSkPathOpsTSect.h2159 const SkTSpan<TCurve, OppCurve>* head1 = result1; in BinarySearch() local
2160 if (!(zeroOneSet & kZeroS1Set) && approximately_less_than_zero(head1->fStartT)) { in BinarySearch()
2162 if (head1->isBounded()) { in BinarySearch()
2163 double t = head1->closestBoundedT(start1); in BinarySearch()