If you need to make conference calls for your business, consider enlisting the aid of a professional teleconferencing service. It doesn't have to be major expense because you sign up for free conference calling with a reliable company online.

Linux Manual Pages - section 3 (library calls)

_ | a | b | c | d | e | f | g | h | i | j | k | l | m | n | o | p | q | r | s | t | u | v | w | x | y | z |
Displaying 1757 of 18427
pack - support for connected components
package - Facilities for package loading and version control
packagens - Construct an appropriate package ifneeded
packages - Packages in Erlang
packdrake - Mandrake Simple Archive Extractor/Builder
pack_fclose - pack_fclose
pack_fclose_chunk - pack_fclose_chunk
pack_feof - pack_feof
pack_ferror - pack_ferror
pack_fgets - pack_fgets
PACKFILE - PACKFILE
packfile_password - packfile_password
pack_fopen - pack_fopen
pack_fopen_chunk - pack_fopen_chunk
pack_fputs - pack_fputs
pack_fread - pack_fread
pack_fseek - pack_fseek
pack_fwrite - pack_fwrite
pack_getc - pack_getc
pack_igetl - pack_igetl
pack_igetw - pack_igetw
pack_iputl - pack_iputl
pack_iputw - pack_iputw
pack_mgetl - pack_mgetl
pack_mgetw - pack_mgetw
pack_mputl - pack_mputl
pack_mputw - pack_mputw
pack-old - pack-Obsolete syntax for packer geometry manager
pack_putc - pack_putc
pad - newpad , subpad , prefresh ,
PadWalker - play with other peoples' lexical variables
page - set and get form page number
PALETTE - PALETTE
palette_color - palette_color
pam_authenticate -

pam_chauthtok -

pam_close_session -
pam_end -
pam_fail_delay -

pam_get_item -
pam_open_session -

pam_setcred -

pam_set_item -

pam_start -

pam_strerror -

