Examples of org.openoffice.xmerge.merger.diff.IteratorRowCompare

Package org.openoffice.xmerge.merger.diff

Examples of org.openoffice.xmerge.merger.diff.IteratorRowCompare

org.openoffice.xmerge.merger.diff.IteratorRowCompare
A very simple and direct difference algorithm for row Node objects in a spreadsheet. Basically, it will compare objects in sequence and does not look ahead (unlike LCS).
1. If two objects are the same, skip to next one.
2. Otherwise check whether the row repeated attribute is the same.
3. If the row repeated attribute is the same, then compare two rows and mark it as change if those rows are different.
4. If the row repeated attribute is different, then split the rows and continue to compare.
5. If there are more objects in the modseq than the original sequence, then all of the extra ones in the modified sequence are marked as add.
6. If there are more objects in the original sequence than the modified sequence, then all the extra one in the modified sequence are marked as delete.
NOTE: The algorithm will have potential side effect to split rows.
@author smak

                // use a straight comparsion algorithm then do a merge on it
                Iterator i1 = new RowIterator(cc_, workSheet);
                Iterator i2 = new RowIterator(cc_, matchingWorkSheet);


                // find out the diff
                DiffAlgorithm diffAlgo = new IteratorRowCompare();


                // find out the paragrah level diffs
                Difference[] diffResult = diffAlgo.computeDiffs(i1, i2);


                if (Debug.isFlagSet(Debug.INFO)) {
                    Debug.log(Debug.INFO, "Diff Result: ");


                    for (int j = 0; j < diffResult.length; j++) {

View Full Code Here

                // use a straight comparsion algorithm then do a merge on it
                Iterator i1 = new RowIterator(cc_, workSheet);
                Iterator i2 = new RowIterator(cc_, matchingWorkSheet);


                // find out the diff
                DiffAlgorithm diffAlgo = new IteratorRowCompare();


                // find out the paragrah level diffs
                Difference[] diffResult = diffAlgo.computeDiffs(i1, i2);


                if (Debug.isFlagSet(Debug.INFO)) {
                    Debug.log(Debug.INFO, "Diff Result: ");


                    for (int j = 0; j < diffResult.length; j++) {

View Full Code Here

                // use a straight comparsion algorithm then do a merge on it
                Iterator i1 = new RowIterator(cc_, workSheet);
                Iterator i2 = new RowIterator(cc_, matchingWorkSheet);


                // find out the diff
                DiffAlgorithm diffAlgo = new IteratorRowCompare();


                // find out the paragrah level diffs
                Difference[] diffResult = diffAlgo.computeDiffs(i1, i2);


                if (Debug.isFlagSet(Debug.INFO)) {
                    Debug.log(Debug.INFO, "Diff Result: ");


                    for (int j = 0; j < diffResult.length; j++) {

View Full Code Here

                // use a straight comparsion algorithm then do a merge on it
                Iterator i1 = new RowIterator(cc_, workSheet);
                Iterator i2 = new RowIterator(cc_, matchingWorkSheet);


                // find out the diff
                DiffAlgorithm diffAlgo = new IteratorRowCompare();


                // find out the paragrah level diffs
                Difference[] diffResult = diffAlgo.computeDiffs(i1, i2);


                if (Debug.isFlagSet(Debug.INFO)) {
                    Debug.log(Debug.INFO, "Diff Result: ");


                    for (int j = 0; j < diffResult.length; j++) {

View Full Code Here

                // use a straight comparsion algorithm then do a merge on it
                Iterator i1 = new RowIterator(cc_, workSheet);
                Iterator i2 = new RowIterator(cc_, matchingWorkSheet);


                // find out the diff
                DiffAlgorithm diffAlgo = new IteratorRowCompare();


                // find out the paragrah level diffs
                Difference[] diffResult = diffAlgo.computeDiffs(i1, i2);


                if (Debug.isFlagSet(Debug.INFO)) {
                    Debug.log(Debug.INFO, "Diff Result: ");


                    for (int j = 0; j < diffResult.length; j++) {

View Full Code Here

                // use a straight comparsion algorithm then do a merge on it
                Iterator i1 = new RowIterator(cc_, workSheet);
                Iterator i2 = new RowIterator(cc_, matchingWorkSheet);


                // find out the diff
                DiffAlgorithm diffAlgo = new IteratorRowCompare();


                // find out the paragrah level diffs
                Difference[] diffResult = diffAlgo.computeDiffs(i1, i2);


                if (Debug.isFlagSet(Debug.INFO)) {
                    Debug.log(Debug.INFO, "Diff Result: ");


                    for (int j = 0; j < diffResult.length; j++) {

View Full Code Here

                // use a straight comparsion algorithm then do a merge on it
                Iterator i1 = new RowIterator(cc_, workSheet);
                Iterator i2 = new RowIterator(cc_, matchingWorkSheet);


                // find out the diff
                DiffAlgorithm diffAlgo = new IteratorRowCompare();


                // find out the paragrah level diffs
                Difference[] diffResult = diffAlgo.computeDiffs(i1, i2);


                if (Debug.isFlagSet(Debug.INFO)) {
                    Debug.log(Debug.INFO, "Diff Result: ");


                    for (int j = 0; j < diffResult.length; j++) {

View Full Code Here

                // use a straight comparsion algorithm then do a merge on it
                Iterator i1 = new RowIterator(cc_, workSheet);
                Iterator i2 = new RowIterator(cc_, matchingWorkSheet);


                // find out the diff
                DiffAlgorithm diffAlgo = new IteratorRowCompare();


                // find out the paragrah level diffs
                Difference[] diffResult = diffAlgo.computeDiffs(i1, i2);


                if (Debug.isFlagSet(Debug.INFO)) {
                    Debug.log(Debug.INFO, "Diff Result: ");


                    for (int j = 0; j < diffResult.length; j++) {

View Full Code Here

                // use a straight comparsion algorithm then do a merge on it
                Iterator i1 = new RowIterator(cc_, workSheet);
                Iterator i2 = new RowIterator(cc_, matchingWorkSheet);


                // find out the diff
                DiffAlgorithm diffAlgo = new IteratorRowCompare();


                // find out the paragrah level diffs
                Difference[] diffResult = diffAlgo.computeDiffs(i1, i2);


                if (Debug.isFlagSet(Debug.INFO)) {
                    Debug.log(Debug.INFO, "Diff Result: ");


                    for (int j = 0; j < diffResult.length; j++) {

View Full Code Here

                // use a straight comparsion algorithm then do a merge on it
                Iterator i1 = new RowIterator(cc_, workSheet);
                Iterator i2 = new RowIterator(cc_, matchingWorkSheet);


                // find out the diff
                DiffAlgorithm diffAlgo = new IteratorRowCompare();


                // find out the paragrah level diffs
                Difference[] diffResult = diffAlgo.computeDiffs(i1, i2);


                if (Debug.isFlagSet(Debug.INFO)) {
                    Debug.log(Debug.INFO, "Diff Result: ");


                    for (int j = 0; j < diffResult.length; j++) {

View Full Code Here

TOP

Related Classes of org.openoffice.xmerge.merger.diff.IteratorRowCompare

org.openoffice.xmerge.converter.xml.sxc.DocumentMergerImpl

org.openoffice.xmerge.merger.Difference

org.w3c.dom.Node

java.util.Vector

org.w3c.dom.Element

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.