aud.test.DListTest Class Reference

Public Member Functions
void	testCtor ()
void	testSize ()
void	testEntries ()
void	testList ()
void	testInvalid_at ()
void	testInvalid_front ()
void	testInvalid_back ()
void	testInvalid_erase ()
void	testInvalid_pop_front ()
void	testInvalid_pop_back ()
void	testIterators ()

Static Public Member Functions
static void	main (String args[])

Detailed Description

Definition at line 7 of file DListTest.java.

Member Function Documentation

main()

static void aud.test.DListTest.main ( String  args[] )

static

Definition at line 171 of file DListTest.java.

                                         {
    // prefer command line:
    // > java org.junit.runner.JUnitCore  aud.tests.DListTest
 
    org.junit.runner.JUnitCore.main("aud.test.DListTest");
  }

testCtor()

void aud.test.DListTest.testCtor

(

)

Definition at line 9 of file DListTest.java.

                         {
    DList<String> list=new DList<String>();
    assertTrue(list.empty());
  }

References aud.DList< T >.empty().

Here is the call graph for this function:

testEntries()

void aud.test.DListTest.testEntries

(

)

Definition at line 25 of file DListTest.java.

                            {
    DList<Integer> list=new DList<Integer>();
    for (int i=0;i<10;++i) {
      list.push_front(i);
      assertEquals(list.front().intValue(),i);
    }
    int n=list.size();
    for (int i=0;i<10;++i) {
      assertTrue(list.at(i)==n-1-i);
    }
  }

References aud.DList< T >.at(), aud.DList< T >.front(), aud.DList< T >.push_front(), and aud.DList< T >.size().

Here is the call graph for this function:

testInvalid_at()

void aud.test.DListTest.testInvalid_at

(

)

Definition at line 80 of file DListTest.java.

                               {
    DList<Integer> list=new DList<Integer>();
    list.push_front(1);
    list.at(1);
  }

References aud.DList< T >.at(), and aud.DList< T >.push_front().

Here is the call graph for this function:

testInvalid_back()

void aud.test.DListTest.testInvalid_back

(

)

Definition at line 93 of file DListTest.java.

                                 {
    DList<Integer> list=new DList<Integer>();
    list.back();
  }

References aud.DList< T >.back().

Here is the call graph for this function:

testInvalid_erase()

void aud.test.DListTest.testInvalid_erase

(

)

Definition at line 99 of file DListTest.java.

                                  {
    DList<Integer> list=new DList<Integer>();
    list.push_front(1);
    list.erase(1);
  }

References aud.DList< T >.erase(), and aud.DList< T >.push_front().

Here is the call graph for this function:

testInvalid_front()

void aud.test.DListTest.testInvalid_front

(

)

Definition at line 87 of file DListTest.java.

                                  {
    DList<Integer> list=new DList<Integer>();
    list.front();
  }

References aud.DList< T >.front().

Here is the call graph for this function:

testInvalid_pop_back()

void aud.test.DListTest.testInvalid_pop_back

(

)

Definition at line 111 of file DListTest.java.

                                     {
    DList<Integer> list=new DList<Integer>();
    list.pop_back();
  }

References aud.DList< T >.pop_back().

Here is the call graph for this function:

testInvalid_pop_front()

void aud.test.DListTest.testInvalid_pop_front

(

)

Definition at line 106 of file DListTest.java.

                                      {
    DList<Integer> list=new DList<Integer>();
    list.pop_front();
  }

References aud.DList< T >.pop_front().

Here is the call graph for this function:

testIterators()

void aud.test.DListTest.testIterators

(

)

