FilesExpand file tree

basic_algorithms

/

ListUtilsTest.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

61 lines (45 loc) · 1.37 KB

basic_algorithms

/

ListUtilsTest.java

Copy path

Top

File metadata and controls

• Code
• Blame

61 lines (45 loc) · 1.37 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

package utils;

import org.junit.Test;

import utils.comparators.IntegerComparator;

import java.util.ArrayList;

import java.util.Comparator;

import java.util.List;

import static junit.framework.TestCase.assertEquals;

/**

* Unit tests for List utilities

*/

public class ListUtilsTest {

/**

* Test Scenario: Application wants to zip two unequal lists

* Expected Output: A zip list should be returned with size equal to the size of

* the list with the smallest size

*/

@Test

public void testZip(){

List<Integer> lst1 = new ArrayList<>();

List<Integer> lst2 = new ArrayList<>();

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

lst1.add(i);

lst2.add(i);

}

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

lst2.add(i);

}

List<Pair<Integer, Integer>> result = ListUtils.zip(lst1, lst2);

assertEquals("Invalid list size",result.size(), lst1.size());

}

/**

* Test Scenario: Application wants to partition a list of items

* Expected Output: The list should be partitioned

*

*/

@Test

public void testPartition(){

List<Integer> list = new ArrayList<>();

Comparator<Integer> comparator = new IntegerComparator();

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

list.add(i + 1);

}

ListUtils.partition(list, comparator);

}

}