-
Notifications
You must be signed in to change notification settings - Fork 194
/
Copy pathRandomGenerator.java
162 lines (132 loc) · 4.34 KB
/
RandomGenerator.java
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
/*
* Copyright 2023 by OLTPBenchmark Project
*
* Licensed 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 com.oltpbenchmark.util;
import java.util.concurrent.ThreadLocalRandom;
public class RandomGenerator extends java.util.Random {
/**
* Constructor
*/
public RandomGenerator() {
}
@Override
protected int next(int bits) {
return ThreadLocalRandom.current().nextInt() >>> (32 - bits);
}
@Override
public int nextInt() {
return ThreadLocalRandom.current().nextInt();
}
@Override
public int nextInt(int bound) {
return ThreadLocalRandom.current().nextInt(bound);
}
@Override
public long nextLong() {
return ThreadLocalRandom.current().nextLong();
}
@Override
public boolean nextBoolean() {
return ThreadLocalRandom.current().nextBoolean();
}
@Override
public float nextFloat() {
return ThreadLocalRandom.current().nextFloat();
}
@Override
public double nextDouble() {
return ThreadLocalRandom.current().nextDouble();
}
@Override
public double nextGaussian() {
return ThreadLocalRandom.current().nextGaussian();
}
/**
* Returns a random int value between minimum and maximum (inclusive)
*
* @param minimum
* @param maximum
* @returns a int in the range [minimum, maximum]. Note that this is inclusive.
*/
public int number(int minimum, int maximum) {
int range_size = maximum - minimum + 1;
int value = ThreadLocalRandom.current().nextInt(range_size);
value += minimum;
return value;
}
/**
* Returns a random long value between minimum and maximum (inclusive)
*
* @param minimum
* @param maximum
* @return
*/
public long number(long minimum, long maximum) {
long range_size = (maximum - minimum) + 1;
// error checking and 2^x checking removed for simplicity.
long bits, val;
do {
bits = (ThreadLocalRandom.current().nextLong() << 1) >>> 1;
val = bits % range_size;
}
while (bits - val + range_size < 0L);
val += minimum;
return val;
}
/**
* @param decimal_places
* @param minimum
* @param maximum
* @return
*/
public double fixedPoint(int decimal_places, double minimum, double maximum) {
int multiplier = 1;
for (int i = 0; i < decimal_places; ++i) {
multiplier *= 10;
}
int int_min = (int) (minimum * multiplier + 0.5);
int int_max = (int) (maximum * multiplier + 0.5);
return (double) this.number(int_min, int_max) / (double) multiplier;
}
/**
* @returns a random alphabetic string with length in range [minimum_length, maximum_length].
*/
public String astring(int minimum_length, int maximum_length) {
return randomString(minimum_length, maximum_length, 'a', 26);
}
/**
* @returns a random numeric string with length in range [minimum_length, maximum_length].
*/
public String nstring(int minimum_length, int maximum_length) {
return randomString(minimum_length, maximum_length, '0', 10);
}
/**
* @param minimum_length
* @param maximum_length
* @param base
* @param numCharacters
* @return
*/
private String randomString(int minimum_length, int maximum_length, char base, int numCharacters) {
int length = number(minimum_length, maximum_length);
byte baseByte = (byte) base;
byte[] bytes = new byte[length];
for (int i = 0; i < length; ++i) {
bytes[i] = (byte) (baseByte + number(0, numCharacters - 1));
}
return new String(bytes);
}
}