5fe776f5a2
* contrib/btree/hb_btree.api
+ extern "C"
* rename nFlags to ulFlags
+ declaration for hb_BTreeDataItem()
* declaration for hb_BTreeInsert() to use a PHB_ITEM vs LONG
* contrib/btree/hb_btree.ch
- comments from around 'inmemory' definition
* contrib/btree/test/test.prg
+ code to test in-memory tree, including passing floats vs longs
* contrib/btree/test/ctest.c
! a SEEK call that was incorrectly failing because the
DATA param passed as 0
* hb_BTreeInsert() calls to use new form (PHB_ITEM vs long)
* contrib/btree/hb_btree.c
; the following warnings are reported by BCC (thanks Alexander):
Suspicious pointer conversion in function hb_BTreeNew & hb_BTreeOpen
pBTree->pStrCompare = strncmp;
Parameter 'ulFlags' is never used in function hb_BTreeOpen
- defintion and use of DBG() macro
+ extern "C" ifdef'd
- comments from around 'inmemory' definition
* renamed nFlags to ulFlags, lFlags to ulFlags, position to iPosition
* hb_btreenew [hi level] - when flag contains HB_BTREE_INMEMORY,
first
parameter is ignored
* hb_btreenew [lo level] - when flag contains HB_BTREE_INMEMORY,
dont
try to open the file, etc, and clear necessary fields
* hb_btreeclose [lo level] - close file and release file name only when
necessary
* only call HeaderWrite() when not in-memory tree
+ ioOneBufferAlloc() - allocate one ioBuffer_T block, called by
ioBufferAlloc(), and Grow() when in-memory
* Grow() in-memory - add a page to the link list
+ Prune() in-memory - added code to remove a page from the link list
* (assorted) IsDirty flag is assigned the tree property IsDirtyFlagAssignment,
so that in-memory trees never fire the write methods (ie. always false)
* hb_BTreeGoTop(), hb_BTreeGoBottom() [lo-level]
+ bug fix: preserve last node found
+ if tree is empty, clear key/data, else retrieve selected key/data
* ioBufferRead() - moved IsDirty reset within "if ( IsDirty )" block
* ioBufferScan() - call ioBufferRead() when not in-memory tree
- SearchNode() redundant BufferRelease() and return statement
- enum ExceptionTypes (not used)
- Buffer_T typedef struct, incorporating into the ioBuffer_T typedef struct
* hb_KeyData_T: replaced lData with a union lData/pData
+ definition for hb_BTreeDataItem()
* definition for hb_BTreeInsert() to use a PHB_ITEM vs LONG
* hb_btreeinsert() [hi-level] accepts only number for file i/o and
any data type for in-memory
- macro SETKEYDATA(), placing equivalent code into hb_BTreeInsert()
+ Prune() - release individial items and then the page itself
! CountAdj() last param should have been SHORT not USHORT
; RecDelete() moved the inline assignment & comparision around to remove
the b32 warning
TODO: find a solution to the 'Suspicious pointer conversion in function
hb_BTreeNew & hb_BTreeOpen' [strncmp() & hb_strncmp()]
TODO: impliment ulFlags within hb_btreeopen() - see warning above
- clear im-memory flag
- get unique flag from file header
* contrib/btree/doc/hb_btree.txt
* spelling corrections
* clarified use of HB_BTREE_INMEMORY flag with hb_BTreeNew() API
! corrected type of pBTree params, from 'hb_BTree *' to 'struct hb_BTree *'
+ definition for hb_BTreeDataItem()
* clarified use of data param and data return value
314 lines
9.2 KiB
Plaintext
314 lines
9.2 KiB
Plaintext
/*
|
|
* $Id$
|
|
*/
|
|
|
|
#include "simpleio.ch"
|
|
#include "hb_btree.ch"
|
|
#include "fileio.ch"
|
|
|
|
Procedure Main()
|
|
local n, a
|
|
local c
|
|
|
|
if fileattr( "test_1.out") = 1 + 32
|
|
setfattr( "test_1.out", 32 )
|
|
ferase( "test_1.out" )
|
|
endif
|
|
|
|
? "Harbour API test: in-memory"
|
|
n := hb_btreenew( , 2048, 90, HB_BTREE_READONLY + HB_BTREE_INMEMORY )
|
|
if n > 0
|
|
? "successfully opened"
|
|
insertdata( n, 100 )
|
|
? "# keys", hb_btreeinfo( n, HB_BTREEINFO_KEYCOUNT )
|
|
|
|
? "skip to EOF test"
|
|
hb_btreegobottom( n )
|
|
? hb_btreekey( n ), hb_btreedata( n )
|
|
? hb_btreeskip( n, 1 )
|
|
? "skip to EOF test end"
|
|
|
|
? "Forward traversal"
|
|
hb_btreegotop( n )
|
|
c := 0
|
|
while .t.
|
|
? hb_btreekey( n ), hb_btreedata( n ), ++c
|
|
if 1 <> hb_btreeskip( n, 1 )// .or. c == hb_btreeinfo( n, HB_BTREEINFO_KEYCOUNT )-1
|
|
exit
|
|
endif
|
|
end
|
|
? "Forward traversal end"
|
|
?
|
|
|
|
? "Reverse traversal"
|
|
hb_btreegobottom( n )
|
|
c := 0
|
|
while .t.
|
|
? hb_btreekey( n ), hb_btreedata( n ), ++c
|
|
if -1 <> hb_btreeskip( n, -1 )// .or. c == hb_btreeinfo( n, HB_BTREEINFO_KEYCOUNT )-1
|
|
exit
|
|
endif
|
|
end
|
|
? "Reverse traversal end"
|
|
?
|
|
|
|
? "Test SEEK of 'cdntyzrf'"
|
|
? hb_btreeseek( n, "cdntyzrf" )
|
|
? hb_btreekey( n ), hb_btreedata( n )
|
|
hb_btreeskip( n, 1 )
|
|
? hb_btreekey( n ), hb_btreedata( n ), "dmfmivqb ?"
|
|
|
|
?
|
|
? "Test soft SEEK of short key 'cd'"
|
|
? hb_btreeseek( n, "cd", , .t. )
|
|
? hb_btreekey( n ), hb_btreedata( n )
|
|
hb_btreeskip( n, 1 )
|
|
? hb_btreekey( n ), hb_btreedata( n ), "dmfmivqb ?"
|
|
|
|
?
|
|
? "Test soft SEEK of an existing key 'cdntyzrf'"
|
|
? hb_btreeseek( n, "cdntyzrf", , .t. )
|
|
? hb_btreekey( n ), hb_btreedata( n )
|
|
hb_btreeskip( n, 1 )
|
|
? hb_btreekey( n ), hb_btreedata( n ), "dmfmivqb ?"
|
|
|
|
?
|
|
? "Test soft SEEK of a missing key, that should force EOF ('zzzzzz')"
|
|
? hb_btreeseek( n, "zzzzzz" )
|
|
? hb_btreekey( n ), hb_btreedata( n )
|
|
hb_btreeskip( n, 1 )
|
|
? hb_btreekey( n ), hb_btreedata( n ), "dmfmivqb ?"
|
|
|
|
?
|
|
hb_btreeclose( n )
|
|
else
|
|
? "error / failure"
|
|
wait
|
|
endif
|
|
|
|
? "Harbour API test: in-memory end"
|
|
|
|
? "Harbour API test"
|
|
n := hb_btreenew( "test_1.out", 2048, 90, HB_BTREE_READONLY )
|
|
if n > 0
|
|
|
|
? valtype( a := hb_btreeinfo( n ) )
|
|
? "File", a[ HB_BTREEINFO_FILENAME ]
|
|
? "Page", a[ HB_BTREEINFO_PAGESIZE ]
|
|
? "Key ", a[ HB_BTREEINFO_KEYSIZE ]
|
|
? "Max ", a[ HB_BTREEINFO_MAXKEYS ]
|
|
? "Min ", a[ HB_BTREEINFO_MINKEYS ]
|
|
? "Flag", a[ HB_BTREEINFO_FLAGS ]
|
|
? "Keys", a[ HB_BTREEINFO_KEYCOUNT ]
|
|
?
|
|
|
|
insertdata( n )
|
|
|
|
? "Keys", hb_btreeinfo( n, HB_BTREEINFO_KEYCOUNT )
|
|
|
|
?
|
|
? "Forward traversal"
|
|
hb_btreegotop( n )
|
|
c := 0
|
|
while .t.
|
|
? hb_btreekey( n ), hb_btreedata( n ), ++c
|
|
if 1 <> hb_btreeskip( n, 1 )
|
|
exit
|
|
endif
|
|
end
|
|
|
|
?
|
|
? "Reverse traversal"
|
|
hb_btreegobottom( n )
|
|
c := 0
|
|
while .t.
|
|
? hb_btreekey( n ), hb_btreedata( n ), ++c
|
|
if -1 <> hb_btreeskip( n, -1 )
|
|
exit
|
|
endif
|
|
end
|
|
|
|
?
|
|
? "Test SEEK"
|
|
? hb_btreeseek( n, "cdntyzrf" )
|
|
? hb_btreekey( n ), hb_btreedata( n )
|
|
hb_btreeskip( n, 1 )
|
|
? hb_btreekey( n ), hb_btreedata( n ), "dmfmivqb ?"
|
|
|
|
?
|
|
? "Test soft SEEK of a short key"
|
|
? hb_btreeseek( n, "cd", , .t. )
|
|
? hb_btreekey( n ), hb_btreedata( n )
|
|
hb_btreeskip( n, 1 )
|
|
? hb_btreekey( n ), hb_btreedata( n ), "dmfmivqb ?"
|
|
|
|
?
|
|
? "Test soft SEEK of an existing key"
|
|
? hb_btreeseek( n, "cdntyzrf", , .t. )
|
|
? hb_btreekey( n ), hb_btreedata( n )
|
|
hb_btreeskip( n, 1 )
|
|
? hb_btreekey( n ), hb_btreedata( n ), "dmfmivqb ?"
|
|
|
|
?
|
|
? "Test soft SEEK of a missing key, that should force EOF"
|
|
? hb_btreeseek( n, "zzzzzz" )
|
|
? hb_btreekey( n ), hb_btreedata( n )
|
|
hb_btreeskip( n, 1 )
|
|
? hb_btreekey( n ), hb_btreedata( n ), "dmfmivqb ?"
|
|
|
|
?
|
|
|
|
hb_btreeclose( n )
|
|
|
|
TTest()
|
|
CTest()
|
|
|
|
else
|
|
? "error / failure"
|
|
endif
|
|
|
|
?
|
|
? "Harbour caseless sensitivity API test"
|
|
n := hb_btreenew( "test_1a.out", 2048, 90, HB_BTREE_CASELESS )
|
|
if n > 0
|
|
hb_btreeinsert( n, "alpha", 0 )
|
|
if hb_btreeinsert( n, "ALPHA", 0 )
|
|
? "inserted 'ALPHA', test failed"
|
|
else
|
|
? "could not insert 'ALPHA', test passed"
|
|
endif
|
|
hb_btreeclose( n )
|
|
endif
|
|
|
|
?
|
|
? "Harbour case sensitivity API test"
|
|
n := hb_btreenew( "test_1b.out", 2048, 90 )
|
|
if n > 0
|
|
hb_btreeinsert( n, "alpha", 0 )
|
|
if hb_btreeinsert( n, "ALPHA", 0 )
|
|
? "inserted 'ALPHA', test passed"
|
|
else
|
|
? "could not insert 'ALPHA', test failed"
|
|
endif
|
|
hb_btreeclose( n )
|
|
endif
|
|
|
|
?
|
|
|
|
return
|
|
|
|
static procedure insertdata( n, s )
|
|
if s == NIL ; s := 1; endif
|
|
hb_btreeinsert( n, "fuweqgsz", 1 / s )
|
|
hb_btreeinsert( n, "sjruexrd", 2 / s )
|
|
hb_btreeinsert( n, "fvveitnz", 3 / s )
|
|
hb_btreeinsert( n, "aqgksjxe", 4 / s )
|
|
hb_btreeinsert( n, "oonrehvj", 5 / s )
|
|
hb_btreeinsert( n, "gvowjwtr", 6 / s )
|
|
hb_btreeinsert( n, "xxidwtvn", 7 / s )
|
|
hb_btreeinsert( n, "rwjbxesd", 8 / s )
|
|
hb_btreeinsert( n, "yaznsaek", 9 / s )
|
|
hb_btreeinsert( n, "wbdhfkfy", 10 / s )
|
|
hb_btreeinsert( n, "lryaezia", 11 / s )
|
|
hb_btreeinsert( n, "tspmnrvk", 12 / s )
|
|
hb_btreeinsert( n, "hpxryhdj", 13 / s )
|
|
hb_btreeinsert( n, "sztcqaby", 14 / s )
|
|
hb_btreeinsert( n, "fcyzsqja", 15 / s )
|
|
hb_btreeinsert( n, "uccxumvg", 16 / s )
|
|
hb_btreeinsert( n, "amwuoout", 17 / s )
|
|
hb_btreeinsert( n, "yaytseln", 18 / s )
|
|
hb_btreeinsert( n, "sfiiozej", 19 / s )
|
|
hb_btreeinsert( n, "xuvsoljy", 20 / s )
|
|
hb_btreeinsert( n, "qmqjbedm", 21 / s )
|
|
hb_btreeinsert( n, "cctzzrkz", 22 / s )
|
|
hb_btreeinsert( n, "ikytgdon", 23 / s )
|
|
hb_btreeinsert( n, "pksobcwu", 24 / s )
|
|
hb_btreeinsert( n, "vmurindj", 25 / s )
|
|
hb_btreeinsert( n, "elvybqwg", 26 / s )
|
|
hb_btreeinsert( n, "ixchaztx", 27 / s )
|
|
hb_btreeinsert( n, "nzpztlhd", 28 / s )
|
|
hb_btreeinsert( n, "aucrchiw", 29 / s )
|
|
hb_btreeinsert( n, "munrytse", 30 / s )
|
|
hb_btreeinsert( n, "kqkhcmls", 31 / s )
|
|
hb_btreeinsert( n, "abqhurbi", 32 / s )
|
|
hb_btreeinsert( n, "ymrldckr", 33 / s )
|
|
hb_btreeinsert( n, "rhsmfflc", 34 / s )
|
|
hb_btreeinsert( n, "apyfkvee", 35 / s )
|
|
hb_btreeinsert( n, "cdntyzrf", 36 / s )
|
|
hb_btreeinsert( n, "iacblqrh", 37 / s )
|
|
hb_btreeinsert( n, "xvewqana", 38 / s )
|
|
hb_btreeinsert( n, "xmybqytj", 39 / s )
|
|
hb_btreeinsert( n, "dnowympf", 40 / s )
|
|
hb_btreeinsert( n, "smloihft", 41 / s )
|
|
hb_btreeinsert( n, "zumppmis", 42 / s )
|
|
hb_btreeinsert( n, "jirucnxu", 43 / s )
|
|
hb_btreeinsert( n, "ecdzikcv", 44 / s )
|
|
hb_btreeinsert( n, "slbwvnpg", 45 / s )
|
|
hb_btreeinsert( n, "yaftlkmz", 46 / s )
|
|
hb_btreeinsert( n, "blcepksd", 47 / s )
|
|
hb_btreeinsert( n, "xufowlpl", 48 / s )
|
|
hb_btreeinsert( n, "xegtjtqc", 49 / s )
|
|
hb_btreeinsert( n, "yplcqumq", 50 / s )
|
|
hb_btreeinsert( n, "vdoycauz", 51 / s )
|
|
hb_btreeinsert( n, "uhqkjuph", 52 / s )
|
|
hb_btreeinsert( n, "prllaeyi", 53 / s )
|
|
hb_btreeinsert( n, "ybzgmwzm", 54 / s )
|
|
hb_btreeinsert( n, "kkvyllnp", 55 / s )
|
|
hb_btreeinsert( n, "nberwsrb", 56 / s )
|
|
hb_btreeinsert( n, "wgetahua", 57 / s )
|
|
hb_btreeinsert( n, "yxcyehcv", 58 / s )
|
|
hb_btreeinsert( n, "oacormks", 59 / s )
|
|
hb_btreeinsert( n, "mcadkdxo", 60 / s )
|
|
hb_btreeinsert( n, "ycsalwqw", 61 / s )
|
|
hb_btreeinsert( n, "qmpysvjl", 62 / s )
|
|
hb_btreeinsert( n, "iqikamew", 63 / s )
|
|
hb_btreeinsert( n, "iaparrva", 64 / s )
|
|
hb_btreeinsert( n, "casbvtay", 65 / s )
|
|
hb_btreeinsert( n, "blaksexr", 66 / s )
|
|
hb_btreeinsert( n, "tbosrbql", 67 / s )
|
|
hb_btreeinsert( n, "ifkywsyt", 68 / s )
|
|
hb_btreeinsert( n, "gvklwevy", 69 / s )
|
|
hb_btreeinsert( n, "krpmpbud", 70 / s )
|
|
hb_btreeinsert( n, "rdvlwbwm", 71 / s )
|
|
hb_btreeinsert( n, "apnvdkww", 72 / s )
|
|
hb_btreeinsert( n, "euqdocvm", 73 / s )
|
|
hb_btreeinsert( n, "ksmkjcwp", 74 / s )
|
|
hb_btreeinsert( n, "bztgclzc", 75 / s )
|
|
hb_btreeinsert( n, "awkdnuxa", 76 / s )
|
|
hb_btreeinsert( n, "abavnpod", 77 / s )
|
|
hb_btreeinsert( n, "dvwvhjmh", 78 / s )
|
|
hb_btreeinsert( n, "dmfmivqb", 79 / s )
|
|
hb_btreeinsert( n, "ewsxanon", 80 / s )
|
|
return
|
|
|
|
/*
|
|
* Harbour Project source code:
|
|
* hb_btree api test
|
|
*
|
|
* Copyright 2000 April White <awhite@mail.rosecom.ca>
|
|
* www - http://www.harbour-project.org
|
|
*
|
|
* 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, with one exception:
|
|
*
|
|
* The exception is that if you link the Harbour Runtime Library (HRL)
|
|
* and/or the Harbour Virtual Machine (HVM) with other files to produce
|
|
* an executable, this does not by itself cause the resulting executable
|
|
* to be covered by the GNU General Public License. Your use of that
|
|
* executable is in no way restricted on account of linking the HRL
|
|
* and/or HVM code into it.
|
|
*
|
|
* 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 (or visit
|
|
* their web site at http://www.gnu.org/).
|
|
*
|
|
*/
|