int main(void) { std::ifstream infile; infile.open("b.txt"); if(!infile.is_open()) { std::cout<<"open failed"<<std::endl; exit(1); } runQueries(infile); }
TEST_F(DistributedTests, test_workflow) { auto dist = Distributed(); auto s = dist.pullUpdates(); EXPECT_TRUE(s.ok()); EXPECT_EQ(s.toString(), "OK"); EXPECT_EQ(dist.getPendingQueryCount(), 2U); EXPECT_EQ(dist.results_.size(), 0U); s = dist.runQueries(); EXPECT_TRUE(s.ok()); EXPECT_EQ(s.toString(), "OK"); EXPECT_EQ(dist.getPendingQueryCount(), 0U); EXPECT_EQ(dist.results_.size(), 2U); }
static void TestRTree(skiatest::Reporter* reporter) { DataRect rects[NUM_RECTS]; SkRandom rand; SkRTree* rtree = SkRTree::Create(MIN_CHILDREN, MAX_CHILDREN); SkAutoUnref au(rtree); REPORTER_ASSERT(reporter, NULL != rtree); int expectedDepthMin = -1; int expectedDepthMax = -1; int tmp = NUM_RECTS; while (tmp > 0) { tmp -= static_cast<int>(pow(static_cast<double>(MAX_CHILDREN), static_cast<double>(expectedDepthMin + 1))); ++expectedDepthMin; } tmp = NUM_RECTS; while (tmp > 0) { tmp -= static_cast<int>(pow(static_cast<double>(MIN_CHILDREN), static_cast<double>(expectedDepthMax + 1))); ++expectedDepthMax; } for (size_t i = 0; i < NUM_ITERATIONS; ++i) { random_data_rects(rand, rects, NUM_RECTS); // First try bulk-loaded inserts for (int i = 0; i < NUM_RECTS; ++i) { rtree->insert(rects[i].data, rects[i].rect, true); } rtree->flushDeferredInserts(); runQueries(reporter, rand, rects, *rtree); REPORTER_ASSERT(reporter, NUM_RECTS == rtree->getCount()); REPORTER_ASSERT(reporter, expectedDepthMin <= rtree->getDepth() && expectedDepthMax >= rtree->getDepth()); rtree->clear(); REPORTER_ASSERT(reporter, 0 == rtree->getCount()); // Then try immediate inserts for (int i = 0; i < NUM_RECTS; ++i) { rtree->insert(rects[i].data, rects[i].rect); } runQueries(reporter, rand, rects, *rtree); REPORTER_ASSERT(reporter, NUM_RECTS == rtree->getCount()); REPORTER_ASSERT(reporter, expectedDepthMin <= rtree->getDepth() && expectedDepthMax >= rtree->getDepth()); rtree->clear(); REPORTER_ASSERT(reporter, 0 == rtree->getCount()); // And for good measure try immediate inserts, but in reversed order for (int i = NUM_RECTS - 1; i >= 0; --i) { rtree->insert(rects[i].data, rects[i].rect); } runQueries(reporter, rand, rects, *rtree); REPORTER_ASSERT(reporter, NUM_RECTS == rtree->getCount()); REPORTER_ASSERT(reporter, expectedDepthMin <= rtree->getDepth() && expectedDepthMax >= rtree->getDepth()); rtree->clear(); REPORTER_ASSERT(reporter, 0 == rtree->getCount()); } }
int main(int argc, char** argv) { std::ifstream infile("/home/tom/test.md"); runQueries(infile); infile.close(); return 0; }