/* -----------------------------------------------------------------------------
 * Copyright 2022 Massachusetts Institute of Technology.
 * All Rights Reserved
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 *  1. Redistributions of source code must retain the above copyright notice,
 *     this list of conditions and the following disclaimer.
 *
 *  2. Redistributions in binary form must reproduce the above copyright notice,
 *     this list of conditions and the following disclaimer in the documentation
 *     and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 *
 * Research was sponsored by the United States Air Force Research Laboratory and
 * the United States Air Force Artificial Intelligence Accelerator and was
 * accomplished under Cooperative Agreement Number FA8750-19-2-1000. The views
 * and conclusions contained in this document are those of the authors and should
 * not be interpreted as representing the official policies, either expressed or
 * implied, of the United States Air Force or the U.S. Government. The U.S.
 * Government is authorized to reproduce and distribute reprints for Government
 * purposes notwithstanding any copyright notation herein.
 * -------------------------------------------------------------------------- */
#include <gtest/gtest.h>
#include <spark_dsg/edge_attributes.h>
#include <spark_dsg/edge_container.h>

namespace spark_dsg {

TEST(EdgeContainerTests, NewEdgesCorrect) {
  EdgeContainer container;
  container.insert(0, 1, nullptr);
  container.insert(1, 2, nullptr);
  container.insert(0, 3, nullptr);

  {
    std::vector<EdgeKey> expected{{0, 1}, {0, 3}, {1, 2}};

    std::vector<EdgeKey> result;
    container.getNew(result, false);
    EXPECT_EQ(expected, result);
  }

  {
    std::vector<EdgeKey> expected{{0, 1}, {0, 3}, {1, 2}};

    std::vector<EdgeKey> result;
    container.getNew(result, true);
    EXPECT_EQ(expected, result);
  }

  {
    std::vector<EdgeKey> expected;

    std::vector<EdgeKey> result;
    container.getNew(result, true);
    EXPECT_EQ(expected, result);
  }
}

TEST(EdgeContainerTests, RemovedEdgesCorrect) {
  EdgeContainer container;
  container.insert(0, 1, nullptr);
  container.insert(1, 2, nullptr);
  container.insert(0, 3, nullptr);

  {
    std::vector<EdgeKey> expected;

    std::vector<EdgeKey> result;
    container.getRemoved(result, false);
    EXPECT_EQ(expected, result);
  }

  container.remove(1, 0);

  {
    std::vector<EdgeKey> expected{{0, 1}};

    std::vector<EdgeKey> result;
    container.getRemoved(result, false);
    EXPECT_EQ(expected, result);
  }

  {
    std::vector<EdgeKey> expected{{0, 1}};

    std::vector<EdgeKey> result;
    container.getRemoved(result, true);
    EXPECT_EQ(expected, result);
  }

  {
    std::vector<EdgeKey> expected;

    std::vector<EdgeKey> result;
    container.getRemoved(result, false);
    EXPECT_EQ(expected, result);
  }
}

TEST(EdgeContainerTests, RemovedWithAddCorrect) {
  EdgeContainer container;
  container.insert(0, 1, nullptr);

  {
    std::vector<EdgeKey> expected;

    std::vector<EdgeKey> result;
    container.getRemoved(result, false);
    EXPECT_EQ(expected, result);
  }

  container.remove(1, 0);

  {
    std::vector<EdgeKey> expected{{0, 1}};

    std::vector<EdgeKey> result;
    container.getRemoved(result, false);
    EXPECT_EQ(expected, result);
  }

  container.insert(0, 1, nullptr);

  {
    std::vector<EdgeKey> expected;

    std::vector<EdgeKey> result;
    container.getRemoved(result, false);
    EXPECT_EQ(expected, result);
  }
}

TEST(EdgeContainerTests, StaleInvariants) {
  EdgeContainer container;

  for (size_t i = 0; i < 10; ++i) {
    container.insert(0, i, nullptr);
  }
  EXPECT_EQ(container.size(), 10u);

  container.setStale();
  for (const auto& key_info_pair : container.stale_edges) {
    EXPECT_TRUE(key_info_pair.second);
  }

  for (size_t i = 0; i < 3; ++i) {
    EXPECT_NE(container.find(0, i), nullptr);
  }

  for (const auto& key_info_pair : container.stale_edges) {
    EXPECT_EQ(key_info_pair.first.k2 >= 3, key_info_pair.second);
  }

  const auto const_container = const_cast<const EdgeContainer*>(&container);
  for (size_t i = 3; i < 6; ++i) {
    EXPECT_NE(const_container->find(0, i), nullptr);
  }

  for (const auto& key_info_pair : container.stale_edges) {
    EXPECT_EQ(key_info_pair.first.k2 >= 6, key_info_pair.second);
  }
}

}  // namespace spark_dsg
