On Thu, Jan 22, 2009 at 1:26 AM, <jonathan.sk...@googlemail.com> wrote:
> Presumably this is *not* backwardly compatible - i.e. data written > using a message with the packed encoding can't be read by older > clients. It can be ignored by older clients, since it uses an existing wire type. But adding or removing the packed option from a field is not a backwards-compatible change, no. > Will add test case in C# code. No idea whether it will work without > trying, unfortunately. My understanding is that most regex implementations use recursive matching because it is the only way to implement back-references. Personally I've never used a back-reference but apparently many people feel they are necessary. Apparently back-references turn regular expression matching into an NP-complete problem. Of course, being NP complete sort of directly contradicts the whole point of regular expressions in the theoretical sense. Go figure. Point being, the C# code probably has the same problem. Further reading: http://swtch.com/~rsc/regexp/regexp1.html --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Protocol Buffers" group. To post to this group, send email to protobuf@googlegroups.com To unsubscribe from this group, send email to protobuf+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/protobuf?hl=en -~----------~----~----~----~------~----~------~--~---
