test_set.c

来自「开放源码的编译器open watcom 1.6.0版的源代码」· C语言 代码 · 共 700 行 · 第 1/2 页

//
// Copyright (C) 1991 Texas Instruments Incorporated.
//
// Permission is granted to any individual or institution to use, copy, modify,
// and distribute this software, provided that this complete copyright and
// permission notice is maintained, intact, in all copies and supporting
// documentation.
//
// Texas Instruments Incorporated provides this software "as is" without
// express or implied warranty.
//

#include <cool/char.h>          // for strcmp
#include <cool/Set.h>
#include <cool/Set.C>
#include <cool/test.h>

void test_int () {
  CoolSet<int> s0;
  TEST ("CoolSet<int> s0",s0.get_bucket_count(),3);
  TEST ("s0.capacity()", s0.capacity(), 24);
  CoolSet<int> s1(20);
  TEST ("CoolSet<int> s1(20)",s1.get_bucket_count(),3);
  TEST ("s1.capacity()", s1.capacity(), 24);
  CoolSet<int> s2(25);
  TEST ("CoolSet<int> s2(25)",s2.get_bucket_count(),7);
  TEST ("s2.capacity()", s2.capacity(), 56);
  CoolSet<int> s3(s2);
  TEST ("CoolSet<int> s3(s2)",s3.get_bucket_count(),7);
  TEST ("s2==s3", (s2==s3), TRUE);
  TEST ("s2 == s3", (s2 == s3), TRUE);
  TEST ("s1 == s2", (s1 == s2), TRUE);
  TEST ("s1 != s3", (s1 != s3), FALSE);
  TEST ("s0.reset()",(s0.reset(),1),1);
  TEST ("s0.put(1)", s0.put(1),TRUE);
  TEST ("s0.find(1)", s0.find(1), TRUE);
  TEST ("s0.value()", s0.value(), 1);
  TEST ("s0.length()", s0.length(), 1);
  TEST ("s0.put(2)", s0.put(2),TRUE);
  TEST ("s0.find(2)", s0.find(2), TRUE);
  TEST ("s0.put(3)", s0.put(3),TRUE);
  TEST ("s0.find(3)", s0.find(3), TRUE);
  TEST ("s0.put(4)", s0.put(4), TRUE);
  TEST ("s0.value()", s0.value(), 4);
  TEST ("s0.find(4)", s0.find(4), TRUE);
  TEST ("s0.value()", s0.value(), 4);
  TEST ("s0.put(5)", s0.put(5),TRUE);
  TEST ("s0.find(5)", s0.find(5), TRUE);
  TEST ("s0.put(6)", s0.put(6),TRUE);
  TEST ("s0.find(6)", s0.find(6), TRUE);
  TEST ("s0.put(7)", s0.put(7),TRUE);
  TEST ("s0.find(7)", s0.find(7), TRUE);
  TEST ("s0.put(8)", s0.put(8),TRUE);
  TEST ("s0.find(8)", s0.find(8), TRUE);
  TEST ("s0.put(9)", s0.put(9),TRUE);
  TEST ("s0.find(9)", s0.find(9), TRUE);
  TEST ("s0.get_bucket_count()", s0.get_bucket_count(), 3);
  TEST ("s0.length()", s0.length(), 9);
  TEST ("s0.remove(1)", s0.remove(1), TRUE);
  TEST ("s0.length()", s0.length(), 8);
  TEST ("s0.reset()",(s0.reset(),1),1);
  TEST ("s0.next()",s0.next(),TRUE);
  TEST ("s0.next()",s0.next(),TRUE);
  TEST ("s0.next()",s0.next(),TRUE);
  TEST ("s0.next()",s0.next(),TRUE);
  TEST ("s0.next()",s0.next(),TRUE);
  TEST ("s0.next()",s0.next(),TRUE);
  TEST ("s0.next()",s0.next(),TRUE);
  TEST ("s0.next()",s0.next(),TRUE);
  TEST ("s0.next()",s0.next(),FALSE);
  TEST ("s0.prev()",s0.prev(),TRUE);
  TEST ("s0.prev()",s0.prev(),TRUE);
  TEST ("s0.prev()",s0.prev(),TRUE);
  TEST ("s0.prev()",s0.prev(),TRUE);
  TEST ("s0.prev()",s0.prev(),TRUE);
  TEST ("s0.prev()",s0.prev(),TRUE);
  TEST ("s0.prev()",s0.prev(),TRUE);
  TEST ("s0.prev()",s0.prev(),TRUE);
  TEST ("s0.prev()",s0.prev(),FALSE);
  TEST ("s1=s0", (s1=s0,(s0==s1)), TRUE);
  TEST ("s1.resize(30)", s1.resize(30), TRUE);
  TEST ("s1.find(7)", s1.find(7), TRUE);
  TEST ("s1.value()", s1.value(), 7);
  TEST ("s1.find(3)", s1.find(3), TRUE);
  TEST ("s1.value()", s1.value(), 3);
  TEST ("s1.find(9)", s1.find(9), TRUE);
  TEST ("s1.value()", s1.value(), 9);
  TEST ("s1.get_bucket_count()", s1.get_bucket_count(), 7);
  TEST ("s1.length()", s1.length(), 8);
  TEST ("s0.set_ratio(1.0)", (s0.set_ratio(1.0),1), 1);
  TEST ("s0.resize(30)", s0.resize(30), TRUE);
  TEST ("s0.get_bucket_count()", s0.get_bucket_count(), 7);
  TEST ("s0.find(2)", s0.find(2), TRUE);
  TEST ("s0.find(4)", s0.find(4), TRUE);
  TEST ("s0.find(6)", s0.find(6), TRUE);
  TEST ("s0.find(8)", s0.find(8), TRUE);
  TEST ("s0.resize(60)", s0.resize(60), TRUE);
  TEST ("s0.get_bucket_count()", s0.get_bucket_count(), 19);
  TEST ("s0.find(2)", s0.find(2), TRUE);
  TEST ("s0.value()", s0.value(), 2);
  TEST ("s0.find(4)", s0.find(4), TRUE);
  TEST ("s0.value()", s0.value(), 4);
  TEST ("s0.find(6)", s0.find(6), TRUE);
  TEST ("s0.value()", s0.value(), 6);
  TEST ("s0.find(8)", s0.find(8), TRUE);
  TEST ("s0.value()", s0.value(), 8);
  TEST ("s0.remove()", s0.remove(), TRUE);
  TEST ("s0.find(8)", s0.find(8), FALSE);
  CoolSet<int> s4(s1);
  TEST ("CoolSet<int> S4(s1)", (s4==s1), TRUE);
  TEST ("s4.remove(6)", s4.remove(6), TRUE);
  TEST ("s1.search(s4)", s1.search(s4), TRUE);
  TEST ("s0.clear()", (s0.clear(), s0.length()), 0);
  TEST ("s1.clear()", (s1.clear(), s1.length()), 0);
}

