)]}'
{
  "commit": "24bfa4096413de656bb2143760d73b5c968f8ba1",
  "tree": "6e416e4f085bcf3082da3e61389aad8c497391f9",
  "parents": [
    "887c74a36551702f134b0a9c03f5db5c7a25ccee"
  ],
  "author": {
    "name": "Dhananjay Gundapu Jayakrishnan",
    "email": "dhananjay.jayakrishnan@proglove.de",
    "time": "Wed Aug 22 12:33:00 2018 +0200"
  },
  "committer": {
    "name": "Anas Nashif",
    "email": "anas.nashif@intel.com",
    "time": "Mon Oct 08 12:59:12 2018 -0400"
  },
  "message": "kernel: k_queue: extend k_queue API to append unique element\n\nk_queue has k_queue_append API which does not check if the element\u0027s\naddress already exists. This creates a problem if the same element\naddress is appended to queue. This forms circular list showing\nunintended behaviour for the application using queue. The proposed\nAPI k_queue_find_and_append takes care of checking if element exists\nalready before appending. This API is complimentary to k_queue_remove\nwhich checks if the queue element is present before removing.\n\nSigned-off-by: Dhananjay Gundapu Jayakrishnan \u003cdhananjay.jayakrishnan@proglove.de\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "72bcc4225b5873c43c7867f0c97f2a847afd1e02",
      "old_mode": 33188,
      "old_path": "include/kernel.h",
      "new_id": "6983fa17cadaa9f9c3c6e94b2f2768ec05b2ea09",
      "new_mode": 33188,
      "new_path": "include/kernel.h"
    }
  ]
}