Examples with IntIntVectorStorage com.tencent.angel.ml.math2.storage.IntIntVectorStorage used on opensource projects

Example 21 with IntIntVectorStorage

use of com.tencent.angel.ml.math2.storage.IntIntVectorStorage in project angel by Tencent.

the class SimpleBinaryOutNonZAExecutor method apply.

public static Vector apply(IntIntVector v1, IntDummyVector v2, Binary op) {
    IntIntVectorStorage newStorage = (IntIntVectorStorage) StorageSwitch.apply(v1, v2, op);
    if (v1.isDense()) {
        int[] resValues = newStorage.getValues();
        int[] v2Indices = v2.getIndices();
        for (int idx : v2Indices) {
            resValues[idx] = op.apply(resValues[idx], 1);
        }
    } else if (v1.isSparse()) {
        int[] v2Indices = v2.getIndices();
        if (((v1.size() + v2.size()) * Constant.intersectionCoeff > Constant.sparseDenseStorageThreshold * v1.getDim())) {
            int[] resValues = newStorage.getValues();
            ObjectIterator<Int2IntMap.Entry> iter = v1.getStorage().entryIterator();
            while (iter.hasNext()) {
                Int2IntMap.Entry entry = iter.next();
                newStorage.set(entry.getIntKey(), entry.getIntValue());
            }
            for (int idx : v2Indices) {
                newStorage.set(idx, op.apply(v1.get(idx), 1));
            }
        } else {
            // to avoid multi-rehash
            int capacity = 1 << (32 - Integer.numberOfLeadingZeros((int) (v1.size() / 0.75)));
            if (v1.size() + v2.size() < 1.5 * capacity) {
                int size = v2.size();
                for (int i = 0; i < size; i++) {
                    int idx = v2Indices[i];
                    newStorage.set(idx, op.apply(v1.get(idx), 1));
                }
            } else {
                ObjectIterator<Int2IntMap.Entry> iter1 = v1.getStorage().entryIterator();
                while (iter1.hasNext()) {
                    Int2IntMap.Entry entry = iter1.next();
                    int idx = entry.getIntKey();
                    newStorage.set(idx, entry.getIntValue());
                }
                int size = v2.size();
                for (int i = 0; i < size; i++) {
                    int idx = v2Indices[i];
                    newStorage.set(idx, op.apply(v1.get(idx), 1));
                }
            }
        }
    } else {
        // sorted
        int[] v1Indices = v1.getStorage().getIndices();
        int[] v2Indices = v2.getIndices();
        if (!op.isKeepStorage() && ((v1.size() + v2.size()) * Constant.intersectionCoeff > Constant.sortedDenseStorageThreshold * v1.getDim())) {
            int[] v1Values = v1.getStorage().getValues();
            int size = v1.size();
            for (int i = 0; i < size; i++) {
                newStorage.set(v1Indices[i], v1Values[i]);
            }
            size = v2.size();
            for (int i = 0; i < size; i++) {
                int idx = v2Indices[i];
                newStorage.set(idx, op.apply(newStorage.get(idx), 1));
            }
        } else {
            int v1Pointor = 0;
            int v2Pointor = 0;
            int size1 = v1.size();
            int size2 = v2.size();
            int[] v1Values = v1.getStorage().getValues();
            while (v1Pointor < size1 || v2Pointor < size2) {
                if ((v1Pointor < size1 && v2Pointor < size2) && v1Indices[v1Pointor] == v2Indices[v2Pointor]) {
                    newStorage.set(v1Indices[v1Pointor], op.apply(v1Values[v1Pointor], 1));
                    v1Pointor++;
                    v2Pointor++;
                } else if ((v1Pointor < size1 && v2Pointor < size2) && v1Indices[v1Pointor] < v2Indices[v2Pointor] || (v1Pointor < size1 && v2Pointor >= size2)) {
                    newStorage.set(v1Indices[v1Pointor], v1Values[v1Pointor]);
                    v1Pointor++;
                } else if (((v1Pointor < size1 && v2Pointor < size2) && v1Indices[v1Pointor] >= v2Indices[v2Pointor]) || (v1Pointor >= size1 && v2Pointor < size2)) {
                    newStorage.set(v2Indices[v2Pointor], op.apply(0, 1));
                    v2Pointor++;
                }
            }
        }
    }
    return new IntIntVector(v1.getMatrixId(), v1.getRowId(), v1.getClock(), v1.getDim(), newStorage);
}

Example 22 with IntIntVectorStorage

use of com.tencent.angel.ml.math2.storage.IntIntVectorStorage in project angel by Tencent.

the class SimpleUnaryExecutor method apply.

