13namespace {
bool intless(
const int&
a,
const int&
b) {
return a <
b; } }
86 for (
int i = 0; i < 100; ++i) {
91 for (
int j = 0; j <
count; ++j) {
104 for (
int j = 0; j <
count; ++j) {
108 for (
int j = 0; j <
count; ++j) {
117 for (
int k = 0; k <
count; ++k) {
145 array[item].fPriority = random.
nextS();
164 for (
int i = 0; i <
count; i++) {
169 pqTest.
insert(&testArray[i]);
175 for (
int i = 0; i <
count; i++) {
177 mock->
fPriority = testArray[i].fPriority;
178 mock->
fValue = testArray[i].fValue;
180 pqControl.
insert(&controlArray[i]);
187 int prevPriority = pqTest.
peek()->fPriority;
188 for (
int i = 0; i <
count; i++) {
191 prevPriority = pqTest.
at(i)->fPriority;
195 for (
int i = 0; i <
count; i++) {
void sort_test(skiatest::Reporter *reporter)
void random_test(skiatest::Reporter *reporter)
static void simple_test(skiatest::Reporter *reporter)
#define DEF_TEST(name, reporter)
#define REPORTER_ASSERT(r, cond,...)
static bool LessP(Mock *const &a, Mock *const &b)
bool operator==(const Mock &that) const
static int * PQIndex(Mock *const &mock)
bool operator!=(const Mock &that) const
uint32_t nextULessThan(uint32_t count)
void priorityDidChange(T entry)