org.dflib.IntSeries Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of dflib Show documentation
Show all versions of dflib Show documentation
dflib: DataFrame library
package org.dflib;
import org.dflib.series.BooleanArraySeries;
import org.dflib.series.FalseSeries;
import org.dflib.series.IntArraySeries;
import org.dflib.series.IntIndexedSeries;
import org.dflib.series.TrueSeries;
import org.dflib.set.Diff;
import org.dflib.set.Intersect;
import org.dflib.sort.IntComparator;
import java.util.Comparator;
import java.util.Random;
import java.util.function.IntPredicate;
import java.util.function.Predicate;
/**
* A Series optimized to store and access primitive int values without java.lang.Integer wrapper. Can also
* pose as "Series<Integer>", although this is not the most efficient way of using it.
*
* @since 0.6
*/
public interface IntSeries extends Series {
@Override
default Class getNominalType() {
return Integer.TYPE;
}
@Override
default Class getInferredType() {
return Integer.TYPE;
}
@Override
default IntSeries castAsInt() {
return this;
}
int getInt(int index);
void copyToInt(int[] to, int fromOffset, int toOffset, int len);
@Override
IntSeries materialize();
@Override
default int position(Integer value) {
if (value == null) {
return -1;
}
int ival = value;
int len = size();
for (int i = 0; i < len; i++) {
if (ival == getInt(i)) {
return i;
}
}
return -1;
}
@Override
default Series expand(Object... values) {
int len = values.length;
if (len == 0) {
return this;
}
int[] primitives = new int[len];
for (int i = 0; i < len; i++) {
if (values[i] instanceof Integer) {
primitives[i] = (Integer) values[i];
} else {
return Series.super.expand(values);
}
}
return expandInt(primitives);
}
/**
* Creates a new Series with a provided values appended to the end of this Series.
*
* @since 1.0.0-M21
*/
default IntSeries expandInt(int... values) {
int rlen = values.length;
if (rlen == 0) {
return this;
}
int llen = size();
int[] expanded = new int[llen + rlen];
this.copyToInt(expanded, 0, 0, llen);
System.arraycopy(values, 0, expanded, llen, rlen);
return Series.ofInt(expanded);
}
IntSeries concatInt(IntSeries... other);
@Override
default IntSeries diff(Series other) {
return Diff.diffInt(this, other);
}
@Override
default IntSeries intersect(Series other) {
return Intersect.intersectInt(this, other);
}
/**
* @since 1.0.0-M19
*/
IntSeries rangeInt(int fromInclusive, int toExclusive);
@Override
default IntSeries head(int len) {
if (Math.abs(len) >= size()) {
return this;
}
return len < 0 ? tail(size() + len) : rangeInt(0, len);
}
@Override
default IntSeries tail(int len) {
int size = size();
if (Math.abs(len) >= size()) {
return this;
}
return len < 0 ? head(size + len) : rangeInt(size - len, size);
}
@Override
IntSeries select(Predicate p);
@Override
IntSeries select(Condition condition);
@Override
IntSeries select(BooleanSeries positions);
@Override
default Series select(IntSeries positions) {
return IntIndexedSeries.of(this, positions);
}
/**
* @since 0.11
*/
IntSeries selectInt(IntPredicate p);
@Override
IntSeries sort(Sorter... sorters);
@Override
IntSeries sort(Comparator comparator);
IntSeries sortInt();
IntSeries sortInt(IntComparator comparator);
/**
* @since 0.8
*/
IntSeries sortIndexInt();
/**
* @since 0.8
*/
IntSeries sortIndexInt(IntComparator comparator);
/**
* Returns an IntSeries that represents positions in the Series that match the predicate. The returned value can be
* used to "select" data from this Series or from DataFrame containing this Series. Same as {@link #index(Predicate)}
* only usually much faster.
*
* @param predicate match condition
* @return an IntSeries that represents positions in the Series that match the predicate. Negative values denote
* null values.
*/
IntSeries indexInt(IntPredicate predicate);
BooleanSeries locateInt(IntPredicate predicate);
@Override
default BooleanSeries isNull() {
return new FalseSeries(size());
}
@Override
default BooleanSeries isNotNull() {
return new TrueSeries(size());
}
@Override
IntSeries unique();
/**
* @since 0.7
*/
@Override
IntSeries sample(int size);
/**
* @since 0.7
*/
@Override
IntSeries sample(int size, Random random);
/**
* @since 0.7
*/
default int[] toIntArray() {
int len = size();
int[] copy = new int[len];
copyToInt(copy, 0, 0, len);
return copy;
}
/**
* @since 0.14
*/
LongSeries cumSum();
/**
* @since 0.7
*/
int max();
/**
* @since 0.7
*/
int min();
/**
* @since 0.7
*/
long sum();
/**
* @since 0.11
*/
double avg();
/**
* @since 0.7
*/
double median();
@Override
default BooleanSeries eq(Series s) {
if (!(s instanceof IntSeries)) {
return Series.super.eq(s);
}
int len = size();
if (len != s.size()) {
throw new IllegalArgumentException("Another Series size " + s.size() + " is not the same as this size " + len);
}
boolean[] data = new boolean[len];
IntSeries anotherInt = (IntSeries) s;
for (int i = 0; i < len; i++) {
data[i] = getInt(i) == anotherInt.getInt(i);
}
return new BooleanArraySeries(data);
}
@Override
default BooleanSeries ne(Series s) {
if (!(s instanceof IntSeries)) {
return Series.super.ne(s);
}
int len = size();
if (len != s.size()) {
throw new IllegalArgumentException("Another Series size " + s.size() + " is not the same as this size " + len);
}
boolean[] data = new boolean[len];
IntSeries anotherInt = (IntSeries) s;
for (int i = 0; i < len; i++) {
data[i] = getInt(i) != anotherInt.getInt(i);
}
return new BooleanArraySeries(data);
}
/**
* Performs per-element addition between this and another IntSeries, returning the Series of the same
* length.
*
* @since 0.11
*/
default IntSeries add(IntSeries s) {
int len = size();
if (len != s.size()) {
throw new IllegalArgumentException("Another Series size " + s.size() + " is not the same as this size " + len);
}
int[] data = new int[len];
for (int i = 0; i < len; i++) {
data[i] = this.getInt(i) + s.getInt(i);
}
return new IntArraySeries(data);
}
/**
* Performs subtraction operation between this and another IntSeries.
*
* @since 0.11
*/
default IntSeries sub(IntSeries s) {
int len = size();
if (len != s.size()) {
throw new IllegalArgumentException("Another Series size " + s.size() + " is not the same as this size " + len);
}
int[] data = new int[len];
for (int i = 0; i < len; i++) {
data[i] = this.getInt(i) - s.getInt(i);
}
return new IntArraySeries(data);
}
/**
* Performs multiplication operation between this and another IntSeries.
*
* @since 0.11
*/
default IntSeries mul(IntSeries s) {
int len = size();
if (len != s.size()) {
throw new IllegalArgumentException("Another Series size " + s.size() + " is not the same as this size " + len);
}
int[] data = new int[len];
for (int i = 0; i < len; i++) {
data[i] = this.getInt(i) * s.getInt(i);
}
return new IntArraySeries(data);
}
/**
* Performs division operation between this and another IntSeries.
*
* @since 0.11
*/
default IntSeries div(IntSeries s) {
int len = size();
if (len != s.size()) {
throw new IllegalArgumentException("Another Series size " + s.size() + " is not the same as this size " + len);
}
int[] data = new int[len];
for (int i = 0; i < len; i++) {
data[i] = this.getInt(i) / s.getInt(i);
}
return new IntArraySeries(data);
}
/**
* Performs modulo operation between this and another IntSeries.
*
* @since 0.11
*/
default IntSeries mod(IntSeries s) {
int len = size();
if (len != s.size()) {
throw new IllegalArgumentException("Another Series size " + s.size() + " is not the same as this size " + len);
}
int[] data = new int[len];
for (int i = 0; i < len; i++) {
data[i] = this.getInt(i) % s.getInt(i);
}
return new IntArraySeries(data);
}
/**
* @since 0.11
*/
default BooleanSeries lt(IntSeries s) {
int len = size();
if (len != s.size()) {
throw new IllegalArgumentException("Another Series size " + s.size() + " is not the same as this size " + len);
}
boolean[] data = new boolean[len];
for (int i = 0; i < len; i++) {
data[i] = this.getInt(i) < s.getInt(i);
}
return new BooleanArraySeries(data);
}
/**
* @since 0.11
*/
default BooleanSeries le(IntSeries s) {
int len = size();
if (len != s.size()) {
throw new IllegalArgumentException("Another Series size " + s.size() + " is not the same as this size " + len);
}
boolean[] data = new boolean[len];
for (int i = 0; i < len; i++) {
data[i] = this.getInt(i) <= s.getInt(i);
}
return new BooleanArraySeries(data);
}
/**
* @since 0.11
*/
default BooleanSeries gt(IntSeries s) {
int len = size();
if (len != s.size()) {
throw new IllegalArgumentException("Another Series size " + s.size() + " is not the same as this size " + len);
}
boolean[] data = new boolean[len];
for (int i = 0; i < len; i++) {
data[i] = this.getInt(i) > s.getInt(i);
}
return new BooleanArraySeries(data);
}
/**
* @since 0.11
*/
default BooleanSeries ge(IntSeries s) {
int len = size();
if (len != s.size()) {
throw new IllegalArgumentException("Another Series size " + s.size() + " is not the same as this size " + len);
}
boolean[] data = new boolean[len];
for (int i = 0; i < len; i++) {
data[i] = this.getInt(i) >= s.getInt(i);
}
return new BooleanArraySeries(data);
}
/**
* @since 1.0.0-M19
*/
default BooleanSeries between(IntSeries from, IntSeries to) {
int len = size();
if (len != from.size()) {
throw new IllegalArgumentException("'from' Series size " + from.size() + " is not the same as this size " + len);
} else if (len != to.size()) {
throw new IllegalArgumentException("'to' Series size " + to.size() + " is not the same as this size " + len);
}
boolean[] data = new boolean[len];
for (int i = 0; i < len; i++) {
int v = this.getInt(i);
data[i] = v >= from.getInt(i) && v <= to.getInt(i);
}
return new BooleanArraySeries(data);
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy