/**
 * Copyright 2020 Huawei Technologies Co., Ltd
 *
 * 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 "gtest/gtest.h"
#include "poly/schedule_tree_util.h"
#include <vector>

namespace akg {

TEST(TestPromotionFunc, TestCaseMap) {
  std::vector<int> input{0, 1, 2, 3, 4};
  std::vector<int> expect_output{1, 2, 3, 4, 5};
  std::vector<int> output;
  std::function<int(int)> add = [](int x) { return x + 1; };
  output = ir::poly::MapWithFunc(add, input);
  EXPECT_EQ(expect_output, output);
}

TEST(TestPromotionFunc, TestCaseFilter) {
  std::vector<int> input{0, 1, 2, 3, 4};
  std::vector<int> expect_output{0, 2, 4};
  std::vector<int> output;
  std::function<bool(int)> even = [](int x) { return x % 2 == 0; };
  output = ir::poly::FilterWithFunc(even, input);
  EXPECT_EQ(expect_output, output);
}

}  // namespace akg
