Romain Francoise <[EMAIL PROTECTED]> writes: > I found out that getting a hash of the current buffer is > very fast. So my function now recomputes the completion > list only if the library buffer has changed (or if a > prefix argument is passed).
Computing the MD5 hash of a buffer containing thousands of lines takes about a second here. Is this acceptable for something that will run every time you hit `j'? -- Daniel Brockman <[EMAIL PROTECTED]> _______________________________________________ bongo-devel mailing list [email protected] http://lists.nongnu.org/mailman/listinfo/bongo-devel
