semvec/pypi-packages huggingface dataset:
ocp-vtk 7.5.3.0
OCP+VTK wheel with shared library dependencies bundled.

# OCP

[![Build Status](https://dev.azure.com/cadquery/OCP/_apis/build/status/CadQuery.OCP?branchName=master)](https://dev.azure.com/cadquery/OCP/_build/latest?definitionId=5&branchName=master)
[![Anaconda-Server Badge](https://anaconda.org/cadquery/ocp/badges/installer/conda.svg)](https://conda.anaconda.org/cadquery)

Python wrapper for OCCT7.5.1 generated using pywrap. Typing stubs available [here](https://github.com/CadQuery/OCP-stubs).

## Goals
* Provide thin bindings to OCCT.
* Wrap all OCCT modules (if practical).
* React quickly to new OCCT releases.
* Cater primarily for the CadQuery project.

## Non-goals
* Provide additional functionality not present in OCCT

## Installation
The easiest way to get started is to use conda:
```
conda install -c conda-forge -c cadquery ocp
```
Building from sources is also possible using https://github.com/CadQuery/pywrap
```
pywrap all ocp.toml
cmake -S OCP -B build
cmake --build build
```
but you might need to specify additional headers and libclang location for pywrap:
```
pywrap -i path1/include -i path2/include -l path/to/libclang.so all ocp.toml
```
web3-wiki 2022.4.16.0
ApacheCN Web3 知识库
Requires Python: >=3.6

# ApacheCN Web3 知识库

> 协议：[CC BY-NC-SA 4.0](http://creativecommons.org/licenses/by-nc-sa/4.0/)
> 
> 收割 SB 的人会被 SB 们封神，试图唤醒 SB 的人是 SB 眼中的 SB。——SB 第三定律

* [在线阅读](https://w3w.apachecn.org)
* [在线阅读（Gitee）](https://apachecn.gitee.io/doc-template/)
* [ApacheCN 学习资源](http://docs.apachecn.org/)

## 贡献指南

请通过 ISSUE 提交想要收录的文章，负责人看到后就会处理。

## 联系方式

### 负责人

* [飞龙](https://github.com/wizardforcel): 562826179

### 其他

*   在我们的 [apachecn/web3-wiki](https://github.com/apachecn/web3-wiki) github 上提 issue.
*   发邮件到 Email: `apachecn@163.com`.
*   在我们的 [组织学习交流群](https://www.apachecn.org/#/docs/join) 中联系群主/管理员即可.

## 下载

### Docker

```
docker pull apachecn0/web3-wiki
docker run -tid -p <port>:80 apachecn0/web3-wiki
# 访问 http://localhost:{port} 查看文档
```

### PYPI

```
pip install web3-wiki
web3-wiki <port>
# 访问 http://localhost:{port} 查看文档
```

### NPM

```
npm install -g web3-wiki
web3-wiki <port>
# 访问 http://localhost:{port} 查看文档
```

## 赞助我们

![](http://data.apachecn.org/img/about/donate.jpg)
python-auto-wiki 2022.4.16.0
ApacheCN Python 自动化知识库
Requires Python: >=3.6

# ApacheCN Python 自动化知识库

> 协议：[CC BY-NC-SA 4.0](http://creativecommons.org/licenses/by-nc-sa/4.0/)
> 
> 利欲驱人万火牛，江湖浪迹一沙鸥。——陆游《秋思》

* [在线阅读](https://pyaw.apachecn.org)
* [在线阅读（Gitee）](https://apachecn.gitee.io/doc-template/)
* [ApacheCN 学习资源](http://docs.apachecn.org/)

## 贡献指南

请通过 ISSUE 提交想要收录的文章，负责人看到后就会处理。

## 联系方式

### 负责人

* [飞龙](https://github.com/wizardforcel): 562826179

### 其他

*   在我们的 [apachecn/python-auto-wiki](https://github.com/apachecn/python-auto-wiki) github 上提 issue.
*   发邮件到 Email: `apachecn@163.com`.
*   在我们的 [组织学习交流群](https://www.apachecn.org/#/docs/join) 中联系群主/管理员即可.

## 下载

### Docker

```
docker pull apachecn0/python-auto-wiki
docker run -tid -p <port>:80 apachecn0/python-auto-wiki
# 访问 http://localhost:{port} 查看文档
```

### PYPI

```
pip install python-auto-wiki
python-auto-wiki <port>
# 访问 http://localhost:{port} 查看文档
```

### NPM

```
npm install -g python-auto-wiki
python-auto-wiki <port>
# 访问 http://localhost:{port} 查看文档
```

## 赞助我们

![](http://data.apachecn.org/img/about/donate.jpg)
mtsp-routing 1.1.0
Solve multiple traveling salesman problem (MTSP)
Requires Python: >=3.7

[RU](https://github.com/bkarpov/mtsp-routing-core/blob/main/README.ru.md)

# mtsp-routing-core

Solve the multiple travelling salesman problem (MTSP).

---

## Initial data
1. A - list of destinations, all vertices from which should be reachable in graph G
2. K - number of clusters
3. G - strongly connected weighted graph represented by adjacency lists. The weight of an edge is equal to its length 
   1. n - number of vertices in the graph
   2. m - number of edges

---

## Algorithm

### I. Check that points from A are reachable in G
The time complexity is O(n<sup>2</sup>).

### II. Divide points from A into clusters
The time complexity of 1 iteration of the algorithm is O(n<sup>2</sup> * m * log(n * P)), P is the largest edge length.

Iteration limit = 1000.

The [Constrained K-Means](https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/tr-2000-65.pdf)
algorithm is used for clustering points.

To solve the minimum-cost flow problem (MCFP), the
[Google OR-Tools](https://developers.google.com/optimization/flow/mincostflow) library is used.

### III. Solve the travelling salesman problem (TSP) in each cluster

Execution time in seconds = 30 * K / C, C - number of available processes.
You can use no more than 1 process on 1 logical processor.

A genetic algorithm is used to solve the problem. The search for a solution for 1 cluster takes 30 seconds.

### IV. Build a route in each cluster

The time complexity is O(n * m).

To build a route between two vertices, the A* algorithm is used.

---

## API

### 1. Build routes
   1. Input - a list with destinations, the number of routes, a graph with a road network
   2. Output - an iterator that returns tuples with two lists (points and edges in the order of traversal of the route)
```
from routing import solution

solution.build_routes(
     points: list[Point], clusters_amt: int, graph: sp.Graph, processes_num: int = 0
) -> Iterator[tuple[list[Point], list[Segment]]]:
```

### 2. Create a point
   1. Coordinates are rounded to 6 decimal places
   2. The coordinates of the point cannot be changed
```
from routing import spatial_objects

spatial_objects.Point(x: float, y: float)
```

### 3. Create an edge of the graph
   1. The length of the segment is rounded to 6 decimal places
   2. If the length is not passed to the constructor, then it is calculated as the Euclidean distance between the ends
   3. The beginning of the segment, the end of the segment and the length cannot be changed
```
from routing import spatial_objects

spatial_objects.Segment(start: Point, finish: Point, length: float = 0)
```

### 4. Create a graph
```
from routing import spatial_objects

spatial_objects.Graph()
```

### 5. Add an edge to the graph
```
from routing import spatial_objects

spatial_objects.Graph().add_edge(edge: Segment) -> None
```
bait 2.5.9
an ITerative BAer picker algorithm
Requires Python: >=3.6

# BAIT_

**It**erative **Ba**er picking system.

AUTHOR: _Matteo Bagagli @ ETH-Zurich_
VERSION: _2.5.9_
DATE: _04/2022_

----------

The BaIt picking system is a software created around the already famous and widely used Baer-Kradolfer picker (Baer 1987). The proposed seismic picker push forward the already great performance of the Baer-Kradolfer algorithm by adding an iterative picking procedure over the given seismic trace.

It relies on standard libraries like numpy, matplotlib and ObsPy. For the installation, see further.

## Installation
The file `./data/bait_condaenv.ylm` contains all the encessary dependencies to install and run the framework. The lines to be typed in the terminal are

```bash
$ conda create -n bait python=3.6
$ conda activate bait
$ pip install .
$ pytest # to check everything is cool :)
```

Prior of the run of the subsequent code, the user must have installed `conda` or `miniconda` ([HOW-TO](https://conda.io/docs/user-guide/install/index.html)).

----------
#### References

- Baer, M., and U. Kradolfer. "An automatic phase picker for local and teleseismic events." Bulletin of the Seismological Society of America 77.4 (1987): 1437-1445.

##### Funny Quotes
- Always code as if the guy who ends up maintaining your code will be a violent psycopath who knows where you live (Jhon Woods)
a2woz 0.1.0a0
Visualize floppy disk flux patterns
Requires Python: >=3.9

<!--
SPDX-FileCopyrightText: 2022 Jeff Epler for Adafruit Industries

SPDX-License-Identifier: MIT
-->

# a2woz - minimally process a2r files into woz files

## Usage
One-time installation:
```shell
pip install https://github.com/adafruit/a2woz
```

Convert a single file:
```shell
a2woz input.a2r
```

Convert multiple files, with output directory:
```shell
a2woz --output-dir out *.a2r
```

Full usage:
```shell
a2woz --help
```

## Theory of a2r to woz raw conversion:

The a2r file contains "1 and a fraction" revolutions, for each track. (It can actually contain multiple revolutions, but ignore that for now)

`a2woz` takes a revolution, then finds all the "sync points".
"sync points" are a sequence of 2 or more "FF36" or "FF40", which are used
by the floppy interface controller to synchronize with data on the floppy.

For each pair of sync points within some distance of the start of the capture,
and some distance of the "estimated bit length" of the capture, find the
similarity measure.  A similarity of 1.0 indicates that the next few thousand
bits (at least one full 256-byte sector) are an exact match; a similiary of
0.67 seems to happen for random/fake flux regions.

The pair of sync points with the best similarity is used as the "exact bit length" of the track.
Ties are broken by choosing the resulting track length that is closest to the estimated bit length.
Chop the flux after exactly this many bits, and write it to the output woz file.

That's about all there is to it.

This has worked for a small set of a2r files:

 * Amnesia - Disk 1, Side A.a2r (4am from archive.org)
 * DOS 3.3 System Master [1983] - Disk 1, Side A.a2r (cowgod from archive.org)
 * skyfox.a2r (jepler from fluxengine)


## TODO

 * Share with the world
 * Try more a2rs
 * Graft in the greaseweazle flux readers & use them as input formats
 * Try different revolutions, if available in the a2r file, hopefully
   finding a single best revolution
 * Properly handle "weak bits" by locating stretches that look like they are
   not valid flux (due to sequences of 3+ zeros), and setting all the bits in
   the region to 0. A proper emulator then generates fake flux for these
   sections of the track.

## Credits

a2woz is based on passport.py, a2rchery, and wozardry from [@a2-4am](https://github.com/a2-4am).
apachecn-vuln-wiki 2022.4.16.0
ApacheCN 漏洞知识库
Requires Python: >=3.6

# ApacheCN 漏洞知识库

> 协议：[CC BY-NC-SA 4.0](http://creativecommons.org/licenses/by-nc-sa/4.0/)
> 
> 收割 SB 的人会被 SB 们封神，试图唤醒 SB 的人是 SB 眼中的 SB。——SB 第三定律

* [在线阅读](https://vulnw.apachecn.org)
* [在线阅读（Gitee）](https://apachecn.gitee.io/doc-template/)
* [ApacheCN 学习资源](http://docs.apachecn.org/)

## 贡献指南

请通过 ISSUE 提交想要收录的文章，负责人看到后就会处理。

## 联系方式

### 负责人

* [飞龙](https://github.com/wizardforcel): 562826179

### 其他

*   在我们的 [apachecn/apachecn-vuln-wiki](https://github.com/apachecn/apachecn-vuln-wiki) github 上提 issue.
*   发邮件到 Email: `apachecn@163.com`.
*   在我们的 [组织学习交流群](https://www.apachecn.org/#/docs/join) 中联系群主/管理员即可.

## 下载

### Docker

```
docker pull apachecn0/apachecn-vuln-wiki
docker run -tid -p <port>:80 apachecn0/apachecn-vuln-wiki
# 访问 http://localhost:{port} 查看文档
```

### PYPI

```
pip install apachecn-vuln-wiki
apachecn-vuln-wiki <port>
# 访问 http://localhost:{port} 查看文档
```

### NPM

```
npm install -g apachecn-vuln-wiki
apachecn-vuln-wiki <port>
# 访问 http://localhost:{port} 查看文档
```

## 赞助我们

![](http://data.apachecn.org/img/about/donate.jpg)
apachecn-oj-wiki 2022.4.16.0
ApacheCN OJ 知识库
Requires Python: >=3.6

# ApacheCN OJ 知识库

> 协议：[CC BY-NC-SA 4.0](http://creativecommons.org/licenses/by-nc-sa/4.0/)
> 
> 收割 SB 的人会被 SB 们封神，试图唤醒 SB 的人是 SB 眼中的 SB。——SB 第三定律

* [在线阅读](https://ojw.apachecn.org)
* [在线阅读（Gitee）](https://apachecn.gitee.io/doc-template/)
* [ApacheCN 学习资源](http://docs.apachecn.org/)

## 贡献指南

请通过 ISSUE 提交想要收录的文章，负责人看到后就会处理。

## 联系方式

### 负责人

* [飞龙](https://github.com/wizardforcel): 562826179

### 其他

*   在我们的 [apachecn/apachecn-oj-wiki](https://github.com/apachecn/apachecn-oj-wiki) github 上提 issue.
*   发邮件到 Email: `apachecn@163.com`.
*   在我们的 [组织学习交流群](https://www.apachecn.org/#/docs/join) 中联系群主/管理员即可.

## 下载

### Docker

```
docker pull apachecn0/apachecn-oj-wiki
docker run -tid -p <port>:80 apachecn0/apachecn-oj-wiki
# 访问 http://localhost:{port} 查看文档
```

### PYPI

```
pip install apachecn-oj-wiki
apachecn-oj-wiki <port>
# 访问 http://localhost:{port} 查看文档
```

### NPM

```
npm install -g apachecn-oj-wiki
apachecn-oj-wiki <port>
# 访问 http://localhost:{port} 查看文档
```

## 赞助我们

![](http://data.apachecn.org/img/about/donate.jpg)
apachecn-ctf-wiki 2022.4.16.0
ApacheCN CTF 知识库
Requires Python: >=3.6

# ApacheCN CTF 知识库

> 协议：[CC BY-NC-SA 4.0](http://creativecommons.org/licenses/by-nc-sa/4.0/)
> 
> 收割 SB 的人会被 SB 们封神，试图唤醒 SB 的人是 SB 眼中的 SB。——SB 第三定律

* [在线阅读](https://ctfw.apachecn.org)
* [在线阅读（Gitee）](https://apachecn.gitee.io/doc-template/)
* [ApacheCN 学习资源](http://docs.apachecn.org/)

## 贡献指南

请通过 ISSUE 提交想要收录的文章，负责人看到后就会处理。

## 联系方式

### 负责人

* [飞龙](https://github.com/wizardforcel): 562826179

### 其他

*   在我们的 [apachecn/apachecn-ctf-wiki](https://github.com/apachecn/apachecn-ctf-wiki) github 上提 issue.
*   发邮件到 Email: `apachecn@163.com`.
*   在我们的 [组织学习交流群](https://www.apachecn.org/#/docs/join) 中联系群主/管理员即可.

## 下载

### Docker

```
docker pull apachecn0/apachecn-ctf-wiki
docker run -tid -p <port>:80 apachecn0/apachecn-ctf-wiki
# 访问 http://localhost:{port} 查看文档
```

### PYPI

```
pip install apachecn-ctf-wiki
apachecn-ctf-wiki <port>
# 访问 http://localhost:{port} 查看文档
```

### NPM

```
npm install -g apachecn-ctf-wiki
apachecn-ctf-wiki <port>
# 访问 http://localhost:{port} 查看文档
```

## 赞助我们

![](http://data.apachecn.org/img/about/donate.jpg)