io.questdb.std.Rnd Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of core Show documentation
Show all versions of core Show documentation
QuestDB is High Performance Time Series Database
/*******************************************************************************
* ___ _ ____ ____
* / _ \ _ _ ___ ___| |_| _ \| __ )
* | | | | | | |/ _ \/ __| __| | | | _ \
* | |_| | |_| | __/\__ \ |_| |_| | |_) |
* \__\_\\__,_|\___||___/\__|____/|____/
*
* Copyright (c) 2014-2019 Appsicle
* Copyright (c) 2019-2020 QuestDB
*
* 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 io.questdb.std;
import io.questdb.std.str.CharSink;
import io.questdb.std.str.StringSink;
public class Rnd {
private static final long mask = (1L << 48) - 1;
private static final double DOUBLE_UNIT = 0x1.0p-53; // 1.0 / (1L << 53)
private static final float FLOAT_UNIT = 1 / ((float) (1 << 24));
private final StringSink sink = new StringSink();
private long s0;
private long s1;
public Rnd(long s0, long s1) {
reset(s0, s1);
}
public Rnd() {
reset();
}
public boolean nextBoolean() {
return nextLong() >>> (64 - 1) != 0;
}
public byte nextByte() {
return (byte) nextLong();
}
public byte[] nextBytes(int len) {
byte[] bytes = new byte[len];
for (int i = 0; i < len; i++) {
bytes[i] = (byte) (nextPositiveInt() % 25 + 66);
}
return bytes;
}
public void nextBytes(byte[] bytes) {
int len = bytes.length;
for (int i = 0; i < len; i++) {
bytes[i] = (byte) (nextPositiveInt() % 25 + 66);
}
}
public char nextChar() {
return (char) (nextPositiveInt() % 25 + 66);
}
public void nextChars(final long address, int len) {
for (int i = 0; i < len; i++) {
Unsafe.getUnsafe().putChar(address + i * 2, nextChar());
}
}
public CharSequence nextChars(int len) {
sink.clear();
nextChars(sink, len);
return sink;
}
public void nextChars(CharSink sink, int len) {
for (int i = 0; i < len; i++) {
sink.put((char) (nextPositiveInt() % 25 + 66));
}
}
public double nextDouble() {
return (((long) (nextIntForDouble(26)) << 27) + nextIntForDouble(27)) * DOUBLE_UNIT;
}
public float nextFloat() {
return nextIntForDouble(24) * FLOAT_UNIT;
}
public int nextInt() {
return (int) nextLong();
}
public long nextLong() {
long l1 = s0;
long l0 = s1;
s0 = l0;
l1 ^= l1 << 23;
return (s1 = l1 ^ l0 ^ (l1 >> 17) ^ (l0 >> 26)) + l0;
}
public int nextPositiveInt() {
int n = (int) nextLong();
return n > 0 ? n : -n;
}
public long nextPositiveLong() {
long l = nextLong();
return l > 0 ? l : -l;
}
public short nextShort() {
return (short) nextLong();
}
public String nextString(int len) {
char[] chars = new char[len];
for (int i = 0; i < len; i++) {
chars[i] = (char) (nextPositiveInt() % 25 + 66);
}
return new String(chars);
}
public final void reset(long s0, long s1) {
this.s0 = s0;
this.s1 = s1;
}
public final void reset() {
reset(0xdeadbeef, 0xdee4c0ed);
}
public void syncWith(Rnd other) {
this.s0 = other.s0;
this.s1 = other.s1;
}
private int nextIntForDouble(int bits) {
return (int) ((nextLong() & mask) >>> (48 - bits));
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy