Function main

Exercises/NoModules/Chapter 12/Soln12_08/Soln12_08.cpp:32–66

Truckload::Iterator findSmallestBox(const Truckload& truckload);

int main()
{
  Truckload load;  // Create an empty list

  // Add 12 random Box objects to the list
  const size_t boxCount{ 12 };
  for (size_t i{}; i < boxCount; ++i)
    load.addBox(randomSharedBox());

  std::cout << "The random truckload:\n";
  load.listBoxes();
  std::cout << std::endl;

  const auto largestIter{ findLargestBox(load) };
  const auto smallestIter{ findSmallestBox(load) };

  std::cout << "The largest box (found using forward iteration) is ";
  largestIter.getCurrentBox()->listBox();
  std::cout << '\n' << std::endl;

  load.removeBox(largestIter);

  std::cout << "The truckload without its largest box:\n";
  load.listBoxes();
  std::cout << std::endl;

  std::cout << "The smallest box (found using reverse iteration) is ";
  smallestIter.getCurrentBox()->listBox();
  std::cout << '\n' << std::endl;
  
  load.removeBox(smallestIter);

  std::cout << "The truckload without its smallest box (in reverse order):\n";
  load.listBoxesReversed();
}

Truckload::Iterator findLargestBox(const Truckload& truckload)
{