private static Vector apply(IntIntVector v1, Unary op) {
    IntIntVector res;
    if (op.isOrigin() || v1.isDense()) {
        if (!op.isInplace()) {
            res = v1.copy();
        } else {
            res = v1;
        }
        if (v1.isDense()) {
            int[] values = res.getStorage().getValues();
            for (int i = 0; i < values.length; i++) {
                values[i] = op.apply(values[i]);
            }
        } else if (v1.isSparse()) {
            ObjectIterator<Int2IntMap.Entry> iter = res.getStorage().entryIterator();
            while (iter.hasNext()) {
                Int2IntMap.Entry entry = iter.next();
                entry.setValue(op.apply(entry.getIntValue()));
            }
        } else if (v1.isSorted()) {
            int[] values = res.getStorage().getValues();
            for (int i = 0; i < v1.size(); i++) {
                values[i] = op.apply(values[i]);
            }
        } else {
            throw new AngelException("The operation is not support!");
        }
    } else {
        IntIntVectorStorage newstorage = v1.getStorage().emptyDense();
        IntIntVectorStorage storage = v1.getStorage();
        int[] values = newstorage.getValues();
        int tmp = op.apply((int) 0);
        int dim = v1.getDim();
        for (int i = 0; i < dim; i++) {
            values[i] = tmp;
        }
        if (v1.isSparse()) {
            ObjectIterator<Int2IntMap.Entry> iter = storage.entryIterator();
            while (iter.hasNext()) {
                Int2IntMap.Entry entry = iter.next();
                values[entry.getIntKey()] = op.apply(entry.getIntValue());
            }
        } else {
            // sort
            int[] idxs = storage.getIndices();
            int[] v1Values = storage.getValues();
            for (int k = 0; k < idxs.length; k++) {
                values[idxs[k]] = op.apply(v1Values[k]);
            }
        }
        if (op.isInplace()) {
            v1.setStorage(newstorage);
            res = v1;
        } else {
            res = new IntIntVector(v1.getMatrixId(), v1.getRowId(), v1.getClock(), v1.getDim(), newstorage);
        }
    }
    return res;
}

Example 23 with IntIntVectorStorage

use of com.tencent.angel.ml.math2.storage.IntIntVectorStorage in project angel by Tencent.

the class RangeRouterUtils method splitIntIntVector.

public static KeyValuePart[] splitIntIntVector(MatrixMeta matrixMeta, IntIntVector vector) {
    IntIntVectorStorage storage = vector.getStorage();
    if (storage.isSparse()) {
        // Get keys and values
        IntIntSparseVectorStorage sparseStorage = (IntIntSparseVectorStorage) storage;
        int[] keys = sparseStorage.getIndices();
        int[] values = sparseStorage.getValues();
        return split(matrixMeta, vector.getRowId(), keys, values, false);
    } else if (storage.isDense()) {
        // Get values
        IntIntDenseVectorStorage denseStorage = (IntIntDenseVectorStorage) storage;
        int[] values = denseStorage.getValues();
        return split(matrixMeta, vector.getRowId(), values);
    } else {
        // Key and value array pair
        IntIntSortedVectorStorage sortStorage = (IntIntSortedVectorStorage) storage;
        int[] keys = sortStorage.getIndices();
        int[] values = sortStorage.getValues();
        return split(matrixMeta, vector.getRowId(), keys, values, true);
    }
}

Example 24 with IntIntVectorStorage

use of com.tencent.angel.ml.math2.storage.IntIntVectorStorage in project angel by Tencent.

the class HashRouterUtils method splitIntIntVector.

