Aren/haiku
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Added code to Get() to filter out all but the most recent of any duplicate

Browse Source 
matching entries with differing "opened with" app sigs.


git-svn-id: file:///srv/svn/repos/haiku/trunk/current@1879 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
Tyler Dauwalder 2002-11-08 08:37:56 +00:00
parent 1bde02ae7b
commit b2589492d0
1 changed files with 25 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

25
src/servers/registrar/RecentEntries.cpp
View File

@ -156,6 +156,12 @@ RecentEntries::Add(const entry_ref *ref, const char *appSig)
If there are fewer than \a maxCount items in the list, the entire If there are fewer than \a maxCount items in the list, the entire
list is returned. list is returned.
Duplicate entries are never returned, i.e. if two instances of the
same entry were added under different app sigs, and both instances
match the given filter criterion, only the most recent instance is
returned; the latter instance is ignored and not counted towards
the \a maxCount number of entries to return.
Since BRoster::GetRecentEntries() returns \c void, the message pointed Since BRoster::GetRecentEntries() returns \c void, the message pointed
to by \a list is simply cleared if maxCount is invalid (i.e. <= 0). to by \a list is simply cleared if maxCount is invalid (i.e. <= 0).
@ -170,8 +176,11 @@ RecentEntries::Get(int32 maxCount, const char *fileTypes[], int32 fileTypesCount
? B_OK : B_BAD_VALUE; ? B_OK : B_BAD_VALUE;
if (!error) { if (!error) {
result->MakeEmpty(); result->MakeEmpty();
std::list<recent_entry*> duplicateList;
std::list<recent_entry*>::iterator item; std::list<recent_entry*>::iterator item;
int count = 0; int count = 0;
for (item = fEntryList.begin(); for (item = fEntryList.begin();
count < maxCount && item != fEntryList.end(); count < maxCount && item != fEntryList.end();
item++) item++)
@ -197,6 +206,22 @@ RecentEntries::Get(int32 maxCount, const char *fileTypes[], int32 fileTypesCount
} }
} }
if (match) { if (match) {
// Check for duplicates
for (std::list<recent_entry*>::iterator dupItem
= duplicateList.begin();
dupItem != duplicateList.end();
dupItem++)
{
if ((*dupItem)->ref == (*item)->ref) {
match = false;
break;
}
}
}
if (match) {
// Add the ref to the list used to check
// for duplicates, and then to the result
duplicateList.push_back(*item);
result->AddRef("refs", &(*item)->ref); result->AddRef("refs", &(*item)->ref);
count++; count++;
} }