First loop test passed.  The data structure and search algorithm is still crude and in-flux.  But this milestone needed to be locked in.  Right now every loop is implemented in terms of a structure that will handle the most complicated {min, max} loop.  Though only *-loops are tested at the moment.  In a future iteration *-loops will likely be optimized a little more.  The only tests are for basic posix so far, but I have prototype code running for extended posix and ecma.  The prototype code lacks the complicating properties of the real <regex> requirements though.

llvm-svn: 107803
3 files changed
tree: 462766a671a994a93983c0fe31118b7c5d163348
  1. clang/
  2. compiler-rt/
  3. libcxx/
  4. lldb/
  5. llvm/