panedwindow - Create and manipulate panedwindow widgets
panel - panel stack extension for curses
Panel.applet - no description
Panel.applet_signals - no description
parport - representation of a parallel port
parport_list - a collection of parallel ports
Parse::ePerl - Perl interface to the ePerl parser
parse_open_flags - converts open flag symbols into bitmask
parse_opts - parse standard and user options for LTP test programs
Parse::RecDescent - Generate Recursive-Descent Parsers
Parse::Yapp - Perl extension for generating and using LALR parsers.
Parsing - The run-time library for parsers generated by ocamlyacc.
Participant - A class of objects representing remote participants (RTP applications) in a multimedia session.
ParticipantHandler - Participant objects modification methods.
passwd2des -
pathconf -
pathplan - finds and smooths shortest paths
pattern - get and set a menu's pattern buffer
payload -
PayloadFormat - Base payload format class.
pcap - Packet Capture library
pcdbsv - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pcdbtrf - compute a LU factorization of an N-by-N complex banded diagonally dominant-like distributed matrix with bandwidth BWL, BWU
pcdbtrs - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pcdbtrsv - solve a banded triangular system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pcdtsv - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pcdttrf - compute a LU factorization of an N-by-N complex tridiagonal diagonally dominant-like distributed matrix A(1:N, JA:JA+N-1)
pcdttrs - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pcdttrsv - solve a tridiagonal triangular system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pcgbsv - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pcgbtrf - compute a LU factorization of an N-by-N complex banded distributed matrix with bandwidth BWL, BWU
pcgbtrs - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pcgebd2 - reduce a complex general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper or lower bidiagonal form B by an unitary transformation
pcgebrd - reduce a complex general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper or lower bidiagonal form B by an unitary transformation
pcgecon - estimate the reciprocal of the condition number of a general distributed complex matrix A(IA:IA+N-1,JA:JA+N-1), in either the 1-norm or the infinity-norm, using the LU factorization computed by PCGETRF
pcgeequ - compute row and column scalings intended to equilibrate an M-by-N distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA:JA+N-1) and reduce its condition number
pcgehd2 - reduce a complex general distributed matrix sub( A ) to upper Hessenberg form H by an unitary similarity transformation
pcgehrd - reduce a complex general distributed matrix sub( A ) to upper Hessenberg form H by an unitary similarity transformation
pcgelq2 - compute a LQ factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = L * Q
pcgelqf - compute a LQ factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = L * Q
pcgels - solve overdetermined or underdetermined complex linear systems involving an M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1),
pcgeql2 - compute a QL factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * L
pcgeqlf - compute a QL factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * L
pcgeqpf - compute a QR factorization with column pivoting of a M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1)
pcgeqr2 - compute a QR factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * R
pcgeqrf - compute a QR factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * R
pcgerfs - improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solutions
pcgerq2 - compute a RQ factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = R * Q
pcgerqf - compute a RQ factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = R * Q
pcgesv - compute the solution to a complex system of linear equations   sub( A ) * X = sub( B ),
pcgesvx - use the LU factorization to compute the solution to a complex system of linear equations   A(IA:IA+N-1,JA:JA+N-1) * X = B(IB:IB+N-1,JB:JB+NRHS-1),
pcgetf2 - compute an LU factorization of a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) using partial pivoting with row interchanges
pcgetrf - compute an LU factorization of a general M-by-N distributed matrix sub( A ) = (IA:IA+M-1,JA:JA+N-1) using partial pivoting with row interchanges
pcgetri - compute the inverse of a distributed matrix using the LU factorization computed by PCGETRF
pcgetrs - solve a system of distributed linear equations   op( sub( A ) ) * X = sub( B )  with a general N-by-N distributed matrix sub( A ) using the LU factorization computed by PCGETRF
pcggqrf - compute a generalized QR factorization of an N-by-M matrix sub( A ) = A(IA:IA+N-1,JA:JA+M-1) and an N-by-P matrix sub( B ) = B(IB:IB+N-1,JB:JB+P-1)
pcggrqf - compute a generalized RQ factorization of an M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1)
pcheevx - compute selected eigenvalues and, optionally, eigenvectors
pchegs2 - reduce a complex Hermitian-definite generalized eigenproblem to standard form
pchegst - reduce a complex Hermitian-definite generalized eigenproblem to standard form
pchegvx - compute all the eigenvalues, and optionally,
pchetd2 - reduce a complex Hermitian matrix sub( A ) to Hermitian tridiagonal form T by an unitary similarity transformation
pchetrd - reduce a complex Hermitian matrix sub( A ) to Hermitian tridiagonal form T by an unitary similarity transformation
pclabrd - reduce the first NB rows and columns of a complex general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper or lower bidiagonal form by an unitary transformation Q' * A * P, and returns the matrices X and Y which are needed to apply the transfor- mation to the unreduced part of sub( A )
pclacgv - conjugate a complex vector of length N, sub( X ), where sub( X ) denotes X(IX,JX:JX+N-1) if INCX = DESCX( M_ ) and X(IX:IX+N-1,JX) if INCX = 1, and  Notes =====  Each global data object is described by an associated description vector
pclacon - estimate the 1-norm of a square, complex distributed matrix A
pclacp2 - copie all or part of a distributed matrix A to another distributed matrix B
pclacpy - copie all or part of a distributed matrix A to another distributed matrix B
pclaevswp - move the eigenvectors (potentially unsorted) from where they are computed, to a ScaLAPACK standard block cyclic array, sorted so that the corresponding eigenvalues are sorted
pclahrd - reduce the first NB columns of a complex general N-by-(N-K+1) distributed matrix A(IA:IA+N-1,JA:JA+N-K) so that elements below the k-th subdiagonal are zero
pclange - return the value of the one norm, or the Frobenius norm,
pclanhe - return the value of the one norm, or the Frobenius norm,
pclanhs - return the value of the one norm, or the Frobenius norm,
pclansy - return the value of the one norm, or the Frobenius norm,
pclantr - return the value of the one norm, or the Frobenius norm,
pclapiv - applie either P (permutation matrix indicated by IPIV) or inv( P ) to a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1), resulting in row or column pivoting
pclapv2 - applie either P (permutation matrix indicated by IPIV) or inv( P ) to a M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1), resulting in row or column pivoting
pclaqge - equilibrate a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) using the row and scaling factors in the vectors R and C
pclaqsy - equilibrate a symmetric distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) using the scaling factors in the vectors SR and SC
pclarf - applie a complex elementary reflector Q to a complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1), from either the left or the right
pclarfb - applie a complex block reflector Q or its conjugate transpose Q**H to a complex M-by-N distributed matrix sub( C ) denoting C(IC:IC+M-1,JC:JC+N-1), from the left or the right
pclarfc - applie a complex elementary reflector Q**H to a complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1),
pclarfg - generate a complex elementary reflector H of order n, such that   H * sub( X ) = H * ( x(iax,jax) ) = ( alpha ), H' * H = I
pclarft - form the triangular factor T of a complex block reflector H of order n, which is defined as a product of k elementary reflectors
pclarz - applie a complex elementary reflector Q to a complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1), from either the left or the right
pclarzb - applie a complex block reflector Q or its conjugate transpose Q**H to a complex M-by-N distributed matrix sub( C ) denoting C(IC:IC+M-1,JC:JC+N-1), from the left or the right
pclarzc - applie a complex elementary reflector Q**H to a complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1),
pclarzt - form the triangular factor T of a complex block reflector H of order > n, which is defined as a product of k elementary reflectors as returned by PCTZRZF
pclascl - multiplie the M-by-N complex distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) by the real scalar CTO/CFROM
pclase2 - initialize an M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) to BETA on the diagonal and ALPHA on the offdiagonals
pclaset - initialize an M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) to BETA on the diagonal and ALPHA on the offdiagonals
pclassq - return the values scl and smsq such that   ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq,
pclaswp - perform a series of row or column interchanges on the distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1)
pclatra - compute the trace of an N-by-N distributed matrix sub( A ) denoting A( IA:IA+N-1, JA:JA+N-1 )
pclatrd - reduce NB rows and columns of a complex Hermitian distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) to complex tridiagonal form by an unitary similarity transformation Q' * sub( A ) * Q, and returns the matrices V and W which are needed to apply the transformation to the unreduced part of sub( A )
pclatrs - solve a triangular system
pclatrz - reduce the M-by-N ( M<=N ) complex upper trapezoidal matrix sub( A ) = [A(IA:IA+M-1,JA:JA+M-1) A(IA:IA+M-1,JA+N-L:JA+N-1)]
pclauu2 - compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
pclauum - compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
pclose -
pcmax1 - compute the global index of the maximum element in absolute value of a distributed vector sub( X )
pconf_autodetect_pport - Autodetect printer on a parallel port using IEEE1284 protocol.
pconf_detect_printer - Return array of strings containing printer specific information.
pconf_get_detection_methods - List autodetection methods.
PConn_bind -
PConnClose -
pcpbsv - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pcpbtrf - compute a Cholesky factorization of an N-by-N complex banded symmetric positive definite distributed matrix with bandwidth BW
pcpbtrs - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pcpbtrsv - solve a banded triangular system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pcpocon - estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite distributed matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by PCPOTRF
pcpoequ - compute row and column scalings intended to equilibrate a distributed Hermitian positive definite matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) and reduce its condition number (with respect to the two-norm)
pcporfs - improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and provides error bounds and backward error estimates for the solutions
pcposv - compute the solution to a complex system of linear equations   sub( A ) * X = sub( B ),
pcposvx - use the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system of linear equations   A(IA:IA+N-1,JA:JA+N-1) * X = B(IB:IB+N-1,JB:JB+NRHS-1),
pcpotf2 - compute the Cholesky factorization of a complex hermitian positive definite distributed matrix sub( A )=A(IA:IA+N-1,JA:JA+N-1)
pcpotrf - compute the Cholesky factorization of an N-by-N complex hermitian positive definite distributed matrix sub( A ) denoting A(IA:IA+N-1, JA:JA+N-1)
pcpotri - compute the inverse of a complex Hermitian positive definite distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) using the Cholesky factorization sub( A ) = U**H*U or L*L**H computed by PCPOTRF
pcpotrs - solve a system of linear equations   sub( A ) * X = sub( B )  A(IA:IA+N-1,JA:JA+N-1)*X = B(IB:IB+N-1,JB:JB+NRHS-1)
pcptsv - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pcpttrf - compute a Cholesky factorization of an N-by-N complex tridiagonal symmetric positive definite distributed matrix A(1:N, JA:JA+N-1)
pcpttrs - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pcpttrsv - solve a tridiagonal triangular system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pcre - Perl-compatible regular expressions
pcreapi - Perl-compatible regular expressions
pcrebuild - Perl-compatible regular expressions
pcrecallout - Perl-compatible regular expressions
pcrecompat - Perl-compatible regular expressions
pcre_compile - Perl-compatible regular expressions
pcre_config - Perl-compatible regular expressions
pcre_copy_named_substring - Perl-compatible regular expressions
pcre_copy_substring - Perl-compatible regular expressions
pcre_exec - Perl-compatible regular expressions
pcre_free_substring - Perl-compatible regular expressions
pcre_free_substring_list - Perl-compatible regular expressions
pcre_fullinfo - Perl-compatible regular expressions
pcre_get_named_substring - Perl-compatible regular expressions
pcre_get_stringnumber - Perl-compatible regular expressions
pcre_get_substring - Perl-compatible regular expressions
pcre_get_substring_list - Perl-compatible regular expressions
pcre_info - Perl-compatible regular expressions
pcre_maketables - Perl-compatible regular expressions
pcrepattern - Perl-compatible regular expressions
pcreperform - Perl-compatible regular expressions
pcreposix - Perl-compatible regular expressions.
pcresample - Perl-compatible regular expressions
pcre_study - Perl-compatible regular expressions
pcre_subst - Perl-compatible regular expression subsitution.
pcre_version - Perl-compatible regular expressions
pcsrscl - multiplie an N-element complex distributed vector sub( X ) by the real scalar 1/a
pcstein - compute the eigenvectors of a symmetric tridiagonal matrix in parallel, using inverse iteration
pctrcon - estimate the reciprocal of the condition number of a triangular distributed matrix A(IA:IA+N-1,JA:JA+N-1), in either the 1-norm or the infinity-norm
pctrrfs - provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
pctrti2 - compute the inverse of a complex upper or lower triangular block matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
pctrtri - compute the inverse of a upper or lower triangular distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
pctrtrs - solve a triangular system of the form   sub( A ) * X = sub( B ) or sub( A )**T * X = sub( B ) or   sub( A )**H * X = sub( B ),
pctzrzf - reduce the M-by-N ( M<=N ) complex upper trapezoidal matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper triangular form by means of unitary transformations
pcung2l - generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal columns, which is defined as the last N columns of a product of K elementary reflectors of order M   Q = H(k)
pcung2r - generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal columns, which is defined as the first N columns of a product of K elementary reflectors of order M   Q =
pcungl2 - generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows, which is defined as the first M rows of a product of K elementary reflectors of order N   Q = H(k)'
pcunglq - generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows, which is defined as the first M rows of a product of K elementary reflectors of order N   Q = H(k)'
pcungql - generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal columns, which is defined as the last N columns of a product of K elementary reflectors of order M   Q = H(k)
pcungqr - generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal columns, which is defined as the first N columns of a product of K elementary reflectors of order M   Q =
pcungr2 - generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows, which is defined as the last M rows of a product of K elementary reflectors of order N   Q = ' '
pcungrq - generate an M-by-N complex distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows, which is defined as the last M rows of a product of K elementary reflectors of order N   Q = ' '
pcunm2l - overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pcunm2r - overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pcunmbr - VECT = 'Q', PCUNMBR overwrites the general complex distributed M-by-N matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pcunmhr - overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pcunml2 - overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pcunmlq - overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pcunmql - overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pcunmqr - overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pcunmr2 - overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pcunmr3 - overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pcunmrq - overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pcunmrz - overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pcunmtr - overwrite the general complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pdb_AppendRecord -
pdb_CopyRecord -
pdb_DeleteRecordByID -
pdb_FindRecordByID -
pdb_LoadHeader -
pdb_Read -
pddbsv - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pddbtrf - compute a LU factorization of an N-by-N real banded diagonally dominant-like distributed matrix with bandwidth BWL, BWU
pddbtrs - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pddbtrsv - solve a banded triangular system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pddtsv - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pddttrf - compute a LU factorization of an N-by-N real tridiagonal diagonally dominant-like distributed matrix A(1:N, JA:JA+N-1)
pddttrs - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pddttrsv - solve a tridiagonal triangular system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
PDF::API2 - A Perl Module Chain to faciliate the Creation and Modification of High-Quality "Portable Document Format (aka. PDF)" Files.
PDF::API2::Annotation - Annotation object for PDF::API2
PDF::API2::Basic::PDF::Array - Corresponds to a PDF array. Inherits from PDF::Objind
PDF::API2::Basic::PDF::Bool - A special form of PDF::String which holds the strings
PDF::API2::Basic::PDF::Dict - PDF Dictionaries and Streams. Inherits from PDF::Objind
PDF::API2::Basic::PDF::File - Holds the trailers and cross-reference tables for a PDF file
PDF::API2::Basic::PDF::Filter - Ascii Hex encoding (very inefficient) for PDF streams.
PDF::API2::Basic::PDF::Name - Inherits from PDF::API2::Basic::PDF::String and stores PDF names (things
PDF::API2::Basic::PDF::Null - PDF Null type object.  This is a subclass of
PDF::API2::Basic::PDF::Number - Numbers in PDF. Inherits from PDF::API2::Basic::PDF::String
PDF::API2::Basic::PDF::Objind - PDF indirect object reference. Also acts as an abstract
PDF::API2::Basic::PDF::Page - Represents a PDF page, inherits from PDF::API2::Basic::PDF::Pages
PDF::API2::Basic::PDF::Pages - a PDF pages hierarchical element. Inherits from PDF::API2::Basic::PDF::Dict
PDF::API2::Basic::PDF::String - PDF String type objects and superclass for simple objects
PDF::API2::Basic::PDF::Utils - Utility functions for PDF library
PDF::API2::Basic::TTF::AATKern - PDF::API2::Basic::TTF::AATKern
PDF::API2::Basic::TTF::AATutils - PDF::API2::Basic::TTF::AATutils
PDF::API2::Basic::TTF::Anchor - Anchor points for GPOS tables
PDF::API2::Basic::TTF::Bsln - Baseline table in a font
PDF::API2::Basic::TTF::Cmap - Character map table
PDF::API2::Basic::TTF::Coverage - Opentype coverage and class definition objects
PDF::API2::Basic::TTF::Cvt_ - Control Value Table in a TrueType font
PDF::API2::Basic::TTF::Delta - Opentype Device tables
PDF::API2::Basic::TTF::Fdsc - Font Descriptors table in a font
PDF::API2::Basic::TTF::Feat - Font Features
PDF::API2::Basic::TTF::Fmtx - Font Metrics table
PDF::API2::Basic::TTF::Font - Memory representation of a font
PDF::API2::Basic::TTF::Fpgm - Font program in a TrueType font. Called when a font is loaded
PDF::API2::Basic::TTF::GDEF - Opentype GDEF table support
PDF::API2::Basic::TTF::Glyf - The Glyf data table
PDF::API2::Basic::TTF::Glyph - Holds a single glyph's information
PDF::API2::Basic::TTF::GPOS - Support for Opentype GPOS tables in conjunction with TTOpen
PDF::API2::Basic::TTF::GSUB - Module support for the GSUB table in conjunction with TTOpen
PDF::API2::Basic::TTF::Hdmx - Horizontal device metrics
PDF::API2::Basic::TTF::Head - The head table for a TTF Font
PDF::API2::Basic::TTF::Hhea - Horizontal Header table
PDF::API2::Basic::TTF::Hmtx - Horizontal Metrics
PDF::API2::Basic::TTF::Kern - Kerning tables
PDF::API2::Basic::TTF::Kern::ClassArray - PDF::API2::Basic::TTF::Kern::ClassArray
PDF::API2::Basic::TTF::Kern::CompactClassArray - PDF::API2::Basic::TTF::Kern::CompactClassArray
PDF::API2::Basic::TTF::Kern::OrderedList - PDF::API2::Basic::TTF::Kern::OrderedList
PDF::API2::Basic::TTF::Kern::StateTable - PDF::API2::Basic::TTF::Kern::StateTable
PDF::API2::Basic::TTF::Kern::Subtable - PDF::API2::Basic::TTF::Kern::Subtable
PDF::API2::Basic::TTF::Loca - the Locations table, which is intimately tied to the glyf table
PDF::API2::Basic::TTF::LTSH - Linear Threshold table
PDF::API2::Basic::TTF::Maxp - Maximum Profile table in a font
PDF::API2::Basic::TTF::Mort - Glyph Metamorphosis table in a font
PDF::API2::Basic::TTF::Mort::Chain - PDF::API2::Basic::TTF::Mort::Chain
PDF::API2::Basic::TTF::Mort::Contextual - PDF::API2::Basic::TTF::Mort::Contextual
PDF::API2::Basic::TTF::Mort::Insertion - PDF::API2::Basic::TTF::Mort::Insertion
PDF::API2::Basic::TTF::Mort::Ligature - PDF::API2::Basic::TTF::Mort::Ligature
PDF::API2::Basic::TTF::Mort::Noncontextual - PDF::API2::Basic::TTF::Mort::Noncontextual
PDF::API2::Basic::TTF::Mort::Rearrangement - PDF::API2::Basic::TTF::Mort::Rearrangement
PDF::API2::Basic::TTF::Mort::Subtable - PDF::API2::Basic::TTF::Mort::Subtable
PDF::API2::Basic::TTF::Name - String table for a TTF font
PDF::API2::Basic::TTF::OldCmap - Character map table
PDF::API2::Basic::TTF::OldMort - Glyph Metamorphosis table in a font
PDF::API2::Basic::TTF::OS_2 - the OS/2 table in a TTF font
PDF::API2::Basic::TTF::PCLT - PCLT TrueType font table
PDF::API2::Basic::TTF::Post - Holds the Postscript names for each glyph
PDF::API2::Basic::TTF::Prep - Preparation hinting program. Called when ppem changes
PDF::API2::Basic::TTF::Prop - Glyph Properties table in a font
PDF::API2::Basic::TTF::Segarr - Segmented array
PDF::API2::Basic::TTF::Table - Superclass for tables and used for tables we don't have a class for
PDF::API2::Basic::TTF::Ttc - Truetype Collection class
PDF::API2::Basic::TTF::Ttopen - Opentype superclass for standard Opentype lookup based tables
PDF::API2::Basic::TTF::Utils - Utility functions to save fingers
PDF::API2::Basic::TTF::Vhea - Vertical Header table
PDF::API2::Basic::TTF::Vmtx - Vertical Metrics
PDF::API2::Basic::TTF::XMLparse - provides support for XML parsing. Requires Expat module XML::Parser::Expat
PDF::API2::Content - Content object for PDF::API2
PDF::API2::Content::Text - Text content object for PDF::API2
PDF::API2::HOWTO - A basic set of guidelines to use PDF::API2.
PDF::API2::Lite - lite pdf creation
PDF::API2::NamedDestination - PDF::API2::NamedDestination
PDF::API2::Outline - Outline object for PDF::API2
PDF::API2::Outlines - Outlines object for PDF::API2
PDF::API2::Page -
PDF::API2::Resource - Resource object for PDF::API2
PDF::API2::Resource::BaseFont - Font resource object for PDF::API2
PDF::API2::Resource::CIDFont - CID-Font object for PDF::API2
PDF::API2::Resource::CIDFont::CJKFont - A CJK-Font object for PDF::API2
PDF::API2::Resource::CIDFont::TrueType - TrueType Font object for PDF::API2
PDF::API2::Resource::ColorSpace - PDF::API2::Resource::ColorSpace
PDF::API2::Resource::ColorSpace::Indexed - Indexed colorspace object for PDF::API2
PDF::API2::Resource::ColorSpace::Indexed::ACTFile - Colorspace object from an Adobe Color Table file for PDF::API2
PDF::API2::Resource::ColorSpace::Indexed::Hue - Colorspace object based on various hues for PDF::API2
PDF::API2::Resource::ColorSpace::Indexed::WebColor - Colorspace object created from the Web color palette of PDF::PAI2
PDF::API2::Resource::ExtGState - Extgstate object for PDF::API2
PDF::API2::Resource::Font - Encodes the font in the specified byte-ordering
PDF::API2::Resource::Font::BdFont - Module for using bitmapped Fonts.
PDF::API2::Resource::Font::CoreFont - Module for using the 14 PDF built-in Fonts.
PDF::API2::Resource::Font::Postscript - Adope type1 font object for PDF::API2
PDF::API2::Resource::Font::SynFont - Module for using synthetic Fonts.
PDF::API2::Resource::XObject - XObject-resource object for PDF::API2
PDF::API2::Resource::XObject::Form - Form-resource object base class for PDF::API2
PDF::API2::Resource::XObject::Form::Hybrid - Hybrid-form content for PDF::API2
PDF::API2::Resource::XObject::Image - PDF::API2::Resource::XObject::Image
PDF::API2::Resource::XObject::Image::GIF - GIF-image object for PDF::API2
PDF::API2::Resource::XObject::Image::JPEG - JPEG-Image object for PDF::API2
PDF::API2::Resource::XObject::Image::PNG - PNG-image object for PDF::API2
PDF::API2::Resource::XObject::Image::PNM - PNM-Image object for PDF::API2
PDF::API2::Resource::XObject::Image::TIFF - TIFF-Image object for PDF::API2
PDF::API2::Util - utility package for often use methods across the package.
PDF::API2::Version - PDF::API2::Version
PDF::Report - A wrapper written for PDF::API2
pdgbsv - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pdgbtrf - compute a LU factorization of an N-by-N real banded distributed matrix with bandwidth BWL, BWU
pdgbtrs - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pdgebd2 - reduce a real general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper or lower bidiagonal form B by an orthogonal transformation
pdgebrd - reduce a real general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper or lower bidiagonal form B by an orthogonal transformation
pdgecon - estimate the reciprocal of the condition number of a general distributed real matrix A(IA:IA+N-1,JA:JA+N-1), in either the 1-norm or the infinity-norm, using the LU factorization computed by PDGETRF
pdgeequ - compute row and column scalings intended to equilibrate an M-by-N distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA:JA+N-1) and reduce its condition number
pdgehd2 - reduce a real general distributed matrix sub( A ) to upper Hessenberg form H by an orthogonal similarity transforma- tion
pdgehrd - reduce a real general distributed matrix sub( A ) to upper Hessenberg form H by an orthogonal similarity transforma- tion
pdgelq2 - compute a LQ factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = L * Q
pdgelqf - compute a LQ factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = L * Q
pdgels - solve overdetermined or underdetermined real linear systems involving an M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1),
pdgeql2 - compute a QL factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * L
pdgeqlf - compute a QL factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * L
pdgeqpf - compute a QR factorization with column pivoting of a M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1)
pdgeqr2 - compute a QR factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * R
pdgeqrf - compute a QR factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * R
pdgerfs - improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solutions
pdgerq2 - compute a RQ factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = R * Q
pdgerqf - compute a RQ factorization of a real distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = R * Q
pdgesv - compute the solution to a real system of linear equations   sub( A ) * X = sub( B ),
pdgesvd - compute the singular value decomposition (SVD) of an M-by-N matrix A, optionally computing the left and/or right singular vectors
pdgesvx - use the LU factorization to compute the solution to a real system of linear equations   A(IA:IA+N-1,JA:JA+N-1) * X = B(IB:IB+N-1,JB:JB+NRHS-1),
pdgetf2 - compute an LU factorization of a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) using partial pivoting with row interchanges
pdgetrf - compute an LU factorization of a general M-by-N distributed matrix sub( A ) = (IA:IA+M-1,JA:JA+N-1) using partial pivoting with row interchanges
pdgetri - compute the inverse of a distributed matrix using the LU factorization computed by PDGETRF
pdgetrs - solve a system of distributed linear equations   op( sub( A ) ) * X = sub( B )  with a general N-by-N distributed matrix sub( A ) using the LU factorization computed by PDGETRF
pdggqrf - compute a generalized QR factorization of an N-by-M matrix sub( A ) = A(IA:IA+N-1,JA:JA+M-1) and an N-by-P matrix sub( B ) = B(IB:IB+N-1,JB:JB+P-1)
pdggrqf - compute a generalized RQ factorization of an M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1)
PDL - the Perl Data Language
pdlabad - take as input the values computed by PDLAMCH for underflow and overflow, and returns the square root of each of these values if the log of LARGE is sufficiently large
pdlabrd - reduce the first NB rows and columns of a real general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper or lower bidiagonal form by an orthogonal transformation Q' * A * P,
pdlacon - estimate the 1-norm of a square, real distributed matrix A
pdlaconsb - look for two consecutive small subdiagonal elements by  seeing the effect of starting a double shift QR iteration  given by H44, H33, & H43H34 and see if this would make a  subdiagonal negligible
pdlacp2 - copie all or part of a distributed matrix A to another distributed matrix B
pdlacp3 - i an auxiliary routine that copies from a global parallel  array into a local replicated array or vise versa
pdlacpy - copie all or part of a distributed matrix A to another distributed matrix B
pdlaevswp - move the eigenvectors (potentially unsorted) from where they are computed, to a ScaLAPACK standard block cyclic array, sorted so that the corresponding eigenvalues are sorted
pdlahqr - i an auxiliary routine used to find the Schur decomposition  and or eigenvalues of a matrix already in Hessenberg form from  cols ILO to IHI
pdlahrd - reduce the first NB columns of a real general N-by-(N-K+1) distributed matrix A(IA:IA+N-1,JA:JA+N-K) so that elements below the k-th subdiagonal are zero
pdlamch - determine double precision machine parameters
pdlange - return the value of the one norm, or the Frobenius norm,
pdlanhs - return the value of the one norm, or the Frobenius norm,
pdlansy - return the value of the one norm, or the Frobenius norm,
pdlantr - return the value of the one norm, or the Frobenius norm,
pdlapiv - applie either P (permutation matrix indicated by IPIV) or inv( P ) to a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1), resulting in row or column pivoting
pdlapv2 - applie either P (permutation matrix indicated by IPIV) or inv( P ) to a M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1), resulting in row or column pivoting
pdlaqge - equilibrate a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) using the row and scaling factors in the vectors R and C
pdlaqsy - equilibrate a symmetric distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) using the scaling factors in the vectors SR and SC
pdlared1d - redistribute a 1D array  It assumes that the input array, BYCOL, is distributed across rows and that all process column contain the same copy of BYCOL
pdlared2d - redistribute a 1D array  It assumes that the input array, BYROW, is distributed across columns and that all process rows contain the same copy of BYROW
pdlarf - applie a real elementary reflector Q (or Q**T) to a real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1), from either the left or the right
pdlarfb - applie a real block reflector Q or its transpose Q**T to a real distributed M-by-N matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1)
pdlarfg - generate a real elementary reflector H of order n, such that   H * sub( X ) = H * ( x(iax,jax) ) = ( alpha ), H' * H = I
pdlarft - form the triangular factor T of a real block reflector H of order n, which is defined as a product of k elementary reflectors
pdlarz - applie a real elementary reflector Q (or Q**T) to a real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1), from either the left or the right
pdlarzb - applie a real block reflector Q or its transpose Q**T to a real distributed M-by-N matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1)
pdlarzt - form the triangular factor T of a real block reflector H of order > n, which is defined as a product of k elementary reflectors as returned by PDTZRZF
pdlascl - multiplie the M-by-N real distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) by the real scalar CTO/CFROM
pdlase2 - initialize an M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) to BETA on the diagonal and ALPHA on the offdiagonals
pdlaset - initialize an M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) to BETA on the diagonal and ALPHA on the offdiagonals
pdlasmsub - look for a small subdiagonal element from the bottom  of the matrix that it can safely set to zero
pdlassq - return the values scl and smsq such that   ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq,
pdlaswp - perform a series of row or column interchanges on the distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1)
pdlatra - compute the trace of an N-by-N distributed matrix sub( A ) denoting A( IA:IA+N-1, JA:JA+N-1 )
pdlatrd - reduce NB rows and columns of a real symmetric distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) to symmetric tridiagonal form by an orthogonal similarity transformation Q' * sub( A ) * Q,
pdlatrs - solve a triangular system
pdlatrz - reduce the M-by-N ( M<=N ) real upper trapezoidal matrix sub( A ) = [ A(IA:IA+M-1,JA:JA+M-1) A(IA:IA+M-1,JA+N-L:JA+N-1) ] to upper triangular form by means of orthogonal transformations
PDL::AutoLoader - MatLab style AutoLoader for PDL
pdlauu2 - compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
pdlauum - compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
pdlawil - get the transform given by H44,H33, & H43H34 into V  starting at row M
PDL::Bad - PDL does not process bad values
PDL::BAD2_demo -
PDL::BAD_demo -
PDL::Basic - PDL::Basic -- Basic utility functions for PDL
PDL::CallExt - call functions in external shared libraries
PDL::Char - PDL::Char -- PDL subclass which allows reading and writing of fixed-length character strings as byte PDLs
PDL::Complex - handle complex numbers
PDL::Config -
PDL::Core - fundamental PDL functionality
PDL::Dbg - functions to support debugging of PDL scripts
PDL::Dev - PDL development module
PDL::DiskCache - PDL::DiskCache -- Non-memory-resident array object
PDL::Doc - support for PDL online documentation
PDL::Doc::Config -
PDL::Doc::Perldl - commands for accessing PDL doc database from 'perldl' shell
PDL::Dumper - PDL::IO::Dumper -- data dumping for structs with PDLs
PDL::Exporter - PDL export control
PDL::FFT - FFTs for PDL
PDL::FFTW - PDL interface to the Fastest Fourier Transform in the West v2.x
PDL::Fit::Gaussian - routines for fitting gaussians
PDL::Func - useful functions
PDL::Gaussian - PDL::Gaussian -- Gaussian distributions.
PDL::Graphics2D - An object oriented interface to PDL graphics
PDL::Graphics::IIS - Display PDL images on IIS devices (saoimage/ximtool)
PDL::Graphics::Limits - derive limits for display purposes
PDL::Graphics::LUT - provides access to a number of look-up tables
PDL::Graphics::OpenGL - PDL::Graphics::OpenGL -- a PDL interface to the OpenGL graphics library.
PDL::Graphics::OpenGLQ - 1

