)]}'
{
  "commit": "0659e98417197390ee16d304c51a27773b62c3af",
  "tree": "1c1ab5b125a7c0de7af764ad93c003bb265b47a2",
  "parents": [
    "cd0b2559d17fd5b7c0fbc8d01275bb3fd6b99f55"
  ],
  "author": {
    "name": "Travis Cross",
    "email": "tc@traviscross.com",
    "time": "Sun Nov 16 08:08:10 2025 +0000"
  },
  "committer": {
    "name": "Travis Cross",
    "email": "tc@traviscross.com",
    "time": "Tue Nov 18 21:52:40 2025 +0000"
  },
  "message": "Say \"dereference expressions\" in constant exprs list\n\nTo define what\u0027s allowed in a constant expression, we have a list that\nstarts with the text:\n\n\u003e The following expressions are constant expressions...\n\nCorrespondingly, most of the items in this list are stated in terms of\nbeing a \"this expression\" or a \"that expression\".  However, for deref,\nwe had instead said \"the dereference operator\".  Even though the\n`expr.deref` section is currently titled \"the dereference operator\",\nit seems more clear and consistent in the context of this list to talk\nabout dereference expressions, so let\u0027s do that.  These are\nexpressions, after all, The grammar production is named\n`DereferenceExpression`.\n\n(There is one other place in the list that we talk about operators:\n\"built-in negation, arithmetic, logical, comparison, or lazy boolean\noperators used on integer and floating point types, `bool`, and\n`char`.\"  Perhaps we\u0027ll reword that one later.  It stands out a bit\nless than this one did.)\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "35b14853360b4cdf607bf39fb6467d06eab4d6e8",
      "old_mode": 33188,
      "old_path": "src/const_eval.md",
      "new_id": "71f392dc3f8ab17fe7b755307ef1a1b1013ace09",
      "new_mode": 33188,
      "new_path": "src/const_eval.md"
    }
  ]
}