void test_int_2 () {
  CoolSet<int> s0;
  CoolSet<int> s1;
  CoolSet<int> s2;
  CoolSet<int> s3;
  CoolSet<int> s4;
  CoolSet<int> s5; 
  CoolSet<int> s6;
  CoolSet<int> s7;
  int i;
  for (i = 0; i < 10; i++) 
    s0.put(i);
  s0.remove(8);
  for (i = 2; i < 10; i++)
    s1.put(i);
  s1.remove(4);
  s2.put(0);
  s2.put(1);
  s2.put(4);
  s3.put(8);
  s4 = s0;
  s4.put(8);
  s5 = s1;
  s5.remove(8);
  s6.put(0);
  s6.put(1);
  s6.put(4);
  s6.put(8);
//   cout << s0 << "-" << s1 << "=" << (s0-s1) << endl;
//   cout << s0 << "|" << s1 << "=" << (s0|s1) << endl;
//   cout << s0 << "&" << s1 << "=" << (s0&s1) << endl;
//   cout << s0 << "^" << s1 << "=" << (s0^s1) << endl;

  TEST ("(s0 - s1) == s2", ((s0-s1) == s2), TRUE);
  TEST ("(s1 - s0) == s3", ((s1-s0) == s3), TRUE);
  TEST ("(s0 | s1) == s4", ((s0|s1) == s4), TRUE);
  TEST ("(s1 | s0) == s4", ((s1|s0) == s4), TRUE);
  TEST ("(s0 & s1) == s5", ((s0&s1) == s5), TRUE);
  TEST ("(s1 & s0) == s5", ((s1&s0) == s5), TRUE);
  
  TEST ("(s0 ^ s1) == s6", ((s0^s1) == s6), TRUE);
  TEST ("(s1 ^ s0) == s6", ((s1^s0) == s6), TRUE);
  s7 = s0;
  TEST ("s0 -= s1", (s0 -= s1, s0 == s2), TRUE);
  s0 = s7; s7=s1;
  TEST ("s1 -= s0", (s1 -= s0, s1 == s3), TRUE);
  s1 = s7; s7=s0;
  TEST ("s0 |= s1", (s0 |= s1, s0 == s4), TRUE);
  s0 = s7; s7=s1;
  TEST ("s1 |= s0", (s1 |= s0, s1 == s4), TRUE);
  s1 = s7; s7=s0;
  TEST ("s0 &= s1", (s0 &= s1, s0 == s5), TRUE);
  s0 = s7; s7=s1;
  TEST ("s1 &= s0", (s1 &= s0, s1 == s5), TRUE);
  s1 = s7; s7=s0;
  TEST ("s0 ^= s1", (s0 ^= s1, s0 == s6), TRUE);
  s0 = s7; s7=s1;
  TEST ("s1 ^= s0", (s1 ^= s0, s1 == s6), TRUE);
  s1 = s7; s7 = s0;
  TEST ("s0.set_difference(s1)", (s0.set_difference(s1), s0 == s2), TRUE);
  s0 = s7;
  TEST ("s0.set_union(s1)", (s0.set_union(s1), s0 == s4), TRUE);
  s0 = s7;
  TEST ("s0.set_intersection(s1)", (s0.set_intersection(s1), s0 == s5), TRUE);
  s0 = s7;
  TEST ("s0.set_xor(s1)", (s0.set_xor(s1), s0 == s6), TRUE);
  s0 = s7;
  s0.reset(), s1.reset();
  // Create sets for intersection, union, difference, and xor
  CoolSet<int> sint;
  CoolSet<int> sunion;
  CoolSet<int> sdif;
  CoolSet<int> sxor;
  {sint.put(2);}
  {sint.put(7);}
  {sint.put(9);}
  {sint.put(6);}
  {sint.put(5);}
  {sint.put(3);}
  {sdif.put(1);}
  {sdif.put(4);}
  {sdif.put(0);}
  {sunion.put(6);}
  {sunion.put(1);}
  {sunion.put(3);}
  {sunion.put(2);}
  {sunion.put(8);}
  {sunion.put(0);}
  {sunion.put(5);}
  {sunion.put(7);}
  {sunion.put(4);}
  {sunion.put(9);}
  {sxor.put(1);}
  {sxor.put(8);}
  {sxor.put(4);}
  {sxor.put(0);}

  CoolSet<int> ltemp1;
  CoolSet<int> ltemp2;
  CoolSet<int> ltemp3;
  CoolSet<int> ltemp4;

  s0.reset(), s1.reset();
  TEST_RUN ("s0.next_intersection(s1)", 
            while (s0.next_intersection(s1)) ltemp1.put(s0.value()),
            ltemp1 == sint, TRUE);
  s0.reset(), s1.reset();
  TEST_RUN ("s0.next_difference(s1)", 
            while (s0.next_difference(s1)) ltemp2.put(s0.value()),
            ltemp2 == sdif, TRUE);
  s0.reset(), s1.reset();
  TEST_RUN ("s0.next_union(s1)", 
            while (s0.next_union(s1)) ltemp3.put(s0.value()),
            ltemp3 == sunion, TRUE);
  s0.reset(), s1.reset();
  TEST_RUN ("s0.next_xor(s1)", 
            while (s0.next_xor(s1)) ltemp4.put(s0.value()),
            ltemp4 == sxor, TRUE);
}

