From ac6efa8cbb4721324d5aec47c97574f4278f9eb7 Mon Sep 17 00:00:00 2001 From: Mindaugas Kavaliauskas Date: Mon, 30 Jan 2012 12:38:00 +0000 Subject: [PATCH] 2012-01-30 14:38 UTC+0200 Mindaugas Kavaliauskas (dbtopas/at/dbtopas.lt) * ChangeLog ! fixed multiple typos in previous ChangeLog entry --- harbour/ChangeLog | 11 ++++++++--- 1 file changed, 8 insertions(+), 3 deletions(-) diff --git a/harbour/ChangeLog b/harbour/ChangeLog index 3716a927b4..f782c00d04 100644 --- a/harbour/ChangeLog +++ b/harbour/ChangeLog @@ -16,6 +16,10 @@ The license applies to all entries newer than 2009-04-28. */ +2012-01-30 14:38 UTC+0200 Mindaugas Kavaliauskas (dbtopas/at/dbtopas.lt) + * ChangeLog + ! fixed multiple typos in previous ChangeLog entry + 2012-01-30 10:27 UTC+0100 Viktor Szakats (harbour syenar.net) * src/rtl/getsyshb.prg % optimization @@ -74,13 +78,14 @@ 2012-01-27 18:25 UTC+0200 Mindaugas Kavaliauskas (dbtopas/at/dbtopas.lt) * src/vm/hashes.c * src/vm/hashfunc.c - + implemented posibility to use hashes a sorted arays with binary search. + + implemented possibility to use hashes as sorted arrays with binary search. Implemented HB_BOOL hb_hashScanSoft( pHash, pKey, &nPos ). Function - if similar to, but returns nPos even if pKey is not found in pHash. + is similar to hb_hashScan(), but returns nPos even if pKey is not + found in pHash. Extended HB_HHASKEY( aHash, xKey [, @nPos ] ) --> lFound - Function optionaly returns position of the item with a largest key + Function optionally returns position of the item with a largest key smaller or equal to xKey. If xKey is less than all keys in hash, zero position is returned. I.e., aHash := {10=>, 20=>}