Skip to main content
aboutsummaryrefslogtreecommitdiffstats
blob: 36a9615503532f215d19d540508aa3bd8ab5b982 (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
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
/*******************************************************************************
 * Copyright (c) 2007 Intel Corporation and others.
 * All rights reserved. This program and the accompanying materials
 * are made available under the terms of the Eclipse Public License v1.0
 * which accompanies this distribution, and is available at
 * http://www.eclipse.org/legal/epl-v10.html
 *
 * Contributors:
 * Intel Corporation - Initial API and implementation
 *******************************************************************************/
package org.eclipse.cdt.core.settings.model.util;

import java.util.AbstractCollection;
import java.util.ArrayList;
import java.util.Collection;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Map.Entry;

import org.eclipse.cdt.core.model.CoreModelUtil;

public class PatternNameMap {
	private static final char[] SPEC_CHARS = new char[]{'*', '?'}; 
	static final String DOUBLE_STAR_PATTERN = "**";  //$NON-NLS-1$

	private Map<String, PathSettingsContainer> fChildrenMap;
	private Map<StringCharArray, PathSettingsContainer> fPatternMap;
	private Collection<PathSettingsContainer> fValues;
	private boolean fContainsDoubleStar;

	private static class StringCharArray {
		private String fString;
		private char[] fCharArray;

		StringCharArray(String string){
			fString = string;
		}
		
		char[] getCharArray(){
			if(fCharArray == null){
				fCharArray = fString.toCharArray();
			}
			return fCharArray;
		}

		@Override
		public boolean equals(Object obj) {
			if(obj == this)
				return true;
			
			if(!(obj instanceof StringCharArray))
				return false;
			
			return fString.equals(((StringCharArray)obj).fString);
		}

		@Override
		public int hashCode() {
			return fString.hashCode();
		}

		@Override
		public String toString() {
			return fString;
		}
	}
	
	private class EmptyIterator implements Iterator<PathSettingsContainer>{

		public boolean hasNext() {
			return false;
		}

		public PathSettingsContainer next() {
			throw new NoSuchElementException();
		}

		public void remove() {
			throw new IllegalStateException();
		}
		
	}
	
	private class ValuesCollection extends AbstractCollection<PathSettingsContainer> {
		
		private class Iter implements Iterator<PathSettingsContainer> {
			private Iterator<Entry<String, PathSettingsContainer>> fEntrySetIter;
			private Entry<String, PathSettingsContainer> fCur;

			Iter (Iterator<Entry<String, PathSettingsContainer>> entryIter){
				this.fEntrySetIter = entryIter;
			}
			public boolean hasNext() {
				return fEntrySetIter.hasNext();
			}

			public PathSettingsContainer next() {
				fCur = fEntrySetIter.next();
				return fCur.getValue();
			}

			public void remove() {
				fEntrySetIter.remove();
				String name = fCur.getKey();
				if(DOUBLE_STAR_PATTERN.equals(name)){
					fContainsDoubleStar = false;
				} else {
					removePattern(name);
				}
			}
		}

		@Override
		public Iterator<PathSettingsContainer> iterator() {
			return fChildrenMap != null ? new Iter(fChildrenMap.entrySet().iterator()) : new EmptyIterator();
		}

		@Override
		public int size() {
			return PatternNameMap.this.size();
		}
		
		@Override
		public void clear(){
			PatternNameMap.this.clear();
		}
		
		@Override
		public boolean contains(Object o){
			return fChildrenMap != null ? fChildrenMap.containsValue(o) : false;
		}
	}

	public /* PathSettingsContainer */ Object get(String name){
		return fChildrenMap != null ? fChildrenMap.get(name) : null;
	}
	
	public int size(){
		return fChildrenMap != null ? fChildrenMap.size() : 0;
	}
	
	public boolean isEmpty(){
		return fChildrenMap == null || fChildrenMap.isEmpty();
	}
	
	public boolean hasPatterns(){
		return fContainsDoubleStar || hasPatternsMap();
	}

	public boolean hasPatternsMap(){
		return (fPatternMap != null && fPatternMap.size() != 0);
	}

	public List<PathSettingsContainer> getValues(String name){
		if(fChildrenMap == null)
			return null;
		
		PathSettingsContainer val = fChildrenMap.get(name);
		if(hasPatternsMap()){
			List<PathSettingsContainer> list;
			if(val != null){
				list = new ArrayList<PathSettingsContainer>(3);
				list.add(val);
			} else {
				list = null;
			}
			
			Map.Entry<PatternNameMap.StringCharArray,PathSettingsContainer> entry;
			StringCharArray strCA;
			char[] nameCharArray = name.toCharArray(); 
			for(Iterator<Map.Entry<PatternNameMap.StringCharArray,PathSettingsContainer>> iter = fPatternMap.entrySet().iterator(); iter.hasNext();){
				entry = iter.next();
				strCA = entry.getKey();
				if(CoreModelUtil.match(strCA.getCharArray(), nameCharArray, true)){
					if(list == null)
						list = new ArrayList<PathSettingsContainer>(2);
					list.add(entry.getValue());
				}
			}
			return list;
		} else if (val != null){
			List<PathSettingsContainer> list = new ArrayList<PathSettingsContainer>(1);
			list.add(val);
			return list;
		}
		return null;
	}
	
	public boolean containsDoubleStar(){
		return fContainsDoubleStar;
	}
	
	public /* PathSettingsContainer */ Object put(String name, /* PathSettingsContainer */Object value){
		return put(name, (PathSettingsContainer)value);
	}
	
	private PathSettingsContainer put(String name, PathSettingsContainer value){
		if(value == null)
			return (PathSettingsContainer)remove(name);
		
		PathSettingsContainer oldValue;
		if(fChildrenMap == null){
			fChildrenMap = new HashMap<String, PathSettingsContainer>();
			oldValue = null;
		} else {
			oldValue = fChildrenMap.get(name);
		}
		
		fChildrenMap.put(name, value);
		
		if(DOUBLE_STAR_PATTERN.equals(name)){
			fContainsDoubleStar = true;
		} else if(isPatternName(name)){
			StringCharArray strCA = new StringCharArray(name);
			if(fPatternMap == null)
				fPatternMap = new HashMap<StringCharArray, PathSettingsContainer>();
			
			fPatternMap.put(strCA, value);
		}
		
		return oldValue;
	}
	
	public /* PathSettingsContainer */ Object remove(String name){
		if(fChildrenMap != null){
			PathSettingsContainer oldVal = fChildrenMap.remove(name);
			if(fChildrenMap.size() == 0){
				fChildrenMap = null;
				fPatternMap = null;
				fContainsDoubleStar = false;
			} else if(DOUBLE_STAR_PATTERN.equals(name)){
				fContainsDoubleStar = false;
			} else {
				removePattern(name);
			}
			return oldVal;
		}
		return null;
	}
	
	private void removePattern(String name){
		if (fPatternMap != null){
			fPatternMap.remove(new StringCharArray(name));
			if(fPatternMap.size() == 0)
				fPatternMap = null;
		}
	}
	
	private static boolean hasSpecChars(String str){
		for(int i = 0; i < SPEC_CHARS.length; i++){
			if(str.indexOf(SPEC_CHARS[i]) != -1)
				return true;
		}
		return false;
	}

	public static boolean isPatternName(String str){
		//TODO: check escape chars
		return hasSpecChars(str);
	}
	
	public void clear(){
		fChildrenMap = null;
		fPatternMap = null;
		fContainsDoubleStar = false;
	}
	
	public Collection<PathSettingsContainer> values(){
		if(fValues == null)
			fValues = new ValuesCollection();
		return fValues;
	}
}

Back to the top