Search in sources :

Example 51 with ObjectIterator

use of it.unimi.dsi.fastutil.objects.ObjectIterator in project angel by Tencent.

the class SimpleBinaryInAllExecutor method apply.

public static Vector apply(IntLongVector v1, IntLongVector v2, Binary op) {
    if (v1.isDense() && v2.isDense()) {
        long[] resValues = v1.getStorage().getValues();
        long[] v2Values = v2.getStorage().getValues();
        for (int idx = 0; idx < resValues.length; idx++) {
            resValues[idx] = op.apply(resValues[idx], v2Values[idx]);
        }
    } else if (v1.isDense() && v2.isSparse()) {
        long[] resValues = v1.getStorage().getValues();
        if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
            for (int i = 0; i < resValues.length; i++) {
                resValues[i] = op.apply(resValues[i], 0);
            }
            ObjectIterator<Int2LongMap.Entry> iter = v2.getStorage().entryIterator();
            while (iter.hasNext()) {
                Int2LongMap.Entry entry = iter.next();
                int idx = entry.getIntKey();
                resValues[idx] = op.apply(v1.get(idx), entry.getLongValue());
            }
        } else {
            IntLongVectorStorage v2Storage = v2.getStorage();
            for (int i = 0; i < resValues.length; i++) {
                if (v2Storage.hasKey(i)) {
                    resValues[i] = op.apply(resValues[i], v2.get(i));
                } else {
                    resValues[i] = op.apply(resValues[i], 0);
                }
            }
        }
    } else if (v1.isDense() && v2.isSorted()) {
        long[] resValues = v1.getStorage().getValues();
        if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
            int[] v2Indices = v2.getStorage().getIndices();
            long[] v2Values = v2.getStorage().getValues();
            for (int i = 0; i < resValues.length; i++) {
                resValues[i] = op.apply(resValues[i], 0);
            }
            int size = v2.size();
            for (int i = 0; i < size; i++) {
                int idx = v2Indices[i];
                resValues[idx] = op.apply(v1.get(idx), v2Values[i]);
            }
        } else {
            IntLongVectorStorage v2Storage = v2.getStorage();
            for (int i = 0; i < resValues.length; i++) {
                if (v2Storage.hasKey(i)) {
                    resValues[i] = op.apply(resValues[i], v2.get(i));
                } else {
                    resValues[i] = op.apply(resValues[i], 0);
                }
            }
        }
    } else if (v1.isSparse() && v2.isDense()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntLongVectorStorage newStorage = v1.getStorage().emptyDense();
            long[] resValues = newStorage.getValues();
            long[] v2Values = v2.getStorage().getValues();
            if (v1.size() < Constant.denseLoopThreshold * v1.getDim()) {
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(0, v2Values[i]);
                }
                ObjectIterator<Int2LongMap.Entry> iter = v1.getStorage().entryIterator();
                while (iter.hasNext()) {
                    Int2LongMap.Entry entry = iter.next();
                    int idx = entry.getIntKey();
                    resValues[idx] = op.apply(entry.getLongValue(), v2Values[idx]);
                }
            } else {
                for (int i = 0; i < resValues.length; i++) {
                    if (v1.getStorage().hasKey(i)) {
                        resValues[i] = op.apply(v1.get(i), v2Values[i]);
                    } else {
                        resValues[i] = op.apply(0, v2Values[i]);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSorted() && v2.isDense()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntLongVectorStorage newStorage = v1.getStorage().emptyDense();
            long[] resValues = newStorage.getValues();
            long[] v2Values = v2.getStorage().getValues();
            if (v1.size() < Constant.denseLoopThreshold * v1.getDim()) {
                int[] v1Indices = v1.getStorage().getIndices();
                long[] v1Values = v1.getStorage().getValues();
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(0, v2Values[i]);
                }
                int size = v1.size();
                for (int i = 0; i < size; i++) {
                    int idx = v1Indices[i];
                    resValues[idx] = op.apply(v1Values[i], v2Values[idx]);
                }
            } else {
                IntLongVectorStorage v1Storage = v1.getStorage();
                for (int i = 0; i < resValues.length; i++) {
                    if (v1Storage.hasKey(i)) {
                        resValues[i] = op.apply(v1.get(i), v2Values[i]);
                    } else {
                        resValues[i] = op.apply(0, v2Values[i]);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSparse() && v2.isSparse()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntLongVectorStorage newStorage = v1.getStorage().emptyDense();
            long[] resValues = newStorage.getValues();
            ObjectIterator<Int2LongMap.Entry> iter1 = v1.getStorage().entryIterator();
            while (iter1.hasNext()) {
                Int2LongMap.Entry entry = iter1.next();
                int idx = entry.getIntKey();
                resValues[idx] = entry.getLongValue();
            }
            if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(resValues[i], 0);
                }
                ObjectIterator<Int2LongMap.Entry> iter = v2.getStorage().entryIterator();
                while (iter.hasNext()) {
                    Int2LongMap.Entry entry = iter.next();
                    int idx = entry.getIntKey();
                    if (v1.getStorage().hasKey(idx)) {
                        resValues[idx] = op.apply(v1.get(idx), entry.getLongValue());
                    }
                }
            } else {
                IntLongVectorStorage v2Storage = v2.getStorage();
                for (int i = 0; i < resValues.length; i++) {
                    if (v2Storage.hasKey(i)) {
                        resValues[i] = op.apply(resValues[i], v2.get(i));
                    } else {
                        resValues[i] = op.apply(resValues[i], 0);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSparse() && v2.isSorted()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntLongVectorStorage newStorage = v1.getStorage().emptyDense();
            long[] resValues = newStorage.getValues();
            ObjectIterator<Int2LongMap.Entry> iter1 = v1.getStorage().entryIterator();
            while (iter1.hasNext()) {
                Int2LongMap.Entry entry = iter1.next();
                int idx = entry.getIntKey();
                resValues[idx] = entry.getLongValue();
            }
            if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
                int[] v2Indices = v2.getStorage().getIndices();
                long[] v2Values = v2.getStorage().getValues();
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(resValues[i], 0);
                }
                int size = v2.size();
                for (int i = 0; i < size; i++) {
                    int idx = v2Indices[i];
                    if (v1.getStorage().hasKey(idx)) {
                        resValues[idx] = op.apply(v1.get(idx), v2Values[i]);
                    }
                }
            } else {
                IntLongVectorStorage v2Storage = v2.getStorage();
                for (int i = 0; i < resValues.length; i++) {
                    if (v2Storage.hasKey(i)) {
                        resValues[i] = op.apply(resValues[i], v2.get(i));
                    } else {
                        resValues[i] = op.apply(resValues[i], 0);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSorted() && v2.isSparse()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntLongVectorStorage newStorage = v1.getStorage().emptyDense();
            long[] resValues = newStorage.getValues();
            int[] v1Indices = v1.getStorage().getIndices();
            long[] v1Values = v1.getStorage().getValues();
            int size = v1.size();
            for (int i = 0; i < size; i++) {
                int idx = v1Indices[i];
                resValues[idx] = v1Values[i];
            }
            if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(resValues[i], 0);
                }
                ObjectIterator<Int2LongMap.Entry> iter = v2.getStorage().entryIterator();
                while (iter.hasNext()) {
                    Int2LongMap.Entry entry = iter.next();
                    int idx = entry.getIntKey();
                    if (v1.getStorage().hasKey(idx)) {
                        resValues[idx] = op.apply(v1.get(idx), entry.getLongValue());
                    }
                }
            } else {
                IntLongVectorStorage v2Storage = v2.getStorage();
                for (int i = 0; i < resValues.length; i++) {
                    if (v2Storage.hasKey(i)) {
                        resValues[i] = op.apply(resValues[i], v2.get(i));
                    } else {
                        resValues[i] = op.apply(resValues[i], 0);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSorted() && v2.isSorted()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntLongVectorStorage newStorage = v1.getStorage().emptyDense();
            long[] resValues = newStorage.getValues();
            int v1Pointor = 0;
            int v2Pointor = 0;
            int size1 = v1.size();
            int size2 = v2.size();
            int[] v1Indices = v1.getStorage().getIndices();
            long[] v1Values = v1.getStorage().getValues();
            int[] v2Indices = v2.getStorage().getIndices();
            long[] 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;
                    }
                }
            }
            while (v1Pointor < size1 && v2Pointor < size2) {
                if (v1Indices[v1Pointor] == v2Indices[v2Pointor]) {
                    resValues[v1Indices[v1Pointor]] = op.apply(v1Values[v1Pointor], v2Values[v2Pointor]);
                    v1Pointor++;
                    v2Pointor++;
                } else if (v1Indices[v1Pointor] < v2Indices[v2Pointor]) {
                    resValues[v1Indices[v1Pointor]] = op.apply(v1Values[v1Pointor], 0);
                    v1Pointor++;
                } else {
                    // v1Indices[v1Pointor] > v2Indices[v2Pointor]
                    resValues[v2Indices[v2Pointor]] = op.apply(0, v2Values[v2Pointor]);
                    v2Pointor++;
                }
            }
            v1.setStorage(newStorage);
        }
    } else {
        throw new AngelException("The operation is not support!");
    }
    return v1;
}
Also used : AngelException(com.tencent.angel.exception.AngelException) IntLongVectorStorage(com.tencent.angel.ml.math2.storage.IntLongVectorStorage) Int2LongMap(it.unimi.dsi.fastutil.ints.Int2LongMap) ObjectIterator(it.unimi.dsi.fastutil.objects.ObjectIterator)

Example 52 with ObjectIterator

use of it.unimi.dsi.fastutil.objects.ObjectIterator in project angel by Tencent.

the class SimpleBinaryInAllExecutor method apply.

public static Vector apply(IntFloatVector v1, IntIntVector v2, Binary op) {
    if (v1.isDense() && v2.isDense()) {
        float[] resValues = v1.getStorage().getValues();
        int[] v2Values = v2.getStorage().getValues();
        for (int idx = 0; idx < resValues.length; idx++) {
            resValues[idx] = op.apply(resValues[idx], v2Values[idx]);
        }
    } else if (v1.isDense() && v2.isSparse()) {
        float[] resValues = v1.getStorage().getValues();
        if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
            for (int i = 0; i < resValues.length; i++) {
                resValues[i] = op.apply(resValues[i], 0);
            }
            ObjectIterator<Int2IntMap.Entry> iter = v2.getStorage().entryIterator();
            while (iter.hasNext()) {
                Int2IntMap.Entry entry = iter.next();
                int idx = entry.getIntKey();
                resValues[idx] = op.apply(v1.get(idx), entry.getIntValue());
            }
        } else {
            IntIntVectorStorage v2Storage = v2.getStorage();
            for (int i = 0; i < resValues.length; i++) {
                if (v2Storage.hasKey(i)) {
                    resValues[i] = op.apply(resValues[i], v2.get(i));
                } else {
                    resValues[i] = op.apply(resValues[i], 0);
                }
            }
        }
    } else if (v1.isDense() && v2.isSorted()) {
        float[] resValues = v1.getStorage().getValues();
        if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
            int[] v2Indices = v2.getStorage().getIndices();
            int[] v2Values = v2.getStorage().getValues();
            for (int i = 0; i < resValues.length; i++) {
                resValues[i] = op.apply(resValues[i], 0);
            }
            int size = v2.size();
            for (int i = 0; i < size; i++) {
                int idx = v2Indices[i];
                resValues[idx] = op.apply(v1.get(idx), v2Values[i]);
            }
        } else {
            IntIntVectorStorage v2Storage = v2.getStorage();
            for (int i = 0; i < resValues.length; i++) {
                if (v2Storage.hasKey(i)) {
                    resValues[i] = op.apply(resValues[i], v2.get(i));
                } else {
                    resValues[i] = op.apply(resValues[i], 0);
                }
            }
        }
    } else if (v1.isSparse() && v2.isDense()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntFloatVectorStorage newStorage = v1.getStorage().emptyDense();
            float[] resValues = newStorage.getValues();
            int[] v2Values = v2.getStorage().getValues();
            if (v1.size() < Constant.denseLoopThreshold * v1.getDim()) {
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(0, v2Values[i]);
                }
                ObjectIterator<Int2FloatMap.Entry> iter = v1.getStorage().entryIterator();
                while (iter.hasNext()) {
                    Int2FloatMap.Entry entry = iter.next();
                    int idx = entry.getIntKey();
                    resValues[idx] = op.apply(entry.getFloatValue(), v2Values[idx]);
                }
            } else {
                for (int i = 0; i < resValues.length; i++) {
                    if (v1.getStorage().hasKey(i)) {
                        resValues[i] = op.apply(v1.get(i), v2Values[i]);
                    } else {
                        resValues[i] = op.apply(0, v2Values[i]);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSorted() && v2.isDense()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntFloatVectorStorage newStorage = v1.getStorage().emptyDense();
            float[] resValues = newStorage.getValues();
            int[] v2Values = v2.getStorage().getValues();
            if (v1.size() < Constant.denseLoopThreshold * v1.getDim()) {
                int[] v1Indices = v1.getStorage().getIndices();
                float[] v1Values = v1.getStorage().getValues();
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(0, v2Values[i]);
                }
                int size = v1.size();
                for (int i = 0; i < size; i++) {
                    int idx = v1Indices[i];
                    resValues[idx] = op.apply(v1Values[i], v2Values[idx]);
                }
            } else {
                IntFloatVectorStorage v1Storage = v1.getStorage();
                for (int i = 0; i < resValues.length; i++) {
                    if (v1Storage.hasKey(i)) {
                        resValues[i] = op.apply(v1.get(i), v2Values[i]);
                    } else {
                        resValues[i] = op.apply(0, v2Values[i]);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSparse() && v2.isSparse()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntFloatVectorStorage newStorage = v1.getStorage().emptyDense();
            float[] resValues = newStorage.getValues();
            ObjectIterator<Int2FloatMap.Entry> iter1 = v1.getStorage().entryIterator();
            while (iter1.hasNext()) {
                Int2FloatMap.Entry entry = iter1.next();
                int idx = entry.getIntKey();
                resValues[idx] = entry.getFloatValue();
            }
            if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(resValues[i], 0);
                }
                ObjectIterator<Int2IntMap.Entry> iter = v2.getStorage().entryIterator();
                while (iter.hasNext()) {
                    Int2IntMap.Entry entry = iter.next();
                    int idx = entry.getIntKey();
                    if (v1.getStorage().hasKey(idx)) {
                        resValues[idx] = op.apply(v1.get(idx), entry.getIntValue());
                    }
                }
            } else {
                IntIntVectorStorage v2Storage = v2.getStorage();
                for (int i = 0; i < resValues.length; i++) {
                    if (v2Storage.hasKey(i)) {
                        resValues[i] = op.apply(resValues[i], v2.get(i));
                    } else {
                        resValues[i] = op.apply(resValues[i], 0);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSparse() && v2.isSorted()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntFloatVectorStorage newStorage = v1.getStorage().emptyDense();
            float[] resValues = newStorage.getValues();
            ObjectIterator<Int2FloatMap.Entry> iter1 = v1.getStorage().entryIterator();
            while (iter1.hasNext()) {
                Int2FloatMap.Entry entry = iter1.next();
                int idx = entry.getIntKey();
                resValues[idx] = entry.getFloatValue();
            }
            if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
                int[] v2Indices = v2.getStorage().getIndices();
                int[] v2Values = v2.getStorage().getValues();
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(resValues[i], 0);
                }
                int size = v2.size();
                for (int i = 0; i < size; i++) {
                    int idx = v2Indices[i];
                    if (v1.getStorage().hasKey(idx)) {
                        resValues[idx] = op.apply(v1.get(idx), v2Values[i]);
                    }
                }
            } else {
                IntIntVectorStorage v2Storage = v2.getStorage();
                for (int i = 0; i < resValues.length; i++) {
                    if (v2Storage.hasKey(i)) {
                        resValues[i] = op.apply(resValues[i], v2.get(i));
                    } else {
                        resValues[i] = op.apply(resValues[i], 0);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSorted() && v2.isSparse()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntFloatVectorStorage newStorage = v1.getStorage().emptyDense();
            float[] resValues = newStorage.getValues();
            int[] v1Indices = v1.getStorage().getIndices();
            float[] v1Values = v1.getStorage().getValues();
            int size = v1.size();
            for (int i = 0; i < size; i++) {
                int idx = v1Indices[i];
                resValues[idx] = v1Values[i];
            }
            if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(resValues[i], 0);
                }
                ObjectIterator<Int2IntMap.Entry> iter = v2.getStorage().entryIterator();
                while (iter.hasNext()) {
                    Int2IntMap.Entry entry = iter.next();
                    int idx = entry.getIntKey();
                    if (v1.getStorage().hasKey(idx)) {
                        resValues[idx] = op.apply(v1.get(idx), entry.getIntValue());
                    }
                }
            } else {
                IntIntVectorStorage v2Storage = v2.getStorage();
                for (int i = 0; i < resValues.length; i++) {
                    if (v2Storage.hasKey(i)) {
                        resValues[i] = op.apply(resValues[i], v2.get(i));
                    } else {
                        resValues[i] = op.apply(resValues[i], 0);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSorted() && v2.isSorted()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntFloatVectorStorage newStorage = v1.getStorage().emptyDense();
            float[] resValues = newStorage.getValues();
            int v1Pointor = 0;
            int v2Pointor = 0;
            int size1 = v1.size();
            int size2 = v2.size();
            int[] v1Indices = v1.getStorage().getIndices();
            float[] v1Values = v1.getStorage().getValues();
            int[] v2Indices = v2.getStorage().getIndices();
            int[] v2Values = v2.getStorage().getValues();
            if (!op.isCompare()) {
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = Float.NaN;
                }
            }
            while (v1Pointor < size1 && v2Pointor < size2) {
                if (v1Indices[v1Pointor] == v2Indices[v2Pointor]) {
                    resValues[v1Indices[v1Pointor]] = op.apply(v1Values[v1Pointor], v2Values[v2Pointor]);
                    v1Pointor++;
                    v2Pointor++;
                } else if (v1Indices[v1Pointor] < v2Indices[v2Pointor]) {
                    resValues[v1Indices[v1Pointor]] = op.apply(v1Values[v1Pointor], 0);
                    v1Pointor++;
                } else {
                    // v1Indices[v1Pointor] > v2Indices[v2Pointor]
                    resValues[v2Indices[v2Pointor]] = op.apply(0, v2Values[v2Pointor]);
                    v2Pointor++;
                }
            }
            v1.setStorage(newStorage);
        }
    } else {
        throw new AngelException("The operation is not support!");
    }
    return v1;
}
Also used : AngelException(com.tencent.angel.exception.AngelException) IntIntVectorStorage(com.tencent.angel.ml.math2.storage.IntIntVectorStorage) IntFloatVectorStorage(com.tencent.angel.ml.math2.storage.IntFloatVectorStorage) Int2FloatMap(it.unimi.dsi.fastutil.ints.Int2FloatMap) Int2IntMap(it.unimi.dsi.fastutil.ints.Int2IntMap) ObjectIterator(it.unimi.dsi.fastutil.objects.ObjectIterator)

Example 53 with ObjectIterator

use of it.unimi.dsi.fastutil.objects.ObjectIterator in project angel by Tencent.

the class SimpleBinaryInAllExecutor method apply.

public static Vector apply(IntLongVector v1, IntIntVector v2, Binary op) {
    if (v1.isDense() && v2.isDense()) {
        long[] resValues = v1.getStorage().getValues();
        int[] v2Values = v2.getStorage().getValues();
        for (int idx = 0; idx < resValues.length; idx++) {
            resValues[idx] = op.apply(resValues[idx], v2Values[idx]);
        }
    } else if (v1.isDense() && v2.isSparse()) {
        long[] resValues = v1.getStorage().getValues();
        if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
            for (int i = 0; i < resValues.length; i++) {
                resValues[i] = op.apply(resValues[i], 0);
            }
            ObjectIterator<Int2IntMap.Entry> iter = v2.getStorage().entryIterator();
            while (iter.hasNext()) {
                Int2IntMap.Entry entry = iter.next();
                int idx = entry.getIntKey();
                resValues[idx] = op.apply(v1.get(idx), entry.getIntValue());
            }
        } else {
            IntIntVectorStorage v2Storage = v2.getStorage();
            for (int i = 0; i < resValues.length; i++) {
                if (v2Storage.hasKey(i)) {
                    resValues[i] = op.apply(resValues[i], v2.get(i));
                } else {
                    resValues[i] = op.apply(resValues[i], 0);
                }
            }
        }
    } else if (v1.isDense() && v2.isSorted()) {
        long[] resValues = v1.getStorage().getValues();
        if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
            int[] v2Indices = v2.getStorage().getIndices();
            int[] v2Values = v2.getStorage().getValues();
            for (int i = 0; i < resValues.length; i++) {
                resValues[i] = op.apply(resValues[i], 0);
            }
            int size = v2.size();
            for (int i = 0; i < size; i++) {
                int idx = v2Indices[i];
                resValues[idx] = op.apply(v1.get(idx), v2Values[i]);
            }
        } else {
            IntIntVectorStorage v2Storage = v2.getStorage();
            for (int i = 0; i < resValues.length; i++) {
                if (v2Storage.hasKey(i)) {
                    resValues[i] = op.apply(resValues[i], v2.get(i));
                } else {
                    resValues[i] = op.apply(resValues[i], 0);
                }
            }
        }
    } else if (v1.isSparse() && v2.isDense()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntLongVectorStorage newStorage = v1.getStorage().emptyDense();
            long[] resValues = newStorage.getValues();
            int[] v2Values = v2.getStorage().getValues();
            if (v1.size() < Constant.denseLoopThreshold * v1.getDim()) {
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(0, v2Values[i]);
                }
                ObjectIterator<Int2LongMap.Entry> iter = v1.getStorage().entryIterator();
                while (iter.hasNext()) {
                    Int2LongMap.Entry entry = iter.next();
                    int idx = entry.getIntKey();
                    resValues[idx] = op.apply(entry.getLongValue(), v2Values[idx]);
                }
            } else {
                for (int i = 0; i < resValues.length; i++) {
                    if (v1.getStorage().hasKey(i)) {
                        resValues[i] = op.apply(v1.get(i), v2Values[i]);
                    } else {
                        resValues[i] = op.apply(0, v2Values[i]);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSorted() && v2.isDense()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntLongVectorStorage newStorage = v1.getStorage().emptyDense();
            long[] resValues = newStorage.getValues();
            int[] v2Values = v2.getStorage().getValues();
            if (v1.size() < Constant.denseLoopThreshold * v1.getDim()) {
                int[] v1Indices = v1.getStorage().getIndices();
                long[] v1Values = v1.getStorage().getValues();
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(0, v2Values[i]);
                }
                int size = v1.size();
                for (int i = 0; i < size; i++) {
                    int idx = v1Indices[i];
                    resValues[idx] = op.apply(v1Values[i], v2Values[idx]);
                }
            } else {
                IntLongVectorStorage v1Storage = v1.getStorage();
                for (int i = 0; i < resValues.length; i++) {
                    if (v1Storage.hasKey(i)) {
                        resValues[i] = op.apply(v1.get(i), v2Values[i]);
                    } else {
                        resValues[i] = op.apply(0, v2Values[i]);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSparse() && v2.isSparse()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntLongVectorStorage newStorage = v1.getStorage().emptyDense();
            long[] resValues = newStorage.getValues();
            ObjectIterator<Int2LongMap.Entry> iter1 = v1.getStorage().entryIterator();
            while (iter1.hasNext()) {
                Int2LongMap.Entry entry = iter1.next();
                int idx = entry.getIntKey();
                resValues[idx] = entry.getLongValue();
            }
            if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(resValues[i], 0);
                }
                ObjectIterator<Int2IntMap.Entry> iter = v2.getStorage().entryIterator();
                while (iter.hasNext()) {
                    Int2IntMap.Entry entry = iter.next();
                    int idx = entry.getIntKey();
                    if (v1.getStorage().hasKey(idx)) {
                        resValues[idx] = op.apply(v1.get(idx), entry.getIntValue());
                    }
                }
            } else {
                IntIntVectorStorage v2Storage = v2.getStorage();
                for (int i = 0; i < resValues.length; i++) {
                    if (v2Storage.hasKey(i)) {
                        resValues[i] = op.apply(resValues[i], v2.get(i));
                    } else {
                        resValues[i] = op.apply(resValues[i], 0);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSparse() && v2.isSorted()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntLongVectorStorage newStorage = v1.getStorage().emptyDense();
            long[] resValues = newStorage.getValues();
            ObjectIterator<Int2LongMap.Entry> iter1 = v1.getStorage().entryIterator();
            while (iter1.hasNext()) {
                Int2LongMap.Entry entry = iter1.next();
                int idx = entry.getIntKey();
                resValues[idx] = entry.getLongValue();
            }
            if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
                int[] v2Indices = v2.getStorage().getIndices();
                int[] v2Values = v2.getStorage().getValues();
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(resValues[i], 0);
                }
                int size = v2.size();
                for (int i = 0; i < size; i++) {
                    int idx = v2Indices[i];
                    if (v1.getStorage().hasKey(idx)) {
                        resValues[idx] = op.apply(v1.get(idx), v2Values[i]);
                    }
                }
            } else {
                IntIntVectorStorage v2Storage = v2.getStorage();
                for (int i = 0; i < resValues.length; i++) {
                    if (v2Storage.hasKey(i)) {
                        resValues[i] = op.apply(resValues[i], v2.get(i));
                    } else {
                        resValues[i] = op.apply(resValues[i], 0);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSorted() && v2.isSparse()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntLongVectorStorage newStorage = v1.getStorage().emptyDense();
            long[] resValues = newStorage.getValues();
            int[] v1Indices = v1.getStorage().getIndices();
            long[] v1Values = v1.getStorage().getValues();
            int size = v1.size();
            for (int i = 0; i < size; i++) {
                int idx = v1Indices[i];
                resValues[idx] = v1Values[i];
            }
            if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(resValues[i], 0);
                }
                ObjectIterator<Int2IntMap.Entry> iter = v2.getStorage().entryIterator();
                while (iter.hasNext()) {
                    Int2IntMap.Entry entry = iter.next();
                    int idx = entry.getIntKey();
                    if (v1.getStorage().hasKey(idx)) {
                        resValues[idx] = op.apply(v1.get(idx), entry.getIntValue());
                    }
                }
            } else {
                IntIntVectorStorage v2Storage = v2.getStorage();
                for (int i = 0; i < resValues.length; i++) {
                    if (v2Storage.hasKey(i)) {
                        resValues[i] = op.apply(resValues[i], v2.get(i));
                    } else {
                        resValues[i] = op.apply(resValues[i], 0);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSorted() && v2.isSorted()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntLongVectorStorage newStorage = v1.getStorage().emptyDense();
            long[] resValues = newStorage.getValues();
            int v1Pointor = 0;
            int v2Pointor = 0;
            int size1 = v1.size();
            int size2 = v2.size();
            int[] v1Indices = v1.getStorage().getIndices();
            long[] v1Values = v1.getStorage().getValues();
            int[] 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;
                    }
                }
            }
            while (v1Pointor < size1 && v2Pointor < size2) {
                if (v1Indices[v1Pointor] == v2Indices[v2Pointor]) {
                    resValues[v1Indices[v1Pointor]] = op.apply(v1Values[v1Pointor], v2Values[v2Pointor]);
                    v1Pointor++;
                    v2Pointor++;
                } else if (v1Indices[v1Pointor] < v2Indices[v2Pointor]) {
                    resValues[v1Indices[v1Pointor]] = op.apply(v1Values[v1Pointor], 0);
                    v1Pointor++;
                } else {
                    // v1Indices[v1Pointor] > v2Indices[v2Pointor]
                    resValues[v2Indices[v2Pointor]] = op.apply(0, v2Values[v2Pointor]);
                    v2Pointor++;
                }
            }
            v1.setStorage(newStorage);
        }
    } else {
        throw new AngelException("The operation is not support!");
    }
    return v1;
}
Also used : AngelException(com.tencent.angel.exception.AngelException) IntIntVectorStorage(com.tencent.angel.ml.math2.storage.IntIntVectorStorage) IntLongVectorStorage(com.tencent.angel.ml.math2.storage.IntLongVectorStorage) Int2LongMap(it.unimi.dsi.fastutil.ints.Int2LongMap) Int2IntMap(it.unimi.dsi.fastutil.ints.Int2IntMap) ObjectIterator(it.unimi.dsi.fastutil.objects.ObjectIterator)

Example 54 with ObjectIterator

use of it.unimi.dsi.fastutil.objects.ObjectIterator in project angel by Tencent.

the class SimpleBinaryInAllExecutor method apply.

public static Vector apply(IntDoubleVector v1, IntFloatVector v2, Binary op) {
    if (v1.isDense() && v2.isDense()) {
        double[] resValues = v1.getStorage().getValues();
        float[] v2Values = v2.getStorage().getValues();
        for (int idx = 0; idx < resValues.length; idx++) {
            resValues[idx] = op.apply(resValues[idx], v2Values[idx]);
        }
    } else if (v1.isDense() && v2.isSparse()) {
        double[] resValues = v1.getStorage().getValues();
        if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
            for (int i = 0; i < resValues.length; i++) {
                resValues[i] = op.apply(resValues[i], 0);
            }
            ObjectIterator<Int2FloatMap.Entry> iter = v2.getStorage().entryIterator();
            while (iter.hasNext()) {
                Int2FloatMap.Entry entry = iter.next();
                int idx = entry.getIntKey();
                resValues[idx] = op.apply(v1.get(idx), entry.getFloatValue());
            }
        } else {
            IntFloatVectorStorage v2Storage = v2.getStorage();
            for (int i = 0; i < resValues.length; i++) {
                if (v2Storage.hasKey(i)) {
                    resValues[i] = op.apply(resValues[i], v2.get(i));
                } else {
                    resValues[i] = op.apply(resValues[i], 0);
                }
            }
        }
    } else if (v1.isDense() && v2.isSorted()) {
        double[] resValues = v1.getStorage().getValues();
        if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
            int[] v2Indices = v2.getStorage().getIndices();
            float[] v2Values = v2.getStorage().getValues();
            for (int i = 0; i < resValues.length; i++) {
                resValues[i] = op.apply(resValues[i], 0);
            }
            int size = v2.size();
            for (int i = 0; i < size; i++) {
                int idx = v2Indices[i];
                resValues[idx] = op.apply(v1.get(idx), v2Values[i]);
            }
        } else {
            IntFloatVectorStorage v2Storage = v2.getStorage();
            for (int i = 0; i < resValues.length; i++) {
                if (v2Storage.hasKey(i)) {
                    resValues[i] = op.apply(resValues[i], v2.get(i));
                } else {
                    resValues[i] = op.apply(resValues[i], 0);
                }
            }
        }
    } else if (v1.isSparse() && v2.isDense()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntDoubleVectorStorage newStorage = v1.getStorage().emptyDense();
            double[] resValues = newStorage.getValues();
            float[] v2Values = v2.getStorage().getValues();
            if (v1.size() < Constant.denseLoopThreshold * v1.getDim()) {
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(0, v2Values[i]);
                }
                ObjectIterator<Int2DoubleMap.Entry> iter = v1.getStorage().entryIterator();
                while (iter.hasNext()) {
                    Int2DoubleMap.Entry entry = iter.next();
                    int idx = entry.getIntKey();
                    resValues[idx] = op.apply(entry.getDoubleValue(), v2Values[idx]);
                }
            } else {
                for (int i = 0; i < resValues.length; i++) {
                    if (v1.getStorage().hasKey(i)) {
                        resValues[i] = op.apply(v1.get(i), v2Values[i]);
                    } else {
                        resValues[i] = op.apply(0, v2Values[i]);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSorted() && v2.isDense()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntDoubleVectorStorage newStorage = v1.getStorage().emptyDense();
            double[] resValues = newStorage.getValues();
            float[] v2Values = v2.getStorage().getValues();
            if (v1.size() < Constant.denseLoopThreshold * v1.getDim()) {
                int[] v1Indices = v1.getStorage().getIndices();
                double[] v1Values = v1.getStorage().getValues();
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(0, v2Values[i]);
                }
                int size = v1.size();
                for (int i = 0; i < size; i++) {
                    int idx = v1Indices[i];
                    resValues[idx] = op.apply(v1Values[i], v2Values[idx]);
                }
            } else {
                IntDoubleVectorStorage v1Storage = v1.getStorage();
                for (int i = 0; i < resValues.length; i++) {
                    if (v1Storage.hasKey(i)) {
                        resValues[i] = op.apply(v1.get(i), v2Values[i]);
                    } else {
                        resValues[i] = op.apply(0, v2Values[i]);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSparse() && v2.isSparse()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntDoubleVectorStorage newStorage = v1.getStorage().emptyDense();
            double[] resValues = newStorage.getValues();
            ObjectIterator<Int2DoubleMap.Entry> iter1 = v1.getStorage().entryIterator();
            while (iter1.hasNext()) {
                Int2DoubleMap.Entry entry = iter1.next();
                int idx = entry.getIntKey();
                resValues[idx] = entry.getDoubleValue();
            }
            if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(resValues[i], 0);
                }
                ObjectIterator<Int2FloatMap.Entry> iter = v2.getStorage().entryIterator();
                while (iter.hasNext()) {
                    Int2FloatMap.Entry entry = iter.next();
                    int idx = entry.getIntKey();
                    if (v1.getStorage().hasKey(idx)) {
                        resValues[idx] = op.apply(v1.get(idx), entry.getFloatValue());
                    }
                }
            } else {
                IntFloatVectorStorage v2Storage = v2.getStorage();
                for (int i = 0; i < resValues.length; i++) {
                    if (v2Storage.hasKey(i)) {
                        resValues[i] = op.apply(resValues[i], v2.get(i));
                    } else {
                        resValues[i] = op.apply(resValues[i], 0);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSparse() && v2.isSorted()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntDoubleVectorStorage newStorage = v1.getStorage().emptyDense();
            double[] resValues = newStorage.getValues();
            ObjectIterator<Int2DoubleMap.Entry> iter1 = v1.getStorage().entryIterator();
            while (iter1.hasNext()) {
                Int2DoubleMap.Entry entry = iter1.next();
                int idx = entry.getIntKey();
                resValues[idx] = entry.getDoubleValue();
            }
            if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
                int[] v2Indices = v2.getStorage().getIndices();
                float[] v2Values = v2.getStorage().getValues();
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(resValues[i], 0);
                }
                int size = v2.size();
                for (int i = 0; i < size; i++) {
                    int idx = v2Indices[i];
                    if (v1.getStorage().hasKey(idx)) {
                        resValues[idx] = op.apply(v1.get(idx), v2Values[i]);
                    }
                }
            } else {
                IntFloatVectorStorage v2Storage = v2.getStorage();
                for (int i = 0; i < resValues.length; i++) {
                    if (v2Storage.hasKey(i)) {
                        resValues[i] = op.apply(resValues[i], v2.get(i));
                    } else {
                        resValues[i] = op.apply(resValues[i], 0);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSorted() && v2.isSparse()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntDoubleVectorStorage newStorage = v1.getStorage().emptyDense();
            double[] resValues = newStorage.getValues();
            int[] v1Indices = v1.getStorage().getIndices();
            double[] v1Values = v1.getStorage().getValues();
            int size = v1.size();
            for (int i = 0; i < size; i++) {
                int idx = v1Indices[i];
                resValues[idx] = v1Values[i];
            }
            if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(resValues[i], 0);
                }
                ObjectIterator<Int2FloatMap.Entry> iter = v2.getStorage().entryIterator();
                while (iter.hasNext()) {
                    Int2FloatMap.Entry entry = iter.next();
                    int idx = entry.getIntKey();
                    if (v1.getStorage().hasKey(idx)) {
                        resValues[idx] = op.apply(v1.get(idx), entry.getFloatValue());
                    }
                }
            } else {
                IntFloatVectorStorage v2Storage = v2.getStorage();
                for (int i = 0; i < resValues.length; i++) {
                    if (v2Storage.hasKey(i)) {
                        resValues[i] = op.apply(resValues[i], v2.get(i));
                    } else {
                        resValues[i] = op.apply(resValues[i], 0);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSorted() && v2.isSorted()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntDoubleVectorStorage newStorage = v1.getStorage().emptyDense();
            double[] resValues = newStorage.getValues();
            int v1Pointor = 0;
            int v2Pointor = 0;
            int size1 = v1.size();
            int size2 = v2.size();
            int[] v1Indices = v1.getStorage().getIndices();
            double[] v1Values = v1.getStorage().getValues();
            int[] v2Indices = v2.getStorage().getIndices();
            float[] v2Values = v2.getStorage().getValues();
            if (!op.isCompare()) {
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = Double.NaN;
                }
            }
            while (v1Pointor < size1 && v2Pointor < size2) {
                if (v1Indices[v1Pointor] == v2Indices[v2Pointor]) {
                    resValues[v1Indices[v1Pointor]] = op.apply(v1Values[v1Pointor], v2Values[v2Pointor]);
                    v1Pointor++;
                    v2Pointor++;
                } else if (v1Indices[v1Pointor] < v2Indices[v2Pointor]) {
                    resValues[v1Indices[v1Pointor]] = op.apply(v1Values[v1Pointor], 0);
                    v1Pointor++;
                } else {
                    // v1Indices[v1Pointor] > v2Indices[v2Pointor]
                    resValues[v2Indices[v2Pointor]] = op.apply(0, v2Values[v2Pointor]);
                    v2Pointor++;
                }
            }
            v1.setStorage(newStorage);
        }
    } else {
        throw new AngelException("The operation is not support!");
    }
    return v1;
}
Also used : AngelException(com.tencent.angel.exception.AngelException) Int2DoubleMap(it.unimi.dsi.fastutil.ints.Int2DoubleMap) ObjectIterator(it.unimi.dsi.fastutil.objects.ObjectIterator) IntFloatVectorStorage(com.tencent.angel.ml.math2.storage.IntFloatVectorStorage) IntDoubleVectorStorage(com.tencent.angel.ml.math2.storage.IntDoubleVectorStorage) Int2FloatMap(it.unimi.dsi.fastutil.ints.Int2FloatMap)

Example 55 with ObjectIterator

use of it.unimi.dsi.fastutil.objects.ObjectIterator in project angel by Tencent.

the class SimpleBinaryInAllExecutor method apply.

public static Vector apply(IntDoubleVector v1, IntIntVector v2, Binary op) {
    if (v1.isDense() && v2.isDense()) {
        double[] resValues = v1.getStorage().getValues();
        int[] v2Values = v2.getStorage().getValues();
        for (int idx = 0; idx < resValues.length; idx++) {
            resValues[idx] = op.apply(resValues[idx], v2Values[idx]);
        }
    } else if (v1.isDense() && v2.isSparse()) {
        double[] resValues = v1.getStorage().getValues();
        if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
            for (int i = 0; i < resValues.length; i++) {
                resValues[i] = op.apply(resValues[i], 0);
            }
            ObjectIterator<Int2IntMap.Entry> iter = v2.getStorage().entryIterator();
            while (iter.hasNext()) {
                Int2IntMap.Entry entry = iter.next();
                int idx = entry.getIntKey();
                resValues[idx] = op.apply(v1.get(idx), entry.getIntValue());
            }
        } else {
            IntIntVectorStorage v2Storage = v2.getStorage();
            for (int i = 0; i < resValues.length; i++) {
                if (v2Storage.hasKey(i)) {
                    resValues[i] = op.apply(resValues[i], v2.get(i));
                } else {
                    resValues[i] = op.apply(resValues[i], 0);
                }
            }
        }
    } else if (v1.isDense() && v2.isSorted()) {
        double[] resValues = v1.getStorage().getValues();
        if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
            int[] v2Indices = v2.getStorage().getIndices();
            int[] v2Values = v2.getStorage().getValues();
            for (int i = 0; i < resValues.length; i++) {
                resValues[i] = op.apply(resValues[i], 0);
            }
            int size = v2.size();
            for (int i = 0; i < size; i++) {
                int idx = v2Indices[i];
                resValues[idx] = op.apply(v1.get(idx), v2Values[i]);
            }
        } else {
            IntIntVectorStorage v2Storage = v2.getStorage();
            for (int i = 0; i < resValues.length; i++) {
                if (v2Storage.hasKey(i)) {
                    resValues[i] = op.apply(resValues[i], v2.get(i));
                } else {
                    resValues[i] = op.apply(resValues[i], 0);
                }
            }
        }
    } else if (v1.isSparse() && v2.isDense()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntDoubleVectorStorage newStorage = v1.getStorage().emptyDense();
            double[] resValues = newStorage.getValues();
            int[] v2Values = v2.getStorage().getValues();
            if (v1.size() < Constant.denseLoopThreshold * v1.getDim()) {
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(0, v2Values[i]);
                }
                ObjectIterator<Int2DoubleMap.Entry> iter = v1.getStorage().entryIterator();
                while (iter.hasNext()) {
                    Int2DoubleMap.Entry entry = iter.next();
                    int idx = entry.getIntKey();
                    resValues[idx] = op.apply(entry.getDoubleValue(), v2Values[idx]);
                }
            } else {
                for (int i = 0; i < resValues.length; i++) {
                    if (v1.getStorage().hasKey(i)) {
                        resValues[i] = op.apply(v1.get(i), v2Values[i]);
                    } else {
                        resValues[i] = op.apply(0, v2Values[i]);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSorted() && v2.isDense()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntDoubleVectorStorage newStorage = v1.getStorage().emptyDense();
            double[] resValues = newStorage.getValues();
            int[] v2Values = v2.getStorage().getValues();
            if (v1.size() < Constant.denseLoopThreshold * v1.getDim()) {
                int[] v1Indices = v1.getStorage().getIndices();
                double[] v1Values = v1.getStorage().getValues();
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(0, v2Values[i]);
                }
                int size = v1.size();
                for (int i = 0; i < size; i++) {
                    int idx = v1Indices[i];
                    resValues[idx] = op.apply(v1Values[i], v2Values[idx]);
                }
            } else {
                IntDoubleVectorStorage v1Storage = v1.getStorage();
                for (int i = 0; i < resValues.length; i++) {
                    if (v1Storage.hasKey(i)) {
                        resValues[i] = op.apply(v1.get(i), v2Values[i]);
                    } else {
                        resValues[i] = op.apply(0, v2Values[i]);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSparse() && v2.isSparse()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntDoubleVectorStorage newStorage = v1.getStorage().emptyDense();
            double[] resValues = newStorage.getValues();
            ObjectIterator<Int2DoubleMap.Entry> iter1 = v1.getStorage().entryIterator();
            while (iter1.hasNext()) {
                Int2DoubleMap.Entry entry = iter1.next();
                int idx = entry.getIntKey();
                resValues[idx] = entry.getDoubleValue();
            }
            if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(resValues[i], 0);
                }
                ObjectIterator<Int2IntMap.Entry> iter = v2.getStorage().entryIterator();
                while (iter.hasNext()) {
                    Int2IntMap.Entry entry = iter.next();
                    int idx = entry.getIntKey();
                    if (v1.getStorage().hasKey(idx)) {
                        resValues[idx] = op.apply(v1.get(idx), entry.getIntValue());
                    }
                }
            } else {
                IntIntVectorStorage v2Storage = v2.getStorage();
                for (int i = 0; i < resValues.length; i++) {
                    if (v2Storage.hasKey(i)) {
                        resValues[i] = op.apply(resValues[i], v2.get(i));
                    } else {
                        resValues[i] = op.apply(resValues[i], 0);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSparse() && v2.isSorted()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntDoubleVectorStorage newStorage = v1.getStorage().emptyDense();
            double[] resValues = newStorage.getValues();
            ObjectIterator<Int2DoubleMap.Entry> iter1 = v1.getStorage().entryIterator();
            while (iter1.hasNext()) {
                Int2DoubleMap.Entry entry = iter1.next();
                int idx = entry.getIntKey();
                resValues[idx] = entry.getDoubleValue();
            }
            if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
                int[] v2Indices = v2.getStorage().getIndices();
                int[] v2Values = v2.getStorage().getValues();
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(resValues[i], 0);
                }
                int size = v2.size();
                for (int i = 0; i < size; i++) {
                    int idx = v2Indices[i];
                    if (v1.getStorage().hasKey(idx)) {
                        resValues[idx] = op.apply(v1.get(idx), v2Values[i]);
                    }
                }
            } else {
                IntIntVectorStorage v2Storage = v2.getStorage();
                for (int i = 0; i < resValues.length; i++) {
                    if (v2Storage.hasKey(i)) {
                        resValues[i] = op.apply(resValues[i], v2.get(i));
                    } else {
                        resValues[i] = op.apply(resValues[i], 0);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSorted() && v2.isSparse()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntDoubleVectorStorage newStorage = v1.getStorage().emptyDense();
            double[] resValues = newStorage.getValues();
            int[] v1Indices = v1.getStorage().getIndices();
            double[] v1Values = v1.getStorage().getValues();
            int size = v1.size();
            for (int i = 0; i < size; i++) {
                int idx = v1Indices[i];
                resValues[idx] = v1Values[i];
            }
            if (v2.size() < Constant.denseLoopThreshold * v2.getDim()) {
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = op.apply(resValues[i], 0);
                }
                ObjectIterator<Int2IntMap.Entry> iter = v2.getStorage().entryIterator();
                while (iter.hasNext()) {
                    Int2IntMap.Entry entry = iter.next();
                    int idx = entry.getIntKey();
                    if (v1.getStorage().hasKey(idx)) {
                        resValues[idx] = op.apply(v1.get(idx), entry.getIntValue());
                    }
                }
            } else {
                IntIntVectorStorage v2Storage = v2.getStorage();
                for (int i = 0; i < resValues.length; i++) {
                    if (v2Storage.hasKey(i)) {
                        resValues[i] = op.apply(resValues[i], v2.get(i));
                    } else {
                        resValues[i] = op.apply(resValues[i], 0);
                    }
                }
            }
            v1.setStorage(newStorage);
        }
    } else if (v1.isSorted() && v2.isSorted()) {
        if (op.isKeepStorage()) {
            throw new AngelException("operation is not support!");
        } else {
            IntDoubleVectorStorage newStorage = v1.getStorage().emptyDense();
            double[] resValues = newStorage.getValues();
            int v1Pointor = 0;
            int v2Pointor = 0;
            int size1 = v1.size();
            int size2 = v2.size();
            int[] v1Indices = v1.getStorage().getIndices();
            double[] v1Values = v1.getStorage().getValues();
            int[] v2Indices = v2.getStorage().getIndices();
            int[] v2Values = v2.getStorage().getValues();
            if (!op.isCompare()) {
                for (int i = 0; i < resValues.length; i++) {
                    resValues[i] = Double.NaN;
                }
            }
            while (v1Pointor < size1 && v2Pointor < size2) {
                if (v1Indices[v1Pointor] == v2Indices[v2Pointor]) {
                    resValues[v1Indices[v1Pointor]] = op.apply(v1Values[v1Pointor], v2Values[v2Pointor]);
                    v1Pointor++;
                    v2Pointor++;
                } else if (v1Indices[v1Pointor] < v2Indices[v2Pointor]) {
                    resValues[v1Indices[v1Pointor]] = op.apply(v1Values[v1Pointor], 0);
                    v1Pointor++;
                } else {
                    // v1Indices[v1Pointor] > v2Indices[v2Pointor]
                    resValues[v2Indices[v2Pointor]] = op.apply(0, v2Values[v2Pointor]);
                    v2Pointor++;
                }
            }
            v1.setStorage(newStorage);
        }
    } else {
        throw new AngelException("The operation is not support!");
    }
    return v1;
}
Also used : AngelException(com.tencent.angel.exception.AngelException) IntIntVectorStorage(com.tencent.angel.ml.math2.storage.IntIntVectorStorage) IntDoubleVectorStorage(com.tencent.angel.ml.math2.storage.IntDoubleVectorStorage) Int2DoubleMap(it.unimi.dsi.fastutil.ints.Int2DoubleMap) Int2IntMap(it.unimi.dsi.fastutil.ints.Int2IntMap) ObjectIterator(it.unimi.dsi.fastutil.objects.ObjectIterator)

Aggregations

ObjectIterator (it.unimi.dsi.fastutil.objects.ObjectIterator)254 IntDoubleVectorStorage (com.tencent.angel.ml.math2.storage.IntDoubleVectorStorage)115 IntFloatVectorStorage (com.tencent.angel.ml.math2.storage.IntFloatVectorStorage)114 IntLongVectorStorage (com.tencent.angel.ml.math2.storage.IntLongVectorStorage)111 IntIntVectorStorage (com.tencent.angel.ml.math2.storage.IntIntVectorStorage)110 AngelException (com.tencent.angel.exception.AngelException)100 LongDoubleVectorStorage (com.tencent.angel.ml.math2.storage.LongDoubleVectorStorage)100 LongFloatVectorStorage (com.tencent.angel.ml.math2.storage.LongFloatVectorStorage)99 LongLongVectorStorage (com.tencent.angel.ml.math2.storage.LongLongVectorStorage)98 LongIntVectorStorage (com.tencent.angel.ml.math2.storage.LongIntVectorStorage)97 Storage (com.tencent.angel.ml.math2.storage.Storage)96 Int2FloatMap (it.unimi.dsi.fastutil.ints.Int2FloatMap)62 Int2LongMap (it.unimi.dsi.fastutil.ints.Int2LongMap)57 Int2DoubleMap (it.unimi.dsi.fastutil.ints.Int2DoubleMap)56 Int2IntMap (it.unimi.dsi.fastutil.ints.Int2IntMap)55 IntDoubleVector (com.tencent.angel.ml.math2.vector.IntDoubleVector)47 IntDoubleSortedVectorStorage (com.tencent.angel.ml.math2.storage.IntDoubleSortedVectorStorage)44 LongDoubleSortedVectorStorage (com.tencent.angel.ml.math2.storage.LongDoubleSortedVectorStorage)44 IntFloatSortedVectorStorage (com.tencent.angel.ml.math2.storage.IntFloatSortedVectorStorage)43 LongFloatSortedVectorStorage (com.tencent.angel.ml.math2.storage.LongFloatSortedVectorStorage)43