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
|
/*
Derby - Class org.apache.derbyTesting.unitTests.services.T_Key
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.derbyTesting.unitTests.services;
/**
Key for these objects is an array of objects
value - Integer or String - implies what object should be used in the cache.
waitms - time to wait in ms on a set or create (simulates the object being loaded into the cache).
canFind - true of the object can be found on a set, false if it can't. (simulates a request for a non-existent object)
raiseException - true if an exception should be raised during set or create identity
*/
public class T_Key {
private Object value;
private long waitms;
private boolean canFind;
private boolean raiseException;
public static T_Key simpleInt(int value) {
return new T_Key(value, 0, true, false);
}
public static T_Key dontFindInt(int value) {
return new T_Key(value, 0, false, false);
}
public static T_Key exceptionInt(int value) {
return new T_Key(value, 0, true, true);
}
/**
48%/48%/4% chance of Int/String/invalid key
90%/5%/5% chance of can find / can't find / raise exception
*/
public static T_Key randomKey() {
double rand = Math.random();
T_Key tkey = new T_Key();
if (rand < 0.48)
tkey.value = (int) (100.0 * rand);
else if (rand < 0.96)
tkey.value = (int) (100.0 * rand);
else
tkey.value = Boolean.FALSE;
rand = Math.random();
if (rand < 0.90)
tkey.canFind = true;
else if (rand < 0.95)
tkey.canFind = false;
else {
tkey.canFind = true;
tkey.raiseException = false;
}
rand = Math.random();
if (rand < 0.30) {
tkey.waitms = (long) (rand * 1000.0); // Range 0 - 0.3 secs
}
return tkey;
}
private T_Key() {
}
private T_Key(Object value, long waitms, boolean canFind, boolean raiseException) {
this.value = value;
this.waitms = waitms;
this.canFind = canFind;
this.raiseException = raiseException;
}
public Object getValue() {
return value;
}
public long getWait() {
return waitms;
}
public boolean canFind() {
return canFind;
}
public boolean raiseException() {
return raiseException;
}
public boolean equals(Object other) {
if (other instanceof T_Key) {
return value.equals(((T_Key) other).value);
}
return false;
}
public int hashCode() {
return value.hashCode();
}
public String toString() {
return value + " " + waitms + " " + canFind + " " + raiseException;
}
}
|
