#!/usr/local/bin/python
#
# File:        sorttest
# Copyright:   (c) 2002 The Regents of the University of California
# Revision:    $Revision: 4434 $
# Date:        $Date: 2005-03-17 09:05:29 -0800 (Thu, 17 Mar 2005) $
# Description: Excercise interfaces and abstract classes
#

import sort.MergeSort
import sort.QuickSort
import sort.HeapSort
import sort.SortTest
from synch import RegOut
from synch.ResultType import *

class TestCounter:

  def __init__(self, numparts = -1):
    self.tracker = RegOut.getInstance()
    self.partno = 0
    self.tracker.setExpectations(numparts)

  def describeTest(self, description):
    self.partno = self.partno + 1
    self.tracker.startPart(self.partno)
    self.tracker.writeComment(description)

  def evalTest(self, result, expected):
    if (result):
      if (expected):
        self.tracker.endPart(self.partno, PASS)
      else:
        self.tracker.endPart(self.partno, XPASS)
    else:
      if (expected):
        self.tracker.endPart(self.partno, FAIL)
      else:
        self.tracker.endPart(self.partno, XFAIL)
        
  def finish(self):
    self.tracker.close()

if __name__ == '__main__':
    test = TestCounter(4)
    merge = sort.MergeSort.MergeSort()
    quick = sort.QuickSort.QuickSort()
    heap = sort.HeapSort.HeapSort()
    test.describeTest("merge != None")
    test.evalTest(merge, 1)
    test.describeTest("quick != None")
    test.evalTest(quick, 1)
    test.describeTest("heap != None")
    test.evalTest(heap, 1)
    test.describeTest("sort.SortTest.stressTest([merge, quick, heap])")
    test.evalTest(sort.SortTest.stressTest([merge, quick, heap]), 1)
    test.finish()