void test_double () {
  CoolSet<double> d0;
  TEST ("CoolSet<double> d0",d0.get_bucket_count(),3);
  TEST ("d0.capacity()", d0.capacity(), 24);
  CoolSet<double> d1(20);
  TEST ("CoolSet<double> d1(20)",d1.get_bucket_count(),3);
  TEST ("d1.capacity()", d1.capacity(), 24);
  CoolSet<double> d2(25);
  TEST ("CoolSet<double> d2(25)",d2.get_bucket_count(),7);
  TEST ("d2.capacity()", d2.capacity(), 56);
  CoolSet<double> d3(d2);
  TEST ("CoolSet<double> d3(d2)",d3.get_bucket_count(),7);
  TEST ("d2==d3", (d2==d3), TRUE);
  TEST ("d2 == d3", (d2 == d3), TRUE);
  TEST ("d1 == d2", (d1 == d2), TRUE);
  TEST ("d1 != d3", (d1 != d3), FALSE);
  TEST ("d0.reset()",(d0.reset(),1.0),1.0);
  TEST ("d0.put(1.0)", d0.put(1.0),TRUE);
  TEST ("d0.find(1.0)", d0.find(1.0), TRUE);
  TEST ("d0.value()", d0.value(), 1.0);
  TEST ("d0.length()", d0.length(), 1.0);
  TEST ("d0.put(2.0)", d0.put(2.0),TRUE);
  TEST ("d0.find(2.0)", d0.find(2.0), TRUE);
  TEST ("d0.put(3.0)", d0.put(3.0),TRUE);
  TEST ("d0.find(3.0)", d0.find(3.0), TRUE);
  TEST ("d0.put(4.0)", d0.put(4.0), TRUE);
  TEST ("d0.value()", d0.value(), 4.0);
  TEST ("d0.find(4.0)", d0.find(4.0), TRUE);
  TEST ("d0.value()", d0.value(), 4.0);
  TEST ("d0.put(5.0)", d0.put(5.0),TRUE);
  TEST ("d0.find(5.0)", d0.find(5.0), TRUE);
  TEST ("d0.put(6.0)", d0.put(6.0),TRUE);
  TEST ("d0.find(6.0)", d0.find(6.0), TRUE);
  TEST ("d0.put(7.0)", d0.put(7.0),TRUE);
  TEST ("d0.find(7.0)", d0.find(7.0), TRUE);
  TEST ("d0.put(8.0)", d0.put(8.0),TRUE);
  TEST ("d0.find(8.0)", d0.find(8.0), TRUE);
  TEST ("d0.put(9.0)", d0.put(9.0),TRUE);
  TEST ("d0.find(9.0)", d0.find(9.0), TRUE);
  TEST ("d0.get_bucket_count()", d0.get_bucket_count(), 3.0);
  TEST ("d0.length()", d0.length(), 9);
  TEST ("d0.remove(1.0)", d0.remove(1.0), TRUE);
  TEST ("d0.length()", d0.length(), 8);
  TEST ("d0.reset()",(d0.reset(),1.0),1.0);
  TEST ("d0.next()",d0.next(),TRUE);
  TEST ("d0.next()",d0.next(),TRUE);
  TEST ("d0.next()",d0.next(),TRUE);
  TEST ("d0.next()",d0.next(),TRUE);
  TEST ("d0.next()",d0.next(),TRUE);
  TEST ("d0.next()",d0.next(),TRUE);
  TEST ("d0.next()",d0.next(),TRUE);
  TEST ("d0.next()",d0.next(),TRUE);
  TEST ("d0.next()",d0.next(),FALSE);
  TEST ("d0.prev()",d0.prev(),TRUE);
  TEST ("d0.prev()",d0.prev(),TRUE);
  TEST ("d0.prev()",d0.prev(),TRUE);
  TEST ("d0.prev()",d0.prev(),TRUE);
  TEST ("d0.prev()",d0.prev(),TRUE);
  TEST ("d0.prev()",d0.prev(),TRUE);
  TEST ("d0.prev()",d0.prev(),TRUE);
  TEST ("d0.prev()",d0.prev(),TRUE);
  TEST ("d0.prev()",d0.prev(),FALSE);
  TEST ("d1=d0", (d1=d0,(d0==d1)), TRUE);
  TEST ("d1.resize(30)", d1.resize(30), TRUE);
  TEST ("d1.find(7.0)", d1.find(7.0), TRUE);
  TEST ("d1.value()", d1.value(), 7.0);
  TEST ("d1.find(3.0)", d1.find(3.0), TRUE);
  TEST ("d1.value()", d1.value(), 3.0);
  TEST ("d1.find(9.0)", d1.find(9.0), TRUE);
  TEST ("d1.value()", d1.value(), 9.0);
  TEST ("d1.get_bucket_count()", d1.get_bucket_count(), 7);
  TEST ("d1.length()", d1.length(), 8);
  TEST ("d0.set_ratio(1.0)", (d0.set_ratio(1.0),1.0), 1.0);
  TEST ("d0.resize(30)", d0.resize(30), TRUE);
  TEST ("d0.get_bucket_count()", d0.get_bucket_count(), 7);
  TEST ("d0.find(2.0)", d0.find(2.0), TRUE);
  TEST ("d0.find(4.0)", d0.find(4.0), TRUE);
  TEST ("d0.find(6.0)", d0.find(6.0), TRUE);
  TEST ("d0.find(8.0)", d0.find(8.0), TRUE);
  TEST ("d0.resize(60)", d0.resize(60), TRUE);
  TEST ("d0.get_bucket_count()", d0.get_bucket_count(), 19);
  TEST ("d0.find(2.0)", d0.find(2.0), TRUE);
  TEST ("d0.value()", d0.value(), 2.0);
  TEST ("d0.find(4.0)", d0.find(4.0), TRUE);
  TEST ("d0.value()", d0.value(), 4.0);
  TEST ("d0.find(6.0)", d0.find(6.0), TRUE);
  TEST ("d0.value()", d0.value(), 6.0);
  TEST ("d0.find(8.0)", d0.find(8.0), TRUE);
  TEST ("d0.value()", d0.value(), 8.0);
  TEST ("d0.remove()", d0.remove(), TRUE);
  TEST ("d0.find(8.0)", d0.find(8.0), FALSE);
  CoolSet<double> d4(d1);
  TEST ("CoolSet<double> D4(d1)", (d4==d1), TRUE);
  TEST ("d4.remove(6.0)", d4.remove(6.0), TRUE);
  TEST ("d1.search(d4)", d1.search(d4), TRUE);
  TEST ("d0.clear()", (d0.clear(), d0.length()), 0);
  TEST ("d1.clear()", (d1.clear(), d1.length()), 0);
}

void test_double_2 () {
  CoolSet<double> d0;
  CoolSet<double> d1;
  CoolSet<double> d2;
  CoolSet<double> d3;
  CoolSet<double> d4;
  CoolSet<double> d5; 
  CoolSet<double> d6;
  CoolSet<double> d7;
  double i;
  for (i = 0.0; i < 10.0; i++) 
    d0.put(i);
  d0.remove(8.0);
  for (i = 2.0; i < 10.0; i++)
    d1.put(i);