chromium/third_party/abseil-cpp/absl/strings/internal/cord_rep_btree_navigator_test.cc

// Copyright 2021 The Abseil Authors
//
// 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
//
//     https://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 "absl/strings/internal/cord_rep_btree_navigator.h"

#include <string>
#include <vector>

#include "gmock/gmock.h"
#include "gtest/gtest.h"
#include "absl/base/config.h"
#include "absl/base/internal/raw_logging.h"
#include "absl/strings/internal/cord_internal.h"
#include "absl/strings/internal/cord_rep_btree.h"
#include "absl/strings/internal/cord_rep_test_util.h"
#include "absl/strings/str_cat.h"
#include "absl/strings/string_view.h"

namespace absl {
ABSL_NAMESPACE_BEGIN
namespace cord_internal {
namespace {

Eq;
Ne;

CordRepBtreeFromFlats;
CordToString;
CreateFlatsFromString;
CreateRandomString;
MakeFlat;
MakeSubstring;

ReadResult;
Position;

// CordRepBtreeNavigatorTest is a test fixture which automatically creates a
// tree to test navigation logic on. The parameter `count' defines the number of
// data edges in the test tree.
class CordRepBtreeNavigatorTest : public testing::TestWithParam<size_t> {};

INSTANTIATE_TEST_SUITE_P();

TEST(CordRepBtreeNavigatorTest, Uninitialized) {}

TEST_P(CordRepBtreeNavigatorTest, InitFirst) {}

TEST_P(CordRepBtreeNavigatorTest, InitLast) {}

TEST_P(CordRepBtreeNavigatorTest, NextPrev) {}

TEST_P(CordRepBtreeNavigatorTest, PrevNext) {}

TEST(CordRepBtreeNavigatorTest, Reset) {}

TEST_P(CordRepBtreeNavigatorTest, Skip) {}

TEST_P(CordRepBtreeNavigatorTest, Seek) {}

TEST(CordRepBtreeNavigatorTest, InitOffset) {}

TEST(CordRepBtreeNavigatorTest, InitOffsetAndSeekBeyondLength) {}

TEST_P(CordRepBtreeNavigatorTest, Read) {}

TEST_P(CordRepBtreeNavigatorTest, ReadBeyondLengthOfTree) {}

TEST(CordRepBtreeNavigatorTest, NavigateMaximumTreeDepth) {}

}  // namespace
}  // namespace cord_internal
ABSL_NAMESPACE_END
}  // namespace absl