[boost] Re: regular expression proposals

From: Greg Colvin (gcolvin_at_[hidden])
Date: 1999-09-14 11:39:09

John Maddock proposes:

     a)   Define a design idiom for generic
       "pattern" types, rather as containers have
       certain basic requirements that all
       containers should satisfy, so "compiled
       patterns" should have certain requirements
       that all pattern matching classes should
       meet.  Just as some containers may be
       interchangeable under some circumstances,
       the same should be true for pattern-
       matching classes.  For example literal
       string algorithms (KNP, Boyer-Moore, Shift
       Or etc) should be more or less
       interchangeable with each other (cf vector
       and deque), but not with say a regular
       expression (cf vector and set).

To which I say -- Yes!