Richard Stallman <[EMAIL PROTECTED]> writes: > > There is no other interface into the number of accessible match > > strings (which might be nil) rather than > > (/ (length (match-data t)) 2). > > That's still pretty inefficient -- I suggest that we introduce a new > function `match-count' to return that number. > > Is there sufficient use for this function to justify introducing it? > I think that most cases where this would be used, the code would > then proceed to call match-data.
I don't know. -- Kim F. Storm <[EMAIL PROTECTED]> http://www.cua.dk _______________________________________________ Emacs-devel mailing list Emacs-devel@gnu.org http://lists.gnu.org/mailman/listinfo/emacs-devel
