semvec/pypi-packages huggingface dataset:
python-slack-print 1.0.5
Python print for stdout and slack
License: MIT

# python_slack_print

## About

python_slack_print is a simple printer for both stdout and slack channel

## Examples

```python
from slack_print import SlackPrint

sp = SlackPrint('<your-slack-access-token>', '#general')

# Print
sp.print('hello world')

# Upload a file
sp.upload('hello.txt')
```

## Installation

```
$ pip install python_slack_print
```

## Tip

### Replace your print() with sp.print()

You can replace your print() with sp.print() with UNIX command.
Below is one of the simplest ways. (There must be a better way.)
 
```
sed -i -e "s/print(/sp.print(/g" <file-to-be-replaced>
```
wagtailbookmarklet 0.1.4
Gives Wagtail editors an 'edit this page' bookmarklet
License: MIT
Keywords: development

# Wagtail Bookmarklet

This simple app gives Wagtail editors an 'edit this page' bookmarklet, for scenarios where the [User Bar](http://docs.wagtail.io/en/stable/topics/writing_templates.html#wagtail-user-bar) isn't available, e.g. when the site has been statically generated.

## Installation

1. `pip install wagtailbookmarklet`
2. Add `'wagtailbookmarklet'` to your `INSTALLED_APPS`
3. Check `BASE_URL` is correctly configured in settings.

## Usage

Go to 'Bookmarklet' in the Wagtail admin settings menu. Drag the link to your bookmarks bar.
friendpaste-api 0.1.2-alpha
Simple Python API for friendpaste.com
License: MIT
Keywords: friendpaste,api,scrapper

Friendpaste API
===============

Installation
------------

``pip install friendpaste-api``


Requirements
------------

-  `requests <http://docs.python-requests.org/en/master/>`__


Usage
-----

.. code:: python

    from friendpaste import fp_write

    # Update post using hash
    fp_write('y0Z1ia3h47j8ddRSn2QiPy', 'My new text')
RangeMinQuery 0.2
Solving the Range Minimum Query problem
License: MIT
Keywords: range-minimum-query

[![PyPI version](https://img.shields.io/pypi/v/RangeMinQuery.svg)](https://pypi.python.org/pypi/RangeMinQuery/)
[![PyPI pyversions](https://img.shields.io/pypi/pyversions/RangeMinQuery.svg)](https://pypi.python.org/pypi/RangeMinQuery/)
[![PyPI license](https://img.shields.io/pypi/l/RangeMinQuery.svg)](https://pypi.python.org/pypi/RangeMinQuery/)

This data structure solves the [range minimum query problem](https://en.wikipedia.org/wiki/Range_minimum_query) of finding the minimal value in a sub-array of an array of comparable objects. Different from the original problem, this data structure also supports updating the values.

# Installation

This package is available on PyPI. Just use `pip install -U RangeMinQuery` to install it. Then you can import it using `from RangeMinQuery import SegmentTree`.

# Usage

## Initialization

Use `SegmentTree()` to initialize the tree with a set of keys, in **comparable and hashable** type.

- `func=min` specifies how the best value is computed for any range of keys.

- `default=None` specifies the default value for each key.

- `maxChildNum=2` specifies the maximum number of children for each node.

```Python
tree = SegmentTree(
    {1, 2, 3, 4, 5},
    func=min, default=0, maxChildNum=2
)
```

The space complexity should be $O(n)$.

## Updating

You need to use `update()` to initialize the values, or update the values if necessary, by specifying a dictionary of key/value pairs. Currently, adding new keys is not supported yet.

```Python
tree.update({1: 3, 4: 6})
```

Given m values updated, the time complexity should be $O(m^2)$.

## Querying

Use `query()` to to find the best value of a range of keys. The range is denoted by a tuple `(a, b)`, representing each key `x` such that `a <= x < b`. The range here is closed on the left side and open on the right side, consistent with Python tradition.

```Python
tree.query((1, 3))
```

The time complexity should be $O(log n)$.