PDL::Graphics::PGPLOT - 1

PDL::Graphics::PGPLOTOptions - Setting PGPLOT options
PDL::Graphics::PGPLOT::Window - A OO interface to PGPLOT windows
PDL::Graphics::PLplot - Object-oriented interface from perl/PDL to the PLPLOT plotting library
PDL::Graphics::TriD - PDL::Graphics::TriD -- PDL 3D interface
PDL::Graphics::TriD::ButtonControl - default event handler subroutines
PDL::Graphics::TriD::Contours - 1

PDL::Graphics::TriD::Labels - PDL::Graphics::TriD::Labels -- Text tools
PDL::Graphics::TriD::MathGraph - PDL::Graphics::TriD::MathGraph -- Mathematical Graph objects for PDL
PDL::Graphics::TriD::Objects - 1

PDL::Graphics::TriD::Rout - 1

PDL::Graphics::TriD::Tk - A Tk widget interface to the PDL::Graphics::TriD.
PDL::Graphics::TriD::VRML - PDL::Graphics::TriD::VRML -- TriD VRML backend
PDL::GSL::DIFF - PDL interface to numerical differentiation routines in GSL
PDL::GSL::INTEG - PDL interface to numerical integration routines in GSL
PDL::GSL::INTERP - PDL interface to Interpolation routines in GSL
PDL::GSL::RNG - PDL interface to RNG and randist routines in GSL
PDL::GSLSF::AIRY - PDL interface to GSL Special Functions
PDL::GSLSF::BESSEL - PDL interface to GSL Special Functions
PDL::GSLSF::CLAUSEN - PDL interface to GSL Special Functions
PDL::GSLSF::COULOMB - PDL interface to GSL Special Functions
PDL::GSLSF::COUPLING - PDL interface to GSL Special Functions
PDL::GSLSF::DAWSON - PDL interface to GSL Special Functions
PDL::GSLSF::DEBYE - PDL interface to GSL Special Functions
PDL::GSLSF::DILOG - PDL interface to GSL Special Functions
PDL::GSLSF::ELEMENTARY - PDL interface to GSL Special Functions
PDL::GSLSF::ELLINT - PDL interface to GSL Special Functions
PDL::GSLSF::ELLJAC - PDL interface to GSL Special Functions
PDL::GSLSF::ERF - PDL interface to GSL Special Functions
PDL::GSLSF::EXP - PDL interface to GSL Special Functions
PDL::GSLSF::EXPINT - PDL interface to GSL Special Functions
PDL::GSLSF::FERMI_DIRAC - PDL interface to GSL Special Functions
PDL::GSLSF::GAMMA - PDL interface to GSL Special Functions
PDL::GSLSF::GEGENBAUER - PDL interface to GSL Special Functions
PDL::GSLSF::HYPERG - PDL interface to GSL Special Functions
PDL::GSLSF::LAGUERRE - PDL interface to GSL Special Functions
PDL::GSLSF::LEGENDRE - PDL interface to GSL Special Functions
PDL::GSLSF::LOG - PDL interface to GSL Special Functions
PDL::GSLSF::POLY - PDL interface to GSL Special Functions
PDL::GSLSF::POW_INT - PDL interface to GSL Special Functions
PDL::GSLSF::PSI - PDL interface to GSL Special Functions
PDL::GSLSF::SYNCHROTRON - PDL interface to GSL Special Functions
PDL::GSLSF::TRANSPORT - PDL interface to GSL Special Functions
PDL::GSLSF::TRIG - PDL interface to GSL Special Functions
PDL::GSLSF::ZETA - PDL interface to GSL Special Functions
PDL::Image2D - Miscellaneous 2D image processing functions
PDL::ImageND - useful image processing in N dimensions
PDL::ImageRGB - PDL::ImageRGB -- some utility functions for RGB image data handling
PDL::IO::FastRaw - PDL::IO::FastRaw -- A simple, fast and convenient io format for PerlDL.
PDL::IO::FITS - PDL::IO::FITS -- Simple FITS support for PDL
PDL::IO::FlexRaw - PDL::IO::FlexRaw -- A flexible binary i/o format for PerlDL.
PDL::IO::Misc - misc IO routines for PDL
PDL::IO::NDF - PDL Module for reading and writing Starlink
PDL::IO::Pnm - PDL::IO::Pnm -- pnm format I/O for PDL
PDL::IO::Storable - helper functions to make PDL usable with Storable
PDL::Linear - linear filtering for PDL
PDL::Linfit - routines for fitting data with linear combinations of functions.
PDL::LinPred - Linear predictive filtering
PDL::Lite - minimum PDL module OO loader
PDL::LiteF - minimum PDL module function loader
PDL::LM - PDL::Fit::LM -- Levenber-Marquardt fitting routine for PDL
PDL::Lvalue - declare PDL lvalue subs
PDL::Math - extended mathematical operations and special functions
PDL::Matrix - PDL::Matrix -- a convenience matrix class for column-major access
PDL::MatrixOps - PDL::MatrixOps
PDL::NiceSlice - toward a nicer slicing syntax for PDL
PDL::Ops - Fundamental mathematical operators
PDL::Options - simplifies option passing by hash in PerlDL
PDL::Opt::Simplex - PDL::Opt::Simplex -- Simplex optimization routines
PDL::Pod::Parser - base class for creating pod filters and translators
PDL::Pod::Select - function to extract selected sections of pod documentation
PDL::Pod::Usage - print a usage message using a script's embedded pod documentation
PDL::Polynomial - routines for fitting with polynomials
Pdlpp - 1

