*   Prints out the possible permutations in tables.

   *

   * \param $schedule_store

   *   The schedule_store handle with which this schedule was loaded,

   *   used to query the parent schedule.

   */

  //--------------------------------------------------

  function writeoutTables(array $schedule_store = NULL)

  {

    $filled = false;

    $time = array(700,730,800,830,900,930,1000,1030,1100,1130,1200,1230,1300,1330,1400,1430,1500,1530,1600,1630,1700,1730,1800,1830,1900,1930,2000,2030,2100,2130, 2200);

    $npages = ceil($this->nPermutations / SP_PERMUTATIONS_PER_PAGE);

    $page = 0;

    if (isset($_REQUEST['page']))

      $page = $_REQUEST['page'];

    /*

     * only display the ``this page doesn't exist'' 404 if there is at

     * least one permutation. Otherwise, we give an irrelevant 404 for

     * users with no permutations.

     */

    if ($this->nPermutations && $page >= $npages)

      Page::show_404('Unable to find page ' . $page . ', there are only ' . $this->nPermutations . ' non-conflicting permutations, for a total of ' . $npages . ' pages.');