FilesExpand file tree

 master

/

Queue.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

64 lines (42 loc) · 1.25 KB

 master

/

Queue.java

Copy path

Top

File metadata and controls

• Code
• Blame

64 lines (42 loc) · 1.25 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

/**

* A simple queue implementation with a linkedlist

* @author William Fiset, william.alexandre.fiset@gmail.com

**/

public class Queue <T> implements Iterable <T> {

private java.util.LinkedList <T> list = new java.util.LinkedList <T> ();

public Queue() { }

public Queue(T firstElem) {

offer(firstElem);

}

// Return the size of the queue

public int size() {

return list.size();

}

// Returns whether or not the queue is empty

public boolean isEmpty() {

return size() == 0;

}

// Peek the element at the front of the queue

// The method throws an error is the queue is empty

public T peek() {

if (isEmpty())

throw new RuntimeException("Queue Empty");

return list.peekFirst();

}

// Poll an element from the front of the queue

// The method throws an error is the queue is empty

public T poll() {

if (isEmpty())

throw new RuntimeException("Queue Empty");

return list.removeFirst();

}

// Add an element to the back of the queue

public void offer(T elem) {

list.addLast(elem);

}

// Return an iterator to alow the user to traverse

// through the elements found inside the queue

@Override public java.util.Iterator <T> iterator () {

return list.iterator();

}

}