LDP
/
man-pages
mirror of https://github.com/mkerrisk/man-pages
0
1
Fork 0
Code Releases Activity

ffix

This commit is contained in:
Michael Kerrisk 2007-07-09 20:25:04 +00:00
parent a9b4ebbc8f
commit e505689487
9 changed files with 52 additions and 24 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
man3/MB_CUR_MAX.3
View File

@ -27,7 +27,8 @@ the maximum number of bytes needed to represent a single
wide character in the current locale.
It is locale dependent and therefore not a compile-time constant.
.SH "RETURN VALUE"
An integer >= 1 and <= MB_LEN_MAX.
An integer >= 1 and <=
.BR MB_LEN_MAX .
The value 1 denotes traditional 8-bit encoded characters.
.SH "CONFORMING TO"
C99, POSIX.1-2001.

4
man3/MB_LEN_MAX.3
View File

@ -32,12 +32,12 @@ C99, POSIX.1-2001.
The entities
.B MB_LEN_MAX
and
.B sizeof(wchar_t)
.I sizeof(wchar_t)
are totally unrelated.
In the GNU libc,
.B MB_LEN_MAX
is typically 6 while
.B sizeof(wchar_t)
.I sizeof(wchar_t)
is 4.
.SH "SEE ALSO"
.BR MB_CUR_MAX (3)

30
man3/btree.3
View File

