nagai/fune
3
0
Fork 0
forked from mirrors/gecko-dev
Code Pull requests Activity

Bug 1482011 - Make Bench_Cpp_MozHashSet more idiomatic. r=froydnj

Browse source 
I discovered there are some shortcut methods for some common operations.

--HG--
extra : rebase_source : b22ca592af24857e093308d4b6351621062b8cea
This commit is contained in:
Nicholas Nethercote 2018-08-14 08:52:38 +10:00
parent 6f0db984fe
commit ce73ba39cf
1 changed files with 3 additions and 5 deletions
repo.diff.show_diff_stats Download patch file Download diff file Expand all files Collapse all files

8
xpcom/rust/gtest/bench-collections/Bench.cpp
View file

@ -176,20 +176,18 @@ Bench_Cpp_MozHashSet(const Params* aParams, void** aVals, size_t aLen)
mozilla::HashSet<void*, mozilla::DefaultHasher<void*>, MallocAllocPolicy> hs;
for (size_t j = 0; j < aParams->mNumInserts; j++) {
auto p = hs.lookupForAdd(aVals[j]);
MOZ_RELEASE_ASSERT(!p);
MOZ_RELEASE_ASSERT(hs.add(p, aVals[j]));
MOZ_RELEASE_ASSERT(hs.put(aVals[j]));
}
for (size_t i = 0; i < aParams->mNumSuccessfulLookups; i++) {
for (size_t j = 0; j < aParams->mNumInserts; j++) {
MOZ_RELEASE_ASSERT(hs.lookup(aVals[j]));
MOZ_RELEASE_ASSERT(hs.has(aVals[j]));
}
}
for (size_t i = 0; i < aParams->mNumFailingLookups; i++) {
for (size_t j = aParams->mNumInserts; j < aParams->mNumInserts*2; j++) {
MOZ_RELEASE_ASSERT(!hs.lookup(aVals[j]));
MOZ_RELEASE_ASSERT(!hs.has(aVals[j]));
}
}