{"push_id":734370164,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"184469ca050d440874c2eff4bc2854bf8ae8cb0f","before":"9e0fc766515c3f4e8e7c16a815366c6c24a45a87","commits":[{"sha":"184469ca050d440874c2eff4bc2854bf8ae8cb0f","author":{"email":"e1dc5ea50faef0bbb92d1a0c276aaf04451b210a@overthemonkey.com","name":"Spencer Rinehart"},"message":"Don't die when there are no new commits after base tag.\n\nWhen there are no commits since the last tag at all and the graph is\nempty, this code was erroring when trying to call `getVertexMatch` (none\nwould match).  This updates it to use `getVerticesMatch` instead which\nreturns a set of vertices that match and doesn't error when there are\nnone.  This was done to be safest to all possible graphs.  Cyclic graphs\n(which shouldn't occur) would have no matches and would be treated the\nsame as an empty graph.  The other possibility that wasn't treated\nbefore was when there are multiple commits with no children (which\nshouldn't happen).  This will now also act the same as an empty graph.\nThis is implemented by just checking the count of commits with no\nchildren and if we don't find exactly one commit like that, return null\nfor the base commit, otherwise return that single commit.\n\nThe `firstParents` method also had to be updated to handle this `null`\nvalue.  By handling it in the `while` loop condition, we protect\nourselves for any potential cases where `$current` gets set to `null` in\nthe loop as well.  The behavior in either of these cases would be to\nbreak out of the loop and return the array so far.  For 0-commit graphs,\nthis would return an empty array as expected.\n\nThe calling code already knows how to handle an empty array of commits\nand rather than erroring out like was happening, it now prints a message\nsaying \"There were no unreleased changes found!\" like expected.","distinct":true,"url":"https://api.github.com/repos/nubs/release-notes/commits/184469ca050d440874c2eff4bc2854bf8ae8cb0f"}]}