From c337d9fd8c59bafbfd63616a7efb864d80096681 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Henrik=20Grubbstr=C3=B6m=20=28Grubba=29?=
<grubba@grubba.org>
Date: Tue, 19 May 1998 20:47:41 +0200
Subject: [PATCH] Some minor changes.
Rev: src/builtin_functions.c:1.110
---
src/builtin_functions.c | 5 ++++-
1 file changed, 4 insertions(+), 1 deletion(-)
diff --git a/src/builtin_functions.c b/src/builtin_functions.c
index 6a10ecacbe..316dd9b72c 100644
--- a/src/builtin_functions.c
+++ b/src/builtin_functions.c
@@ -4,7 +4,7 @@
||| See the files COPYING and DISCLAIMER for more information.
\*/
#include "global.h"
-RCSID("$Id: builtin_functions.c,v 1.109 1998/05/19 18:46:06 grubba Exp $");
+RCSID("$Id: builtin_functions.c,v 1.110 1998/05/19 18:47:41 grubba Exp $");
#include "interpret.h"
#include "svalue.h"
#include "pike_macros.h"
@@ -2168,6 +2168,9 @@ static struct array *diff_longest_sequence(struct array *cmptbl, int blen)
*
* This makes it faster than the G-M algorithm on binary data,
* but slower on ascii data.
+ *
+ * NOT true! The G-M algorithm seems to be faster on most data anyway.
+ * /grubba 1998-05-19
*/
static struct array *diff_dyn_longest_sequence(struct array *cmptbl, int blen)
{
--
GitLab