2012-01-30 14:38 UTC+0200 Mindaugas Kavaliauskas (dbtopas/at/dbtopas.lt)

* ChangeLog
    ! fixed multiple typos in previous ChangeLog entry
This commit is contained in:
Mindaugas Kavaliauskas
2012-01-30 12:38:00 +00:00
parent e83d6afbe2
commit ac6efa8cbb

View File

@@ -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=>}