Re: Inefficient code in reftex-index.el

[Richard Stallman]

    > 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.