# Pages du manuel Linux : Fonctions des bibliothèques

DPMSGetTimeouts
retrieves the timeout values used by the X server for DPMS timings
DPMSGetVersion
returns the version of the DPMS extension implemented by the X server
DPMSInfo
returns information about the current DPMS state
DPMSQueryExtension
queries the X server to determine the availability of the DPMS Extension
DPMSSetTimeouts
permits applications to set the timeout values used by the X server for DPMS timings
dpocon
estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPOTRF
dpoequ
compute row and column scalings intended to equilibrate a symmetric positive definite matrix A and reduce its condition number (with respect to the two-norm)
dporfs
improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite,
dposv
compute the solution to a real system of linear equations A * X = B,
dposvx
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 * X = B,
dpotf2
compute the Cholesky factorization of a real symmetric positive definite matrix A
dpotrf
compute the Cholesky factorization of a real symmetric positive definite matrix A
dpotri
compute the inverse of a real symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPOTRF
dpotrs
solve a system of linear equations A*X = B with a symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPOTRF
dppcon
estimate the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite packed matrix using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPPTRF
dppequ
compute row and column scalings intended to equilibrate a symmetric positive definite matrix A in packed storage and reduce its condition number (with respect to the two-norm)
dpprfs
improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and packed, and provides error bounds and backward error estimates for the solution
dppsv
compute the solution to a real system of linear equations A * X = B,
dppsvx
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 * X = B,
dpptrf
compute the Cholesky factorization of a real symmetric positive definite matrix A stored in packed format
dpptri
compute the inverse of a real symmetric positive definite matrix A using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPPTRF
dpptrs
solve a system of linear equations A*X = B with a symmetric positive definite matrix A in packed storage using the Cholesky factorization A = U**T*U or A = L*L**T computed by DPPTRF
dprintf
Ecriture formatée dans un descripteur de fichier
dptcon
compute the reciprocal of the condition number (in the 1-norm) of a real symmetric positive definite tridiagonal matrix using the factorization A = L*D*L**T or A = U**T*D*U computed by DPTTRF
dpteqr
compute all eigenvalues and, optionally, eigenvectors of a symmetric positive definite tridiagonal matrix by first factoring the matrix using DPTTRF, and then calling DBDSQR to compute the singular values of the bidiagonal factor
dptrfs
improve the computed solution to a system of linear equations when the coefficient matrix is symmetric positive definite and tridiagonal, and provides error bounds and backward error estimates for the solution
dptsv
compute the solution to a real system of linear equations A*X = B, where A is an N-by-N symmetric positive definite tridiagonal matrix, and X and B are N-by-NRHS matrices
dptsvx
use the factorization A = L*D*L**T to compute the solution to a real system of linear equations A*X = B, where A is an N-by-N symmetric positive definite tridiagonal matrix and X and B are N-by-NRHS matrices
dpttrf
compute the L*D*L' factorization of a real symmetric positive definite tridiagonal matrix A
dpttrs
solve a tridiagonal system of the form A * X = B using the L*D*L' factorization of A computed by DPTTRF
dpttrsv
solve one of the triangular systems L**T* X = B, or L * X = B,
dptts2
solve a tridiagonal system of the form A * X = B using the L*D*L' factorization of A computed by DPTTRF
dragdrop
facilities for handling drag&drop data transfers
draggers
drand48
Générateurs de nombres pseudo-aléatoires uniformément distribués.
drand48
generate uniformly distributed pseudo-random numbers
drand48_r
drand48_r, erand48_r, lrand48_r, nrand48_r, mrand48_r, jrand48_r, srand48_r, seed48_r, lcong48_r - generate uniformly distributed pseudo-random numbers reentrantly
DrawFocHlt
draw the traversal highlight ring for a widget
Drawing
general purpose drawing widget
drawing_mode
Sets the graphics drawing mode. Allegro game programming library.
draw_character_ex
Draws non transparent pixels of the sprite with a color. Allegro game programming library.
draw_compiled_sprite
Draws a compiled sprite. Allegro game programming library.
draw_gouraud_sprite
Draws a sprite with gouraud shading. Allegro game programming library.
draw_lit_rle_sprite
Draws a tinted RLE sprite. Allegro game programming library.
draw_lit_sprite
Draws a sprite tinted with a specific color. Allegro game programming library.
draw_rle_sprite
Draws an RLE sprite. Allegro game programming library.
draw_sprite
Draws a copy of the sprite onto the destination bitmap. Allegro game programming library.
draw_sprite_h_flip
See draw_sprite_v_flip.3alleg
draw_sprite_vh_flip
See draw_sprite_v_flip.3alleg
draw_sprite_v_flip
Draws the sprite transformed to the destination bitmap. Allegro game programming library.