public static void splitIntIntVector(KeyHash hasher, MatrixMeta matrixMeta, IntIntVector vector, KeyValuePart[] dataParts) {
    int dataPartNum = dataParts.length;
    int dataPartNumMinus1 = dataPartNum - 1;
    if (isPow2(dataPartNum)) {
        IntIntVectorStorage storage = vector.getStorage();
        if (storage.isSparse()) {
            // Use iterator
            IntIntSparseVectorStorage sparseStorage = (IntIntSparseVectorStorage) storage;
            ObjectIterator<Int2IntMap.Entry> iter = sparseStorage.entryIterator();
            while (iter.hasNext()) {
                Int2IntMap.Entry keyValue = iter.next();
                int partId = computeHashCode(hasher, keyValue.getIntKey()) & dataPartNumMinus1;
                ((HashIntKeysIntValuesPart) dataParts[partId]).add(keyValue.getIntKey(), keyValue.getIntValue());
            }
        } else if (storage.isDense()) {
            // Get values
            IntIntDenseVectorStorage denseStorage = (IntIntDenseVectorStorage) storage;
            int[] values = denseStorage.getValues();
            for (int i = 0; i < values.length; i++) {
                int partId = computeHashCode(hasher, i) & dataPartNumMinus1;
                ((HashIntKeysIntValuesPart) dataParts[partId]).add(i, values[i]);
            }
        } else {
            // Key and value array pair
            IntIntSortedVectorStorage sortStorage = (IntIntSortedVectorStorage) storage;
            int[] keys = sortStorage.getIndices();
            int[] values = sortStorage.getValues();
            for (int i = 0; i < keys.length; i++) {
                int partId = computeHashCode(hasher, keys[i]) & dataPartNumMinus1;
                ((HashIntKeysIntValuesPart) dataParts[partId]).add(keys[i], values[i]);
            }
        }
    } else {
        IntIntVectorStorage storage = vector.getStorage();
        if (storage.isSparse()) {
            // Use iterator
            IntIntSparseVectorStorage sparseStorage = (IntIntSparseVectorStorage) storage;
            ObjectIterator<Int2IntMap.Entry> iter = sparseStorage.entryIterator();
            while (iter.hasNext()) {
                Int2IntMap.Entry keyValue = iter.next();
                int partId = computeHashCode(hasher, keyValue.getIntKey()) % dataPartNum;
                ((HashIntKeysIntValuesPart) dataParts[partId]).add(keyValue.getIntKey(), keyValue.getIntValue());
            }
        } else if (storage.isDense()) {
            // Get values
            IntIntDenseVectorStorage denseStorage = (IntIntDenseVectorStorage) storage;
            int[] values = denseStorage.getValues();
            for (int i = 0; i < values.length; i++) {
                int partId = computeHashCode(hasher, i) % dataPartNum;
                ((HashIntKeysIntValuesPart) dataParts[partId]).add(i, values[i]);
            }
        } else {
            // Key and value array pair
            IntIntSortedVectorStorage sortStorage = (IntIntSortedVectorStorage) storage;
            int[] keys = sortStorage.getIndices();
            int[] values = sortStorage.getValues();
            for (int i = 0; i < keys.length; i++) {
                int partId = computeHashCode(hasher, keys[i]) % dataPartNum;
                ((HashIntKeysIntValuesPart) dataParts[partId]).add(keys[i], values[i]);
            }
        }
    }
}

Example 25 with IntIntVectorStorage

use of com.tencent.angel.ml.math2.storage.IntIntVectorStorage in project angel by Tencent.

the class MixedBinaryInAllExecutor method apply.

private static Vector apply(CompIntIntVector v1, IntIntVector v2, Binary op) {
    IntIntVector[] parts = v1.getPartitions();
    Storage[] resParts = StorageSwitch.applyComp(v1, v2, op);
    if (v2.isDense()) {
        int[] v2Values = v2.getStorage().getValues();
        int base = 0, k = 0;
        for (IntIntVector part : parts) {
            IntIntVectorStorage resPart = (IntIntVectorStorage) resParts[k];
            if (part.isDense()) {
                int[] partValue = part.getStorage().getValues();
                int[] resPartValues = resPart.getValues();
                for (int i = 0; i < partValue.length; i++) {
                    int idx = i + base;
                    resPartValues[i] = op.apply(partValue[i], v2Values[idx]);
                }
            } else if (part.isSparse()) {
                int[] resPartValues = resPart.getValues();
                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<Int2IntMap.Entry> iter = part.getStorage().entryIterator();
                    while (iter.hasNext()) {
                        Int2IntMap.Entry entry = iter.next();
                        int idx = entry.getIntKey();
                        resPart.set(idx, op.apply(entry.getIntValue(), v2Values[idx + base]));
                    }
                } else {
                    for (int i = 0; i < resPartValues.length; 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
                int[] resPartIndices = resPart.getIndices();
                int[] resPartValues = resPart.getValues();
                if (op.isKeepStorage()) {
                    if (part.size() < Constant.denseLoopThreshold * part.getDim()) {
                        int[] partIndices = part.getStorage().getIndices();
                        int[] 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 {
                        IntIntVectorStorage 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 {
                    if (part.size() < Constant.denseLoopThreshold * part.getDim()) {
                        int[] partIndices = part.getStorage().getIndices();
                        int[] 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 {
                        IntIntVectorStorage 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 IntIntSortedVectorStorage) {
                    resParts[i] = new IntIntSparseVectorStorage(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)) {
                ((IntIntVectorStorage) resParts[pidx]).set(subidx, op.apply(parts[pidx].get(subidx), v2.get(i)));
            } else {
                ((IntIntVectorStorage) resParts[pidx]).set(subidx, op.apply(parts[pidx].get(subidx), 0));
            }
        }
    }
    IntIntVector[] res = new IntIntVector[parts.length];
    int i = 0;
    for (IntIntVector part : parts) {
        res[i] = new IntIntVector(part.getMatrixId(), part.getRowId(), part.getClock(), part.getDim(), (IntIntVectorStorage) resParts[i]);
        i++;
    }
    v1.setPartitions(res);
    return v1;
}