{"push_id":1805955444,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"7c5bd0c4df767888808cadff752797f19e16a2b3","before":"7c699a0a97bb2bdfd7d58235473558b378a474d6","commits":[{"sha":"7c5bd0c4df767888808cadff752797f19e16a2b3","author":{"name":"Dennis LLopis","email":"3b1ddc0566a257975b4fd0f4a8d0898d82224f0a@gmail.com"},"message":"2 Sample classes from Chapter 4 added\n\n* Queue - class implementation with an increment to count elements\n* QueueNoItemCount - class implementation without an increment\n\tThis technique allows the check of elements without a cost to\n\tperformance. isFull(), isEmpty(), size() - all benefit.","distinct":true,"url":"https://api.github.com/repos/Ninjastride/Data-Structures-Projects/commits/7c5bd0c4df767888808cadff752797f19e16a2b3"}]}
{"actor":{"display_login":"Ninjastride"}}