blob: 3e0647ed3673e0476335a63fd25068d9f3257932 (
plain) (
blame)
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
|
/*******************************************************************************
* Copyright (c) 2000, 2004 IBM Corporation and others.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Common Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/cpl-v10.html
*
* Contributors:
* IBM Corporation - initial API and implementation
*******************************************************************************/
package org.eclipse.search2.internal.ui;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Set;
import org.eclipse.search.ui.IQueryListener;
import org.eclipse.search.ui.ISearchQuery;
class QueryManager {
private List fQueries;
private List fLRU;
private List fListeners;
public QueryManager() {
super();
// an ArrayList should be plenty fast enough (few searches).
fQueries= new ArrayList();
fListeners= new ArrayList();
fLRU= new ArrayList();
}
synchronized ISearchQuery[] getQueries() {
ISearchQuery[] result= new ISearchQuery[fQueries.size()];
return (ISearchQuery[]) fQueries.toArray(result);
}
void removeQuery(ISearchQuery query) {
synchronized (fQueries) {
fQueries.remove(query);
fLRU.remove(query);
}
fireRemoved(query);
}
void addQuery(ISearchQuery query) {
synchronized (fQueries) {
if (fQueries.contains(query))
return;
fQueries.add(0, query);
fLRU.add(0, query);
}
fireAdded(query);
}
void addQueryListener(IQueryListener l) {
synchronized (fListeners) {
fListeners.add(l);
}
}
void removeQueryListener(IQueryListener l) {
synchronized (fListeners) {
fListeners.remove(l);
}
}
void fireAdded(ISearchQuery query) {
Set copiedListeners= new HashSet();
synchronized (fListeners) {
copiedListeners.addAll(fListeners);
}
Iterator listeners= copiedListeners.iterator();
while (listeners.hasNext()) {
IQueryListener l= (IQueryListener) listeners.next();
l.queryAdded(query);
}
}
void fireRemoved(ISearchQuery query) {
Set copiedListeners= new HashSet();
synchronized (fListeners) {
copiedListeners.addAll(fListeners);
}
Iterator listeners= copiedListeners.iterator();
while (listeners.hasNext()) {
IQueryListener l= (IQueryListener) listeners.next();
l.queryRemoved(query);
}
}
void fireStarting(ISearchQuery query) {
Set copiedListeners= new HashSet();
synchronized (fListeners) {
copiedListeners.addAll(fListeners);
}
Iterator listeners= copiedListeners.iterator();
while (listeners.hasNext()) {
IQueryListener l= (IQueryListener) listeners.next();
l.queryStarting(query);
}
}
void fireFinished(ISearchQuery query) {
Set copiedListeners= new HashSet();
synchronized (fListeners) {
copiedListeners.addAll(fListeners);
}
Iterator listeners= copiedListeners.iterator();
while (listeners.hasNext()) {
IQueryListener l= (IQueryListener) listeners.next();
l.queryFinished(query);
}
}
void removeAll() {
Set copiedSearches= new HashSet();
synchronized (fQueries) {
copiedSearches.addAll(fQueries);
fQueries.clear();
fLRU.clear();
Iterator iter= copiedSearches.iterator();
while (iter.hasNext()) {
ISearchQuery element= (ISearchQuery) iter.next();
fireRemoved(element);
}
}
}
void queryFinished(ISearchQuery query) {
fireFinished(query);
}
void queryStarting(ISearchQuery query) {
fireStarting(query);
}
void touch(ISearchQuery query) {
if (fLRU.contains(query)) {
fLRU.remove(query);
fLRU.add(0, query);
}
}
ISearchQuery getOldestQuery() {
if (fLRU.size() > 0)
return (ISearchQuery) fLRU.get(fLRU.size()-1);
return null;
}
}
|