Definition at line 117 of file DListTest.java.

                              {
    DList<Integer> list=new DList<Integer>();
    for (int i=0;i<5;++i)
      list.push_back(i);
 
    int n;
 
    DList<Integer>.ForwardIterator ii=list.iterator();
    for (int i=0;i<5;++i) {
      assertTrue(ii.hasNext());
      n=ii.next().intValue();
      assertTrue(n==i);
    }
    assertFalse(ii.hasNext());
 
    n = 0;
    for (Integer item : list) {
      assertTrue(n==item.intValue());
      ++n;
    }
 
    n = 4;
    for (Integer item : list.backwards()) {
      assertTrue(n==item.intValue());
      --n;
    }
 
    ii=list.iterator();
    list.insert_before(ii,-1);
    list.insert_after(ii,-2);
    assertTrue(ii.hasNext());
    ii.previous();
    assertTrue(ii.hasNext());
    n=ii.next();
    assertTrue(ii.hasNext());
    assertTrue(n==-1);
    n=ii.next();
    assertTrue(ii.hasNext());
    assertTrue(n==0);
    n=ii.next();
    assertTrue(ii.hasNext());
    assertTrue(n==-2);
    n=ii.next();
    assertTrue(ii.hasNext());
    assertTrue(n==1);
 
    DList<Integer>.BackwardIterator jj=list.reverse_iterator();
    for (int i=4;i>=1;--i) {
      assertTrue(jj.hasNext());
      n=jj.next().intValue();
      assertTrue(n==i);
    }
  }

References aud.DList< T >.backwards(), aud.DList< T >.insert_before(), aud.DList< T >.iterator(), aud.DList< T >.push_back(), and aud.DList< T >.reverse_iterator().

Here is the call graph for this function:

testList()

void aud.test.DListTest.testList

(

)

Definition at line 38 of file DListTest.java.

                         {
    DList<Integer> list=new DList<Integer>();
    list.push_front(4); // [4]
    list.push_back(6);  // [4,6]
    list.push_back(8);  // [4,6,8]
    list.push_front(2); // [2,4,6,8]
    list.insert(0,1);   // [1,2,4,6,8]
    list.insert(2,3);   // [1,2,3,4,6,8]
    list.insert(4,5);   // [1,2,3,4,5,6,8]
    list.insert(6,7);   // [1,2,3,4,5,6,7,8]
    list.insert(8,9);   // [1,2,3,4,5,6,7,8,9]
 
    for (int i=0;i<9;++i)
      assertTrue(list.at(i)==i+1);
 
    list.pop_front();   // [2,3,4,5,6,7,8,9]
    assertTrue(list.size()==8);
    assertTrue(list.front()==2);
    assertTrue(list.at(0)==2);
 
    list.pop_back();    // [2,3,4,5,6,7,8]
    assertTrue(list.size()==7);
    assertTrue(list.back()==8);
    assertTrue(list.at(list.size()-1)==8);
 
    assertTrue(list.at(2)==4);
    list.erase(2);     // [2,3,5,6,7,8]
    assertTrue(list.size()==6);
    assertTrue(list.at(2)==5);
 
    while (!list.empty()) {
      int sz=list.size();
      assertTrue(sz>0);
      list.erase(sz-1);
    }
    assertTrue(list.empty());
 
    list.push_back(1);
    assertTrue(list.front().intValue()==1);
  }

References aud.DList< T >.at(), aud.DList< T >.back(), aud.DList< T >.empty(), aud.DList< T >.erase(), aud.DList< T >.front(), aud.DList< T >.insert(), aud.DList< T >.pop_back(), aud.DList< T >.pop_front(), aud.DList< T >.push_back(), aud.DList< T >.push_front(), and aud.DList< T >.size().

Here is the call graph for this function:

testSize()

void aud.test.DListTest.testSize

(

)

Definition at line 15 of file DListTest.java.

                         {
    DList<String> list=new DList<String>();
    assertEquals(list.size(),0);
    for (int i=0;i<10;++i) {
      list.push_front("x");
      assertEquals(list.size(),i+1);
    }
  }

References aud.DList< T >.push_front(), and aud.DList< T >.size().

Here is the call graph for this function:

---

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

• DListTest.java