FilesExpand file tree

 master

/

GenericArrayListQueue.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

44 lines (37 loc) · 1.16 KB

 master

/

GenericArrayListQueue.java

Top

File metadata and controls

• Code
• Blame

44 lines (37 loc) · 1.16 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

package DataStructures.Queues;

import java.util.ArrayList;

public class GenericArrayListQueue<T> {

ArrayList<T> _queue = new ArrayList<T>();

private boolean hasElements() {

return !_queue.isEmpty();

}

public T peek() {

T result = null;

if(this.hasElements()) { result = _queue.get(0); }

return result;

}

public boolean add(T element) {

return _queue.add(element);

}

public T poll() {

T result = null;

if(this.hasElements()) { result = _queue.remove(0); }

return result;

}

public static void main(String[] args) {

GenericArrayListQueue<Integer> queue = new GenericArrayListQueue<Integer>();

System.out.println("Running...");

assert queue.peek() == null;

assert queue.poll() == null;

assert queue.add(1) == true;

assert queue.peek() == 1;

assert queue.add(2) == true;

assert queue.peek() == 1;

assert queue.poll() == 1;

assert queue.peek() == 2;

assert queue.poll() == 2;

assert queue.peek() == null;

assert queue.poll() == null;

System.out.println("Finished.");

}

}