{"push_id":716118516,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"545152e285b374432fb6b5d355769ecb3f5a5fe5","before":"d1d726fa5cdbc5b6d88fc5dba4fc1dcc2fc93dbc","commits":[{"sha":"545152e285b374432fb6b5d355769ecb3f5a5fe5","author":{"email":"01d4434acb3394e9db1af690608510bea446be85@reading.ac.uk","name":"Daniel"},"message":"Understanding of m-trees improved and thus so flaws in the implementation arise.\n\nThe leaf nodes together contain every data entry so they now have an std::array containing shared pointers while the objects used to parent higher nodes use weak_ptrs. Additionally the capacity is now passed into the template.\n\nAlso added constructors to the tree node based structs. If you construct a tree node with a distance to parent it initialises the variant to use a routing object else it initialises it to be a leaf. This will probably be changed later but for now it's sufficient","distinct":true,"url":"https://api.github.com/repos/xd009642/m_tree/commits/545152e285b374432fb6b5d355769ecb3f5a5fe5"}]}