1 files changed, 2 insertions, 2 deletions
diff --git a/lib/diffseq.h b/lib/diffseq.h
index c6aac3d8120..c48da0c98d9 100644
--- a/lib/diffseq.h
+++ b/lib/diffseq.h
@@ -28,13 +28,13 @@
   The basic algorithm is described in:
   "An O(ND) Difference Algorithm and its Variations", Eugene W. Myers,
   Algorithmica Vol. 1, 1986, pp. 251-266,
-   <http://dx.doi.org/10.1007/BF01840446>.
+   <https://doi.org/10.1007/BF01840446>.
   See especially section 4.2, which describes the variation used below.
   The basic algorithm was independently discovered as described in:
   "Algorithms for Approximate String Matching", Esko Ukkonen,
   Information and Control Vol. 64, 1985, pp. 100-118,
-   <http://dx.doi.org/10.1016/S0019-9958(85)80046-2>.
+   <https://doi.org/10.1016/S0019-9958(85)80046-2>.
   Unless the 'find_minimal' flag is set, this code uses the TOO_EXPENSIVE
   heuristic, by Paul Eggert, to limit the cost to O(N**1.5 log N)

diff --git a/lib/diffseq.h b/lib/diffseq.h index c6aac3d8120..c48da0c98d9 100644 --- a/lib/diffseq.h +++ b/lib/diffseq.h
@@ -28,13 +28,13 @@
28	The basic algorithm is described in:	28	The basic algorithm is described in:
29	"An O(ND) Difference Algorithm and its Variations", Eugene W. Myers,	29	"An O(ND) Difference Algorithm and its Variations", Eugene W. Myers,
30	Algorithmica Vol. 1, 1986, pp. 251-266,	30	Algorithmica Vol. 1, 1986, pp. 251-266,
31	<http://dx.doi.org/10.1007/BF01840446>.	31	<https://doi.org/10.1007/BF01840446>.
32	See especially section 4.2, which describes the variation used below.	32	See especially section 4.2, which describes the variation used below.
33		33
34	The basic algorithm was independently discovered as described in:	34	The basic algorithm was independently discovered as described in:
35	"Algorithms for Approximate String Matching", Esko Ukkonen,	35	"Algorithms for Approximate String Matching", Esko Ukkonen,
36	Information and Control Vol. 64, 1985, pp. 100-118,	36	Information and Control Vol. 64, 1985, pp. 100-118,
37	<http://dx.doi.org/10.1016/S0019-9958(85)80046-2>.	37	<https://doi.org/10.1016/S0019-9958(85)80046-2>.
38		38
39	Unless the 'find_minimal' flag is set, this code uses the TOO_EXPENSIVE	39	Unless the 'find_minimal' flag is set, this code uses the TOO_EXPENSIVE
40	heuristic, by Paul Eggert, to limit the cost to O(N**1.5 log N)	40	heuristic, by Paul Eggert, to limit the cost to O(N**1.5 log N)