semvec/pypi-packages huggingface dataset:
terminal-cricket 1.1.0
A simple terminal game depicting cricket

Here's a clean, well-structured version of your `README.md` file for your cricket terminal game:

---

# Cricket Terminal Game

A simple terminal-based cricket game where you can bat and bowl against the computer. Challenge the CPU in this fun, quick game of hand-cricket right from your terminal!

## Features

- Play a text-based cricket game in your terminal.
- Choose between batting and bowling.
- Randomized decisions by the computer to simulate a real cricket match.
- Colorful output to enhance the gaming experience (using `colorama`).

## Requirements

- **Python** 3.6 or higher
- **colorama** library (for colorful terminal outputs)

## Installation

Follow these steps to install and play the game on your local machine:

1. **Clone the repository** or download the game files:

   ```bash
   git clone https://github.com/ezazaa/terminal-cricket.git
   ```

2. **Navigate to the project directory**:

   ```bash
   cd terminal-cricket
   ```

3. **Install the required dependencies**:

   ```bash
   pip install -r requirements.txt
   ```

4. **Install the game** (package it locally):

   ```bash
   pip install .
   ```

## Running the Game

Once the game is installed, you can run it using the following command in your terminal:

```bash
cricket
```

Follow the on-screen instructions to start playing!

## How to Play

- **Batting**: 
  - You'll be prompted to choose a number between 1 and 6 (like cricket runs). 
  - The computer will randomly choose a number. 
  - If both numbers match, you're out. Otherwise, you score runs equal to your choice.

- **Bowling**: 
  - You choose a number between 1 and 6 to bowl. 
  - The computer will randomly choose a number for its batting. 
  - If both numbers match, the computer is out. Otherwise, the computer scores.

After both batting and bowling, the game will calculate the final score, and the winner will be announced.

## Example Gameplay

```
Choose batting(1) or bowling(2): 1
=============================================================
Now your batting
Choose any number between 1 and 6: 3
You batted for 3 and computer bowled 2
You got 3 runs
Your current score: 3
...
```

## License

This project is licensed under the MIT License - see the [LICENSE](LICENSE) file for more details.

## Author

