Add more intelligence to the findfirst stored lists cleanup algorithm
Imported-from: https://svn.code.sf.net/p/dosbox/code-0/dosbox/trunk@3535
This commit is contained in:
parent
1e1dbbff8c
commit
38c99cbf12
3 changed files with 19 additions and 11 deletions
|
@ -141,8 +141,8 @@ public:
|
|||
char* GetExpandName (const char* path);
|
||||
bool GetShortName (const char* fullname, char* shortname);
|
||||
|
||||
bool FindFirst (char* path, Bitu& id);
|
||||
bool FindNext (Bitu id, char* &result);
|
||||
bool FindFirst (char* path, Bit16u& id);
|
||||
bool FindNext (Bit16u id, char* &result);
|
||||
|
||||
void CacheOut (const char* path, bool ignoreLastDir = false);
|
||||
void AddEntry (const char* path, bool checkExist = false);
|
||||
|
@ -205,7 +205,7 @@ private:
|
|||
char dirSearchName [MAX_OPENDIRS];
|
||||
bool free [MAX_OPENDIRS];
|
||||
CFileInfo* dirFindFirst [MAX_OPENDIRS];
|
||||
Bitu nextFreeFindFirst;
|
||||
Bit16u nextFreeFindFirst;
|
||||
|
||||
char label [CROSS_LEN];
|
||||
bool updatelabel;
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue