diff options
| author | Paul Eggert | 2019-09-22 23:50:59 -0700 |
|---|---|---|
| committer | Paul Eggert | 2019-09-22 23:51:44 -0700 |
| commit | 78669517dc3db4d6d51fb26d71073fc0c196ab5d (patch) | |
| tree | a3dff006cf177da51fd6458203d8e4751e36e78b /lib/diffseq.h | |
| parent | a33cda168e35cb93cdf115f7d12765f590226601 (diff) | |
| download | emacs-78669517dc3db4d6d51fb26d71073fc0c196ab5d.tar.gz emacs-78669517dc3db4d6d51fb26d71073fc0c196ab5d.zip | |
Update from Gnulib
This incorporates:
2019-09-22 Update some URLs
2019-09-15 fcntl-h: fix compilation error of creat.c on MSVC
2019-09-15 creat: new module
2019-09-15 access: new module
2019-09-09 Add option to assume best, not worst, when cross-compiling.
* build-aux/config.guess, build-aux/config.sub, doc/misc/texinfo.tex:
* lib/careadlinkat.c, lib/careadlinkat.h, lib/count-leading-zeros.h:
* lib/count-trailing-zeros.h, lib/diffseq.h, lib/fcntl.in.h:
* lib/ftoastr.c, lib/get-permissions.c:
* lib/ieee754.in.h, lib/inttypes.in.h, lib/mktime.c, lib/open.c:
* lib/pathmax.h, lib/pipe2.c, lib/stddef.in.h, lib/stdint.in.h:
* lib/stdlib.in.h, lib/str-two-way.h, lib/string.in.h, lib/time.in.h:
* lib/timegm.c, lib/unistd.in.h, m4/canonicalize.m4:
* m4/extern-inline.m4, m4/fcntl_h.m4, m4/fdopendir.m4:
* m4/getgroups.m4, m4/getopt.m4, m4/gettimeofday.m4:
* m4/gnulib-common.m4, m4/largefile.m4:
* m4/lstat.m4, m4/memmem.m4, m4/mktime.m4, m4/nocrash.m4, m4/open.m4:
* m4/pselect.m4, m4/putenv.m4, m4/readlink.m4, m4/regex.m4:
* m4/symlink.m4, m4/unistd_h.m4, m4/utimens.m4, m4/utimes.m4:
Copy from Gnulib.
* lib/gnulib.mk.in, m4/gnulib-comp.m4: Regenerate.
* m4/open-slash.m4: New file, copied from Gnulib.
Diffstat (limited to 'lib/diffseq.h')
| -rw-r--r-- | lib/diffseq.h | 4 |
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 @@ | |||
| 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) |