.\" This manpage has been automatically generated by docbook2man 
.\" from a DocBook document.  This tool can be found at:
.\" <http://shell.ipoline.com/~elmert/comp/docbook2X/> 
.\" Please send any bug reports, improvements, comments, patches, 
.\" etc. to Steve Cheng <steve@ggi-project.org>.
.TH "RADIX_TREE_GANG_LOOKUP" "9" "09 October 2005" "" ""

.SH NAME
radix_tree_gang_lookup \- perform multiple lookup on a radix tree
.SH SYNOPSIS
"SYNOPSIS"
.sp
\fB
.sp
unsigned int radix_tree_gang_lookup  (struct radix_tree_root * \fIroot\fB, void ** \fIresults\fB, unsigned long \fIfirst_index\fB, unsigned int \fImax_items\fB);
\fR
.SH "ARGUMENTS"
.TP
\fB\fIroot\fB\fR
radix tree root
.TP
\fB\fIresults\fB\fR
where the results of the lookup are placed
.TP
\fB\fIfirst_index\fB\fR
start the lookup from this key
.TP
\fB\fImax_items\fB\fR
place up to this many items at *results
.SH "DESCRIPTION"
.PP
Performs an index-ascending scan of the tree for present items.  Places
them at *\fIresults\fR and returns the number of items which were placed at
*\fIresults\fR\&.
.PP
The implementation is naive.