{"push_id":565774055,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"ebc7a8ee2149f4c88133127f380c0c175e0d1aff","before":"6d7bedcdcf299383f73c1a53a65182b31ab8cd02","commits":[{"sha":"330e733c67c150d57ed63449d06758b3cbe6a2d9","author":{"email":"447c1d2d4018f0871a8d9a5cec12ab625a380bda@intel.com","name":"Jianxin Xiong"},"message":"include: implement \"remove-first-match\" function for linked list\n\nData structures such as receive queue often require the capability\nof finding the first item in the queue that satisfiesd certain\nconditions and remove it from the queue. This patch adds such\nfunction to both the single and double linked list implementation.\n\nSigned-off-by: Jianxin Xiong <jianxin.xiong@intel.com>","distinct":true,"url":"https://api.github.com/repos/ofiwg/libfabric/commits/330e733c67c150d57ed63449d06758b3cbe6a2d9"},{"sha":"ebc7a8ee2149f4c88133127f380c0c175e0d1aff","author":{"email":"9575f92314b8ac7581ac1b2afb880058b7fbd431@intel.com","name":"Sean Hefty"},"message":"Merge pull request #591 from j-xiong/master\n\ninclude: implement \"remove-first-match\" function for linked list","distinct":true,"url":"https://api.github.com/repos/ofiwg/libfabric/commits/ebc7a8ee2149f4c88133127f380c0c175e0d1aff"}]}