compiler/angkor/src/ADT/tensor/IndexEnumerator.test.cpp


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

/*
 * Copyright (c) 2018 Samsung Electronics Co., Ltd. All Rights Reserved
 *
 * 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 "nncc/core/ADT/tensor/IndexEnumerator.h"

#include <vector>
#include <algorithm>

#include <gtest/gtest.h>

using nncc::core::ADT::tensor::Shape;
using nncc::core::ADT::tensor::Index;
using nncc::core::ADT::tensor::IndexEnumerator;

TEST(ADT_TENSOR_INDEX_ENUMERATOR, iterate_full_range)
{
  const uint32_t H = 3;
  const uint32_t W = 4;

  const Shape shape{H, W};

  std::vector<uint32_t> count;

  count.resize(H * W, 0);

  for (IndexEnumerator e{shape}; e.valid(); e.advance())
  {
    const auto &ind = e.current();

    ASSERT_EQ(ind.rank(), 2);
    count.at(ind.at(0) * W + ind.at(1)) += 1;
  }

  ASSERT_TRUE(std::all_of(count.begin(), count.end(), [](uint32_t n) { return n == 1; }));
}