Examples with IntLongVector com.tencent.angel.ml.math2.vector.IntLongVector used on opensource projects

Example 51 with IntLongVector

use of com.tencent.angel.ml.math2.vector.IntLongVector in project angel by Tencent.

the class MixedBinaryOutNonZAExecutor method apply.

private static Vector apply(CompIntLongVector v1, IntIntVector v2, Binary op) {
    IntLongVector[] parts = v1.getPartitions();
    Storage[] resParts = StorageSwitch.applyComp(v1, v2, op);
    if (v2.isDense()) {
        int[] v2Values = v2.getStorage().getValues();
        int base = 0, k = 0;
        for (IntLongVector part : parts) {
            IntLongVectorStorage resPart = (IntLongVectorStorage) resParts[k];
            long[] newValues = resPart.getValues();
            if (part.isDense()) {
                long[] partValue = part.getStorage().getValues();
                for (int i = 0; i < partValue.length; i++) {
                    int idx = i + base;
                    newValues[i] = op.apply(partValue[i], v2Values[idx]);
                }
            } 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 < newValues.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
                if (op.isKeepStorage()) {
                    int dim = part.getDim();
                    int[] resIndices = resPart.getIndices();
                    long[] resValues = resPart.getValues();
                    int[] partIndices = part.getStorage().getIndices();
                    long[] partValues = part.getStorage().getValues();
                    for (int i = 0; i < dim; i++) {
                        resIndices[i] = i;
                        resValues[i] = op.apply(0, v2Values[i + base]);
                    }
                    int size = part.size();
                    for (int i = 0; i < size; i++) {
                        int idx = partIndices[i];
                        resValues[idx] = op.apply(partValues[i], v2Values[idx + base]);
                    }
                } else {
                    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++) {
                            newValues[i] = op.apply(0, v2Values[i + base]);
                        }
                        int size = part.size();
                        for (int i = 0; i < size; i++) {
                            int idx = partIndices[i];
                            newValues[idx] = op.apply(partValues[i], v2Values[idx + base]);
                        }
                    } else {
                        IntLongVectorStorage partStorage = part.getStorage();
                        for (int i = 0; i < newValues.length; i++) {
                            if (partStorage.hasKey(i)) {
                                newValues[i] = op.apply(partStorage.get(i), v2Values[i + base]);
                            } else {
                                newValues[i] = op.apply(0, v2Values[i + base]);
                            }
                        }
                    }
                }
            }
            base += part.getDim();
            k++;
        }
    } else {
        if (v2.isSparse()) {
            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();
            ObjectIterator<Int2IntMap.Entry> iter = v2.getStorage().entryIterator();
            while (iter.hasNext()) {
                Int2IntMap.Entry entry = iter.next();
                int gidx = entry.getIntKey();
                int pidx = (int) (gidx / subDim);
                int subidx = gidx % subDim;
                ((IntLongVectorStorage) 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 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.getStorage().getIndices();
            int[] v2Values = v2.getStorage().getValues();
            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), v2Values[i]));
            }
        }
    }
    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());
}

Example 52 with IntLongVector

use of com.tencent.angel.ml.math2.vector.IntLongVector in project angel by Tencent.

the class MixedDotExecutor method apply.

