semvec/pypi-packages huggingface dataset:
tabletexifier 0.3.4
Add your description here
Requires Python: >=3.6

# Goal of the project 

Provide an easy interface to create Tables that are not only printed nicely in the terminal, but can
also be easily exported to LaTeX code. It is also desired to easily create tables in the format required by multiple scientific journals.

Check the docs in here: https://tabletexifier.readthedocs.io/en/latest/


# How to Install

```
pip install tabletexifier
```

# Development

Create a virtual environment and run
```
pip install -r requirements_dev.txt
```
in order to install development dependencies.


In order to run the tests and see coverage reports, use
```
pytest --cov=. test --cov-report html
```
eezz 1.0.0
HTML User Interface for Python
Requires Python: >=3.11
Keywords: HTML, User Interface

Graphical User Interface for Python
===================================

EEZZ provides your application with a fast, easy to use and lightweight user interface.
- It is bidirectional  
- It is platform independent
- It is open source

The huge features list includes
- Tree, Grid and Input-Form Views
- Push Service
- Extended File Download
- Transparent Access to SQLite

Find an introduction and the documentation under the following links

- http://eezz.biz/eezz.pdf
- http://eezz.biz/index.html

The installation comes with zero administration and works right out of the box.
The package uses python integrated HTML server as default. 
After installation, you could start the server with the following command to activate the framework.

**python -m eezz.server**

The server starts a bootstrap and creates the local directory eezz/webroot with the necessary scripts and 
an example to start with. Now you could open http://localhost:8000,
and start your journey, visiting the examples and creating your own modules in **eezz/webroot/applications**.

To work more professional, I would recommend using https://nginx.org HTTP server and to copy the content of ./eezz/wesocket to /var/www/html. 
Activate the nginx WebSocket interface (see https://nginx.org/en/docs/http/websocket.html)
 and execute the following line:

**python -m eezz.server --webroot /var/www/html** 

EEZZ is your highway from prototype to product. It ensures shorter development cycles,
easier ways to test your software and it encourages parallelizing your tasks.
zlota-bukmacherska 0.1.0
Biblioteka do przewidywania correct score i typów zakładów
Requires Python: >=3.6

# ZĹ‚ota Bukmacherska

Biblioteka do przewidywania correct score i rĂłĹĽnych typĂłw zakĹ‚adĂłw, wykorzystujÄ…ca modele Machine Learning.
basalam.backbone-translation 1.0.1
Python Utilities & Basalam Micro-Services SDK
Requires Python: >=3.6

#### Requirements

- Python 3.6+

#### Installation & Upgrade

```shell
pip install basalam.backbone-translation
```

#### Usage

```python
from backbone_translation.translator import Translator

translator = Translator({
    "messages.greeting" : "Bonjour {name}"
})

# OR translator = Translator.from_json_file("path_to_json_file")

translator.translate("messages.greeting", name="Mojtabaa")
# Bonjour Mojtabaa
```

#### Testing

```bash
# install pytest
pip install pytest

# run tests
python -m pytest
```

#### Changelog
- 0.0.2 added from_json_file method
- 0.0.3 Now build and push are done using gitlab-ci
- 0.0.4 new `exists(phrase: str) -> bool` method
- 0.1.0 added utf-8 encoding thanks to alimohammayali@gmail.com
gcd-lcm-calculator 1.0.2
You can find the gcm (greatest common divisior) and lcm (least command multiplier) of the numbers. And also you can find the other values of the primity.

# GCD-LCM-Finder

You can find the gcm (greatest common divisior) and lcm (least command multiplier) of the numbers. And also you can find the other values of the primity.

### Installation
```
pip install gcd-lcm-calculator
```

On Python, you can use this library with this command
```
import gcdlcm
```
or
```
from gcdlcm import *
```
I will give this library's command with the second one.

### Commands:

## gcd(e, *b)
You can find the gcd (greatest common dividor) value with this function.
```
>>> gcd(18, 12)
6
>>> gcd(18, 12, 15)
3
```
You can enter as many arguments as you want to this function and get the gcd value.

## gcd(e, *k)
You can find the lcm (least common multiplier) value with this function.
```
>>> lcm(8, 10)
40
>>> lcm(8, 10, 15)
120
```
You can enter as many arguments as you want to this function and get the lcm value.

## getIntegerMultipliers(num)
You can get the number that you entered's multipliers with this function.
```
>>> getIntegerMultipliers(12)
[1, 2, 3, 4, 6, 12]
>>> getIntegerMultipliers(25)
[1, 5, 25]
>>> getIntegerMultipliers(30)
[1, 2, 3, 5, 6, 10, 15, 30]
```

## getPrimeMultipliers(num)
This function returns the prime factors of the value you enter according to their exponent values
```
>>> getPrimeMultipliers(20)
[[2, 2], [5, 1]]
>>> getIntegerMultipliers(51)
[[3, 1], [17, 1]]
>>> getIntegerMultipliers(300)
[[2, 2], [3, 1], [5, 2]]
```
<b>As an example:</b><br>
300's prime multipliers: 2, 3, 5<br>
2^2 * 3^1 * 5^2 = 300

## isPrime(num)
This function returns the number that you entered is prime number or not.
```
>>> isPrime(20)
False
>>> isPrime(17)
True
>>> isPrime(1)
False
```

## findPrimesUntil(num)
This function returns all primes up to this point.
```
>>> findPrimesUntil(20)
[2, 3, 5, 7, 11, 13, 17, 19]
>>> findPrimesUntil(43)
[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43]
```
If the number you enter is a prime number, this function also includes that number.

## isPrimeAmong(x, *y)
This function returns whether the numbers you enter are prime or not.
```
>>> isPrimeAmong(8, 10)
False
>>> isPrimeAmong(8, 10, 15)
True
>>> isPrimeAmong(12, 19)
True
```
You can enter as many arguments as you want to this function and get is these number prime among them or not.

## getMostPrime(x, *y)
This function returns the most prime form of the numbers you enter.
```
>>> getMostPrime(8, 10)
[4, 5]
>>> getMostPrime(12, 15, 18)
[4, 5, 6]
>>> getMostPrime(1920, 1080)
[16, 9]
```
You can enter as many arguments as you want to this function and get the most prime form of the numbers you entered.