semvec/pypi-packages huggingface dataset:
biscuit 0.0.1
Biscuit web framework
License: MIT
Requires Python: >=3.6.0


# biscuit
A WSGI compliant web framework for [insert something cool here].

### Getting Started
Currently there are only a few aspects to be aware of.

Firstly, install the requirements:
```
pip install -r requirements.txt
```

Next you can run the tests via `pytest`

Finally, to start the example project run gunicorn like so:
```
gunicorn examples.basic_app:APP
```

#### How to contribute
Idk yet, just open some PRs dude
quantized 0.0.1a0
Quantifying Probabilistic Electron Transit times.
License: MIT
Requires Python: >=3.7.0,<4.0.0

# Transit-Chem

[Documentation Home](https://transit-chem.readthedocs.io)


Library for solving the time dependent schroedinger equation, 
and finding the probablilistic confidence of the time it takes for a quantum
particle to move from one place to another. Based on 
[this paper](https://www.worldscientific.com/doi/10.1142/S0219633618500463).

## Features

- Harmonic Oscillator Basis Functions
- Functional API for Solving the Time Independent/Time Dependent Schroedinger Equation
- Molecular manipulations: translation, rotation, etc
- Guaranteed 90%+ test coverage
- CLI for 1d transit time analysis
- Caching and optimizations for overlap and hamiltonian integrals
- Fully type hinted
- Logging and input validation, with helpful error messages


## License
[License](LICENSE.md)
py-matching-pattern 0.0.3
Dynamic Pattern Matching Library
License: MIT

# Python Pattern Matching

Inspired by [pampy](https://github.com/santinic/pampy) and [core.match](https://github.com/clojure/core.match), this is a pattern matching library for dynamic list of patterns.

Right now it only supports matching lists of same sizes.

## Usage

Import the lib

```python
import PatternMatchStore from py_matching_pattern
```

First you will add initialize a `PatternMatchStore` with a fixed size of keys to match (size of the list).

```python
pmdb = PatternMatchStore(keysize=3)
```

After that you can add the patterns. Every value is valid match, including `None`.

The "catch all" value is `default` attribute of the instance.

```python
_ = pmdb.default
pmdb.put(keys=["a","b","c"],value=1)
pmdb.put(keys=["a","b","b"],value=2)
pmdb.put(keys=["a","b",_],value=3)
pmdb.put(keys=["a",_,_],value=4)
pmdb.put(keys=["a",None,"c"],value=5)
pmdb.put(keys=["a",_,"d"],value=6)
```

These patterns are staged for the DB. This is useful if you reload the patterns from another thread.

To make the pattern live, you commit it.

```python
pmdb.commit()
```

Now you can finally start matching values:

```python
pmdb.get(keys=["a","b","c"])==1
pmdb.get(keys=["a","b","b"])==2
pmdb.get(keys=["a","b","d"])==3
pmdb.get(keys=["a","c","d"])==4
pmdb.get(keys=["a",None,"c"])==5
pmdb.get(keys=["a","e","d"])==6
pmdb.get(keys=["e","e","e"])==None
```

The staged patterns are kept between commits, so you can add or override to it later.

But in case you want to clean it:

```python
pmdb.clean()
```

It can also raise an exception if not found, but by default it will return `None`:

```python
pmdb = core.PatternMatchStore(keysize=3,raise_on_notfound=True)
pmdb.get(keys=["e","e","e"]) # raise KeyNotFound
```

## License

MIT