ladybird/Userland/Libraries/LibDiff/Generator.h

/*
 * 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 old_text, StringView new_text);

}
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. 2021-09-15 21:58:53 -04:00			`/*`
			`* Copyright (c) 2021, Mustafa Quraish <mustafa@serenityos.org>`
			`*`
			`* SPDX-License-Identifier: BSD-2-Clause`
			`*/`

			`#pragma once`

			`#include "Hunks.h"`

			`namespace Diff {`

Everywhere: Pass AK::StringView by value 2021-11-11 00:55:02 +01:00			`Vector<Hunk> from_text(StringView old_text, StringView new_text);`
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. 2021-09-15 21:58:53 -04:00
			`}`