blob: 1df953cf3145d8fdab2d559dd7a48c1cb99d3196 (
plain)
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
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*/
package org.apache.tools.ant.util;
import java.util.Enumeration;
import java.util.Hashtable;
/** Hashtable implementation that allows delayed construction
* of expensive objects
*
* All operations that need access to the full list of objects
* will call initAll() first. Get and put are cheap.
*
* @since Ant 1.6
*/
public class LazyHashtable extends Hashtable {
// CheckStyle:VisibilityModifier OFF - bc
protected boolean initAllDone = false;
// CheckStyle:VisibilityModifier OFF - bc
/** No arg constructor. */
public LazyHashtable() {
super();
}
/** Used to be part of init. It must be done once - but
* we delay it until we do need _all_ tasks. Otherwise we
* just get the tasks that we need, and avoid costly init.
*/
protected void initAll() {
if (initAllDone) {
return;
}
initAllDone = true;
}
/**
* Get a enumeration over the elements.
* @return an enumeration.
*/
public Enumeration elements() {
initAll();
return super.elements();
}
/**
* Check if the table is empty.
* @return true if it is.
*/
public boolean isEmpty() {
initAll();
return super.isEmpty();
}
/**
* Get the size of the table.
* @return the size.
*/
public int size() {
initAll();
return super.size();
}
/**
* Check if the table contains a particular value.
* @param value the value to look for.
* @return true if the table contains the value.
*/
public boolean contains(Object value) {
initAll();
return super.contains(value);
}
/**
* Check if the table contains a particular key.
* @param value the key to look for.
* @return true if the table contains key.
*/
public boolean containsKey(Object value) {
initAll();
return super.containsKey(value);
}
/**
* Delegates to {@link #contains contains}.
* @param value the value to look for.
* @return true if the table contains the value.
*/
public boolean containsValue(Object value) {
return contains(value);
}
/**
* Get an enumeration over the keys.
* @return an enumeration.
*/
public Enumeration keys() {
initAll();
return super.keys();
}
// TODO Unfortunately JDK1.2 adds entrySet(), keySet(), values() -
// implementing this requires a small hack, we can add it later.
}
|
