semvec/pypi-packages huggingface dataset:
web-scraping-bot-template 1.4.0
Tools that are useful for building web-scraping automated bots.
Keywords: python,bot,automated,web-scraping,python bot


    This package is a template for you
    to create your own bot using Python.
    In order to do that, you don't need to use 
    each method each time you create a new bot.
    The datas you collect using the 'get_hypertexts_links'
    are saved in a folder called 'datas.json'. You are free 
    to modify the path or the name, but I do not reccomend 
    this method.
ieebirdaligner 0.0.4
Implementation of Needleman-Wunsch and Hirschberg's Algorithm.
Requires Python: >=3.6

Alignment
=========

Implementation of Needleman-Wunsch and Hirschberg's Algorithm.

Usage
-----
	from alignment import Needleman, Hirschberg
	seqa = list('12345678')
	seqb = list('123478901')
	
	# Align using Needleman-Wunsch algorithm.
	n = Needleman()
	a,b = n.align(seqa, seqb)
	print a
	print b
	print

	# Align using Hirschberg's algorithm.
	h = Hirschberg()
	a,b = h.align(seqa,seqb)
	print a
	print b
	print

	# Score the alignment, the higher the score is,
	# the better the two sequences align.
	score = h.score(a, b)
	print score
	
	Output:
	12345678|||
	1234||78901

	12345678|||
	1234||78901
	
	# Score.
	20

Memory Usage
------------
Use `/usr/bin/time -v` to test the two algorithms time and memory usage.  
Input: A string of length 1400 and another string of length 1426, both encoded in UTF-8.  
  
Needleman-Wunsch  

	User time (seconds): 5.43
	System time (seconds): 0.04
	Percent of CPU this job got: 99%
	Elapsed (wall clock) time (h:mm:ss or m:ss): 0:05.48
	Maximum resident set size (kbytes): 33832
Hirschberg's  

	User time (seconds): 8.84
	System time (seconds): 0.00
	Percent of CPU this job got: 99%
	Elapsed (wall clock) time (h:mm:ss or m:ss): 0:08.89
	Maximum resident set size (kbytes): 3660

A Trick to Speed up
-------------------
Identify the maximum units which you want to align between original and altered text. For example, `[a-zA-Z]+|[0-9]+|\s+|[.,;!\(\)]+`. The alignment might be a little different from the one aligning every character, but it suffices my need and takes much less time. Use Hirschberg's algorithm with this trick on the same two strings,

	 User time (seconds): 1.19
	 System time (seconds): 0.00
	 Percent of CPU this job got: 99%
	 Elapsed (wall clock) time (h:mm:ss or m:ss): 0:01.20
	 Maximum resident set size (kbytes): 3608

Reference
---------
* http://en.wikipedia.org/wiki/Needleman%E2%80%93Wunsch_algorithm
* http://en.wikipedia.org/wiki/Hirschberg%27s_algorithm
* http://www.akira.ruc.dk/~keld/teaching/algoritmedesign_f03/Artikler/05/Hirschberg75.pdf
carrier.py 0.0.2
A package used for minor annoyances that I experience throught coding.
Requires Python: >=3.6

# carrier.py
carrier.py is a Python package/module that's used to save time when programming, it helps with functions such as 24 and 12 hour time, Discord webhooks, etc. These are all mainly things that I've been annoyed by because I keep forgetting the code and so I've just bundle it up into carrier.py 

# Installation
You will need Python 3.6+

```
# Linux/macOS
python3 -m pip install carrier.py

# Windows
py -3 -m pip install carrier.py
```

# Example
```py
import carrier
import time

while True:
    if carrier.Timecheck("22:30", "HM") == True: 
        print("It is 22:30 aka 10:30 PM.")
        exit()
    else:
        print("It is not 22:30 aka 10:30PM.")
    
    time.sleep(1) 
```