{"push_id":2314222319,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"648994a5fff0baa0172fc8f265b455af8c09a437","before":"f05bc7c345cb06e773acce769a35ffc254ae3ce7","commits":[{"sha":"648994a5fff0baa0172fc8f265b455af8c09a437","author":{"name":"Kevin C. Wells","email":"5723efc96c02e4b822f2cf05507718dc1e60f616@intel.com"},"message":"Refactor bundleset\n\nRefactor bundleSet code to:\n1) Loosen definition of bundleSet to simply a set, without\nadditional constraints. This allows the bundleSet to be built\nincrementally, instead of all-at-once, which in turn allows us to\nnot duplicate bundle parsing that happens elsewhere in the code.\nThe constraints (completeness and cycle-free), as well as the\ncomputation of the AllPackages field in each bundle, are moved to\na standalone \"validateAndFillBundleSet\" function.\n\n2) Separate out bundle file parsing into a standalone function,\nwhich allows code reuse elsewhere in the code.\n\n3) Move completeness checking into the sort function, thus\neliminating the need to cycle through the set an additional time.\n\n4) Add additional name validity checking, disallowing bundles with\nthe reserved names \"full\" and \"MoM\"\n\nThe above changes do not change the functionality of bundleset,\nbut improve efficiency and allow code reuse.\n\nAll tests have been updated, and additional tests of the bundle\nfile parsing function have been added.","distinct":true,"url":"https://api.github.com/repos/clearlinux/mixer-tools/commits/648994a5fff0baa0172fc8f265b455af8c09a437"}]}
{"actor":{"display_login":"tmarcu"}}