private static double apply(CompIntLongVector v1, IntLongVector v2) {
    double dotValue = 0.0;
    if (v2.isDense()) {
        int base = 0;
        long[] 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<Int2LongMap.Entry> iter = v2.getStorage().entryIterator();
        while (iter.hasNext()) {
            Int2LongMap.Entry entry = iter.next();
            int idx = entry.getIntKey();
            dotValue += v1.get(idx) * entry.getLongValue();
        }
    } else if (v2.isSorted() && v1.size() > v2.size()) {
        // v2 is sorted
        int[] v2Indices = v2.getStorage().getIndices();
        long[] 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;
}

Example 53 with IntLongVector

use of com.tencent.angel.ml.math2.vector.IntLongVector in project angel by Tencent.

the class MixedDotExecutor method apply.

private static double apply(CompIntFloatVector v1, IntLongVector v2) {
    double dotValue = 0.0;
    if (v2.isDense()) {
        int base = 0;
        long[] v2Values = v2.getStorage().getValues();
        for (IntFloatVector part : v1.getPartitions()) {
            if (part.isDense()) {
                float[] 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<Int2FloatMap.Entry> iter = part.getStorage().entryIterator();
                while (iter.hasNext()) {
                    Int2FloatMap.Entry entry = iter.next();
                    int idx = base + entry.getIntKey();
                    dotValue += entry.getFloatValue() * v2Values[idx];
                }
            } else {
                // isSorted
                int[] partIndices = part.getStorage().getIndices();
                float[] 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<Int2LongMap.Entry> iter = v2.getStorage().entryIterator();
        while (iter.hasNext()) {
            Int2LongMap.Entry entry = iter.next();
            int idx = entry.getIntKey();
            dotValue += v1.get(idx) * entry.getLongValue();
        }
    } else if (v2.isSorted() && v1.size() > v2.size()) {
        // v2 is sorted
        int[] v2Indices = v2.getStorage().getIndices();
        long[] 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 (IntFloatVector part : v1.getPartitions()) {
            if (part.isDense()) {
                float[] 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<Int2FloatMap.Entry> iter = part.getStorage().entryIterator();
                while (iter.hasNext()) {
                    Int2FloatMap.Entry entry = iter.next();
                    int idx = base + entry.getIntKey();
                    dotValue += entry.getFloatValue() * v2.get(idx);
                }
            } else {
                // isSorted
                int[] partIndices = part.getStorage().getIndices();
                float[] 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;
}

Example 54 with IntLongVector

use of com.tencent.angel.ml.math2.vector.IntLongVector in project angel by Tencent.

the class MixedBinaryInNonZAExecutor 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++;
    }
    v1.setPartitions(res);
    return v1;
}

Example 55 with IntLongVector

use of com.tencent.angel.ml.math2.vector.IntLongVector in project angel by Tencent.

the class MixedBinaryInNonZAExecutor method apply.

private static Vector apply(CompIntLongVector v1, IntIntVector v2, Binary op) {
    IntLongVector[] parts = v1.getPartitions();
    Storage[] resParts = StorageSwitch.applyComp(v1, v2, op);
    if (v2.isDense()) {
        int[] v2Values = v2.getStorage().getValues();
        int base = 0, k = 0;
        for (IntLongVector part : parts) {
            IntLongVectorStorage resPart = (IntLongVectorStorage) resParts[k];
            long[] newValues = resPart.getValues();
            if (part.isDense()) {
                long[] partValue = part.getStorage().getValues();
                for (int i = 0; i < partValue.length; i++) {
                    int idx = i + base;
                    newValues[i] = op.apply(partValue[i], v2Values[idx]);
                }
            } 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 < newValues.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
                if (op.isKeepStorage()) {
                    int dim = part.getDim();
                    int[] resIndices = resPart.getIndices();
                    long[] resValues = resPart.getValues();
                    int[] partIndices = part.getStorage().getIndices();
                    long[] partValues = part.getStorage().getValues();
                    for (int i = 0; i < dim; i++) {
                        resIndices[i] = i;
                        resValues[i] = op.apply(0, v2Values[i]);
                    }
                    int size = v1.size();
                    for (int i = 0; i < size; i++) {
                        int idx = partIndices[i];
                        resValues[idx] = op.apply(partValues[i], v2Values[idx + base]);
                    }
                } else {
                    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++) {
                            newValues[i] = op.apply(0, v2Values[i + base]);
                        }
                        int size = part.size();
                        for (int i = 0; i < size; i++) {
                            int idx = partIndices[i];
                            newValues[idx] = op.apply(partValues[i], v2Values[idx + base]);
                        }
                    } else {
                        IntLongVectorStorage partStorage = part.getStorage();
                        for (int i = 0; i < newValues.length; i++) {
                            if (partStorage.hasKey(i)) {
                                newValues[i] = op.apply(partStorage.get(i), v2Values[i + base]);
                            } else {
                                newValues[i] = op.apply(0, v2Values[i + base]);
                            }
                        }
                    }
                }
            }
            base += part.getDim();
            k++;
        }
    } else if (v2.isSparse()) {
        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();
        ObjectIterator<Int2IntMap.Entry> iter = v2.getStorage().entryIterator();
        while (iter.hasNext()) {
            Int2IntMap.Entry entry = iter.next();
            int gidx = entry.getIntKey();
            int pidx = (int) (gidx / subDim);
            int subidx = gidx % subDim;
            ((IntLongVectorStorage) 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 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.getStorage().getIndices();
        int[] v2Values = v2.getStorage().getValues();
        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), v2Values[i]));
        }
    }
    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++;
    }
    v1.setPartitions(res);
    return v1;
}