semvec/pypi-packages huggingface dataset:
djangoherokudeployer 0.1
Helps in deploying django files to heroku.
License: MIT
Keywords: django,heroku,deploy

Makes the necessary changes to your django files and deploys them to heroku.

Usage:

from primepastalib import herokuLogin, djangoDeploy

#projectName is the name of your django project, and appName is the name that you'd your heroku app to have.

#adds the required files and makes changes to the settings.py file, and deploys them to heroku. Make sure you're logged in. Heroku will choose a name for the app.

djangoDeploy('projectName')

#Does the same as above, except the name you pass will be used for the app.

djangoDeploy('projectName', 'appName')

#You can also login to heroku by running the following: (It is recommended that you log into the heroku CLI yourself.)

herokuLogin()
tredge 0.0.3
Python module for finding transitive edges in a directed acyclic graph
License: MIT
Requires Python: >=3.6

# tredge

[![pypi][pypi-img]][pypi-url]

[pypi-img]: https://img.shields.io/pypi/v/tredge?style=plastic
[pypi-url]: https://pypi.org/project/tredge/

This is tiny yet fast module to get set of explicitly defined transitive edges from a directed acyclic graph. Given a DAG with edges `child`<--`parent` represented as dictionary (keys are children, values are iterables with parents), or as iterable of iterables representing edges ((`child`, `parent`)), or as file object pointing to tab-delimited file with 2 columns (`child`, `parent`), it returns set of transitive edges found there. Original intent of this package was to use it for removing redundant edges from tree structures.

If a given graph is cyclic, `transitive_edges` function will not return edges that include vertices participating in loops. To find such vertices beforehand or make sure there are none, there is a function `cycles(g)`.

Usage:

```python
import tredge

g = {
    'b': {'a'},
    'c': {'a'},
    'd': {'b', 'c', 'a'},
    'e': {'d', 'a'}
}
result = tredge.transitive_edges(g)
print(result)

# {('d', 'a'), ('e', 'a')}
```

or

```python
import tredge

g = [
    ('b', 'a'),
    ('c', 'a'),
    ('d', 'b'),
    ('d', 'c'),
    ('e', 'd'),
    ('e', 'a'),
    ('d', 'a')
]
result = tredge.transitive_edges(g)
print(result)

# {('d', 'a'), ('e', 'a')}
```

or

```python
"""input_file.tab:
b	a
c	a
d	b
d	c
e	d
e	a
d	a
"""

import tredge

with open('input_file.tab', mode='r', encoding='utf8') as g:
    result = tredge.transitive_edges(g)
print(result)

# {('d', 'a'), ('e', 'a')}
```

To check if a graph has cycles:

```python
import tredge

g = {
    'b': {'a'},
    'c': {'a'},
    'd': {'b', 'c', 'a'},
    'e': {'d', 'a'}
}
result = tredge.cycles(g)
print(result)

# {'e', 'c', 'd'}
```
pharedox 0.0.3
An image analysis pipeline to quantify redox state in the pharynx of C. elegans
License: MIT
Requires Python: ~=3.6

[![Code style: black](https://img.shields.io/badge/code%20style-black-000000.svg)](https://github.com/psf/black) 
[![Coverage Status](https://coveralls.io/repos/github/half-adder/wormAnalysis/badge.svg?branch=master)](https://coveralls.io/github/half-adder/wormAnalysis?branch=master) 
[![Documentation Status](https://readthedocs.org/projects/pharynx-redox/badge/?version=latest)](https://pharynx-redox.readthedocs.io/en/latest/?badge=latest)
[![Build Status](https://travis-ci.com/ApfeldLab/pharynx_redox.svg?branch=master)](https://travis-ci.com/ApfeldLab/pharynx_redox)

Documentation: https://pharynx-redox.readthedocs.io/en/latest/

# Changelog
All notable changes to this project will be documented in this file.

The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),
and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).

## [0.0.3] - 2020-08-05
### Fixed
- Fix region summarization bug where value would be null