Stefan Monnier <[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. > > Actually the only cases I can vaguely remember using the > (/ (length (match-data)) 2) idiom didn't use the whole (match-data). > They typically used the idiom in order to know *which* subgroup matched (of > course it only works if you craft your regexp carefully).
Maybe this would be more versatile: (match-subgroups) => "match count" (match-subgroups t) => list of subgroups that matches -- 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
