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
|
/*
* SonarQube, open source software quality management tool.
* Copyright (C) 2008-2014 SonarSource
* mailto:contact AT sonarsource DOT com
*
* SonarQube is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3 of the License, or (at your option) any later version.
*
* SonarQube is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
package org.sonar.duplications.token;
import java.util.Deque;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.ListIterator;
public class TokenQueue implements Iterable<Token> {
private final Deque<Token> tokenQueue;
public TokenQueue(List<Token> tokenList) {
tokenQueue = new LinkedList<Token>(tokenList);
}
public TokenQueue() {
tokenQueue = new LinkedList<Token>();
}
/**
* Retrieves, but does not remove, token from this queue.
*
* @return token from this queue, or <tt>null</tt> if this queue is empty.
*/
public Token peek() {
return tokenQueue.peek();
}
/**
* Retrieves and removes token from this queue.
*
* @return token from this queue, or <tt>null</tt> if this queue is empty.
*/
public Token poll() {
return tokenQueue.poll();
}
public int size() {
return tokenQueue.size();
}
public void add(Token token) {
tokenQueue.addLast(token);
}
public boolean isNextTokenValue(String expectedValue) {
Token nextToken = tokenQueue.peek();
if (nextToken == null) {
// queue is empty
return false;
}
return nextToken.getValue().equals(expectedValue);
}
public Iterator<Token> iterator() {
return tokenQueue.iterator();
}
public void pushForward(List<Token> matchedTokenList) {
ListIterator<Token> iter = matchedTokenList.listIterator(matchedTokenList.size());
while (iter.hasPrevious()) {
tokenQueue.addFirst(iter.previous());
}
}
}
|
