semvec/pypi-packages huggingface dataset:
schwab-api-wrapper 0.3.1
A wrapper package around the schwab http api
Requires Python: >=3.10

# Schwab API Wrapper
# schwab-api-wrapper

## Redis configuration

When using `RedisClient`, the Redis connection is configured via a JSON file (see `redis_config.json`).

### TLS / SSL options

You can control transport security with two optional keys:
- `ssl` (bool): enable TLS for the Redis connection
- `ssl_verify` (bool): when `ssl: true`, verify the server certificate

Backwards-compatible behavior:
- If `ssl` is omitted, the client behaves like older versions: TLS is enabled when `ca_cert_path` is present; otherwise the connection is plaintext.
- If `ssl` is true and `ssl_verify` is omitted, verification defaults to true.

### Examples

Plaintext (insecure):

```json
{
  "host": "localhost",
  "port": 6379,
  "password": "your_password",
  "encryption_key": "your_fernet_key",
  "ssl": false
}
```

TLS with certificate verification (recommended):

```json
{
  "host": "your.redis.host",
  "port": 6379,
  "password": "your_password",
  "encryption_key": "your_fernet_key",
  "ssl": true,
  "ssl_verify": true,
  "ca_cert_path": "path/to/ca.crt"
}
```

TLS without certificate verification (insecure; vulnerable to MITM):

```json
{
  "host": "your.redis.host",
  "port": 6379,
  "password": "your_password",
  "encryption_key": "your_fernet_key",
  "ssl": true,
  "ssl_verify": false
}
```
networkx-reverse-topological-sort 0.1.0a0
Reverse topological sort utilities for NetworkX: easily stratify or sort nodes in a DAG from leaves to root.
Requires Python: >=2

# `networkx-reverse-topological-sort`

Reverse topological sort utilities for [NetworkX](https://networkx.org/): easily stratify or sort nodes in a DAG from leaves to root.

## Features

- **Reverse Topological Sort**: Get a valid reverse of NetworkX's `topological_sort`, yielding from "leaf" nodes up to roots.
- **Reverse Topological Generations**: Partition your DAG into generations in reverse order (each generation, all children are in earlier generations).

## Motivation

NetworkX includes tools for forward (root-to-leaf) topological traversals, but some applications (e.g., evaluating dependencies after their dependents, post-order processing, certain scheduling schemes) need the reverse order: leaves to root.

This tiny package offers that for `networkx`.

## Installation

```
pip install networkx-reverse-topological-sort
```

## Usage

```python
import networkx as nx
from networkx_reverse_topological_sort import (
    reverse_topological_generations,
    reverse_topological_sort,
)

DG = nx.DiGraph([(2, 1), (3, 1)])
print([sorted(generation) for generation in reverse_topological_generations(DG)])
# Output: [[1], [2, 3]]

print(list(reverse_topological_sort(DG)))
# Output: [1, 2, 3]  (or [1, 3, 2]: nodes before their parents)
```

## Contributing

Contributions are welcome! Please submit pull requests or open issues on the GitHub repository.

## License

This project is licensed under the [MIT License](LICENSE).