Metadata-Version: 2.1
Name: hipster
Version: 0.5
Summary: A simple implementation of the Min Heap and Max Heap
Home-page: https://github.com/soumasish/hipster
Author: Soumasish Goswami
Author-email: soumasish@gmail.com
License: MIT
Description: Hipster
        ======================
        
        
        ## Description
        Hipster provides a simple implementation of the MinHeap and MaxHeap. The object being added to the respective heaps need to implement the comparator logic. The APIs are identical for MinHeap and MaxHeap
        
        ## Dependencies
        Python 3
        
        ## Installation
        ```
        pip install --upgrade hipster
        ```
        
        ## Usage
        
        ```
        from hipster.heap import *
        
        max_heap = MaxHeap()           # creates an empty max heap
        max_heap.push(item)            # pushes a new item on the heap
        item = max_heap.peek()         # returns the largest item from the heap without removing it
        item = max_heap.pop()          # pops an item off the max heap
        max_heap.clear()               # Removes all items from the heap
        ```
        
        ## License
        MIT
        
        ## History
        ##### 0.5
        Added clear, fixed README
        
Platform: UNKNOWN
Classifier: License :: OSI Approved :: MIT License
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3.7
Description-Content-Type: text/markdown
