| Class | Description |
|---|---|
| Bisect |
Find the 'middle snake' of a diff, split the problem in two
and return the recursively constructed diff.
|
| Change |
Class representing one diff operation.
|
| Diff |
Diff.
|
| DiffBase |
DiffBase
|
| DiffLines |
Make diff based on lines.
|
| DiffOptions |
Options for diff.
|
| Enum | Description |
|---|---|
| Operation |
The data structure representing a diff is a Linked list of DiffBase objects:
{Change(Operation.DELETE, "Hello"), Change(Operation.INSERT, "Goodbye"),
Change(Operation.EQUAL, " world.")}
which means: delete "Hello", add "Goodbye" and keep " world."
|
Copyright © 2017. All rights reserved.