From 2df45c323dff08d54e21f9a99610cb69d2d01075 Mon Sep 17 00:00:00 2001 From: George Hazan Date: Wed, 10 Oct 2012 07:00:35 +0000 Subject: two new db stubs: db_find_first & db_find_next git-svn-id: http://svn.miranda-ng.org/main/trunk@1855 1316c22d-e87f-b044-9b9b-93d7a3e3ba9c --- include/delphi/m_core.inc | 9 +++++++-- 1 file changed, 7 insertions(+), 2 deletions(-) (limited to 'include/delphi') diff --git a/include/delphi/m_core.inc b/include/delphi/m_core.inc index 6424d47ebb..2f9401e63d 100644 --- a/include/delphi/m_core.inc +++ b/include/delphi/m_core.inc @@ -80,6 +80,11 @@ function db_free(dbv:PDBVARIANT):int_ptr; stdcall; function db_unset(hContact:THANDLE; const szModule:pAnsiChar; const szSetting:pAnsiChar):int_ptr; stdcall; external CoreDLL name 'db_unset'; +function db_find_first(const szModule:pAnsiChar=nil):THANDLE; stdcall; + external CoreDLL name 'db_find_first'; +function db_find_next(hContact:THANDLE; const szModule:pAnsiChar=nil):THANDLE; stdcall; + external CoreDLL name 'db_find_next'; + function db_get_b(hContact:THANDLE; const szModule:pAnsiChar; const szSetting:pAnsiChar; errorValue:int):int; stdcall; external CoreDLL name 'db_get_b'; function db_get_w(hContact:THANDLE; const szModule:pAnsiChar; const szSetting:pAnsiChar; errorValue:int):int; stdcall; @@ -286,9 +291,9 @@ function mir_hash(const key:pointer; len:uint):uint; stdcall; type TFSortFunc = function (para1:pointer; para2:pointer):int;cdecl; { -// Assumes first 32 bit value of the data is the numeric key +// Assumes first 32 bit value of the data is the numeric key // and uses it to perform sort/search operations, this results -// in much better performance as no compare function calls needed +// in much better performance as no compare function calls needed // Incredibly useful for Hash Tables } const -- cgit v1.2.3