Package net.fec.openrq.util.linearalgebra.io

Examples of net.fec.openrq.util.linearalgebra.io.ByteVectorIterator.index()

80
81
82
83
84
85
86
87
88
89
    public Void apply(DenseByteVector a, SparseByteVector b) {

        ByteVectorIterator it = b.nonZeroIterator();
        while (it.hasNext()) {
            it.next();
            a.set(it.index(), aMinusB(a.get(it.index()), it.get()));
        }
        return null;
    }
}
View Full Code Here
49
50
51
52
53
54
55
56
57
58
59
        ByteVectorIterator it = indexer.nonZeroIterator(b);
        // TODO: these.andAlsoAdd(those)
        // these.andAlsoSubtract(those);
        while (it.hasNext()) {
            it.next();
            a.addInPlace(it.index(), multB(it.get()));
        }
        return null;
    }

    @Override
View Full Code Here
59
60
61
62
63
64
65
66
67
68
69
    @Override
    public Void apply(SparseByteVector a, DenseByteVector b) {

        ByteVectorIterator it = indexer.iterator(a);
        while (it.hasNext()) {
            it.set(aPlusB(it.get(), multB(b.get(it.index()))));
        }
        return null;
    }

    @Override
View Full Code Here
79
80
81
82
83
84
85
86
87
88
89
    public Void apply(DenseByteVector a, SparseByteVector b) {

        ByteVectorIterator it = indexer.nonZeroIterator(b);
        while (it.hasNext()) {
            it.next();
            a.set(it.index(), aPlusB(a.get(it.index()), multB(it.get())));
        }
        return null;
    }

    private byte multB(byte bValue) {
View Full Code Here
79
80
81
82
83
84
85
86
87
88
89
    public Void apply(DenseByteVector a, SparseByteVector b) {

        ByteVectorIterator it = indexer.nonZeroIterator(b);
        while (it.hasNext()) {
            it.next();
            a.set(it.index(), aPlusB(a.get(it.index()), multB(it.get())));
        }
        return null;
    }

    private byte multB(byte bValue) {
View Full Code Here
579
580
581
582
583
584
585
586
587
588
589
                ByteVectorIterator it = A.nonZeroRowIterator(row, 0, L - u);
                while (it.hasNext()) {
                    it.next();
                    originalDegree += OctetOps.UNSIGN(it.get()); // add to the degree of this row
                    nodes.add(it.index()); // add the column index to the nodes
                }

                rows.put(row, new Row(row, nonZeros, originalDegree, isHDPC, nodes));
            }
            else {
View Full Code Here
989
990
991
992
993
994
995
996
997
998
999
                else {
                    final Set<Integer> nodes = new HashSet<>(2 + 1, 1.0f); // we know there will only be two non zeros
                    ByteVectorIterator it = A.nonZeroRowIterator(row.position, i, L - u);
                    while (it.hasNext()) {
                        it.next();
                        nodes.add(it.index()); // add node to this edge (column index)
                    }

                    row.nodes = nodes;
                }
            }
View Full Code Here
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
            ByteVectorIterator it = A.nonZeroRowIterator(row, i, L);
            while (it.hasNext()) {
                it.next();

                // "if the row has a nonzero entry at position j"
                final int j = it.index();
                // "if the value of that nonzero entry is b"
                final byte b = it.get();

                // "add to this row b times row j of I_u" -- this would "zerofy"
                // that position, thus we can save the complexity
View Full Code Here
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
            ByteVectorIterator it = A.nonZeroRowIterator(j, 0, j);
            while (it.hasNext()) {
                it.next();

                // "then add A[j,eL] multiplied with row eL of A to row j of A."
                final int eL = it.index();
                beta = it.get();

                // We do not actually have to perform this operation on the matrix A
                // because it will not be used again.
                // A.addRowsInPlace(beta, eL, j);
View Full Code Here
4065
4066
4067
4068
4069
4070
4071
4072
4073
4074
4075
        assertEquals("index 4", 4, it.index());

        assertTrue("hasNext 5", it.hasNext());
        it.next();
        assertEquals("get 5", 0, it.get());
        assertEquals("index 5", 5, it.index());

        assertFalse(it.hasNext());
    }

    @Test
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.