chromium/cc/base/rtree_unittest.cc

// Copyright 2015 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#include "cc/base/rtree.h"

#include <stddef.h>
#include <utility>

#include "testing/gtest/include/gtest/gtest.h"

namespace cc {
namespace {
// Helper function to use in place of rtree. Search that ensures that every
// call to Search / SearchRefs produces the same results.
template <typename T>
void SearchAndVerifyRefs(const RTree<T>& rtree,
                         const gfx::Rect& query,
                         std::vector<T>* results) { … }

template <typename T>
void SearchAndVerifyBounds(const RTree<T>& rtree,
                           const gfx::Rect& query,
                           std::vector<T>* results,
                           std::vector<gfx::Rect>* rects) { … }
}  // namespace

TEST(RTreeTest, ReserveNodesDoesntDcheck) { … }

TEST(RTreeTest, NoOverlap) { … }

TEST(RTreeTest, Overlap) { … }

static void VerifySorted(const std::vector<size_t>& results) { … }

TEST(RTreeTest, SortedResults) { … }

TEST(RTreeTest, GetBoundsEmpty) { … }

TEST(RTreeTest, GetBoundsNonOverlapping) { … }

TEST(RTreeTest, GetBoundsOverlapping) { … }

TEST(RTreeTest, GetBoundsWithEmptyRect) { … }

TEST(RTreeTest, Payload) { … }

TEST(RTreeTest, InvalidBounds) { … }

TEST(RTreeTest, InvalidBoundsSearch) { … }

TEST(RTreeTest, InvalidBoundsGetAllBounds) { … }

}  // namespace cc