.fp 5 CW
..
.nr ;G \\n(.f
.Af "\\$1" "\\$2" "\\$3" "\\$4" "\\$5" "\\$6" "\\$7" "\\$8" "\\$9"
\\*(;G
..
.aF 5 \\n(.f "\\$1" "\\$2" "\\$3" "\\$4" "\\$5" "\\$6" "\\$7"
..
.aF 5 1 "\\$1" "\\$2" "\\$3" "\\$4" "\\$5" "\\$6" "\\$7"
..
.aF 1 5 "\\$1" "\\$2" "\\$3" "\\$4" "\\$5" "\\$6" "\\$7"
..
0
..
..
FIND 3
NAME
find - fastfind algorithm interface
SYNOPSIS
.EX
#include <find.h>
void* findopen(const char* pattern);
char* findnext(void* handle);
void findclose(void* handle);
DESCRIPTION
These routines access the data generated by the
fastfind algorithm.
The data itself is generated by a standalone program that is run daily
via
cron or
at . .L findopen returns a handle to a fastfind stream for the ksh file pattern pattern . .L findnext returns the next pathname that matches the pattern specified by handle . .L findnext returns .L 0 when no more pathnames match the pattern. Finally, .L findclose closes the fastfind stream for handle .
BUGS
These rotuines are only as good as the
fastfind information which is in the system administration domain.
"SEE ALSO"
tw(1),
find(1),
strmatch(3)
James A. Woods, Fast Find Algorithm, Usenix ;login:, February/March, 1983, p. 8