PDL::PP::Dump - PDL::PP::Dump -- dump pp_xxx calls to stdout
PDL::PP::Signature - Internal module to handle signatures
PDL::pptemplate - script to generate Makefile.PL and PP file skeleton
PDL::Primitive - primitive operations for pdl
PDL::Reduce - PDL::Reduce -- a "reduce" function for PDL
PDL::Slatec - PDL interface to the slatec numerical programming library
PDL::Slices - PDL::Slices -- Stupid index tricks
PDL::State - A package to keep track of plotting commands
PDL::Tests - tests for some PP features
PDL::Transform - Image transformations and N-D functions
PDL::Transform::Cartography - Useful cartographic projections
PDL::Types - define fundamental PDL Datatypes
PDL::Ufunc - primitive ufunc operations for pdl
pdorg2l - generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal columns, which is defined as the last N columns of a product of K elementary reflectors of order M   Q = H(k)
pdorg2r - generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal columns, which is defined as the first N columns of a product of K elementary reflectors of order M   Q =
pdorgl2 - generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows, which is defined as the first M rows of a product of K elementary reflectors of order N   Q = H(k)
pdorglq - generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows, which is defined as the first M rows of a product of K elementary reflectors of order N   Q = H(k)
pdorgql - generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal columns, which is defined as the last N columns of a product of K elementary reflectors of order M   Q = H(k)
pdorgqr - generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal columns, which is defined as the first N columns of a product of K elementary reflectors of order M   Q =
pdorgr2 - generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows, which is defined as the last M rows of a product of K elementary reflectors of order N   Q =
pdorgrq - generate an M-by-N real distributed matrix Q denoting A(IA:IA+M-1,JA:JA+N-1) with orthonormal rows, which is defined as the last M rows of a product of K elementary reflectors of order N   Q =
pdorm2l - overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pdorm2r - overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pdormbr - VECT = 'Q', PDORMBR overwrites the general real distributed M-by-N matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pdormhr - overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pdorml2 - overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pdormlq - overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pdormql - overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pdormqr - overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pdormr2 - overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pdormr3 - overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pdormrq - overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pdormrz - overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pdormtr - overwrite the general real M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1) with   SIDE = 'L' SIDE = 'R' TRANS = 'N'
pdpbsv - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pdpbtrf - compute a Cholesky factorization of an N-by-N real banded symmetric positive definite distributed matrix with bandwidth BW
pdpbtrs - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pdpbtrsv - solve a banded triangular system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pdpocon - estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite distributed matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by PDPOTRF
pdpoequ - compute row and column scalings intended to equilibrate a distributed symmetric positive definite matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) and reduce its condition number (with respect to the two-norm)
pdporfs - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and provides error bounds and backward error estimates for the solutions
pdposv - compute the solution to a real system of linear equations   sub( A ) * X = sub( B ),
pdposvx - use the Cholesky factorization A = U**T*U or A = L*L**T to compute the solution to a real system of linear equations   A(IA:IA+N-1,JA:JA+N-1) * X = B(IB:IB+N-1,JB:JB+NRHS-1),
pdpotf2 - compute the Cholesky factorization of a real symmetric positive definite distributed matrix sub( A )=A(IA:IA+N-1,JA:JA+N-1)
pdpotrf - compute the Cholesky factorization of an N-by-N real symmetric positive definite distributed matrix sub( A ) denoting A(IA:IA+N-1, JA:JA+N-1)
pdpotri - compute the inverse of a real symmetric positive definite distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) using the Cholesky factorization sub( A ) = U**T*U or L*L**T computed by PDPOTRF
pdpotrs - solve a system of linear equations   sub( A ) * X = sub( B )  A(IA:IA+N-1,JA:JA+N-1)*X = B(IB:IB+N-1,JB:JB+NRHS-1)
pdptsv - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pdpttrf - compute a Cholesky factorization of an N-by-N real tridiagonal symmetric positive definite distributed matrix A(1:N, JA:JA+N-1)
pdpttrs - solve a system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pdpttrsv - solve a tridiagonal triangular system of linear equations   A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)
pdrscl - multiplie an N-element real distributed vector sub( X ) by the real scalar 1/a
pdstebz - compute the eigenvalues of a symmetric tridiagonal matrix in parallel
pdstein - compute the eigenvectors of a symmetric tridiagonal matrix in parallel, using inverse iteration
pdsyev - compute all eigenvalues and, optionally, eigenvectors
pdsyevx - compute selected eigenvalues and, optionally, eigenvectors
pdsygs2 - reduce a real symmetric-definite generalized eigenproblem to standard form
pdsygst - reduce a real symmetric-definite generalized eigenproblem to standard form
pdsygvx - compute all the eigenvalues, and optionally,
pdsytd2 - reduce a real symmetric matrix sub( A ) to symmetric tridiagonal form T by an orthogonal similarity transformation
pdsytrd - reduce a real symmetric matrix sub( A ) to symmetric tridiagonal form T by an orthogonal similarity transformation
pdtrcon - estimate the reciprocal of the condition number of a triangular distributed matrix A(IA:IA+N-1,JA:JA+N-1), in either the 1-norm or the infinity-norm
pdtrrfs - provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix
pdtrti2 - compute the inverse of a real upper or lower triangular block matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
pdtrtri - compute the inverse of a upper or lower triangular distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)
pdtrtrs - solve a triangular system of the form   sub( A ) * X = sub( B ) or sub( A )**T * X = sub( B ),
pdtzrzf - reduce the M-by-N ( M<=N ) real upper trapezoidal matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper triangular form by means of orthogonal transformations
pdzsum1 - return the sum of absolute values of a complex distributed vector sub( X ) in ASUM,
pem - PEM routines
Perl6::Export - Implements the Perl 6 'is export(...)' trait
Perl6::Form - Implements the Perl 6 'form' built-in
Perl6::Slurp - Implements the Perl 6 'slurp' built-in
perlfilter - Source Filters
PerlIO - On demand loader for PerlIO layers and root of PerlIO::* name space
PerlIO::encoding - encoding layer
PerlIO::eol - PerlIO layer for normalizing line endings
PerlIO::scalar - in-memory IO, scalar IO
PerlIO::via - Helper class for PerlIO layers implemented in perl
PerlIO::via::dynamic - dynamic PerlIO layers
PerlIO::via::QuotedPrint - PerlIO layer for quoted-printable strings
PerlIO::via::symlink - PerlIO layers for create symlinks
PerlPanel::MenuBase - a base class for PerlPanel menu applets.
perlpod - the Plain Old Documentation format
perlpodspec - Plain Old Documentation: format specification and notes
Perl::Tidy - Parses and beautifies perl source
perror - print a system error message
PersistException -
persist.h - Persistence library classes.
persp_project - persp_project, persp_project_f
persp_project_f -
Pervasives - The initially opened module.
Pervasives.LargeFile - Operations on large files.
Petal - TAL for Perl!
Petal::Hash::Test - Test and Tutorial Petal modifier
pg - Distributed, Named Process Groups
pg2 - Distributed Named Process Groups
PGABuildDatatype - Build an MPI datatype for string p in population pop.
PGAChange - Repeatedly apply mutation to a string (with an increasing
PGACheckStoppingConditions - returns boolean to indicate if the PGAPack
PGACheckSum - maps a string to a number to be used a verification check
PGAClearDebugLevel - Turn off a debul level.  Only valid if PGAPack
PGAClearDebugLevelByName - Turn off debugging of the named function.
PGACopyIndividual - copies string p1 in population pop1 to position p2 in
PGACreate - creates an uninitialized context variable.  The Fortran version
PGACrossover - performs crossover on two parent strings to create two
PGADebugPrint - Write debugging information
PGADestroy - deallocate memory for this instance of PGAPack, if this context
PGADone - Returns PGA_TRUE if the stopping conditions have been met,
PGADuplicate - determines if a specified string is a duplicate of one
PGAEncodeIntegerAsBinary - encodes an integer value as a binary string
PGAEncodeIntegerAsGrayCode - encodes a real value as a binary reflected
PGAEncodeRealAsBinary - encodes a real value as a binary string
PGAEncodeRealAsGrayCode - encodes a real value as a binary reflected Gray
PGAError - reports error messages.  Prints out the message supplied, and
PGAEvaluate - Calls a user-specified function to return an evaluation of
PGAFitness - Maps the user's evaluation function value to a fitness value.
PGAGetBestIndex - returns the index of the string with the best evaluation
PGAGetBinaryAllele - returns the value of a (binary) allele in a
PGAGetBinaryInitProb - Returns the probability that an allele will be
PGAGetCharacterAllele - PGAGetCharacterAllele: returns the value of character allele in a-PGA_DATATYPE_CHARACTER string
PGAGetCommunicator - Returns the default communicator used when PGARun is
PGAGetCrossoverProb - Returns the crossover probability
PGAGetCrossoverType - Returns the type of crossover selected
PGAGetDataType - Returns the data type used by the given context.
PGAGetEvaluation - returns the evaluation function value for
PGAGetEvaluationUpToDateFlag - returns true/false to indicate
PGAGetFitness - returns the fitness value for a string
PGAGetFitnessCmaxValue - returns the value of the multiplier used by
PGAGetFitnessMinType - Returns the type of fitness transformation used
PGAGetFitnessType - Returns the type of fitness transformation used.
PGAGetGAIterValue - returns the number of the current genetic
PGAGetIntegerAllele - Returns the value of allele i of member p in
PGAGetIntegerFromBinary - interpets a binary string as encoding an integer
PGAGetIntegerFromGrayCode - interpets a binary reflected Gray code sequence
PGAGetIntegerInitType - returns the type of scheme used to randomly
PGAGetMaxFitnessRank - returns the maximum value used in rank-based
PGAGetMaxGAIterValue - Returns the maximum number of iterations to run
PGAGetMaxIntegerInitValue - returns the maximum of the range of integers
PGAGetMaxMachineDoubleValue - returns the largest double of the current
PGAGetMaxMachineIntValue - returns the largest integer of the current
PGAGetMaxRealInitValue - returns the maximum value used to randomly
PGAGetMinIntegerInitValue - returns the minimum of the range of integers
PGAGetMinMachineDoubleValue - returns the smallest double of the current
PGAGetMinMachineIntValue - returns the smallest integer of the current
PGAGetMinRealInitValue - returns the minimum value used to randomly
PGAGetMutationAndCrossoverFlag - Returns true if mutation occurs only
PGAGetMutationBoundedFlag - returns PGA_TRUE or PGA_FALSE to indicate
PGAGetMutationIntegerValue - Returns the value of the multiplier
PGAGetMutationOrCrossoverFlag - Returns true if mutation only occurs when
PGAGetMutationProb - Returns the probability of mutation.
PGAGetMutationRealValue - Returns the value of the multiplier used to
PGAGetMutationType - Returns the type of mutation used
PGAGetNoDuplicatesFlag - Returns PGA_TRUE if duplicates are not allowed,
PGAGetNumProcs - Returns the size of communicator comm in processes.  If
PGAGetNumReplaceValue - Returns the maximum number of strings to replace
PGAGetOptDirFlag - Returns a symbolic constant that represents the
PGAGetPopReplaceType - returns the symbolic constant used to determine
PGAGetPopSize - Returns the population size
PGAGetPrintFrequencyValue - returns how often to print statistics reports
PGAGetPTournamentProb - returns the probability of selecting the best
PGAGetRandomInitFlag - returns true/false to indicate whether or not
PGAGetRandomSeed - returns the integer to seed random numbers with
PGAGetRank - Returns the rank of the processor in communicator comm.  If
PGAGetRealAllele - returns the value of real-valued allele i in string p
PGAGetRealFromBinary - Interpets a binary string as encoding a real value
PGAGetRealFromGrayCode - interpets a binary reflected Gray code sequence in
PGAGetRealInitType - returns the type of scheme used to randomly
PGAGetRestartAlleleChangeProb - returns the probability with which
PGAGetRestartFlag - returns whether the algorithm should employ the
PGAGetRestartFrequencyValue - returns the number of iterations of no
PGAGetSelectType - Returns the type of selection selected
PGAGetSortedPopIndex - returns a population string index from the array
PGAGetStoppingRuleType - Returns a symbolic constant that defines the
PGAGetStringLength - Returns the string length
PGAGetUniformCrossoverProb - returns the probability of a bit being
PGAGetWorstIndex - returns the index of the string with the worst
PGAHammingDistance - Calculates the mean Hamming distance for a population
PGAMean - calculates the mean value of an array of elements
PGAMutate - This routine performs mutation on a string.  The type of mutation
PGAPrintContextVariable - prints the value of all the fields in the context
PGAPrintIndividual - prints the allele values of a string and associated
PGAPrintPopulation - Calls PGAPrintIndividual to print each member of a
PGAPrintReport - prints genetic algorithm statistics.  The statistics
PGAPrintString - write the allele values in a string to a file
PGARandom01 - generates a uniform random number on the interval [0,1)
PGARandomFlip - flip a biased coin and return PGA_TRUE if the coin is
PGARandomGaussian - returns an approximation to a Gaussian random number
PGARandomInterval - returns a uniform random number on the specified
PGARandomUniform - returns a uniform random number on the interval
PGARank - returns the rank of a string in a population.  This is a value
PGAReceiveIndividual - receive an individual from another process
PGARestart - reseeds a population from the best string
PGARound - Mathematically round a double to an integer, using 0.5 as the
PGARun - Highest level routine to execute the genetic algorithm.  It
PGARunGM - High-level routine to execute the genetic algorithm using the
PGARunMutationAndCrossover - Performs crossover and mutation from one
PGARunMutationOrCrossover - Performs crossover or mutation (but not both)
PGASelect - performs genetic algorithm selection using either the default
PGASelectNextIndex - returns the index of next individual in
PGASendIndividual - transmit an individual to another process
PGASendReceiveIndividual - Send an individual to a process, while receiving
PGASetBinaryAllele - sets a binary allele to the specified value.
PGASetBinaryInitProb - specify the probability of initializing an allele to
PGASetCharacterAllele - sets the value of an allele in a
PGASetCharacterInitType - sets a flag to specify whether the character
PGASetCommunicator - Set the default communicator to use when PGARun is
PGASetCrossoverProb - Probability that a selected string will undergo
PGASetCrossoverType - specify the type of crossover to use. Valid choices
PGASetDebugLevel - Turn on a debug level.  Only valid if PGAPack
PGASetDebugLevelByName - Turn on debugging of the named function.
PGASetEvaluation - Set the evaluation function value for a string to a
PGASetEvaluationUpToDateFlag - sets the flag associated with a
PGASetFitnessCmaxValue - The value of the multiplier used by
PGASetFitnessMinType - sets the type of algorithm used if a minimization
PGASetFitnessType - Set the type of fitness algorithm to use. Valid choices
PGASetIntegerAllele - sets the value of a (integer) allele.
PGASetIntegerInitPermute - sets a flag to tell the initialization routines
PGASetIntegerInitRange - sets a flag to tell the initialization routines to
PGASetMaxFitnessRank - The value of the parameter Max when using linear
PGASetMaxGAIterValue - specify the maximum number of iterations for the
PGASetMaxNoChangeValue - specifiy maximum number of iterations of no change
PGASetMaxSimilarityValue - Specifiy the maximum percent of homogeneity of
PGASetMutationAndCrossoverFlag - A boolean flag to indicate if
PGASetMutationBoundedFlag - If this flag is set to PGA_TRUE, then for
PGASetMutationIntegerValue - Set multiplier to mutate PGA_DATATYPE_INTEGER
PGASetMutationOrCrossoverFlag - A boolean flag to indicate if recombination
PGASetMutationProb - Specifies the probability that a given allele will
PGASetMutationRealValue - Set multiplier to mutate PGA_DATATYPE_REAL
PGASetNoDuplicatesFlag - A boolean flag to indicate if duplicate strings are
PGASetNumReplaceValue - specifies the number of new strings to create each
PGASetPopReplaceType - Choose method of sorting strings to copy from old
PGASetPopSize - Specifies the size of the genetic algorithm population.
PGASetPrintFrequencyValue - Specifies the frequency with which genetic
PGASetPrintOptions - set flags to indicate what GA statistics should be
PGASetPTournamentProb - Specifies the probability that the string that wins
PGASetRandomInitFlag - A boolean flag to indicate whether to randomly
PGASetRandomSeed - set a seed for the random number generator.  The
PGASetRealAllele - sets the value of real-valued allele i in string p
PGASetRealInitPercent - sets the upper and lower bounds for randomly
PGASetRealInitRange - sets the upper and lower bounds for randomly
PGASetRestartAlleleChangeProb - specifies the probability with which
PGASetRestartFlag - specifies whether the algorithm should employ
PGASetRestartFrequencyValue - specifies the number of iterations of no
PGASetSelectType - specify the type of selection to use. Valid choices
PGASetStoppingRuleType - specify a stopping criterion.  If called more than
PGASetUniformCrossoverProb - Probability used in uniform crossover
PGASetUp - set all uninitialized variables to default values and initialize
PGASetUserFunction - specifies the name of a user-written function
PGASortPop - Creates an (internal) array of indices according to one of
PGAStddev - calculates the standard deviation of an array of elements
PGAUpdateGeneration - updates internal data structures for the next
photo - Full-color images
pid - Retrieve process identifiers
pidfile - create a file containing the process id of the current process.
Pipe - The Pipe uses system kernel buffering to hold data being passed either between two execution contexts within the same process, or between different processes. kernel buffering between processes and/or threads.
pivot_scaled_sprite - pivot_scaled_sprite
pivot_scaled_sprite_v_flip - pivot_scaled_sprite_v_flip
pivot_sprite - pivot_sprite
pivot_sprite_v_flip - pivot_sprite_v_flip
pixmap - image type for the XPM file format.
PKCS12_create - create a PKCS#12 structure
PKCS12_parse - parse a PKCS#12 structure
PKCS7_decrypt - decrypt content from a PKCS#7 envelopedData structure
PKCS7_encrypt - create a PKCS#7 envelopedData structure
PKCS7_sign - create a PKCS#7 signedData structure
PKCS7_verify - verify a PKCS#7 signedData structure
pkg::create - Construct an appropriate package ifneeded
pkg_mkIndex - Build an index for automatic loading of packages
pkgMkIndex - Build an index for automatic loading of packages
place - Geometry manager for fixed or rubber-sheet placement
pladv - Advance the (sub-)page
PlanesOfScreen -
plaxes - Draw a box with axes, etc. with arbitrary
play_audio_stream - play_audio_stream
play_fli - play_fli
playlist - Playlist methods
play_looped_midi - play_looped_midi
play_memory_fli - play_memory_fli
play_midi - play_midi
play_sample - play_sample
plbin - Plot a histogram from binned data
plbop - Begin a new page
plbox - Draw a box with axes, etc
plbox3 - Draw a box with axes, etc, in 3-d
plcalc_world - Calculate world coordinates and
plclear - Clear current (sub)page
plclr - Eject current page
plcol - Set color
plcol0 - Set color, map0
plcol1 - Set color, map1
plcont - Contour plot
plcpstrm - Copy state parameters from the
plend - End plotting session
plend1 - End plotting session for current stream
plenv - Set up standard window and draw box
plenv0 - Same as plenv (3plplot) but if in multiplot mode does not advance the subpage, instead clears it.
pleop - Eject current page
plerry - Draw y error bar
plfamadv - Advance to the next family file on the
plfill - Draw filled polygon
plfill3 - Draw filled polygon in 3D
plflush - Flushes the output stream
plfont - Set character font
plgchr - Get character default height and current
plgcol0 - Returns 8-bit RGB values for given color
plgcolbg - plgcolbg -  Returns the background color
plgcompression - Get the current device-compression setting
plgdev - Get the current device (keyword) name
plgdidev - Get parameters that define current device-space window
plgdiplt - Get parameters that define current plot-space window
plgfam - Get family file parameters
plgfnam - Get output file name
plglevel - Get the (current) run level
plgpage - Get page parameters
plgra - Switch to graphics screen
plgspa - Get current subpage parameters
plgstrm - Get current stream number
plgver - Get the current library version number
plgvpd - Get viewport limits in normalized
plgvpw - Get viewport limits in world coordinates
plgxax - Get x axis parameters
plgyax - Get y axis parameters
plgzax - Get z axis parameters
plhls - Set current color by HLS
plinit - Initialize PLplot
pljoin - Draw a line between two points
pllab - Simple routine to write labels
pllightsource - Sets the 3D position of the light
plline - Draw a line
plline3 - Draw a line in 3 space
pllsty - Select line style
plmesh - Plot surface mesh
plmkstrm - Creates a new stream and makes it the
plmtex - Write text relative to viewport boundaries
plot3d - Plot 3-d surface plot
plot3dc - Magnitude colored plot surface with contour.
plotscreenshots - QwtPlot
plpage - Begin a new page
plpat - Set area fill pattern
plplot - Advanced 2D and 3D scientific plotting library
plpoin3 - plpoin3 -  Plots a character at the specified points in 3 space
plpoly3 - Draw a polygon in 3 space
plprec - Set precision in numeric labels
plpsty - Select area fill pattern
plptex - Write text inside the viewport
plreplot - Replays contents of plot buffer to
plrgb - Set line color by red, green
plschr - Set character size
plscmap0 - Set color map0 colors by 8-bit RGB
plscmap1 - Set color map1 colors using 8-bit RGB
pl_setcontlabelparam - Set parameters of
Plucene - A Perl port of the Lucene search engine
Plucene::Analysis::Analyzer - base class for Analyzers
Plucene::Analysis::CharTokenizer - base class for character tokenisers
Plucene::Analysis::LetterTokenizer - Letter tokenizer
Plucene::Analysis::LowerCaseFilter - normalises token text to lower case
Plucene::Analysis::LowerCaseTokenizer - tokenizer which also lower cases text
Plucene::Analysis::PorterStemFilter - Porter stemming on the token stream
Plucene::Analysis::SimpleAnalyzer - The simple analyzer
Plucene::Analysis::Standard::StandardAnalyzer - standard analyzer
Plucene::Analysis::Standard::StandardTokenizer - standard tokenizer
Plucene::Analysis::StopAnalyzer - the stop-word analyzer
Plucene::Analysis::StopFilter - the stop filter
Plucene::Analysis::Token - A term in a field
Plucene::Analysis::TokenFilter - base class for token filters
Plucene::Analysis::Tokenizer - base class for tokenizers
Plucene::Analysis::WhitespaceAnalyzer - white space analyzer
Plucene::Analysis::WhitespaceTokenizer - white space tokenizer
Plucene::Bitvector - a vector of bits
Plucene::Document - The unit of indexing and searching
Plucene::Document::DateSerializer - Utility functions for dealing with dates
Plucene::Document::Field - A field in a Plucene::Document
Plucene::Index::DocumentWriter - the document writer
Plucene::Index::FieldInfo - infomation on a Field in a Document
Plucene::Index::FieldInfos - a collection of FieldInfo objects
Plucene::Index::FieldsReader - read Fields in a Document
Plucene::Index::FieldsWriter - writes Fields to a Document
Plucene::Index::Reader - Abstract class for accessing an index
Plucene::Index::SegmentInfo - Information on a Segment
Plucene::Index::SegmentInfos - A collection of SegmentInfo objects
Plucene::Index::SegmentMergeInfo - Segment Merge information
Plucene::Index::SegmentMerger - the Segment merger
Plucene::Index::SegmentReader - the Segment reader
Plucene::Index::SegmentsReader - reads the segments
Plucene::Index::SegmentTermDocs - Segment term docs
Plucene::Index::SegmentTermEnum - Segment term enum
Plucene::Index::SegmentTermPositions - Segment term positions
Plucene::Index::Term - a word from text
Plucene::Index::TermInfo - Information on an index term
Plucene::Index::TermInfosReader - read the term infos file
Plucene::Index::TermInfosWriter - write to the term infos file
Plucene::Index::Writer - write an index.
Plucene::QueryParser - Turn query strings into Plucene::Search::Query objects
Plucene::Search::BooleanClause - A clause in a boolean query
Plucene::Search::BooleanQuery - a boolean query
Plucene::Search::BooleanScorer - A boolean scorer
Plucene::Search::DateFilter - Restrict searches to given time periods
Plucene::Search::Filter - A search filter base class
Plucene::Search::HitCollector - Plucene::Search::HitCollector
Plucene::Search::Hits - A list of ranked documents
Plucene::Search::IndexSearcher - The index searcher
Plucene::Search::PhrasePositions - The position of a phrase
Plucene::Search::PhraseQuery - A query that matchs a phrase
Plucene::Search::PhraseScorer - a phrase scorer
Plucene::Search::PhraseScorer::Exact - exact phrase scorer