@ -56,9 +56,12 @@ associated key/data pairs.
.PP
The btree access method specific data structure provided to
.BR dbopen (3)
is defined in the <db.h> include file as follows:
is defined in the
.I <db.h>
include file as follows:
.in +0.5i
.nf
typedef struct {
u_long flags;
u_int cachesize;
@ -67,14 +70,14 @@ typedef struct {
u_int psize;
int (*compare)(const DBT *key1, const DBT *key2);
size_t (*prefix)(const DBT *key1, const DBT *key2);
int lorder;
int lorder;
} BTREEINFO;
.fi
.in
.PP
The elements of this structure are as follows:
.TP
flags
.I flags
The flag value is specified by
.IR or 'ing
any of the following values:
@ -101,7 +104,7 @@ routine calls with the R_CURSOR flag set will always return the logical
``first'' of any group of duplicate keys.
.RE
.TP
cachesize
.I cachesize
A suggested maximum size (in bytes) of the memory cache.
This value is
.I only
@ -116,7 +119,7 @@ If
.I cachesize
is 0 (no size is specified) a default cache is used.
.TP
maxkeypage
.I maxkeypage
The maximum number of keys which will be stored on any single page.
Not currently implemented.
.\" The maximum number of keys which will be stored on any single page.
@ -128,7 +131,7 @@ Not currently implemented.
.\" is 0 (no maximum number of keys is specified) the page fill factor is
.\" made as large as possible (which is almost invariably what is wanted).
.TP
minkeypage
.I minkeypage
The minimum number of keys which will be stored on any single page.
This value is used to determine which keys will be stored on overflow
pages, that is, if a key or data item is longer than the pagesize divided
@ -138,7 +141,7 @@ If
.I minkeypage
is 0 (no minimum number of keys is specified) a value of 2 is used.
.TP
psize
.I psize
Page size is the size (in bytes) of the pages used for nodes in the tree.
The minimum page size is 512 bytes and the maximum page size is 64K.
If
@ -146,7 +149,7 @@ If
is 0 (no page size is specified) a page size is chosen based on the
underlying file system I/O block size.
.TP
compare
.I compare
Compare is the key comparison function.
It must return an integer less than, equal to, or greater than zero if the
first key argument is considered to be respectively less than, equal to,
@ -158,7 +161,7 @@ If
is NULL (no comparison function is specified), the keys are compared
lexically, with shorter keys considered less than longer keys.
.TP
prefix
.I prefix
Prefix is the prefix comparison function.
If specified, this routine must return the number of bytes of the second key
argument which are necessary to determine that it is greater than the first
@ -177,7 +180,7 @@ If
is NULL and a comparison routine is specified, no prefix comparison is
done.
.TP
lorder
.I lorder
The byte order for integers in the stored database metadata.
The number should represent the order as an integer; for example,
big endian order would be the number 4,321.
@ -188,7 +191,12 @@ is 0 (no order is specified) the current host order is used.
If the file already exists (and the
.B O_TRUNC
flag is not specified), the
values specified for the parameters flags, lorder and psize are ignored
values specified for the parameters
.IR flags ,
.I lorder
and
.I psize
are ignored
in favor of the values used when the tree was created.
.PP
Forward sequential scans of a tree are from the least key to the greatest.

9
man3/clock.3
View File

@ -44,10 +44,12 @@ to get the number of seconds used, divide by
.BR CLOCKS_PER_SEC .
If the processor time used is not available or its value cannot
be represented, the function returns the value
.BR (clock_t)\-1 .
.IR (clock_t)\-1 .
.SH "CONFORMING TO"
C89, C99, POSIX.1-2001.
POSIX requires that CLOCKS_PER_SEC equals 1000000 independent
POSIX requires that
.B CLOCKS_PER_SEC
equals 1000000 independent
of the actual resolution.
.SH NOTES
The C standard allows for arbitrary values at the start of the program;
@ -57,7 +59,8 @@ at the start of the program to get maximum portability.
.PP
Note that the time can wrap around.
On a 32-bit system where
CLOCKS_PER_SEC equals 1000000 this function will return the same
.B CLOCKS_PER_SEC
equals 1000000 this function will return the same
value approximately every 72 minutes.
.PP
On several other implementations,

3
man3/conj.3
View File

@ -17,7 +17,8 @@ Link with \fI-lm\fP.
.SH DESCRIPTION
The
.BR conj ()
function returns the complex conjugate value of z.
function returns the complex conjugate value of
.IR z .
That is the value obtained by changing the sign of the imaginary part.
.LP
One has cabs(z) = csqrt(z * conj(z)).

9
man3/cpow.3
View File

@ -15,8 +15,13 @@ cpow, cpowf, cpowl \- complex power function
.sp
Link with \fI-lm\fP.
.SH DESCRIPTION
The function calculates x raised to the power z.
(With a branch cut for x along the negative real axis.)
The function calculates
.I x
raised to the power
.IR z .
(With a branch cut for
.I x
along the negative real axis.)
.SH "CONFORMING TO"
C99
.SH "SEE ALSO"

6
man3/cproj.3
View File

@ -17,7 +17,11 @@ Link with \fI-lm\fP.
.SH DESCRIPTION
This function projects a point in the plane onto the surface of a
Riemann Sphere, the one-point compactification of the complex plane.
Each finite point z projects to z itself.
Each finite point
.I z
projects to
.I z
itself.
Every complex infinite value is projected to a single infinite value,
namely to positive infinity on the real axis.
.SH "CONFORMING TO"

3
man3/creal.3
View File

@ -17,7 +17,8 @@ Link with \fI-lm\fP.
.SH DESCRIPTION
The
.BR creal ()
function returns the real part of the complex number z.
function returns the real part of the complex number
.IR z .
.LP
One has z = creal(z) + I * cimag(z).
.SH "CONFORMING TO"

9
man3/encrypt.3
View File

@ -81,6 +81,7 @@ They use the following
structure to hold the key data:
.RS
.nf
struct crypt_data {
char keysched[16 * 8];
char sb0[32768];
@ -95,6 +96,7 @@ struct crypt_data {
};
.fi
.RE
.PP
Before calling
.BR setkey_r ()
set
@ -126,8 +128,11 @@ are GNU extensions.
In glibc 2.2 these functions use the DES algorithm.
.SH EXAMPLE
You need to link with libcrypt to compile this example with glibc 2.2.
To do useful work the key[] and txt[] arrays must be filled with a
useful bit pattern.
To do useful work the
.I key[]
and
.I txt[]
arrays must be filled with a useful bit pattern.
.sp
.nf
#define _XOPEN_SOURCE