/*
 * 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 "Set.h"

#include "cpp14/memory.h"

namespace neurun
{
namespace model
{
namespace operand
{

const Index Set::generateIndex()
{
  assert((_index_count) <= 0x7fffffff);

  return Index{_index_count++};
}

Index Set::append(const Shape &shape, const TypeInfo &type)
{
  auto index = generateIndex();

  _objects[index] = nnfw::cpp14::make_unique<Object>(shape, type);

  return index;
}

const Object &Set::at(const Index &index) const { return *(_objects.at(index)); }

Object &Set::at(const Index &index) { return *(_objects.at(index)); }

bool Set::exist(const Index &index) const { return index.value() < _objects.size(); }

void Set::iterate(const std::function<void(const Index &, const Object &)> &fn) const
{
  for (const auto &e : _objects)
  {
    fn(e.first, *e.second);
  }
}

void Set::iterate(const std::function<void(const Index &, Object &)> &fn)
{
  // TODO Remove this workaround
  //      This implementation is a workaround in case of adding operands while iteration
  //
  //      // Original Implementation (We probably should be back to this)
  //      for (auto &e : _objects)
  //      {
  //        fn(e.first, *e.second);
  //      }

  std::list<Index> l;

  for (auto &e : _objects)
  {
    l.push_back(e.first);
  }

  for (auto index : l)
  {
    fn(index, *_objects[index]);
  }
}

} // namespace operand
} // namespace model
} // namespace neurun