mirror of
https://github.com/RGBCube/serenity
synced 2025-07-25 15:37:46 +00:00
LibDiff: Add new API to generate hunks from two pieces of text
For now this is just a standard implementation of the longest common subsequence algorithm over the lines, except that it doesn't do any coalescing of the lines. This isn't really ideal since we get a single Hunk per changed line, and is definitely something to improve in the future.
This commit is contained in:
parent
27f28998b1
commit
5e28da1aa4
3 changed files with 105 additions and 1 deletions
15
Userland/Libraries/LibDiff/Generator.h
Normal file
15
Userland/Libraries/LibDiff/Generator.h
Normal file
|
@ -0,0 +1,15 @@
|
|||
/*
|
||||
* Copyright (c) 2021, Mustafa Quraish <mustafa@serenityos.org>
|
||||
*
|
||||
* SPDX-License-Identifier: BSD-2-Clause
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include "Hunks.h"
|
||||
|
||||
namespace Diff {
|
||||
|
||||
Vector<Hunk> from_text(StringView const& old_text, StringView const& new_text);
|
||||
|
||||
}
|
Loading…
Add table
Add a link
Reference in a new issue