File: node_set_view_unittest.cc

package info (click to toggle)
chromium 139.0.7258.127-1
  • links: PTS, VCS
  • area: main
  • in suites:
  • size: 6,122,068 kB
  • sloc: cpp: 35,100,771; ansic: 7,163,530; javascript: 4,103,002; python: 1,436,920; asm: 946,517; xml: 746,709; pascal: 187,653; perl: 88,691; sh: 88,436; objc: 79,953; sql: 51,488; cs: 44,583; fortran: 24,137; makefile: 22,147; tcl: 15,277; php: 13,980; yacc: 8,984; ruby: 7,485; awk: 3,720; lisp: 3,096; lex: 1,327; ada: 727; jsp: 228; sed: 36
file content (125 lines) | stat: -rw-r--r-- 4,068 bytes parent folder | download | duplicates (9)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
// Copyright 2024 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#include "components/performance_manager/public/graph/node_set_view.h"

#include <unordered_set>
#include <utility>
#include <vector>

#include "base/containers/contains.h"
#include "base/containers/flat_set.h"
#include "components/performance_manager/graph/frame_node_impl.h"
#include "components/performance_manager/graph/page_node_impl.h"
#include "components/performance_manager/graph/process_node_impl.h"
#include "components/performance_manager/public/graph/frame_node.h"
#include "components/performance_manager/test_support/graph_test_harness.h"
#include "testing/gmock/include/gmock/gmock.h"
#include "testing/gtest/include/gtest/gtest.h"

namespace performance_manager {

namespace {

template <class UnderlyingSetAndNodeViewPtrPair>
class NodeSetViewTest : public GraphTestHarness {
 public:
  using UnderlyingSet = UnderlyingSetAndNodeViewPtrPair::first_type;
  using NodeViewPtr = UnderlyingSetAndNodeViewPtrPair::second_type;

  NodeSetViewTest() = default;

  void SetUp() override {
    GraphTestHarness::SetUp();

    process_node_ = CreateRendererProcessNode();
    page_node_ = CreateNode<PageNodeImpl>();
  }

  void TearDown() override {
    frame_nodes_.clear();
    page_node_.reset();
    process_node_.reset();

    GraphTestHarness::TearDown();
  }

  // Creates `n` frame nodes, store them in `frame_nodes_` and return a set
  // containing the pointer of every created frame.
  UnderlyingSet CreateFrameNodeSet(size_t n) {
    frame_nodes_.reserve(n);

    for (size_t i = 0; i < n; i++) {
      frame_nodes_.push_back(
          CreateFrameNodeAutoId(process_node_.get(), page_node_.get()));
    }

    UnderlyingSet result;
    for (const auto& frame_node : frame_nodes_) {
      result.insert(frame_node.get());
    }
    return result;
  }

 private:
  // The renderer and the page hosting the frames.
  TestNodeWrapper<ProcessNodeImpl> process_node_;
  TestNodeWrapper<PageNodeImpl> page_node_;
  std::vector<TestNodeWrapper<FrameNodeImpl>> frame_nodes_;
};

}  // namespace

TYPED_TEST_SUITE_P(NodeSetViewTest);

TYPED_TEST_P(NodeSetViewTest, Iterator) {
  using UnderlyingSet = TypeParam::first_type;
  using NodeViewPtr = TypeParam::second_type;

  // Create the node set containing frame nodes.
  const UnderlyingSet node_set = this->CreateFrameNodeSet(20);

  // Create the view over the node set.
  NodeSetView<UnderlyingSet, NodeViewPtr> node_set_view(node_set);

  // Iteration using range-based for loop works.
  for (NodeViewPtr node : node_set_view) {
    ASSERT_TRUE(node);
    ASSERT_TRUE(base::Contains(node_set, node));
  }

  // Compare the contents of the view to the contents of the node set.
  EXPECT_THAT(node_set, ::testing::UnorderedElementsAreArray(
                            node_set_view.begin(), node_set_view.end()));
}

TYPED_TEST_P(NodeSetViewTest, AsVector) {
  using UnderlyingSet = TypeParam::first_type;
  using NodeViewPtr = TypeParam::second_type;

  // Create the node set containing frame nodes.
  const UnderlyingSet node_set = this->CreateFrameNodeSet(20);

  // Create the view over the node set.
  NodeSetView<UnderlyingSet, NodeViewPtr> node_set_view(node_set);

  // Use NodeSetView::AsVector().
  std::vector<NodeViewPtr> nodes_from_view = node_set_view.AsVector();

  // Compare the contents of the vector to the contents of the node set.
  EXPECT_THAT(node_set, ::testing::UnorderedElementsAreArray(
                            nodes_from_view.begin(), nodes_from_view.end()));
}

REGISTER_TYPED_TEST_SUITE_P(NodeSetViewTest, Iterator, AsVector);

using TestedTypes = ::testing::Types<
    std::pair<std::unordered_set<const Node*>, const FrameNode*>,
    std::pair<std::unordered_set<const Node*>, FrameNodeImpl*>,
    std::pair<base::flat_set<const Node*>, const FrameNode*>,
    std::pair<base::flat_set<const Node*>, FrameNodeImpl*>>;

INSTANTIATE_TYPED_TEST_SUITE_P(My, NodeSetViewTest, TestedTypes);

}  // namespace performance_manager