zhao.algorithmMagic.operands.vector.FastRangeIntegerVector Maven / Gradle / Ivy
package zhao.algorithmMagic.operands.vector;
import zhao.algorithmMagic.exception.OperatorOperationException;
import zhao.algorithmMagic.utils.ASMath;
import java.util.concurrent.atomic.AtomicReference;
import java.util.function.Consumer;
/**
* 快速区间型整形向量对象，其中并没有存储很多的向量数值，但是却有着强大计算功能，能够实现轻量级的向量计算操作。
*
* The fast interval shaped vector object does not store many vector values, but it has powerful computing functions and can implement lightweight vector computing operations.
*
* @author zhao
*/
public class FastRangeIntegerVector extends RangeVector {
protected final double moduleLength;
protected FastRangeIntegerVector(int[] ints) {
super(ints, 1 + ints[1] - ints[0]);
AtomicReference tempModuleLength = new AtomicReference<>((double) 0);
forEach(integer -> tempModuleLength.updateAndGet(v -> v + integer * integer));
this.moduleLength = Math.sqrt(tempModuleLength.get());
}
public static FastRangeIntegerVector parse(int start, int end) {
if (start < end) {
return new FastRangeIntegerVector(new int[]{start, end});
} else {
throw new OperatorOperationException("您传入的区间不正确哦！！区间左边界的值应小于区间右边界的值!!!\nThe interval you entered is incorrect!! The value of the left boundary of the interval should be less than the value of the right boundary of the interval!!!\n" +
"left = " + start + '\t' + "right = " + end);
}
}
/**
* 将两个操作数进行求和的方法，具体用法请参阅API说明。
*
* The method for summing two operands, please refer to the API description for specific usage.
*
* @param value 被求和的参数 Parameters to be summed
* @return 求和之后的数值 the value after the sum
*
* There is no description for the super interface, please refer to the subclass documentation
*/
@Override
public FastRangeIntegerVector add(FastRangeIntegerVector value) {
return FastRangeIntegerVector.parse(this.getRangeStart() + value.getRangeStart(), this.getRangeEnd() + value.getRangeEnd());
}
/**
* 在两个操作数之间做差的方法，具体用法请参阅API说明。
*
* The method of making a difference between two operands, please refer to the API description for specific usage.
*
* @param value 被做差的参数（被减数） The parameter to be subtracted (minuend)
* @return 差异数值 difference value
* There is no description for the super interface, please refer to the subclass documentation
*/
@Override
public FastRangeIntegerVector diff(FastRangeIntegerVector value) {
return FastRangeIntegerVector.parse(this.getRangeStart() - value.getRangeStart(), this.getRangeEnd() - value.getRangeEnd());
}
/**
* 将两个操作数进行求和的方法，具体用法请参阅API说明。
*
* The method for summing two operands, please refer to the API description for specific usage.
*
* @param value 被求和的参数 Parameters to be summed
* @return 求和之后的数值 the value after the sum
*
* There is no description for the super interface, please refer to the subclass documentation
*/
@Override
public FastRangeIntegerVector add(Number value) {
int v = value.intValue();
return FastRangeIntegerVector.parse(this.getRangeStart() + v, this.getRangeEnd() + v);
}
/**
* 在两个操作数之间做差的方法，具体用法请参阅API说明。
*
* The method of making a difference between two operands, please refer to the API description for specific usage.
*
* @param value 被做差的参数（被减数） The parameter to be subtracted (minuend)
* @return 差异数值 difference value
* There is no description for the super interface, please refer to the subclass documentation
*/
@Override
public FastRangeIntegerVector diff(Number value) {
int v = value.intValue();
return FastRangeIntegerVector.parse(this.getRangeStart() - v, this.getRangeEnd() - v);
}
/**
* @return 该类的实现类对象，用于拓展该接口的子类
*/
@Override
public FastRangeIntegerVector expand() {
return this;
}
/**
* 区间内元素迭代器
*
* Element iterator in interval
*
* @param action 迭代时的数据处理逻辑，其中的值就是区间中的每一个元素。
*
* Data processing logic during iteration, where the value is each element in the interval
*/
@Override
public void forEach(Consumer action) {
int rangeStart = this.getRangeStart() - 1;
final int rangeEnd = this.getRangeEnd();
while (rangeEnd > rangeStart) {
action.accept(++rangeStart);
}
}
/**
* @return 获取到区间型向量中的区间起始数值，同时这个也是向量中的第一个坐标。
*
* Get the interval starting value in the interval type vector, and this is also the first coordinate in the vector.
*/
@Override
public Integer getRangeStart() {
return super.arrayType[0];
}
/**
* @return 获取到区间型向量中的区间终止数值，同时这个也是向量中的最后一个坐标。
*
* Get the interval termination value in the interval vector, which is also the last coordinate in the vector.
*/
@Override
public Integer getRangeEnd() {
return super.arrayType[1];
}
/**
* @return 获取到区间性向量中的所有元素的求和结果数值，是区间中所有元素的和。
*
* Get the sum result value of all elements in the interval vector, which is the sum of all elements in the interval.
*/
@Override
public Integer getRangeSum() {
return ASMath.sumOfRange(this.getRangeStart(), this.getRangeEnd());
}
/**
* 将本区间的向量转换成具体向量。
*
* Convert the vectors in this interval into concrete vectors.
*
* @return 本向量转换成功之后会返回一个向量对象。
*
* A vector object will be returned after the vector conversion is successful.
*/
@Override
public IntegerVector toVector() {
return IntegerVector.parse(copyToNewArray());
}
/**
* @return 将本对象中存储的向量序列数组拷贝到一个新数组并将新数组返回，这里返回的是一个新数组，支持修改等操作。
*
* Copy the vector sequence array stored in this object to a new array and return the new array. Here, a new array is returned, which supports modification and other operations.
*/
@Override
public int[] copyToNewArray() {
int[] res = new int[size()];
int rangeStart = this.getRangeStart() - 1;
final int rangeEnd = this.getRangeEnd();
int count = -1;
while (rangeEnd > rangeStart) {
res[++count] = ++rangeStart;
}
return res;
}
/**
* 将本对象中的所有数据进行洗牌打乱，随机分布数据行的排列。
*
* Shuffle all the data in this object and randomly distribute the arrangement of data rows.
*
* @param seed 打乱算法中所需要的随机种子。
*
* Disrupt random seeds required in the algorithm.
* @return 打乱之后的对象。
*
* Objects after disruption.
*/
@Override
public IntegerVector shuffle(long seed) {
return IntegerVector.parse(ASMath.shuffle(this.copyToNewArray(), seed, false));
}
/**
* 计算该向量的模长，具体实现请参阅api说明
*
* Calculate the modulo length of the vector, please refer to the api node for the specific implementation
*
* @return 向量的模长
* waiting to be realized
*/
@Override
public double moduleLength() {
return this.moduleLength;
}
}