.\" 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 "BEFS_FIND_KEY" "" "06 October 2005" "" ""

.SH NAME
befs_find_key \- Search for a key within a node
.SH SYNOPSIS
"SYNOPSIS"
.sp
\fB
.sp
int befs_find_key  (struct super_block * \fIsb\fB, befs_btree_node * \fInode\fB, const char * \fIfindkey\fB, befs_off_t * \fIvalue\fB);
\fR
.SH "ARGUMENTS"
.TP
\fB\fIsb\fB\fR
Filesystem superblock
.TP
\fB\fInode\fB\fR
Node to find the key within
.TP
\fB\fIfindkey\fB\fR
-- undescribed --
.TP
\fB\fIvalue\fB\fR
If key is found, the value stored with the key is put here
.SH "DESCRIPTION"
.PP
finds exact match if one exists, and returns BEFS_BT_MATCH
If no exact match, finds first key in node that is greater
(alphabetically) than the search key and returns BEFS_BT_PARMATCH
(for partial match, I guess). Can you think of something better to
call it?
.PP
If no key was a match or greater than the search key, return
BEFS_BT_NOT_FOUND.
.PP
Use binary search instead of a linear.