chromium/third_party/perfetto/src/trace_processor/containers/interval_tree_unittest.cc

/*
 * Copyright (C) 2024 The Android Open Source Project
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

#include "src/trace_processor/containers/interval_tree.h"

#include <cstddef>
#include <cstdint>
#include <numeric>
#include <random>
#include <tuple>
#include <utility>
#include <vector>

#include "perfetto/base/compiler.h"
#include "test/gtest_and_gmock.h"

namespace perfetto::trace_processor {

inline bool operator==(const Interval& a, const Interval& b) { … }

namespace {

Interval;
IsEmpty;
UnorderedElementsAre;

std::vector<Interval> CreateIntervals(
    std::vector<std::pair<uint32_t, uint32_t>> periods) { … }

TEST(IntervalTree, Trivial) { … }

TEST(IntervalTree, Simple) { … }

TEST(IntervalTree, SinglePointOverlap) { … }

TEST(IntervalTree, NoOverlaps) { … }

TEST(IntervalTree, IdenticalIntervals) { … }

TEST(IntervalTree, MultipleOverlapsVariousPositions) { … }

TEST(IntervalTree, OverlappingEndpoints) { … }

TEST(IntervalTree, Stress) { … }

}  // namespace
}  // namespace perfetto::trace_processor