semvec/pypi-packages huggingface dataset:
yxr-porn-core 0.0.1.33
python3.9+ library for crawling porn sites
Requires Python: >=3.9

# yxr-porn-core

[![Hatch project](https://img.shields.io/badge/%F0%9F%A5%9A-Hatch-4051b5.svg)](https://github.com/pypa/hatch)

python3.8+ library for crawling porn sites

[User Docs](https://cromarmot.github.com/yxr-porn-core)
structurefinder 87
Search X-ray structures on your hard drive
Requires Python: >=3.10

[![Packaging Status](https://repology.org/badge/vertical-allrepos/python:structurefinder.svg)](https://repology.org/project/python:structurefinder/versions)


![Lates Release](https://img.shields.io/github/v/tag/dkratzert/StructureFinder?label=Latest%20Release)
[![Unit Tests](https://github.com/dkratzert/StructureFinder/actions/workflows/python-app_windows.yml/badge.svg?branch=master)](https://github.com/dkratzert/StructureFinder/actions/workflows/python-app_windows.yml)
![Contributions](https://img.shields.io/badge/contributions-welcome-blue)

# StructureFinder
A crystal structure finder written in PyQt5 and Python3 with SQlite.

[Homepage: https://dkratzert.de/structurefinder.html](https://dkratzert.de/structurefinder.html)

![Program Window](https://github.com/dkratzert/StructureFinder/blob/master/docs/pics/strf_1.png?raw=true)
esp-idf-size 2.1.0
Firmware size analysis for ESP-IDF
Requires Python: >=3.7
Keywords: espressif, embedded, project, size

# esp-idf-size

In the field of IoT development, memory constraints are a common challenge,
often requiring developers to optimize their application size. Whether it
involves ensuring the firmware fits within available flash memory or analyzing
impact of code changes on the final  binary size, effective firmware size
management is essential for resource efficiency.  The esp-idf-size tool
provides developers with the means to explore statically allocated RAM used by
the final binary firmware image generated by
[ESP-IDF](https://github.com/espressif/esp-idf) SDK for Espressif devices.

The `esp-idf-size` tool is included in the ESP-IDF and is installed
automatically. It can be accessed using the `idf.py` command or the
`idf_size.py` wrapper. The `idf.py` command provides access to the most
commonly used `esp-idf-size` commands and automatically sets some options for
user convenience, while the `idf_size.py` wrapper allows full access to all
`esp-idf-size` features. For more information on using `esp-idf-size` in
ESP-IDF, please refer to
[Minimizing Binary Size](https://docs.espressif.com/projects/esp-idf/en/stable/api-guides/performance/size.html).


Starting from version 2.0.0, `esp-idf-size` uses the new generation (NG) 
implementation by default, providing improved performance and additional features
compared to the legacy version.

**Breaking Changes in v2.0.0:**
- The new generation functionality is now the default behavior
- Legacy `--ng` flag and `ESP_IDF_SIZE_NG` environment variable are no longer needed
- Output formats may differ from the legacy version (`json` vs `json2`)

**Migration Guide:**
- Remove `--ng` flags from your commands - the new functionality is now default
- Update any imports from `esp_idf_size.ng` to `esp_idf_size`
- Review and update any scripts that parse the output format

For more detailed information about the available features and options, please refer to the
documentation available [here](esp_idf_size/docs/readme.md).
graphnode 1.1.0
Python package for creating and manipulating graphs and networks
Requires Python: >=3.7
Keywords: Networks, Graph Theory, Mathematics, network, graph, discrete mathematics, math

graphnode
=========

graphnode is a Python package for the creation, manipulation,
and study of the structure, dynamics, and functions of complex networks.

- **Website (including documentation):** https://networkx.org
- **Mailing list:** https://groups.google.com/forum/#!forum/networkx-discuss
- **Source:** https://github.com/scottytucker/graphnode
- **Bug reports:** https://github.com/scottytucker/graphnode/issues
- **Tutorial:** https://networkx.org/documentation/latest/tutorial.html
- **GitHub Discussions:** https://github.com/scottytucker/graphnode/discussions

Simple example
--------------

Find the shortest path between two nodes in an undirected graph:

.. code:: python

   >>> import graphnode as nx
   >>> G = nx.Graph()
   >>> G.add_edge('A', 'B', weight=4)
   >>> G.add_edge('B', 'D', weight=2)
   >>> G.add_edge('A', 'C', weight=3)
   >>> G.add_edge('C', 'D', weight=4)
   >>> nx.shortest_path(G, 'A', 'D', weight='weight')
   ['A', 'B', 'D']

Install
-------

Install the latest version of graphnode::

   $ pip install graphnode

Install with all optional dependencies::

   $ pip install graphnode[all]

For additional details, please see `INSTALL.rst`.

Bugs
----

Please report any bugs that you find `here <https://github.com/scottytucker/graphnode/issues>`_.
Or, even better, fork the repository on `GitHub <https://github.com/scottytucker/graphnode>`_
and create a pull request (PR). We welcome all changes, big or small, and we
will help you make the PR if you are new to `git` (just ask on the issue and/or
see `CONTRIBUTING.rst`).

License
-------

Released under the 3-Clause BSD license (see `LICENSE.txt`)::

   Copyright (C) 2004-2021 graphnode Developers
   Scotty Tucker <scottytucker1@protonmail.com>