GitHub PushEvent at 2014-04-22 01:12:13
Repository: GeoGit
Actor: groldan
Payload: {"shas":[["f9ae8b4dee1bf19424fb616247cb5985e8e18ed4","e07a747ebfd9fe761b0c931682ce13e14bd58ac7@gmail.com","Added 'insert' command to insert arbitrary features in a simplified way","Victor Olaya",false],["635d4d659fe5d00d304a73e337dc0412e10e8c77","974542630cb512383db1b0fe1655271102bc7a7b@lmnsolutions.com","Refactored the LowestCommonAncestor algorithm to the op.","Johnathan Garrett",false],["9d42c3cf9f11e8c91fc7b15f1709970ed77f8047","974542630cb512383db1b0fe1655271102bc7a7b@lmnsolutions.com","Initial implementation of BDBJE graph database.","Johnathan Garrett",false],["c0d33766010188643083bc44204a619b4d04e4f4","974542630cb512383db1b0fe1655271102bc7a7b@lmnsolutions.com","Other graph backends now run FindCommonAncestor tests.","Johnathan Garrett",false],["37f71a9572358f002c991cae94dcb92a0f388130","974542630cb512383db1b0fe1655271102bc7a7b@lmnsolutions.com","Refactored the sparse path check out of the graph database.","Johnathan Garrett",false],["491bf6c841a24ce3fe301fb93318987112b55e17","308a21438efa655915eb945921d5d4b5f6294e06@gmail.com","Some JEGraphDatabase improvements.\n\n- Use a single transaction in put(ObjectId commitId, ImmutableList<ObjectId> parentIds)\n  to insert update the node and the parent nodes.\n- Use a more compact serialization format than default java serialization, based on BDBJE TupleBinding\n- Remove some dead code\n- Use its own environment, and the raw byte[] object id as key instead of a string. It uses a\n  separate database even if using the same environment than JEObjectDatabase so no need for the\n  extra overhead.","Gabriel Roldan",false],["d87f5b9881b47609e06b02363d5ab16dbf3c0093","974542630cb512383db1b0fe1655271102bc7a7b@lmnsolutions.com","Fixed an issue which caused clone to fail when tags were present.","Johnathan Garrett",false],["da000e0cae33844845064b3fb0f68cf966335268","308a21438efa655915eb945921d5d4b5f6294e06@gmail.com","Cleaner and possibly faster way to traverse diffs.\n\nIntroduces DiffTreeVisitor which traverses two trees in parallel, calling\na method of a provided DiffTreeVisitor.Consumer for each diff encountered\n(either a pair tree or feature Node, or Bucket), allowing the traversal\nto skip whole subtrees (both named subtrees or buckets subtrees) at the\ndiscretion of the Consumer implementation, as opposed to the traditional\nIterator<DiffEntry> approach (still used to report diffs).\n\nAdapted DiffBounds and DiffCount to use it, resulting in simpler code both\nand over 100 less lines of code for DiffCount, both being potentially much\nmore efficient.\n\nDiffTreeVisitor comes with over 97% unit test coverage.","Gabriel Roldan",false],["dc55f8a316c6cfa34bf879c701450e1bc14cf8d9","974542630cb512383db1b0fe1655271102bc7a7b@lmnsolutions.com","Merge pull request #700 from groldan/diff_traversal\n\nCleaner and possibly faster way to traverse diffs.","Johnathan Garrett",false],["d2de95fda65609c314bd71421d7826f1f5b33507","308a21438efa655915eb945921d5d4b5f6294e06@gmail.com","fix possible NPE","Gabriel Roldan",false],["6fb5457fe2bb0a348d4c584b0bcd524c3de058d5","974542630cb512383db1b0fe1655271102bc7a7b@lmnsolutions.com","Added javadocs to explain private methods of FindCommonAncestor.","Johnathan Garrett",false],["6d6535fe3f0213c974ff8900cd670be4d91826d4","974542630cb512383db1b0fe1655271102bc7a7b@lmnsolutions.com","Implemented minor performance gains.","Johnathan Garrett",false],["4a6e375fb43bed49fa4f3029851ff30050e2ca60","974542630cb512383db1b0fe1655271102bc7a7b@lmnsolutions.com","Merge pull request #699 from jdgarrett/lca-refactor\n\nRefactor out graph algorithms and build Berkeley Graph Database","Johnathan Garrett",false],["9e712644bae8e36bbd0ee2bcc57bac2bff4e8cf1","308a21438efa655915eb945921d5d4b5f6294e06@gmail.com","Merge pull request #670 from volaya/insert\n\nAdd 'insert' command to insert arbitrary features in a simplified way","Gabriel Roldan",false],["ecf9cc6f69504e05e653127d85e150ce3392f493","308a21438efa655915eb945921d5d4b5f6294e06@gmail.com","Use of a static DataStoreFactory in tests can cause pseudo random failures on parallel builds","Gabriel Roldan",true]],"size":15,"ref":"refs/heads/master","head":"ecf9cc6f69504e05e653127d85e150ce3392f493"}