{"push_id":586097857,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"52b4425ae39d164ad5eac2c9b5be0edadaa33fb3","before":"19c2a7ff9b68e4968a69e51da9631d1bbfa294bf","commits":[{"sha":"2a4a37a33a75cfc9f4bc7f3f90a81a40cb048e0d","author":{"email":"859d2524afe9d1b926cf5c02089ad1cbab640cc0@opentext.com","name":"Peter Harris"},"message":"Add test for longestCommonPrefix","distinct":true,"url":"https://api.github.com/repos/peterh/liner/commits/2a4a37a33a75cfc9f4bc7f3f90a81a40cb048e0d"},{"sha":"52b4425ae39d164ad5eac2c9b5be0edadaa33fb3","author":{"email":"859d2524afe9d1b926cf5c02089ad1cbab640cc0@opentext.com","name":"Peter Harris"},"message":"Fix longestCommonPrefix operating on Unicode\n\n\"range\" operates on runes, but slicing operates on bytes.\n\nNote that this version does not account for combining characters. For\nexample, \"café\" and \"cafe\" will have a longest common prefix of \"caf\" if\nthe 'é' is composed, and \"cafe\" if the 'é' is decomposed. I'm not sure\nit's worth the effort it would take to change this behaviour, especially\nsince it's unclear what the correct behaviour is.","distinct":true,"url":"https://api.github.com/repos/peterh/liner/commits/52b4425ae39d164ad5eac2c9b5be0edadaa33fb3"}]}