)]}'
{
  "commit": "bca3bed137d013d4a654ffec52c0d44a3202aab2",
  "tree": "dbaf0f2728c80eeb88ced23dac4a4a8f77b9d484",
  "parents": [
    "7fb9287c45d8cb176a59378f98c6eaccb5f8968b"
  ],
  "author": {
    "name": "Adam Cozzette",
    "email": "acozzette@google.com",
    "time": "Mon Jul 31 11:31:29 2023 -0700"
  },
  "committer": {
    "name": "Copybara-Service",
    "email": "copybara-worker@google.com",
    "time": "Mon Jul 31 11:36:23 2023 -0700"
  },
  "message": "Introduce recursion limit in Java text format parsing\n\nThis will make the text format parser reject inputs that have a nesting depth\ngreater than 150. We will soon lower this number down to 100 for consistency\nwith other implementations.\n\nFor use cases that rely on parsing deeply nested text protos, it is possible to\ncreate a Parser with a custom recursion limit like this:\n`TextFormat.Parser.newBuilder().setRecursionLimit(i).build()`.\n\nPiperOrigin-RevId: 552543574\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "6d9f378890bd4742e0260db9a73fd60b62d099ed",
      "old_mode": 33188,
      "old_path": "java/core/src/main/java/com/google/protobuf/TextFormat.java",
      "new_id": "6c407cac5137ec834e9da33ef3a4b21befc93a2b",
      "new_mode": 33188,
      "new_path": "java/core/src/main/java/com/google/protobuf/TextFormat.java"
    },
    {
      "type": "modify",
      "old_id": "c933504bd81530b33d30dd647d8870029d086b84",
      "old_mode": 33188,
      "old_path": "java/core/src/test/java/com/google/protobuf/TextFormatTest.java",
      "new_id": "ec5f9742842485572b4e50325e3969384e3c506d",
      "new_mode": 33188,
      "new_path": "java/core/src/test/java/com/google/protobuf/TextFormatTest.java"
    }
  ]
}