mirror of
https://github.com/fadden/ciderpress.git
synced 2024-12-22 20:29:51 +00:00
35 lines
1.1 KiB
C
35 lines
1.1 KiB
C
|
/*
|
||
|
|
* libhfs - library for reading and writing Macintosh HFS volumes
|
||
|
|
* Copyright (C) 1996-1998 Robert Leslie
|
||
|
|
*
|
||
|
|
* This program is free software; you can redistribute it and/or modify
|
||
|
|
* it under the terms of the GNU General Public License as published by
|
||
|
|
* the Free Software Foundation; either version 2 of the License, or
|
||
|
|
* (at your option) any later version.
|
||
|
|
*
|
||
|
|
* This program is distributed in the hope that it will be useful,
|
||
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
|
|
* GNU General Public License for more details.
|
||
|
|
*
|
||
|
|
* You should have received a copy of the GNU General Public License
|
||
|
|
* along with this program; if not, write to the Free Software
|
||
|
|
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
||
|
|
*
|
||
|
|
* $Id$
|
||
|
|
*/
|
||
|
|
|
||
|
|
void n_init(node *, btree *, int, int);
|
||
|
|
|
||
|
|
int n_new(node *);
|
||
|
|
int n_free(node *);
|
||
|
|
|
||
|
|
int n_search(node *, const byte *);
|
||
|
|
|
||
|
|
void n_index(const node *, byte *, unsigned int *);
|
||
|
|
|
||
|
|
void n_insertx(node *, const byte *, unsigned int);
|
||
|
|
int n_insert(node *, byte *, unsigned int *);
|
||
|
|
|
||
|
|
int n_delete(node *, byte *, int *);
|