section 3 · Library functions 📚

P (continued)

• pcre2_set_heap_limit(3)Perl-compatible regular expressions (revised API)✨
• pcre2_set_match_limit(3)Perl-compatible regular expressions (revised API)✨
• pcre2_set_max_pattern_compiled_length(3)Perl-compatible regular expressions (revised API)✨
• pcre2_set_max_pattern_length(3)Perl-compatible regular expressions (revised API)✨
• pcre2_set_max_varlookbehind(3)Perl-compatible regular expressions (revised API)✨
• pcre2_set_newline(3)Perl-compatible regular expressions (revised API)✨
• pcre2_set_offset_limit(3)Perl-compatible regular expressions (revised API)✨
• pcre2_set_optimize(3)Perl-compatible regular expressions (revised API)✨
• pcre2_set_parens_nest_limit(3)Perl-compatible regular expressions (revised API)✨
• pcre2_set_recursion_limit(3)Perl-compatible regular expressions (revised API)✨
• pcre2_set_recursion_memory_management(3)Perl-compatible regular expressions (revised API)✨
• pcre2_set_substitute_callout(3)Perl-compatible regular expressions (revised API)✨
• pcre2_set_substitute_case_callout(3)Perl-compatible regular expressions (revised API)✨
• pcre2_substitute(3)Perl-compatible regular expressions (revised API)✨
• pcre2_substring_copy_byname(3)Perl-compatible regular expressions (revised API)✨
• pcre2_substring_copy_bynumber(3)Perl-compatible regular expressions (revised API)✨
• pcre2_substring_free(3)Perl-compatible regular expressions (revised API)✨
• pcre2_substring_get_byname(3)Perl-compatible regular expressions (revised API)✨
• pcre2_substring_get_bynumber(3)Perl-compatible regular expressions (revised API)✨
• pcre2_substring_length_byname(3)Perl-compatible regular expressions (revised API)✨
• pcre2_substring_length_bynumber(3)Perl-compatible regular expressions (revised API)✨
• pcre2_substring_list_free(3)Perl-compatible regular expressions (revised API)✨
• pcre2_substring_list_get(3)Perl-compatible regular expressions (revised API)✨
• pcre2_substring_nametable_scan(3)Perl-compatible regular expressions (revised API)✨
• pcre2_substring_number_from_name(3)Perl-compatible regular expressions (revised API)✨
• pcre2api(3)Perl-compatible regular expressions (revised API) #include <pcre2.h> PCRE2 is a new API for PCRE, starting at release 10.0. This document contains a description of all its native functions. See the…✨
• pcre2build(3)Perl-compatible regular expressions (revised API)✨
• pcre2callout(3)Perl-compatible regular expressions (revised API)✨
• pcre2compat(3)Perl-compatible regular expressions (revised API)✨
• pcre2convert(3)Perl-compatible regular expressions (revised API)✨
• pcre2demo(3)A demonstration C program for PCRE2✨
• pcre2jit(3)Perl-compatible regular expressions (revised API)✨
• pcre2limits(3)Perl-compatible regular expressions (revised API)✨
• pcre2matching(3)Perl-compatible regular expressions (revised API)✨
• pcre2partial(3)Perl-compatible regular expressions (revised API)✨
• pcre2pattern(3)Perl-compatible regular expressions (revised API)✨
• pcre2perform(3)Perl-compatible regular expressions (revised API)✨
• pcre2posix(3)Perl-compatible regular expressions (revised API)✨
• pcre2sample(3)Perl-compatible regular expressions (revised API)✨
• pcre2serialize(3)Perl-compatible regular expressions (revised API)✨
• pcre2syntax(3)Perl-compatible regular expressions (revised API)✨
• pcre2unicode(3)Perl-compatible regular expressions (revised API)✨
• pcre32(3)Perl-compatible regular expressions #include <pcre.h>✨
• pcre32_assign_jit_stack(3)Perl-compatible regular expressions✨
• pcre32_compile(3)Perl-compatible regular expressions✨
• pcre32_compile2(3)Perl-compatible regular expressions✨
• pcre32_config(3)Perl-compatible regular expressions✨
• pcre32_copy_named_substring(3)Perl-compatible regular expressions✨
• pcre32_copy_substring(3)Perl-compatible regular expressions✨
• pcre32_dfa_exec(3)Perl-compatible regular expressions✨
• pcre32_exec(3)Perl-compatible regular expressions✨
• pcre32_free_study(3)Perl-compatible regular expressions✨
• pcre32_free_substring(3)Perl-compatible regular expressions✨
• pcre32_free_substring_list(3)Perl-compatible regular expressions✨
• pcre32_fullinfo(3)Perl-compatible regular expressions✨
• pcre32_get_named_substring(3)Perl-compatible regular expressions✨
• pcre32_get_stringnumber(3)Perl-compatible regular expressions✨
• pcre32_get_stringtable_entries(3)Perl-compatible regular expressions✨
• pcre32_get_substring(3)Perl-compatible regular expressions✨
• pcre32_get_substring_list(3)Perl-compatible regular expressions✨
• pcre32_jit_exec(3)Perl-compatible regular expressions✨
• pcre32_jit_stack_alloc(3)Perl-compatible regular expressions✨
• pcre32_jit_stack_free(3)Perl-compatible regular expressions✨
• pcre32_maketables(3)Perl-compatible regular expressions✨
• pcre32_pattern_to_host_byte_order(3)Perl-compatible regular expressions✨
• pcre32_refcount(3)Perl-compatible regular expressions✨
• pcre32_study(3)Perl-compatible regular expressions✨
• pcre32_utf32_to_host_byte_order(3)Perl-compatible regular expressions✨
• pcre32_version(3)Perl-compatible regular expressions✨
• pcre_assign_jit_stack(3)Perl-compatible regular expressions✨
• pcre_compile(3)Perl-compatible regular expressions✨
• pcre_compile2(3)Perl-compatible regular expressions✨
• pcre_config(3)Perl-compatible regular expressions✨
• pcre_copy_named_substring(3)Perl-compatible regular expressions✨
• pcre_copy_substring(3)Perl-compatible regular expressions✨
• pcre_dfa_exec(3)Perl-compatible regular expressions✨
• pcre_exec(3)Perl-compatible regular expressions✨
• pcre_free_study(3)Perl-compatible regular expressions✨
• pcre_free_substring(3)Perl-compatible regular expressions✨
• pcre_free_substring_list(3)Perl-compatible regular expressions✨
• pcre_fullinfo(3)Perl-compatible regular expressions✨
• pcre_get_named_substring(3)Perl-compatible regular expressions✨
• pcre_get_stringnumber(3)Perl-compatible regular expressions✨
• pcre_get_stringtable_entries(3)Perl-compatible regular expressions✨
• pcre_get_substring(3)Perl-compatible regular expressions✨
• pcre_get_substring_list(3)Perl-compatible regular expressions✨
• pcre_jit_exec(3)Perl-compatible regular expressions✨
• pcre_jit_stack_alloc(3)Perl-compatible regular expressions✨
• pcre_jit_stack_free(3)Perl-compatible regular expressions✨
• pcre_maketables(3)Perl-compatible regular expressions✨
• pcre_pattern_to_host_byte_order(3)Perl-compatible regular expressions✨
• pcre_refcount(3)Perl-compatible regular expressions✨
• pcre_rule(3)✨
• pcre_rule_len(3)✨
• pcre_study(3)Perl-compatible regular expressions✨
• pcre_utf16_to_host_byte_order(3)Perl-compatible regular expressions✨
• pcre_utf32_to_host_byte_order(3)Perl-compatible regular expressions✨
• pcre_version(3)Perl-compatible regular expressions✨
• pcreapi(3)Perl-compatible regular expressions #include <pcre.h>✨
• pcrebuild(3)Perl-compatible regular expressions✨
• pcrecallout(3)Perl-compatible regular expressions✨
• pcrecompat(3)Perl-compatible regular expressions✨
• pcrecpp(3)Perl-compatible regular expressions.✨
• pcredemo(3)✨
• pcrejit(3)Perl-compatible regular expressions✨
• pcrelimits(3)Perl-compatible regular expressions✨
• pcrematching(3)Perl-compatible regular expressions✨
• pcrepartial(3)Perl-compatible regular expressions✨
• pcrepattern(3)Perl-compatible regular expressions✨
• pcreperform(3)Perl-compatible regular expressions✨
• pcreposix(3)Perl-compatible regular expressions.✨
• pcreprecompile(3)Perl-compatible regular expressions✨
• pcresample(3)Perl-compatible regular expressions✨
• pcrestack(3)Perl-compatible regular expressions✨
• pcresyntax(3)Perl-compatible regular expressions✨
• pcreunicode(3)Perl-compatible regular expressions✨
• pcsrscl(3)multiplie an N-element complex distributed vector sub( X ) by the real scalar 1/a✨
• pcstein(3)compute the eigenvectors of a symmetric tridiagonal matrix in parallel, using inverse iteration✨
• pctrcon(3)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(3)provide error bounds and backward error estimates for the solution to a system of linear equations with a triangular coefficient matrix✨
• pctrti2(3)compute the inverse of a complex upper or lower triangular block matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)✨
• pctrtri(3)compute the inverse of a upper or lower triangular distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)✨
• pctrtrs(3)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 ),✨
• pctype(3)✨
• pctzrzf(3)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(3)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 =…✨
• pcung2r(3)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(3)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(3)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(3)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 =…✨
• pcungqr(3)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(3)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 = H(1)'…✨
• pcungrq(3)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 = H(1)'…✨
• pcunm2l(3)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(3)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(3)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(3)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(3)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(3)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(3)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(3)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(3)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(3)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(3)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(3)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(3)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'✨
• pdcp(3)✨
• pdcp_xfrm(3)✨
• pddbsv(3)solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pddbtrf(3)compute a LU factorization of an N-by-N real banded diagonally dominant-like distributed matrix with bandwidth BWL, BWU✨
• pddbtrs(3)solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pddbtrsv(3)solve a banded triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pddtsv(3)solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pddttrf(3)compute a LU factorization of an N-by-N real tridiagonal diagonally dominant-like distributed matrix A(1:N, JA:JA+N-1)✨
• pddttrs(3)solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pddttrsv(3)solve a tridiagonal triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pdfio(3)pdf read/write library✨
• pdgbsv(3)solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pdgbtrf(3)compute a LU factorization of an N-by-N real banded distributed matrix with bandwidth BWL, BWU✨
• pdgbtrs(3)solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pdgebd2(3)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(3)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(3)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(3)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(3)reduce a real general distributed matrix sub( A ) to upper Hessenberg form H by an orthogonal similarity transforma- tion✨
• pdgehrd(3)reduce a real general distributed matrix sub( A ) to upper Hessenberg form H by an orthogonal similarity transforma- tion✨
• pdgelq2(3)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(3)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(3)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(3)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(3)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(3)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(3)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(3)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(3)improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solutions✨
• pdgerq2(3)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(3)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(3)compute the solution to a real system of linear equations sub( A ) * X = sub( B ),✨
• pdgesvd(3)compute the singular value decomposition (SVD) of an M-by-N matrix A, optionally computing the left and/or right singular vectors✨
• pdgesvx(3)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(3)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(3)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(3)compute the inverse of a distributed matrix using the LU factorization computed by PDGETRF✨
• pdgetrs(3)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(3)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(3)compute a generalized RQ factorization of an M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1)✨
• pdlabad(3)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(3)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(3)estimate the 1-norm of a square, real distributed matrix A✨
• pdlaconsb(3)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(3)copie all or part of a distributed matrix A to another distributed matrix B✨
• pdlacp3(3)i an auxiliary routine that copies from a global parallel array into a local replicated array or vise versa✨
• pdlacpy(3)copie all or part of a distributed matrix A to another distributed matrix B✨
• pdlaevswp(3)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(3)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(3)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(3)determine double precision machine parameters✨
• pdlange(3)return the value of the one norm, or the Frobenius norm,✨
• pdlanhs(3)return the value of the one norm, or the Frobenius norm,✨
• pdlansy(3)return the value of the one norm, or the Frobenius norm,✨