use of com.tencent.angel.ml.math2.vector.CompIntLongVector in project angel by Tencent.
the class MixedBinaryOutNonZAExecutor method apply.
private static Vector apply(CompIntLongVector v1, IntDummyVector v2, Binary op) {
IntLongVector[] parts = v1.getPartitions();
Storage[] resParts = StorageSwitch.applyComp(v1, v2, op);
if (!op.isKeepStorage()) {
for (int i = 0; i < parts.length; i++) {
if (parts[i].getStorage() instanceof IntLongSortedVectorStorage) {
resParts[i] = new IntLongSparseVectorStorage(parts[i].getDim(), parts[i].getStorage().getIndices(), parts[i].getStorage().getValues());
}
}
}
int subDim = (v1.getDim() + v1.getNumPartitions() - 1) / v1.getNumPartitions();
int[] v2Indices = v2.getIndices();
for (int i = 0; i < v2Indices.length; i++) {
int gidx = v2Indices[i];
int pidx = (int) (gidx / subDim);
int subidx = gidx % subDim;
((IntLongVectorStorage) resParts[pidx]).set(subidx, op.apply(parts[pidx].get(subidx), 1));
}
IntLongVector[] res = new IntLongVector[parts.length];
int i = 0;
for (IntLongVector part : parts) {
res[i] = new IntLongVector(part.getMatrixId(), part.getRowId(), part.getClock(), part.getDim(), (IntLongVectorStorage) resParts[i]);
i++;
}
return new CompIntLongVector(v1.getMatrixId(), v1.getRowId(), v1.getClock(), v1.getDim(), res, v1.getSubDim());
}
use of com.tencent.angel.ml.math2.vector.CompIntLongVector in project angel by Tencent.
the class VectorUtils method emptyLike.
private static ComponentVector emptyLike(ComponentVector v) {
ComponentVector result;
if (v instanceof CompIntDoubleVector) {
IntDoubleVector[] parts = new IntDoubleVector[v.getNumPartitions()];
IntDoubleVector[] refParts = ((CompIntDoubleVector) v).getPartitions();
for (int i = 0; i < refParts.length; i++) {
if (null != refParts[i]) {
parts[i] = (IntDoubleVector) emptyLike((SimpleVector) refParts[i]);
}
}
result = new CompIntDoubleVector(((CompIntDoubleVector) v).getMatrixId(), ((CompIntDoubleVector) v).getRowId(), ((CompIntDoubleVector) v).getClock(), ((CompIntDoubleVector) v).getDim(), parts, ((CompIntDoubleVector) v).getSubDim());
} else if (v instanceof CompIntFloatVector) {
IntFloatVector[] parts = new IntFloatVector[v.getNumPartitions()];
IntFloatVector[] refParts = ((CompIntFloatVector) v).getPartitions();
for (int i = 0; i < refParts.length; i++) {
if (null != refParts[i]) {
parts[i] = (IntFloatVector) emptyLike((SimpleVector) refParts[i]);
}
}
result = new CompIntFloatVector(((CompIntFloatVector) v).getMatrixId(), ((CompIntFloatVector) v).getRowId(), ((CompIntFloatVector) v).getClock(), ((CompIntFloatVector) v).getDim(), parts, ((CompIntFloatVector) v).getSubDim());
} else if (v instanceof CompIntLongVector) {
IntLongVector[] parts = new IntLongVector[v.getNumPartitions()];
IntLongVector[] refParts = ((CompIntLongVector) v).getPartitions();
for (int i = 0; i < refParts.length; i++) {
if (null != refParts[i]) {
parts[i] = (IntLongVector) emptyLike((SimpleVector) refParts[i]);
}
}
result = new CompIntLongVector(((CompIntLongVector) v).getMatrixId(), ((CompIntLongVector) v).getRowId(), ((CompIntLongVector) v).getClock(), ((CompIntLongVector) v).getDim(), parts, ((CompIntLongVector) v).getSubDim());
} else if (v instanceof CompIntIntVector) {
IntIntVector[] parts = new IntIntVector[v.getNumPartitions()];
IntIntVector[] refParts = ((CompIntIntVector) v).getPartitions();
for (int i = 0; i < refParts.length; i++) {
if (null != refParts[i]) {
parts[i] = (IntIntVector) emptyLike((SimpleVector) refParts[i]);
}
}
result = new CompIntIntVector(((CompIntIntVector) v).getMatrixId(), ((CompIntIntVector) v).getRowId(), ((CompIntIntVector) v).getClock(), ((CompIntIntVector) v).getDim(), parts, ((CompIntIntVector) v).getSubDim());
} else if (v instanceof CompLongDoubleVector) {
LongDoubleVector[] parts = new LongDoubleVector[v.getNumPartitions()];
LongDoubleVector[] refParts = ((CompLongDoubleVector) v).getPartitions();
for (int i = 0; i < refParts.length; i++) {
if (null != refParts[i]) {
parts[i] = (LongDoubleVector) emptyLike((SimpleVector) refParts[i]);
}
}
result = new CompLongDoubleVector(((CompLongDoubleVector) v).getMatrixId(), ((CompLongDoubleVector) v).getRowId(), ((CompLongDoubleVector) v).getClock(), ((CompLongDoubleVector) v).getDim(), parts, ((CompLongDoubleVector) v).getSubDim());
} else if (v instanceof CompLongFloatVector) {
LongFloatVector[] parts = new LongFloatVector[v.getNumPartitions()];
LongFloatVector[] refParts = ((CompLongFloatVector) v).getPartitions();
for (int i = 0; i < refParts.length; i++) {
if (null != refParts[i]) {
parts[i] = (LongFloatVector) emptyLike((SimpleVector) refParts[i]);
}
}
result = new CompLongFloatVector(((CompLongFloatVector) v).getMatrixId(), ((CompLongFloatVector) v).getRowId(), ((CompLongFloatVector) v).getClock(), ((CompLongFloatVector) v).getDim(), parts, ((CompLongFloatVector) v).getSubDim());
} else if (v instanceof CompLongLongVector) {
LongLongVector[] parts = new LongLongVector[v.getNumPartitions()];
LongLongVector[] refParts = ((CompLongLongVector) v).getPartitions();
for (int i = 0; i < refParts.length; i++) {
if (null != refParts[i]) {
parts[i] = (LongLongVector) emptyLike((SimpleVector) refParts[i]);
}
}
result = new CompLongLongVector(((CompLongLongVector) v).getMatrixId(), ((CompLongLongVector) v).getRowId(), ((CompLongLongVector) v).getClock(), ((CompLongLongVector) v).getDim(), parts, ((CompLongLongVector) v).getSubDim());
} else if (v instanceof CompLongIntVector) {
LongIntVector[] parts = new LongIntVector[v.getNumPartitions()];
LongIntVector[] refParts = ((CompLongIntVector) v).getPartitions();
for (int i = 0; i < refParts.length; i++) {
if (null != refParts[i]) {
parts[i] = (LongIntVector) emptyLike((SimpleVector) refParts[i]);
}
}
result = new CompLongIntVector(((CompLongIntVector) v).getMatrixId(), ((CompLongIntVector) v).getRowId(), ((CompLongIntVector) v).getClock(), ((CompLongIntVector) v).getDim(), parts, ((CompLongIntVector) v).getSubDim());
} else {
throw new AngelException("The operation is not support!");
}
return result;
}
use of com.tencent.angel.ml.math2.vector.CompIntLongVector in project angel by Tencent.
the class RBCompIntLongMatrix method initEmpty.
@Override
public void initEmpty(int idx) {
int numComp = (int) ((getDim() + subDim - 1) / subDim);
if (null == rows[idx]) {
IntLongVector[] tmpParts = new IntLongVector[numComp];
for (int i = 0; i < numComp; i++) {
IntLongSparseVectorStorage storage = new IntLongSparseVectorStorage(subDim);
tmpParts[i] = new IntLongVector(matrixId, idx, clock, (int) getDim(), storage);
}
CompIntLongVector tmpVect = new CompIntLongVector(matrixId, idx, clock, (int) getDim(), tmpParts, subDim);
rows[idx] = tmpVect;
}
}
use of com.tencent.angel.ml.math2.vector.CompIntLongVector in project angel by Tencent.
the class MixedBinaryOutAllExecutor method apply.
private static Vector apply(CompIntLongVector v1, IntLongVector v2, Binary op) {
IntLongVector[] parts = v1.getPartitions();
Storage[] resParts = StorageSwitch.applyComp(v1, v2, op);
if (v2.isDense()) {
long[] v2Values = v2.getStorage().getValues();
int base = 0, k = 0;
for (IntLongVector part : parts) {
IntLongVectorStorage resPart = (IntLongVectorStorage) resParts[k];
if (part.isDense()) {
long[] partValue = part.getStorage().getValues();
long[] resPartValues = resPart.getValues();
for (int i = 0; i < partValue.length; i++) {
int idx = i;
resPartValues[i] = op.apply(partValue[i], v2Values[idx + base]);
}
} else if (part.isSparse()) {
if (part.size() < Constant.denseLoopThreshold * part.getDim()) {
for (int i = 0; i < part.getDim(); i++) {
resPart.set(i, op.apply(0, v2Values[i + base]));
}
ObjectIterator<Int2LongMap.Entry> iter = part.getStorage().entryIterator();
while (iter.hasNext()) {
Int2LongMap.Entry entry = iter.next();
int idx = entry.getIntKey();
resPart.set(idx, op.apply(entry.getLongValue(), v2Values[idx + base]));
}
} else {
for (int i = 0; i < resPart.size(); i++) {
if (part.getStorage().hasKey(i)) {
resPart.set(i, op.apply(part.get(i), v2Values[i + base]));
} else {
resPart.set(i, op.apply(0, v2Values[i + base]));
}
}
}
} else {
// sorted
if (op.isKeepStorage()) {
int[] resPartIndices = resPart.getIndices();
long[] resPartValues = resPart.getValues();
if (part.size() < Constant.denseLoopThreshold * part.getDim()) {
int[] partIndices = part.getStorage().getIndices();
long[] partValues = part.getStorage().getValues();
for (int i = 0; i < part.getDim(); i++) {
resPartIndices[i] = i;
resPartValues[i] = op.apply(0, v2Values[i + base]);
}
int size = part.size();
for (int i = 0; i < size; i++) {
int idx = partIndices[i];
resPartValues[idx] = op.apply(partValues[i], v2Values[idx + base]);
}
} else {
IntLongVectorStorage partStorage = part.getStorage();
for (int i = 0; i < resPartValues.length; i++) {
if (partStorage.hasKey(i)) {
resPartIndices[i] = i;
resPartValues[i] = op.apply(partStorage.get(i), v2Values[i + base]);
} else {
resPartIndices[i] = i;
resPartValues[i] = op.apply(0, v2Values[i + base]);
}
}
}
} else {
long[] resPartValues = resPart.getValues();
if (part.size() < Constant.denseLoopThreshold * part.getDim()) {
int[] partIndices = part.getStorage().getIndices();
long[] partValues = part.getStorage().getValues();
for (int i = 0; i < part.getDim(); i++) {
resPartValues[i] = op.apply(0, v2Values[i + base]);
}
int size = part.size();
for (int i = 0; i < size; i++) {
int idx = partIndices[i];
resPartValues[idx] = op.apply(partValues[i], v2Values[idx + base]);
}
} else {
IntLongVectorStorage partStorage = part.getStorage();
for (int i = 0; i < resPartValues.length; i++) {
if (partStorage.hasKey(i)) {
resPartValues[i] = op.apply(partStorage.get(i), v2Values[i + base]);
} else {
resPartValues[i] = op.apply(0, v2Values[i + base]);
}
}
}
}
}
base += part.getDim();
k++;
}
} else {
if (!op.isKeepStorage()) {
for (int i = 0; i < parts.length; i++) {
if (parts[i].getStorage() instanceof IntLongSortedVectorStorage) {
resParts[i] = new IntLongSparseVectorStorage(parts[i].getDim(), parts[i].getStorage().getIndices(), parts[i].getStorage().getValues());
}
}
}
int subDim = (v1.getDim() + v1.getNumPartitions() - 1) / v1.getNumPartitions();
for (int i = 0; i < v1.getDim(); i++) {
int pidx = (int) (i / subDim);
int subidx = i % subDim;
if (v2.getStorage().hasKey(i)) {
((IntLongVectorStorage) resParts[pidx]).set(subidx, op.apply(parts[pidx].get(subidx), v2.get(i)));
} else {
((IntLongVectorStorage) resParts[pidx]).set(subidx, op.apply(parts[pidx].get(subidx), 0));
}
}
}
IntLongVector[] res = new IntLongVector[parts.length];
int i = 0;
for (IntLongVector part : parts) {
res[i] = new IntLongVector(part.getMatrixId(), part.getRowId(), part.getClock(), part.getDim(), (IntLongVectorStorage) resParts[i]);
i++;
}
return new CompIntLongVector(v1.getMatrixId(), v1.getRowId(), v1.getClock(), v1.getDim(), res, v1.getSubDim());
}
use of com.tencent.angel.ml.math2.vector.CompIntLongVector in project angel by Tencent.
the class MixedDotExecutor method apply.
private static double apply(CompIntLongVector v1, IntIntVector v2) {
double dotValue = 0.0;
if (v2.isDense()) {
int base = 0;
int[] v2Values = v2.getStorage().getValues();
for (IntLongVector part : v1.getPartitions()) {
if (part.isDense()) {
long[] partValues = part.getStorage().getValues();
for (int i = 0; i < partValues.length; i++) {
int idx = base + i;
dotValue += partValues[i] * v2Values[idx];
}
} else if (part.isSparse()) {
ObjectIterator<Int2LongMap.Entry> iter = part.getStorage().entryIterator();
while (iter.hasNext()) {
Int2LongMap.Entry entry = iter.next();
int idx = base + entry.getIntKey();
dotValue += entry.getLongValue() * v2Values[idx];
}
} else {
// isSorted
int[] partIndices = part.getStorage().getIndices();
long[] partValues = part.getStorage().getValues();
for (int i = 0; i < partIndices.length; i++) {
int idx = base + partIndices[i];
dotValue += partValues[i] * v2Values[idx];
}
}
base += part.getDim();
}
} else if (v2.isSparse()) {
ObjectIterator<Int2IntMap.Entry> iter = v2.getStorage().entryIterator();
while (iter.hasNext()) {
Int2IntMap.Entry entry = iter.next();
int idx = entry.getIntKey();
dotValue += v1.get(idx) * entry.getIntValue();
}
} else if (v2.isSorted() && v1.size() > v2.size()) {
// v2 is sorted
int[] v2Indices = v2.getStorage().getIndices();
int[] v2Values = v2.getStorage().getValues();
for (int i = 0; i < v2Indices.length; i++) {
int idx = v2Indices[i];
dotValue += v1.get(idx) * v2Values[i];
}
} else {
int base = 0;
for (IntLongVector part : v1.getPartitions()) {
if (part.isDense()) {
long[] partValues = part.getStorage().getValues();
for (int i = 0; i < partValues.length; i++) {
int idx = base + i;
dotValue += partValues[i] * v2.get(idx);
}
} else if (part.isSparse()) {
ObjectIterator<Int2LongMap.Entry> iter = part.getStorage().entryIterator();
while (iter.hasNext()) {
Int2LongMap.Entry entry = iter.next();
int idx = base + entry.getIntKey();
dotValue += entry.getLongValue() * v2.get(idx);
}
} else {
// isSorted
int[] partIndices = part.getStorage().getIndices();
long[] partValues = part.getStorage().getValues();
for (int i = 0; i < partIndices.length; i++) {
int idx = base + partIndices[i];
dotValue += partValues[i] * v2.get(idx);
}
}
base += part.getDim();
}
}
return dotValue;
}
Aggregations