{"push_id":733791389,"size":1,"distinct_size":1,"ref":"refs/heads/dfa","head":"7924ca8ea17924799d757a6190158a680ba908da","before":"887627260be93c3c48735be4610f5b8f239bb7a2","commits":[{"sha":"7924ca8ea17924799d757a6190158a680ba908da","author":{"email":"fa25b532e204f1d34fe92d8c736d71d104eef9d1@gmail.com","name":"Yichun Zhang (agentzh)"},"message":"re.pl: now we compute the minimum length of input to be consumed for each DFA node. this info can be used to optimize 0-width assertios requiring look-behind.","distinct":true,"url":"https://api.github.com/repos/openresty/sregex/commits/7924ca8ea17924799d757a6190158a680ba908da"}]}