)]}'
{
  "commit": "e8c2e9adaefa68b950bc28c1f3820c19de1e617e",
  "tree": "50ef9eb02be12bf9fec22bacc06985d351f4f1dd",
  "parents": [
    "4c05ef7a163fbc0645d3677d87b7470a8d88467d"
  ],
  "author": {
    "name": "Marie Janssen",
    "email": "jamuraa@google.com",
    "time": "Wed Sep 16 02:07:03 2026 +0000"
  },
  "committer": {
    "name": "CQ Bot Account",
    "email": "pigweed-scoped@luci-project-accounts.iam.gserviceaccount.com",
    "time": "Mon Nov 02 08:10:50 2026 -0800"
  },
  "message": "rust/bt-ascs: Add presentation delay range helpers\n\nA client has to request one Presentation_Delay per direction for all\nthe ASEs in a CIG (BAP v1.0.2 Section 7.1.3), but each ASE publishes\nits own range. Add helpers on PresentationDelayRange that combine those\nranges and pick a delay from the result.\n\nBAP v1.0.2 Section 5.6.2 makes the supported range a shall and the\npreferred range only a should, so the helpers treat them differently.\nIf the supported ranges have no value in common, combining fails.\nPreferred bounds never cause a failure. A bound outside the supported\nrange moves to the nearest supported bound, preferred bounds that cross\nare dropped, and a zero bound (ASCS v1.0.1 Table 4.3) means no\npreference. Combining normalizes the preferred bounds once, after\nmerging every range, because normalizing pair by pair gives an answer\nthat depends on the order of the ASEs.\n\nDecoding now rejects a range whose min is above its max, since no value\nin it can satisfy the shall.\n\nTest: cargo test -p bt-ascs\nChange-Id: I01e07e74ecac123bf3f4aa25d455f8136a6a6964\nReviewed-on: https://bluetooth-review.googlesource.com/c/bluetooth/+/4123\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "8107a5e2e84530dca69f036d4a8ce354e4700eff",
      "old_mode": 33188,
      "old_path": "rust/bt-ascs/src/types.rs",
      "new_id": "e39d943806e7b87a6c54e315abed567a642530fe",
      "new_mode": 33188,
      "new_path": "rust/bt-ascs/src/types.rs"
    }
  ]
}
