Set difference B minus A
Find additions computes the set difference B − A: every line that exists in text B but is absent from text A. The split between texts is a line containing exactly ---. Lines from text A are loaded into a JavaScript Set for O(1) lookup; text B is walked line by line and any line not in A's set is emitted.
Matching is exact: case, whitespace, and trailing spaces all count. Hello and hello are treated as different lines. Use lowercase on both halves first to normalise case, or trim whitespace to strip margin whitespace before comparing.
Output preserves the order in text B. The mirror operation is find removals, which returns A − B. Together they describe the symmetric change between two list states. For the set of unchanged entries see find common lines.
How to use find additions
- 1Paste the older list as text A, then a line with
---, then the newer list as text B. - 2The output panel lists every entry from B that did not appear in A, in B's order.
- 3Click Copy to copy the additions list, or Download to save it.
- 4Pivot to find removals for the opposite direction (A − B).
- 5Pre-clean with trim whitespace when trailing spaces are blocking matches.
Keyboard shortcuts
Drive TextResult without touching the mouse.
| Shortcut | Action |
|---|---|
| Ctrl F | Open the find & replace panel inside the input Plus |
| Ctrl Z | Undo the last input change |
| Ctrl Shift Z | Redo |
| Ctrl Shift Enter | Toggle fullscreen focus on the editor Plus |
| Esc | Close find & replace, or exit fullscreen |
| Ctrl K | Open the command palette to jump to any tool Plus |
| Ctrl S | Save current workflow draft Plus |
| Ctrl P | Run a saved workflow Plus |
How the additions list is built
Set difference B minus A
Lines from text A are loaded into a JavaScript Set. Text B is walked line by line and each entry is checked; any line not in A's set is emitted to the output.
Order follows text B
Output preserves B's order. A new entry that appears at line 3 of B comes before another new entry at line 8, regardless of where they sit in any sorted ordering.
Exact, case-sensitive match
Comparison is byte-for-byte. Hello in A does not block hello in B from being treated as new. Lowercase first if you want case-folded matching.
Mirror of find-removals
Find additions is B − A. Find removals is A − B. Run both for a full picture of what changed between two list versions.
Three-hyphen separator
The split between A (old) and B (new) is a line containing exactly ---. The tool needs this marker to know which side is which.
Worked example
Two new entries (dave and eve) exist in B but not in A. The shared entries are filtered out. For the reverse direction see find removals.
alice bob carol --- alice bob carol dave eve
dave eve
Settings reference
| Behaviour | Effect on output |
|---|---|
| Separator | A line containing exactly --- splits text A (old) from text B (new). |
| Operation | Set difference B − A. |
| Match rule | Exact string equality, case and whitespace sensitive. |
| Order | Follows text B. |
| Duplicates in B | Preserved if not present in A. |
| Mirror operation | find removals returns A − B. |
| Missing separator | Output prompts for two halves split by ---. |
FAQ
How is this different from find unique lines?
Are matches case sensitive?
Hello and hello count as different lines. Lowercase both sides first with lowercase for case-folded matching.Why is a clearly identical line still showing as added?
How do I see lines that were removed?
--- separator.