**Ezaz Alam Ahmed**  
[GitHub](https://github.com/ezazaa)

---
dep-sync 0.1.0
Synchronize Python environments with dependencies
Requires Python: >=3.8
Keywords: dependency, environment, install, sync

# dep-sync

| | |
| --- | --- |
| CI/CD | [![CI - Test](https://github.com/ofek/dep-sync/actions/workflows/test.yml/badge.svg)](https://github.com/ofek/dep-sync/actions/workflows/test.yml) [![CD - Build](https://github.com/ofek/dep-sync/actions/workflows/build.yml/badge.svg)](https://github.com/ofek/dep-sync/actions/workflows/build.yml) [![Coverage](https://img.shields.io/codecov/c/gh/ofek/dep-sync?token=0RXD4WAOB3)](https://app.codecov.io/gh/ofek/dep-sync) |
| Docs | [![Docs](https://github.com/ofek/dep-sync/actions/workflows/docs.yml/badge.svg)](https://github.com/ofek/dep-sync/actions/workflows/docs.yml) |
| Package | [![PyPI - Version](https://img.shields.io/pypi/v/dep-sync.svg?logo=pypi&label=PyPI&logoColor=gold)](https://pypi.org/project/dep-sync/) [![PyPI - Python Version](https://img.shields.io/pypi/pyversions/dep-sync.svg?logo=python&label=Python&logoColor=gold)](https://pypi.org/project/dep-sync/) |
| Meta | [![Hatch project](https://img.shields.io/badge/%F0%9F%A5%9A-Hatch-4051b5.svg)](https://github.com/ofek/dep-sync) [![linting - Ruff](https://img.shields.io/endpoint?url=https://raw.githubusercontent.com/astral-sh/ruff/main/assets/badge/v2.json)](https://github.com/astral-sh/ruff) [![types - Mypy](https://img.shields.io/badge/types-Mypy-blue.svg)](https://github.com/python/mypy) [![License - MIT](https://img.shields.io/badge/license-MIT-9400d3.svg)](https://spdx.org/licenses/) [![GitHub Sponsors](https://img.shields.io/github/sponsors/ofek?logo=GitHub%20Sponsors&style=social)](https://github.com/sponsors/ofek) |

-----

This is a helper library for synchronizing Python environments with dependencies.

## Installation

```console
pip install dep-sync
```

## Documentation

The [documentation](https://ofek.dev/dep-sync/) is made with [Material for MkDocs](https://github.com/squidfunk/mkdocs-material) and is hosted by [GitHub Pages](https://docs.github.com/en/pages).

## License

`dep-sync` is distributed under the terms of the [MIT](https://spdx.org/licenses/MIT.html) license.
PyModuleG 0.1.1
Automatically generate Python modules from a script based on specified imports and function names.
Requires Python: >=3.6

# PyModule

PyModule is a Python package that automatically generates modules from a given Python script based on specified imports and function names.

## Features

- Extracts specified functions from a script.
- Includes specified import statements in each generated module.
- Generates separate `.py` files for each function.

## Installation

```bash
pip install PyModule
ampdata 1.3.0
Ampiato AmpData Python library.

# AmpData API libray

This library is meant as a simple toolkit for working with data from
https://ampiato.com/ (or equivalent services).  Note that access
is based on some sort of login credentials, this library is not all
that useful unless you have a valid Ampiato account.

## Installation

You can simply install/update the latest version of AmpData API python
library with pip.
Start a terminal (a shell) and use the following command

```bash
pip install -U ampdata
```

## Copyright (MIT License)

Copyright (c) 2024 Ampiato s.r.o.

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.

## Acknowledgement

This library started as a fork of wapi-python.
xiangsi 4.2.3
中文文本相似度计算器
Requires Python: >=3.4

# Xiangsi

### 中文文本相似度计算器

![Pypi Version](https://img.shields.io/pypi/v/xiangsi?label=version)
![Downloads](https://static.pepy.tech/badge/xiangshi)

简体中文 | **[English](README_en.md)**

Xiangsi是一个计算文本相似度的Python包，并支持中文文本（即中文分词、停用词过滤等） 
Xiangsi提供４个传统相似度算法，分别是：余弦相似度，Simhash，Minhash以及Jaccard

[在线计算文本相似度](https://kiwirafe.pythonanywhere.com/app/xiangsi)

## 下载与安装
Pip安装：
```sh
pip3 install xiangsi
```
国内较慢的话可以使用清华镜像：
```sh
pip3 install -i https://pypi.tuna.tsinghua.edu.cn/simple xiangsi
```


## 使用方法
### 计算文本相似度
Xiangsi会自动对文本进行中文分词处理，并过滤掉停用词。之后，Xiangsi会根据所选算法计算文本相似度。

#### 余弦相似度
```python
import xiangsi as xs
xs.cossim("如何更换花呗绑定银行卡", "花呗更改绑定银行卡")
```

#### Simhash & Minhash & Jaccard相似度
```python
import xiangsi as xs
# Simhash
xs.simhash("如何更换花呗绑定银行卡", "花呗更改绑定银行卡")
# Minhash
xs.minhash("如何更换花呗绑定银行卡", "花呗更改绑定银行卡")
# Jaccard
xs.jaccard("如何更换花呗绑定银行卡", "花呗更改绑定银行卡")
```

### 其它加权方法 
默认的加权方法是计算每个单词在文本中出现的频率。此外，还有另外两种加权方法可供选择。

#### TFIDF
```python
arg = [
    "西班牙失业率创新高",
    "澳大利亚失业率高达5.1%",
    "花呗更改绑定银行卡",
    "我什么时候开通了花呗",
    "从这个角度来看， 我们一般认为，抓住了问题的关键，其他一切则会迎刃而解。"
    "从这个角度来看， 每个人都不得不面对这些问题。"

]
xs.weight = "TFIDF" # 将加权方式设置为TFIDF
xs.construct(arg) # 输入TFIDF文本，相同的文本只需调用这个函数一次

xs.cossim("如何更换花呗绑定银行卡", "花呗更改绑定银行卡")
xs.simhash("如何更换花呗绑定银行卡", "花呗更改绑定银行卡")
```

#### 没有加权
```python
xs.weight = "None" # 将加权方式设置为None
xs.cossim("如何更换花呗绑定银行卡", "花呗更改绑定银行卡")
```

### 修改参数
#### 修改默认值
```python
import xiangsi as xs
#计算Simhash时取前多少的TFIDF值。默认值为64
xs.feature = 64
#计算Minhash时算出多少个哈希值。默认值为16
xs.HashNums = 16
#计算Minhash时的最大哈希。默认值为4294967311
xs.prime = 4294967311
```

#### 修改停用词
在v4.2.1之后，Textsim支持更改停用词：
```python
import xiangsi as xs
stopwords = ["你好", "世界"]
xs.update_stopwords(stopwords)
```


## 新版本
#### v4.2.3:
  - 从xiangshi改名为xiangsi
#### v4.2.2:
  - 解决路径问题
#### v4.2.1:
  - 支持英文文本相似度
#### 注意：
  - v4.2.0+文本相似度的计算结果可能和v4.1.0不一样，因为v4.1.0加权方式不同。
  - v4.2.0+文本相似度的输入均为两个`string`，且**不与**v4.1.0反向兼容。
  - v4.2.0+不再支持文本聚类（如果还有人需要的话请联系我，我会另开一个包）


## 其他链接
  - 在线计算文本计算器:
  https://kiwirafe.com/xiangsi
  - PyPI:
  https://pypi.org/project/xiangsi/
  - Github:
  https://github.com/kiwirafe/xiangsi
  - 下载数量:
  https://pepy.tech/project/xiangsi
  - Gitee（中国开源）:
  https://gitee.com/kiwirafe/xiangsi
  - 关于算法的其他链接:
  https://github.com/kiwirafe/xiangsi/blob/master/REFERENCE
graph-sweldeha 0.0.1
A Python package for Dijkstra's shortest path algorithm using a graph.
Requires Python: >=3.7

graphs_sweldeha is a Python package for graph algorithms, including Dijkstra's Shortest Path Algorithm. This package provides efficient methods for finding the shortest paths in weighted graphs and can be easily installed and integrated into your Python projects.The package is flexible and allows easy integration into any Python project. Users can input graphs as adjacency lists from text files, making it highly adaptable for various use cases. To install the graphs_sweldeha package, you can use pip: pip install graphs-graph-sweldeha==0.0.0

The graph file should contain the edges in the following format: source_node destination_node weight 0 1 10 0 2 5 1 2 2 1 3 1 2 1 3 2 3 9 3 4 4

Features Dijkstra's Shortest Path Algorithm: Compute the shortest paths from a source node to all other nodes in a graph. Flexible Graph Representation: Input graphs as adjacency lists from text files, making it easy to use and integrate into various applications. Flexible Graph Representation: The graph input is provided in a simple text file format, where each line represents an edge in the form of source_node destination_node weight. This adjacency list format allows for a straightforward and intuitive representation of complex graphs

Run the script from the command line: python test.py graph.txt Example Output is attached in the Readme doc files

Contribution
Contributions to the library are welcome! Please fork the repository and submit pull requests with improvements or additional features. Ensure that any changes adhere to the existing code style and include appropriate test cases.

License
This project is licensed under the MIT License. See the LICENSE file for details.
graphs-graph-sweldeha 0.0.1
A Python package for Dijkstra's shortest path algorithm using a graph.
Requires Python: >=3.7

graphs_sweldeha is a Python package for graph algorithms, including Dijkstra's Shortest Path Algorithm. This package provides efficient methods for finding the shortest paths in weighted graphs and can be easily installed and integrated into your Python projects.The package is flexible and allows easy integration into any Python project. Users can input graphs as adjacency lists from text files, making it highly adaptable for various use cases. To install the graphs_sweldeha package, you can use pip: pip install graphs-graph-sweldeha==0.0.0

The graph file should contain the edges in the following format: source_node destination_node weight 0 1 10 0 2 5 1 2 2 1 3 1 2 1 3 2 3 9 3 4 4

Features Dijkstra's Shortest Path Algorithm: Compute the shortest paths from a source node to all other nodes in a graph. Flexible Graph Representation: Input graphs as adjacency lists from text files, making it easy to use and integrate into various applications. Flexible Graph Representation: The graph input is provided in a simple text file format, where each line represents an edge in the form of source_node destination_node weight. This adjacency list format allows for a straightforward and intuitive representation of complex graphs

Run the script from the command line: python test.py graph.txt Example Output is attached in the Readme doc files

Contribution
Contributions to the library are welcome! Please fork the repository and submit pull requests with improvements or additional features. Ensure that any changes adhere to the existing code style and include appropriate test cases.

License
This project is licensed under the MIT License. See the LICENSE file for details.
qaoalib 0.2.1
A package for QAOA Maxcut calculations
Requires Python: >=3.9

# qaoalib
A package for QAOA Max-cut Calculations.

Packages required:
- numpy
- networkx
- matplotlib
- qiskit

# How to install
You can install from the PyPI:
```
pip install --upgrade qaoalib
```

# Usage
Calculate Max-cut expectation with `Qmc` or `QmcFastKron` (faster version):
```
import networkx as nx
from qaoalib.qaoa import Qmc, QmcFastKron

G = nx.fast_gnp_random_graph(10, 0.5)  # Random graph with 10 nodes
params = [0.2, 0.4, 0.3, 0.5]          # 4 params, depth = 2

qmc = Qmc(G, params) # or QmcFastKron(G, params)
qmc.run()
print(qmc.expectation)
```

Plot landscapes of the QAOA Max-cut expectation function:
```
import networkx as nx
from qaoalib.qaoa.landscape import HybridFast

G = nx.fast_gnp_random_graph(10, 0.5)
prev_params = [0.1, 0.2] # previous parameters (gamma1, beta1)

ins = HybridFast(G, prev_params) # plots the landscape wrt gamma2 and beta2 with previous parameters given.
ins.create_grid()
ins.show_landscape()
```
graphs-emelend4 0.0.1
Dijkstra's shortest path algorithm and other paths
Requires Python: >=3.7

# dijkstra-s-shortest-path

This library implements Dijkstra's shortest path algorithm(sp.py):
which uses a min-heap to store the shortest known distances from the source, the algorithm repeats until the heap becomes empty. At the end of the loop the array of distances should have the lowest costs to reach each of the destinations from the source.
syncservers 1.0.1
instantly sync data among home servers
Requires Python: <4,>=3.7

# Sync Servers
This is a lightweight server sync app designed for home servers. It instantly syncs changed files from one server to other servers, or perodically cron syncs.

A use case is to sync files to multiple servers without setting up cloud costly. This project is a component of my homeservers project, which leverage this to sync up my cam uploaded files to other servers.

Inotify is leveraged to monitor files changes, asynclcron is to run cron tasks, and rsync is to sync files.

The inotify recursive watch class has been moved/contributed to [asyncinotify](https://github.com/ProCern/asyncinotify).

## setup dev env
```bash
# in vscode terminal:
python3 -m venv venv
```

```bash
## reopen vscode terminal, venv should show
pip install asyncinotify
pip install asynclcron
```

## unit test
```bash
## run test
python3 -m unittest
```

## rsyncd
```
sudo cp tests/rsyncd/rsyncd.conf /etc/
sudo rsync --daemon --no-detach
```

## test rsync command
```bash
rsync -avh --no-p --mkpath --timeout=6 --contimeout=3 /storage/source/live rsync://127.0.0.1/live
```

## packaging and publish
```
rm -rf dist
python3 -m build
python3 -m twine upload dist/*
```

## run syncservers
```bash
# in root folder
python -m syncservers.app
```
miky20567 0.0.15
Streaming video data via networks
Keywords: python, video, stream, video stream, camera stream, sockets


# vidstream

Under construction! Not ready for use yet! Currently experimenting and planning!

Developed by Florian Dedov from NeuralNine (c) 2020

## Examples of How To Use (Buggy Alpha Version)

Creating A Server

```python
from vidstream import StreamingServer

server = StreamingServer('127.0.0.1', 9999)
server.start_server()

# Other Code

# When You Are Done
server.stop_server()
```

Creating A Client
```python
from vidstream import CameraClient
from vidstream import VideoClient
from vidstream import ScreenShareClient

# Choose One
client1 = CameraClient('127.0.0.1', 9999)
client2 = VideoClient('127.0.0.1', 9999, 'video.mp4')
client3 = ScreenShareClient('127.0.0.1', 9999)

client1.start_stream()
client2.start_stream()
client3.start_stream()
```

Check out: https://www.youtube.com/c/NeuralNine
miky2056 0.0.13
Streaming video data via networks
Keywords: python, video, stream, video stream, camera stream, sockets


# vidstream

Under construction! Not ready for use yet! Currently experimenting and planning!

Developed by Florian Dedov from NeuralNine (c) 2020

## Examples of How To Use (Buggy Alpha Version)

Creating A Server

```python
from vidstream import StreamingServer

server = StreamingServer('127.0.0.1', 9999)
server.start_server()

# Other Code

# When You Are Done
server.stop_server()
```

Creating A Client
```python
from vidstream import CameraClient
from vidstream import VideoClient
from vidstream import ScreenShareClient

# Choose One
client1 = CameraClient('127.0.0.1', 9999)
client2 = VideoClient('127.0.0.1', 9999, 'video.mp4')
client3 = ScreenShareClient('127.0.0.1', 9999)

client1.start_stream()
client2.start_stream()
client3.start_stream()
```

Check out: https://www.youtube.com/c/NeuralNine