chromium/third_party/pdfium/core/fpdfdoc/cpdf_nametree_unittest.cpp

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

#include "core/fpdfdoc/cpdf_nametree.h"
#include "core/fpdfapi/parser/cpdf_array.h"
#include "core/fpdfapi/parser/cpdf_dictionary.h"
#include "core/fpdfapi/parser/cpdf_number.h"
#include "core/fpdfapi/parser/cpdf_string.h"
#include "core/fxcrt/retain_ptr.h"
#include "testing/gtest/include/gtest/gtest.h"

namespace {

void AddNameKeyValue(CPDF_Array* names, const char* key, int value) { … }

void CheckNameKeyValue(const CPDF_Array* names,
                       int pair_index,
                       const char* key,
                       int value) { … }

void AddLimitsArray(CPDF_Dictionary* node,
                    const char* least,
                    const char* greatest) { … }

void CheckLimitsArray(const CPDF_Dictionary* node,
                      const char* least,
                      const char* greatest) { … }

// Set up a name tree with 3 levels and 5 nodes, per diagram:
//
//   [root]
//     |
//     |
//     |
//   [pKid1]
//     |
//     +------------+
//     |            |
//   [pGrandKid2] [pGrandKid3]
//     |          {9.txt: 999}
//     |
//     +-----------------+
//     |                 |
//   [pGreatGrandKid4] [pGreatGrandKid5]
//   {1.txt: 111}      {3.txt: 333}
//   {2.txt: 222}      {5.txt: 555}
//
void FillNameTreeDict(CPDF_Dictionary* pRootDict) { … }

}  // namespace

TEST(cpdf_nametree, GetUnicodeNameWithBOM) { … }

TEST(cpdf_nametree, GetFromTreeWithLimitsArrayWith4Items) { … }

TEST(cpdf_nametree, AddIntoNames) { … }

TEST(cpdf_nametree, AddIntoEmptyNames) { … }

TEST(cpdf_nametree, AddIntoKids) { … }

TEST(cpdf_nametree, DeleteFromKids) { … }