From dfbe73a1331794c4e379f83823e73d31d801ccb1 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Jo=C3=A3o=20T=C3=A1vora?= Date: Mon, 9 Feb 2026 23:17:23 +0000 Subject: [PATCH] ; * src/minibuf.c (Fcompletion__flex_cost_gotoh): Fix comment. --- src/minibuf.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/minibuf.c b/src/minibuf.c index 7b34a307976..309a9f4af20 100644 --- a/src/minibuf.c +++ b/src/minibuf.c @@ -2302,7 +2302,7 @@ init_minibuf_once_for_pdumper (void) particular implementation of the algorithm assumes they have at least one match. - D (originally stands for 'Deletion' in the Gotoh paper) has "running + D (originally stands for 'Distance' in the Gotoh paper) has "running costs". Each value D[i,j] represents what the algorithm has to pay to make or extend a gap when a match is found at i+1, j+1. By that time, that cost may or may not be lower than continuing from a match