semvec/pypi-packages huggingface dataset:
ghpr 1.0.0
Project to get data from github pull requests
License: MIT
Requires Python: >=3.6

# Github-pr-data
Project to get data from github pull requests and transfrom it to a format that can be used for 

* Bookeeping of the comments 
* Analysis of the comments
* AI analysis of the comments
* AI Categorization of the comments

### Development setup 

* Create a virtualenv with python3.6 (suggested location: `./virtualEnv`)
* Activate the virtualenv ```source ./virtualEnv/bin/activate```
* Install requirements ```pip install -r requirements.txt```
* Setup module in editable mode ``` pip install --editable .```. Meaning no need to install the module every time when you want to change the code.

### Reference

* Github API - https://docs.github.com/en/rest
* Github python SDK - https://pygithub.readthedocs.io/en/latest/
* Click command line interface - https://click.palletsprojects.com/en/8.0.x/documentation/
## CLI `ghpr`
`ghpr` is the command line interface for the project.

### Supported parameters:

This CLI supports the following parameters:

| Option | Description | Default value | Supported Values |  Required |
| --- | --- | --- | --- | --- |
| --token | The token to use for authentication.  |  |  | Yes|
| --pr-link | This is the pull request number. | | PR link  | yes |
| --copy | Copy output in markdown format | true | `true`/`false`  | No |
| --copy-csv | Copy output in csv format | false | `true`/`false`  | No |
generic-heap 1.0.1
Heap data structure,Gives a feel like using priority queue in Java and C++.
License: MIT
Keywords: python,Heap

ï»¿
Heap

	Heap data structure,Gives a feel like using priority queue in Java and C++.
	crete instance Heap(List,Key) Key can be any lambda or other function
	
	Eg:-
		do not mix datatypes other wise error may happen
		other wise customize the func to handle multipel datatypes

		def func(x):
			customize the function as you wish and return 

		l =[el1,el2,.......,eln]
	
		Initialization
		heap = Heap(l,key = lambda x: func(x)) <- user negative return value to implement max_hap , by default min_heap
	
		Eg:-
			heap = Heap(l,key = lambda x: func(x)) <- min heap
			heap = Heap(l,key = lambda x: -func(x)) <- max heap
	
			heap.show() <- it shows the entire heap

			heap.size() <- returns the size of the heap(no of element it contains)	

			heap.push(x) <- enter an element
	
			heap.pop() <- removes and returns the top most element

			heap.peek() <- returns the top element without removing it

			heap.empty() <- returns whether heap is empty or not
	
Installation

	copy from PyPi and paste to cmd and enter

How to use it?

	Import it in python script and use by creating Heap class Instance
	from generic_heap import Heap 

License

	Copyright 2021 Pritam Sarkar

This repository is licensed under the MIT license. See LICENSE for details.


Change Log
==========

0.0.1 (18/07/2021)
------------------
- First Release


1.0.1 (09/08/2021)
------------------
- First Release