use of com.tencent.angel.ml.math2.storage.LongIntSparseVectorStorage in project angel by Tencent.
the class RBCompLongIntMatrix method initEmpty.
@Override
public void initEmpty(int idx) {
int numComp = (int) ((getDim() + subDim - 1) / subDim);
if (null == rows[idx]) {
LongIntVector[] tmpParts = new LongIntVector[numComp];
for (int i = 0; i < numComp; i++) {
LongIntSparseVectorStorage storage = new LongIntSparseVectorStorage(subDim);
tmpParts[i] = new LongIntVector(matrixId, idx, clock, (long) getDim(), storage);
}
CompLongIntVector tmpVect = new CompLongIntVector(matrixId, idx, clock, (long) getDim(), tmpParts, subDim);
rows[idx] = tmpVect;
}
}
use of com.tencent.angel.ml.math2.storage.LongIntSparseVectorStorage in project angel by Tencent.
the class MixedBinaryOutNonZAExecutor method apply.
private static Vector apply(CompLongIntVector v1, LongIntVector v2, Binary op) {
LongIntVector[] parts = v1.getPartitions();
Storage[] resParts = StorageSwitch.applyComp(v1, v2, op);
if (v2.isSparse()) {
if (!op.isKeepStorage()) {
for (int i = 0; i < parts.length; i++) {
if (parts[i].getStorage() instanceof LongIntSortedVectorStorage) {
resParts[i] = new LongIntSparseVectorStorage(parts[i].getDim(), parts[i].getStorage().getIndices(), parts[i].getStorage().getValues());
}
}
}
long subDim = (v1.getDim() + v1.getNumPartitions() - 1) / v1.getNumPartitions();
ObjectIterator<Long2IntMap.Entry> iter = v2.getStorage().entryIterator();
while (iter.hasNext()) {
Long2IntMap.Entry entry = iter.next();
long gidx = entry.getLongKey();
int pidx = (int) (gidx / subDim);
long subidx = gidx % subDim;
((LongIntVectorStorage) resParts[pidx]).set(subidx, op.apply(parts[pidx].get(subidx), entry.getIntValue()));
}
} else {
// sorted
if (!op.isKeepStorage()) {
for (int i = 0; i < parts.length; i++) {
if (parts[i].getStorage() instanceof LongIntSortedVectorStorage) {
resParts[i] = new LongIntSparseVectorStorage(parts[i].getDim(), parts[i].getStorage().getIndices(), parts[i].getStorage().getValues());
}
}
}
long subDim = (v1.getDim() + v1.getNumPartitions() - 1) / v1.getNumPartitions();
long[] v2Indices = v2.getStorage().getIndices();
int[] v2Values = v2.getStorage().getValues();
for (int i = 0; i < v2Indices.length; i++) {
long gidx = v2Indices[i];
int pidx = (int) (gidx / subDim);
long subidx = gidx % subDim;
((LongIntVectorStorage) resParts[pidx]).set(subidx, op.apply(parts[pidx].get(subidx), v2Values[i]));
}
}
LongIntVector[] res = new LongIntVector[parts.length];
int i = 0;
for (LongIntVector part : parts) {
res[i] = new LongIntVector(part.getMatrixId(), part.getRowId(), part.getClock(), part.getDim(), (LongIntVectorStorage) resParts[i]);
i++;
}
return new CompLongIntVector(v1.getMatrixId(), v1.getRowId(), v1.getClock(), v1.getDim(), res, v1.getSubDim());
}
use of com.tencent.angel.ml.math2.storage.LongIntSparseVectorStorage in project angel by Tencent.
the class MixedBinaryInNonZAExecutor method apply.
private static Vector apply(CompLongIntVector v1, LongDummyVector v2, Binary op) {
LongIntVector[] 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 LongIntSortedVectorStorage) {
resParts[i] = new LongIntSparseVectorStorage(parts[i].getDim(), parts[i].getStorage().getIndices(), parts[i].getStorage().getValues());
}
}
}
long subDim = (v1.getDim() + v1.getNumPartitions() - 1) / v1.getNumPartitions();
long[] v2Indices = v2.getIndices();
for (int i = 0; i < v2Indices.length; i++) {
long gidx = v2Indices[i];
int pidx = (int) (gidx / subDim);
long subidx = gidx % subDim;
((LongIntVectorStorage) resParts[pidx]).set(subidx, op.apply(parts[pidx].get(subidx), 1));
}
LongIntVector[] res = new LongIntVector[parts.length];
int i = 0;
for (LongIntVector part : parts) {
res[i] = new LongIntVector(part.getMatrixId(), part.getRowId(), part.getClock(), part.getDim(), (LongIntVectorStorage) resParts[i]);
i++;
}
v1.setPartitions(res);
return v1;
}
use of com.tencent.angel.ml.math2.storage.LongIntSparseVectorStorage in project angel by Tencent.
the class SimpleBinaryInAllExecutor method apply.
public static Vector apply(LongIntVector v1, LongIntVector v2, Binary op) {
if (v1.isSparse() && v2.isSparse()) {
if (op.isKeepStorage()) {
throw new AngelException("operation is not support!");
} else {
// multi-rehash
LongIntVectorStorage newStorage = v1.getStorage().emptySparse((int) (v1.getDim()));
LongIntVectorStorage v1Storage = v1.getStorage();
LongIntVectorStorage v2Storage = v2.getStorage();
for (int i = 0; i < v1.getDim(); i++) {
if (v1Storage.hasKey(i) && v2Storage.hasKey(i)) {
newStorage.set(i, op.apply(v1.get(i), v2.get(i)));
} else if (v1Storage.hasKey(i) && !v2Storage.hasKey(i)) {
newStorage.set(i, op.apply(v1.get(i), 0));
} else if (!v1Storage.hasKey(i) && v2Storage.hasKey(i)) {
newStorage.set(i, op.apply(0, v2.get(i)));
} else {
newStorage.set(i, op.apply(0, 0));
}
}
v1.setStorage(newStorage);
}
} else if (v1.isSparse() && v2.isSorted()) {
if (op.isKeepStorage()) {
throw new AngelException("operation is not support!");
} else {
LongIntVectorStorage newStorage = v1.getStorage().emptySparse((int) (v1.getDim()));
LongIntVectorStorage v1Storage = v1.getStorage();
LongIntVectorStorage v2Storage = v2.getStorage();
for (int i = 0; i < v1.getDim(); i++) {
if (v1Storage.hasKey(i) && v2Storage.hasKey(i)) {
newStorage.set(i, op.apply(v1.get(i), v2.get(i)));
} else if (v1Storage.hasKey(i) && !v2Storage.hasKey(i)) {
newStorage.set(i, op.apply(v1.get(i), 0));
} else if (!v1Storage.hasKey(i) && v2Storage.hasKey(i)) {
newStorage.set(i, op.apply(0, v2.get(i)));
} else {
newStorage.set(i, op.apply(0, 0));
}
}
v1.setStorage(newStorage);
}
} else if (v1.isSorted() && v2.isSparse()) {
if (op.isKeepStorage()) {
throw new AngelException("operation is not support!");
} else {
LongIntVectorStorage newStorage = new LongIntSparseVectorStorage(v1.getDim());
LongIntVectorStorage v1Storage = v1.getStorage();
LongIntVectorStorage v2Storage = v2.getStorage();
for (int i = 0; i < v1.getDim(); i++) {
if (v1Storage.hasKey(i) && v2Storage.hasKey(i)) {
newStorage.set(i, op.apply(v1.get(i), v2.get(i)));
} else if (v1Storage.hasKey(i) && !v2Storage.hasKey(i)) {
newStorage.set(i, op.apply(v1.get(i), 0));
} else if (!v1Storage.hasKey(i) && v2Storage.hasKey(i)) {
newStorage.set(i, op.apply(0, v2.get(i)));
} else {
newStorage.set(i, op.apply(0, 0));
}
}
v1.setStorage(newStorage);
}
} else if (v1.isSorted() && v2.isSorted()) {
if (op.isKeepStorage()) {
throw new AngelException("operation is not support!");
} else {
LongIntVectorStorage newStorage = v1.getStorage().emptySorted((int) (v1.getDim()));
long[] resIndices = newStorage.getIndices();
int[] resValues = newStorage.getValues();
int v1Pointor = 0;
int v2Pointor = 0;
long size1 = v1.size();
long size2 = v2.size();
long[] v1Indices = v1.getStorage().getIndices();
int[] v1Values = v1.getStorage().getValues();
long[] v2Indices = v2.getStorage().getIndices();
int[] v2Values = v2.getStorage().getValues();
if (!op.isCompare()) {
if (size1 != v1.getDim() && size2 != v2.getDim()) {
for (int i = 0; i < v1.getDim(); i++) {
resValues[i] = 0 / 0;
}
}
}
int globalPointor = 0;
while (v1Pointor < size1 && v2Pointor < size2) {
if (v1Indices[v1Pointor] == v2Indices[v2Pointor]) {
resIndices[globalPointor] = v1Indices[v1Pointor];
resValues[globalPointor] = op.apply(v1Values[v1Pointor], v2Values[v2Pointor]);
v1Pointor++;
v2Pointor++;
globalPointor++;
} else if (v1Indices[v1Pointor] < v2Indices[v2Pointor]) {
resIndices[globalPointor] = v1Indices[v1Pointor];
resValues[globalPointor] = op.apply(v2Values[v2Pointor], 0);
v1Pointor++;
globalPointor++;
} else {
// v1Indices[v1Pointor] > v2Indices[v2Pointor]
resIndices[globalPointor] = v2Indices[v2Pointor];
resValues[globalPointor] = op.apply(0, v2Values[v2Pointor]);
v2Pointor++;
globalPointor++;
}
}
v1.setStorage(newStorage);
}
} else {
throw new AngelException("The operation is not support!");
}
return v1;
}
use of com.tencent.angel.ml.math2.storage.LongIntSparseVectorStorage in project angel by Tencent.
the class MixedBinaryOutAllExecutor method apply.
private static Vector apply(CompLongIntVector v1, LongIntVector v2, Binary op) {
LongIntVector[] 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 LongIntSortedVectorStorage) {
resParts[i] = new LongIntSparseVectorStorage(parts[i].getDim(), parts[i].getStorage().getIndices(), parts[i].getStorage().getValues());
}
}
}
long subDim = (v1.getDim() + v1.getNumPartitions() - 1) / v1.getNumPartitions();
for (int i = 0; i < v1.getDim(); i++) {
int pidx = (int) (i / subDim);
long subidx = i % subDim;
if (v2.getStorage().hasKey(i)) {
((LongIntVectorStorage) resParts[pidx]).set(subidx, op.apply(parts[pidx].get(subidx), v2.get(i)));
} else {
((LongIntVectorStorage) resParts[pidx]).set(subidx, op.apply(parts[pidx].get(subidx), 0));
}
}
LongIntVector[] res = new LongIntVector[parts.length];
int i = 0;
for (LongIntVector part : parts) {
res[i] = new LongIntVector(part.getMatrixId(), part.getRowId(), part.getClock(), part.getDim(), (LongIntVectorStorage) resParts[i]);
i++;
}
return new CompLongIntVector(v1.getMatrixId(), v1.getRowId(), v1.getClock(), v1.getDim(), res, v1.getSubDim());
}
Aggregations