)]}'
{
  "commit": "fb9c549bf7adbe195d7c370e39057d318b58853d",
  "tree": "584b93dd24e2221932b7e190a940a56d66481acb",
  "parents": [
    "523b21c71afebd06294dd6a1273b73ba0d9ef92f"
  ],
  "author": {
    "name": "Simon Mavi Stewart",
    "email": "simon.m.stewart@gmail.com",
    "time": "Fri Jan 09 09:32:12 2026 +0000"
  },
  "committer": {
    "name": "GitHub",
    "email": "noreply@github.com",
    "time": "Fri Jan 09 09:32:12 2026 +0000"
  },
  "message": "Optimize dependency graph building with O(1) lookups (#1483)\n\nReplace O(n²) linear searches with O(1) hash set lookups when checking\nif a dependency is in the requested deps list. Previously, isRequestedDep()\nwas called inside nested loops, doing a full stream().anyMatch() scan for\nevery dependency and child dependency, causing long delays on large\ndependency graphs.\n\nNow creates a Set\u003cString\u003e lookup cache at the start of parseDependencies()\nand uses constant-time contains() checks instead of linear scans.",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "02e73d5c28fb6044feecbc47b95209ab70411c4e",
      "old_mode": 33188,
      "old_path": "private/tools/java/com/github/bazelbuild/rules_jvm_external/resolver/gradle/GradleResolver.java",
      "new_id": "b68cc2b4c139eb56516f08e4beb186c3c5a1ccad",
      "new_mode": 33188,
      "new_path": "private/tools/java/com/github/bazelbuild/rules_jvm_external/resolver/gradle/GradleResolver.java"
    }
  ]
}