org.apache.flink.table.util.collections.IntSet Maven / Gradle / Ivy
/*
* 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.flink.table.util.collections;
import org.apache.flink.table.util.hash.Murmur32;
/**
* Int set.
*/
public class IntSet extends OptimizableHashSet {
private int[] key;
private int min = Integer.MAX_VALUE;
private int max = Integer.MIN_VALUE;
public IntSet(final int expected, final float f) {
super(expected, f);
this.key = new int[this.n + 1];
}
public IntSet(final int expected) {
this(expected, DEFAULT_LOAD_FACTOR);
}
public IntSet() {
this(DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR);
}
public boolean add(final int k) {
if (k == 0) {
if (this.containsZero) {
return false;
}
this.containsZero = true;
} else {
int[] key = this.key;
int pos;
int curr;
if ((curr = key[pos = Murmur32.fmix(k) & this.mask]) != 0) {
if (curr == k) {
return false;
}
while ((curr = key[pos = pos + 1 & this.mask]) != 0) {
if (curr == k) {
return false;
}
}
}
key[pos] = k;
}
if (this.size++ >= this.maxFill) {
this.rehash(OptimizableHashSet.arraySize(this.size + 1, this.f));
}
if (k < min) {
min = k;
}
if (k > max) {
max = k;
}
return true;
}
public boolean contains(final int k) {
if (isDense) {
return k >= min && k <= max && used[k - min];
} else {
if (k == 0) {
return this.containsZero;
} else {
int[] key = this.key;
int curr;
int pos;
if ((curr = key[pos = Murmur32.fmix(k) & this.mask]) == 0) {
return false;
} else if (k == curr) {
return true;
} else {
while ((curr = key[pos = pos + 1 & this.mask]) != 0) {
if (k == curr) {
return true;
}
}
return false;
}
}
}
}
private void rehash(final int newN) {
int[] key = this.key;
int mask = newN - 1;
int[] newKey = new int[newN + 1];
int i = this.n;
int pos;
for (int j = this.realSize(); j-- != 0; newKey[pos] = key[i]) {
do {
--i;
} while (key[i] == 0);
if (newKey[pos = Murmur32.fmix(key[i]) & mask] != 0) {
while (newKey[pos = pos + 1 & mask] != 0) {}
}
}
this.n = newN;
this.mask = mask;
this.maxFill = OptimizableHashSet.maxFill(this.n, this.f);
this.key = newKey;
}
@Override
public void optimize() {
int range = max - min;
if (range >= 0 && (range < key.length || range < OptimizableHashSet.DENSE_THRESHOLD)) {
this.used = new boolean[max - min + 1];
for (int v : key) {
if (v != 0) {
used[v - min] = true;
}
}
if (containsZero) {
used[-min] = true;
}
isDense = true;
key = null;
}
}
}