)]}'
{
  "commit": "cfb02ddcad930c174d2466658072ffcc3b1d8517",
  "tree": "aacddc1b4056f947debcf3366bae66a318691ee3",
  "parents": [
    "439c50251faa4d029a18e302562efd097fd65135"
  ],
  "author": {
    "name": "Nathan E. Egge",
    "email": "negge@mozilla.com",
    "time": "Sun Jun 19 14:38:04 2016 -0400"
  },
  "committer": {
    "name": "Yaowu Xu",
    "email": "yaowu@google.com",
    "time": "Fri Oct 14 14:59:27 2016 -0700"
  },
  "message": "Add code to compute in-order mappings for tokens.\n\nAdd av1_indices_from_tree() function that computes a forward and inverse\n mapping of the tree leaf-node symbols to their in-order traversal.\nThis is necessary because many of the aom_tree binary trees have their\n leaf nodes out of order (e.g., an in-order traversal of a tree with n\n nodes does not start at symbol 0 and go to symbol n - 1), but the CDFs\n created by tree_to_cdf() are indexed in-order.\n\nChange-Id: Icd0dbed4c171a67c9e84a634106c4fdb5b1b3488\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "50be72413bc6d60d94146ebd9e672ff8804bf65c",
      "old_mode": 33188,
      "old_path": "av1/encoder/treewriter.c",
      "new_id": "742ffca23798e31923fd314bdce68140e1ba2525",
      "new_mode": 33188,
      "new_path": "av1/encoder/treewriter.c"
    },
    {
      "type": "modify",
      "old_id": "9a4cb86cb24d6561fd96f5503b8bade94ba144de",
      "old_mode": 33188,
      "old_path": "av1/encoder/treewriter.h",
      "new_id": "e16b43fcd85dbba5642fe448fd1013b7148ba8b5",
      "new_mode": 33188,
      "new_path": "av1/encoder/treewriter.h"
    }
  ]
}
