buckettest Class Reference

#include <buckettest.h>

Collaboration diagram for buckettest:

List of all members.

Static Public Member Functions
static void	test01 ()
	Use bucket: sorting a array of doubles in range [0.0,1.0).
static void	test02 ()
	Testing the buckets sorting time of doubles in the range [0.0,1.0) tested in progressive powers of two.
static void	test03 ()
	Test the hybrid bucket sort time of doubles in the range [0.0,1.0) tested in progressive powers of two.
static void	test04 ()
	Test hybrid bucket sort with bad data.
Static Public Attributes
static string	doc []
	Brief description of each test.

---

Detailed Description

Definition at line 9 of file buckettest.h.

---

Member Function Documentation

void buckettest::test01

(

)

[static]

Use bucket: sorting a array of doubles in range [0.0,1.0).

Definition at line 34 of file buckettest.cpp.

References bucket< T, HFN >::copy(), bucket< T, HFN >::eval(), and print().

Referenced by main().

{
  cout << "Testing Bucket Sort" << endl << endl;

  uintc n(10);

  vector<double> v(n);
  fill(&v[0],n);

  cout << "Vector of random values" << endl;
  cout << print(v,"\n"); 
  cout << endl << endl;



  cout << "Sorting" << endl;
  unitdouble f1(2*n);
  bucket<double,unitdouble> b(&v[0],n,f1);
  b.eval();

  vector<double> v2(n);
  b.copy(&v2[0]);

  cout << print(v2) << endl;

}

void buckettest::test02

(

)

[static]

Testing the buckets sorting time of doubles in the range [0.0,1.0) tested in progressive powers of two.

Definition at line 100 of file buckettest.cpp.

Referenced by main().

{
  cout << "Testing Bucket Sort" << endl << endl;

  cout << "Testing Sorting Time" << endl;

  uint u=10000;
  for (uint k=0; k<10; ++k)
  {
    createandtest(u);
    u *= 2;
  }
}

void buckettest::test03

(

)

[static]

Test the hybrid bucket sort time of doubles in the range [0.0,1.0) tested in progressive powers of two.

Definition at line 146 of file buckettest.cpp.

Referenced by main().

{
  cout << "Testing Bucket Hybrid Sort" << endl << endl;
  cout << "Testing Sorting Time" << endl;

  uint u=10000;
  uint blen = 4;
  for (uint k=0; k<9; ++k)
  {
    createandtest2(u,blen);
    u *= 2;
    ++blen;
  }
}

void buckettest::test04

(

)

[static]

Test hybrid bucket sort with bad data.

Definition at line 188 of file buckettest.cpp.

Referenced by main().

{
  cout << "Testing Bucket Hybrid Sort" << endl << endl;
  cout << "Testing Sorting Time" << endl;

  uint u=1000;
  uint blen = 4;
  for (uint k=0; k<1; ++k)
  {
    createandtest3(u,blen);
    u *= 2;
    ++blen;
  }
}

---

Member Data Documentation

string buckettest::doc [static]

Initial value:

 
{
  "",
  "Use bucket: sorting a array of doubles in range [0.0,1.0).",
  "Testing the buckets sorting time of doubles in the range [0.0,1.0) tested in progressive powers of two.",
  "Test the hybrid bucket sort time of doubles in the range [0.0,1.0) tested in progressive powers of two.",
  "Test hybrid bucket sort with bad data."

}

Brief description of each test.

Definition at line 35 of file buckettest.h.

Referenced by main().

---

The documentation for this class was generated from the following files:

• bucket/buckettest.h
• bucket/buckettest.cpp