/* -----------------------------------------------------------------------------
 * 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 "spark_dsg/python/scene_graph_iterators.h"

namespace spark_dsg::python {

NodeIter::NodeIter() : valid_(false) {}

NodeIter::NodeIter(const SceneGraphLayer::Nodes& container)
    : valid_(true), curr_iter_(container.begin()), end_iter_(container.end()) {}

const SceneGraphNode* NodeIter::operator*() const {
  if (!valid_) {
    throw std::runtime_error("invalid node iterator!");
  }

  return curr_iter_->second.get();
}

NodeIter& NodeIter::operator++() {
  if (!valid_) {
    throw std::runtime_error("invalid node iterator!");
  }

  ++curr_iter_;
  return *this;
}

bool NodeIter::operator==(const IterSentinel&) const { return !valid_ || curr_iter_ == end_iter_; }

EdgeIter::EdgeIter() : valid_(false) {}

EdgeIter::EdgeIter(const SceneGraphLayer::Edges& container)
    : valid_(true), curr_iter_(container.begin()), end_iter_(container.end()) {}

const SceneGraphEdge* EdgeIter::operator*() const {
  if (!valid_) {
    throw std::runtime_error("invalid edge iterator!");
  }

  return &(curr_iter_->second);
}

EdgeIter& EdgeIter::operator++() {
  if (!valid_) {
    throw std::runtime_error("invalid edge iterator!");
  }

  ++curr_iter_;
  return *this;
}

bool EdgeIter::operator==(const IterSentinel&) const { return !valid_ || curr_iter_ == end_iter_; }

}  // namespace spark_dsg::python
