Searched refs:kLevels (Results 1 – 3 of 3) sorted by relevance
27 const int kLevels = 5; in TEST() local28 const int kExpectedNumberOfNodes = (1 << (kLevels + 1)) - 1; in TEST()36 kTestCoefficientsLength, kLevels); in TEST()40 for (int level = 0; level <= kLevels; ++level) { in TEST()54 EXPECT_EQ(NULL, tree.NodeAt(kLevels + 1, 0)); in TEST()55 EXPECT_EQ(NULL, tree.NodeAt(kLevels + 5, 0)); in TEST()75 const int kLevels = 3; in TEST() local76 const int kLeaves = 1 << kLevels; in TEST()77 const size_t kLeavesSamples = kTestBufferSize >> kLevels; in TEST()81 kLevels); in TEST()[all …]
55 static const size_t kLevels = 3; variable56 static const size_t kLeaves = 1 << kLevels;
55 kDaubechies8CoefficientsLength, kLevels)); in TransientDetector()87 WPDNode* leaf = wpd_tree_->NodeAt(kLevels, i); in Detect()