5import static org.junit.Assert.*;
11 assertTrue(vec.
empty());
17 assertEquals(vec.
size(),0);
18 for (
int i=0;i<10;++i) {
20 assertEquals(vec.
size(),i+1);
37 assertTrue(vec.
size()==7);
40 for (
int i=0;i<vec.
size();++i)
41 assertTrue(vec.
at(i).intValue()==i+1);
43 assertTrue(vec.
front()==1);
44 assertTrue(vec.
back()==7);
47 assertTrue(vec.
size()==6);
48 assertTrue(vec.
back()==6);
51 assertTrue(vec.
size()==5);
52 assertTrue(vec.
front()==2);
55 assertTrue(vec.
size()==4);
56 assertTrue(vec.
back()==5);
60 assertTrue(vec.
size()==3);
62 assertTrue(vec.
size()==2);
64 assertTrue(vec.
front()==2);
65 assertTrue(vec.
back()==5);
69 assertTrue(vec.
empty());
73 assertTrue(vec.
empty());
84 for (Integer i : vec) {
85 assertTrue(k==i.intValue());
91 @Test(expected=IndexOutOfBoundsException.class)
98 @Test(expected=IndexOutOfBoundsException.class)
104 @Test(expected=IndexOutOfBoundsException.class)
110 @Test(expected=IndexOutOfBoundsException.class)
117 @Test(expected=IndexOutOfBoundsException.class)
123 public static void main(String args[]) {
127 org.junit.runner.JUnitCore.main(
"aud.test.VectorTest");
Implementation of an array-based vector.
void pop_back()
remove last enytry [O(1)]
int capacity()
Get Capacity, i.e., the maximum size the vector can grow without allocating new storage.
T back()
get last entry [O(1)]
void insert(int i, T obj)
Insert new entry obj at position i [O(n)].
void push_back(T obj)
insert new entry obj at the end [O(1) for sufficient capacity]
T at(int i)
get i-th entry [O(1)]
int size()
get number of entries [O(1)]
void erase(int i)
remove entry at position i [O(n)]
T front()
get first entry [O(1)]
boolean empty()
Is vector empty? [O(1)].
void testInvalid_pop_back()
static void main(String args[])
AuD lecture: Data structures, algorithms, examples.