FilesExpand file tree

 master

/

MyLinkedListTester.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

227 lines (189 loc) · 4.65 KB

 master

/

MyLinkedListTester.java

Copy path

Top

File metadata and controls

• Code
• Blame

227 lines (189 loc) · 4.65 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

/**

*

*/

package textgen;

import static org.junit.Assert.*;

import java.util.LinkedList;

import org.junit.Before;

import org.junit.Test;

/**

* @author UC San Diego MOOC team

*

*/

public class MyLinkedListTester {

private static final int LONG_LIST_LENGTH =10;

MyLinkedList<String> shortList;

MyLinkedList<Integer> emptyList;

MyLinkedList<Integer> longerList;

MyLinkedList<Integer> list1;

/**

* @throws java.lang.Exception

*/

@Before

public void setUp() throws Exception {

//Feel free to use these lists, or add your own

shortList = new MyLinkedList<String>();

shortList.add("A");

shortList.add("B");

emptyList = new MyLinkedList<Integer>();

longerList = new MyLinkedList<Integer>();

for (int i = 0; i < LONG_LIST_LENGTH; i++)

{

longerList.add(i);

}

list1 = new MyLinkedList<Integer>();

list1.add(65);

list1.add(21);

list1.add(42);

}

/** Test if the get method is working correctly.

*/

/*You should not need to add much to this method.

* We provide it as an example of a thorough test. */

@Test

public void testGet()

{

//test empty list, get should throw an exception

try {

emptyList.get(0);

fail("Check out of bounds");

}

catch (IndexOutOfBoundsException e) {

}

// test short list, first contents, then out of bounds

assertEquals("Check first", "A", shortList.get(0));

assertEquals("Check second", "B", shortList.get(1));

try {

shortList.get(-1);

fail("Check out of bounds");

}

catch (IndexOutOfBoundsException e) {

}

try {

shortList.get(2);

fail("Check out of bounds");

}

catch (IndexOutOfBoundsException e) {

}

// test longer list contents

for(int i = 0; i<LONG_LIST_LENGTH; i++ ) {

assertEquals("Check "+i+ " element", (Integer)i, longerList.get(i));

}

// test off the end of the longer array

try {

longerList.get(-1);

fail("Check out of bounds");

}

catch (IndexOutOfBoundsException e) {

}

try {

longerList.get(LONG_LIST_LENGTH);

fail("Check out of bounds");

}

catch (IndexOutOfBoundsException e) {

}

}

/** Test removing an element from the list.

* We've included the example from the concept challenge.

* You will want to add more tests. */

@Test

public void testRemove()

{

int a = list1.remove(0);

assertEquals("Remove: check a is correct ", 65, a);

//System.out.println(list1);

assertEquals("Remove: check element 0 is correct ", (Integer)21, list1.get(0));

//System.out.println(list1.get(0));

assertEquals("Remove: check size is correct ", 2, list1.size());

//System.out.println(list1.size());

// TODO: Add more tests here

int b = list1.remove(list1.size()-1);

assertEquals("Remove: check a is correct ", 42, b);

try {

list1.remove(-1);

fail("Check out of bounds");

}

catch (IndexOutOfBoundsException e) {

}

try {

list1.remove(list1.size()+2);

fail("Check out of bounds");

}

catch (IndexOutOfBoundsException e) {

}

}

/** Test adding an element into the end of the list, specifically

* public boolean add(E element)

* */

@Test

public void testAddEnd()

{

// TODO: implement this test

list1.add(50);

assertEquals("Check for newly added last element ", (Integer)50, list1.get(list1.size()-1));

try {

list1.add(-1,70);

fail("Check out of bounds");

}

catch (IndexOutOfBoundsException e) {

}

try {

list1.add(list1.size()+1,50);

fail("Check out of bounds");

}

catch (IndexOutOfBoundsException e) {

}

try {

list1.add(1,null);

fail("Check out of bounds");

}

catch (NullPointerException e) {

}

}

/** Test the size of the list */

@Test

public void testSize()

{

// TODO: implement this test

list1.size();

assertEquals("Check for size of the list ", 3, list1.size());

}

/** Test adding an element into the list at a specified index,

* specifically:

* public void add(int index, E element)

* */

@Test

public void testAddAtIndex()

{

// TODO: implement this test

list1.add(1, 60);

assertEquals("Adding new element in given index ", (Integer)60, list1.get(1));

try {

list1.set(list1.size()+1,50);

fail("Check out of bounds");

}

catch (IndexOutOfBoundsException e) {

}

}

/** Test setting an element in the list */

@Test

public void testSet()

{

// TODO: implement this test

list1.set(1,50);

assertEquals("Adding new element in given index ", (Integer)50, list1.get(1));

try {

list1.set(-1,50);

fail("Check out of bounds");

}

catch (IndexOutOfBoundsException e) {

}

try {

list1.set(list1.size()+1,50);

fail("Check out of bounds");

}

catch (IndexOutOfBoundsException e) {

}

}

// TODO: Optionally add more test methods.

}