#252

Committed 22 Sep 2023 04:09PM UTC coverage: 89.886% (+0.08%) from 89.804%

Build # #252

Build Type

Committed by

Commit Message

Added longest common sequence implementation.

Pull Request Pull Request #6: Feature/sequence

Run Details

106 of 106 new or added lines in 6 files covered. (100.0%)

7492 of 8335 relevant lines covered (89.89%)

0.9 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

95.24

/lis-commons-util/src/main/java/com/link_intersystems/util/diff/LongestCommonSubsequenceTable.java

package com.link_intersystems.util.diff;

import com.link_intersystems.util.table.IntTable;
import com.link_intersystems.util.Sequence;

import java.util.Objects;

import static java.util.Objects.*;

public class LongestCommonSubsequenceTable<E> implements IntTable {

    private final Sequence<E> rowSequence;
    private final Sequence<E> columnSequence;

    private int[][] table;
    private LongestCommonSubsequencePath LongestCommonSubsequencePath;

    public LongestCommonSubsequenceTable(Sequence<E> rowSequence, Sequence<E> columnSequence) {
        this.rowSequence = requireNonNull(rowSequence);
        this.columnSequence = requireNonNull(columnSequence);
    }

    public int[][] getTable() {
        if (table != null) {
            return table;
        }

        table = new int[rowSequence.length() + 1][columnSequence.length() + 1];

        for (int row = 1; row <= rowSequence.length(); row++) {
            for (int column = 1; column <= columnSequence.length(); column++) {
                if (Objects.equals(rowSequence.elementAt(row - 1), columnSequence.elementAt(column - 1))) {
                    table[row][column] = table[row - 1][column - 1] + 1;
                } else {
                    table[row][column] = Math.max(table[row - 1][column], table[row][column - 1]);
                }
            }
        }

        return table;
    }

    public int getValue(int row, int column) {
        return getTable()[row][column];
    }

    public Sequence<E> getLcsPath() {
        if (LongestCommonSubsequencePath != null) {
            return LongestCommonSubsequencePath;
        }

        return LongestCommonSubsequencePath = new LongestCommonSubsequencePath<>(this, getRowSequence(), getColumnSequence());
    }

    public Sequence<E> getRowSequence() {
        return rowSequence;
    }

    public Sequence<E> getColumnSequence() {
        return columnSequence;
    }

    @Override
    public int getColumnCount() {
        return columnSequence.length() + 1;
    }

    @Override
    public int getRowCount() {
        return rowSequence.length() + 1;
    }
}

1	package com.link_intersystems.util.diff;
2
3	import com.link_intersystems.util.table.IntTable;
4	import com.link_intersystems.util.Sequence;
5
6	import java.util.Objects;
7
8	import static java.util.Objects.*;
9
10	public class LongestCommonSubsequenceTable<E> implements IntTable {
11
12	private final Sequence<E> rowSequence;
13	private final Sequence<E> columnSequence;
14
15	private int[][] table;
16	private LongestCommonSubsequencePath LongestCommonSubsequencePath;
17
18	public LongestCommonSubsequenceTable(Sequence<E> rowSequence, Sequence<E> columnSequence) {	1✔
19	this.rowSequence = requireNonNull(rowSequence);	1✔
20	this.columnSequence = requireNonNull(columnSequence);	1✔
21	}	1✔
22
23	public int[][] getTable() {
24	if (table != null) {	1✔
25	return table;	1✔
26	}
27
28	table = new int[rowSequence.length() + 1][columnSequence.length() + 1];	1✔
29
30	for (int row = 1; row <= rowSequence.length(); row++) {	1✔
31	for (int column = 1; column <= columnSequence.length(); column++) {	1✔
32	if (Objects.equals(rowSequence.elementAt(row - 1), columnSequence.elementAt(column - 1))) {	1✔
33	table[row][column] = table[row - 1][column - 1] + 1;	1✔
34	} else {
35	table[row][column] = Math.max(table[row - 1][column], table[row][column - 1]);	1✔
36	}
37	}
38	}
39
40	return table;	1✔
41	}
42
43	public int getValue(int row, int column) {
44	return getTable()[row][column];	1✔
45	}
46
47	public Sequence<E> getLcsPath() {
48	if (LongestCommonSubsequencePath != null) {	1✔
49	return LongestCommonSubsequencePath;	×
50	}
51
52	return LongestCommonSubsequencePath = new LongestCommonSubsequencePath<>(this, getRowSequence(), getColumnSequence());	1✔
53	}
54
55	public Sequence<E> getRowSequence() {
56	return rowSequence;	1✔
57	}
58
59	public Sequence<E> getColumnSequence() {
60	return columnSequence;	1✔
61	}
62
63	@Override
64	public int getColumnCount() {
65	return columnSequence.length() + 1;	1✔
66	}
67
68	@Override
69	public int getRowCount() {
70	return rowSequence.length() + 1;	1✔
71	}
72	}

link-intersystems / lis-commons / #252

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous