Small utilities for searching data structures
Project description
Poisk implements a thin veneer of convenience over familiar search functions. It can be used for:
- regular expression searches;
- jq- or JMESPath-style searches in lists and dicts;
- XPath queries over ElementTrees.
one
and many
At the core of Poisk is the idea that you'd rather raise an exception than extract the wrong data. We want to check that our expectations hold. If we expect our search to return matches, it should not return an empty list. If we expect a single matching element, there shouldn't be two.
The search functions are grouped into two modules, called one
and many
. The
search functions under one
expect to find a single matching value, which they
return. They raise NotFound
if no results are found, and ManyFound
if more
than one match is found.
Here is an example using one.re
, which performs regular expression searches:
>>> from poisk import one
>>> one.re(r'H\w+', 'Hello world!')
'Hello'
>>> one.re(r'H\w+', 'Greetings, world!')
Traceback (most recent call last):
...
poisk.exceptions.NotFound: 'H\\w+' in 'Greetings, world!'
>>> one.re(r'H\w+', 'Ho Ho Ho, world!')
Traceback (most recent call last):
...
poisk.exceptions.ManyFound: 'H\\w+' in 'Ho Ho Ho, world!'
The corresponding functions under many
expect one or more results, which they
return as a list. They raise NotFound
if no matches are found:
>>> from poisk import many
>>> many.re(r'\w+', 'Hello!')
['Hello']
>>> many.re(r'\w+', 'Hello world!')
['Hello', 'world']
>>> many.re(r'\d+', 'Hello world!')
Traceback (most recent call last):
...
poisk.exceptions.NotFound: '\\d+' in 'Hello world!'
Supported search functions
The previous two examples use one.re
and many.re
to perform regular
expression searches, using the standard
re module.
Also available are functions for xpath search over ElementTrees using lxml.etree:
>>> import lxml.etree as ET
>>> from poisk import many, one
>>> document = ET.HTML('''
... <div>
... <p id="p1">First paragraph</p>
... <p id="p2">Second paragraph</p>
... </div>
... ''')
>>> one.etree('p[@id="p1"]/text()', document)
'First paragraph'
>>> many.etree('p/text()', document)
['First paragraph', 'Second paragraph']
The same one.etree
and many.etree
functions accept CSS selectors (via
cssselect):
>>> one.etree('p#p1', document).text
'First paragraph'
The one.pods
and many.pods
functions allow searches using Plain Old Data
Structures (dicts and lists) using a jq- or JMESPath-style query language:
>>> data = {
... "payload": {
... "total": 3,
... "results": [
... {"id": 1},
... {"id": 2},
... {"id": 3},
... ],
... },
... }
>>> one.pods('payload.total', data)
3
>>> many.pods('payload.results[].id', data)
[1, 2, 3]
The test/
directory contains many more examples of the sort functionality that Poisk offers.
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
File details
Details for the file poisk-1.0.3.tar.gz
.
File metadata
- Download URL: poisk-1.0.3.tar.gz
- Upload date:
- Size: 13.8 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/4.0.2 CPython/3.11.2
File hashes
Algorithm | Hash digest | |
---|---|---|
SHA256 | ba3f9469f0f535787b5a8dfd74594e75a839d9eb65c19b4bea18dd043ace5335 |
|
MD5 | 8f9898ad12c3c24d3656fbe1d10c7948 |
|
BLAKE2b-256 | d046d193ab8fdca5528974db1db3ee1363473c69abd794ee9b5c3841e36b8e65 |
File details
Details for the file poisk-1.0.3-py3-none-any.whl
.
File metadata
- Download URL: poisk-1.0.3-py3-none-any.whl
- Upload date:
- Size: 15.0 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/4.0.2 CPython/3.11.2
File hashes
Algorithm | Hash digest | |
---|---|---|
SHA256 | 600940c5bd4e55da3a7fc2e4967904d9ca3be5026af966f343c8324535823651 |
|
MD5 | 6f75d0270ac8e26e1263e04ee3084aef |
|
BLAKE2b-256 | 7ca7bfc333cf9b53dbe574bb1edd4fdefc9c423d77bc6c54df7010c54ef6e3db |