{"push_id":2534650107,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"87d6261ca1eae2adab31b654b9d53b81a8fd1a9f","before":"8b4435e95a19c31d88d06d16d4fa07eb7497f732","commits":[{"sha":"87d6261ca1eae2adab31b654b9d53b81a8fd1a9f","author":{"name":"KrigetsRex","email":"291f35bcd8ae87fa0a4ad9bede769bf3fc948c8f@users.noreply.github.com"},"message":"added creation of BTree using util and cache\n\nutil grabs the filename and returns 1 long string which is then broken up by the user's seqLen and these are converted into longs and then sequences.  if the sequence is a duplicate then it exists in the cache and its freq is incremented, else it is added to the cache and ultimately into the btree.  don't know how to dump the tree into a binary file yet","distinct":true,"url":"https://api.github.com/repos/KrigetsRex/BTree/commits/87d6261ca1eae2adab31b654b9d53b81a8fd1a9f"}]}
{"actor":{"display_login":"KrigetsRex"}}