Function main

Exercises/Modules/Chapter 20/Soln20_08/Soln20_08.cpp:20–43

}

int main()
{
  const size_t num_numbers{ 25'000 };
  std::vector<int> numbers(num_numbers);

  // Why not use an algorithm as well to generate the random numbers!!
  // (Note: technically generate() is allowed to copy a function object 
  //  as often as it wants. std::ref() ensures that the algorithm 
  //  at all times operates on a reference to our random-number generator)
  auto generator{ createUniformPseudoRandomNumberGenerator(0, 10'000) };
  std::ranges::generate(numbers, std::ref(generator));

  // Algorithm number two
  std::ranges::sort(numbers);

  // And number three; this time combined with the remove-erase idiom (or unique-erase, if you will)
  /* Option 1: iterator-based */
  numbers.erase(std::unique(begin(numbers), end(numbers)), end(numbers));
  /* Option 2: range-based (sadly requires two statements...) */
  //const auto [to_erase_begin, to_erase_end] { std::ranges::unique(numbers) };
  //numbers.erase(to_erase_begin, to_erase_end);

  std::cout << "Number of unique numbers: " << numbers.size() << std::endl;
}