/*
  Copyright (C) 2018 David Robillard <d@drobilla.net>

  This program is free software: you can redistribute it and/or modify it under
  the terms of the GNU General Public License as published by the Free Software
  Foundation, either version 2 of the License, or (at your option) any later
  version.

  This program is distributed in the hope that it will be useful, but WITHOUT
  ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
  FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more
  details.

  You should have received a copy of the GNU General Public License along with
  this program.  If not, see <https://www.gnu.org/licenses/>.
*/

#include "chilbert/chilbert.hpp"

#include <array>
#include <cstdint>
#include <cstdio>
#include <cstdlib>

int
main(int argc, char** argv)
{
  if (argc != 2) {
    fprintf(stderr, "Usage: %s NUM_POINTS\n", argv[0]);
    return 1;
  }

  const unsigned long num_points = std::strtoul(argv[1], nullptr, 10);
  if (num_points == 0 || num_points == ULONG_MAX) {
    fprintf(stderr, "Usage: %s NUM_POINTS\n", argv[0]);
    return 1;
  }

  // Vertices
  for (uint64_t i = 0; i < num_points; ++i) {
    std::array<uint32_t, 3> point;
    chilbert::index_to_coords(point, 16, 3, i);
    printf("v %u %u %u\n", point[0], point[1], point[2]);
  }

  // One polyline through all vertices
  printf("\nl");
  for (unsigned i = 0; i < num_points - 1; ++i) {
    printf(" %u", i + 1);
  }
  printf("\n");

  return 0;
}