richset interpolate between list, dict, set and iterables.
Project description
richset
richset interporlates with set, dict, and list.
Motivations and Concepts
- richset provides useful functions for common use cases of set, dict, and list.
- builtin set, dict and list requires many boilerplate codes.
- Pure Python package.
- Fully typing supported.
- No magic. No meta-programming.
Install
$ pip install richset
Usage
from dataclasses import dataclass
from richset import RichSet
@dataclass(frozen=True)
class Something:
id: int
name: str
richset = RichSet.from_list([
Something(1, 'one'),
Something(2, 'two'),
Something(3, 'three'),
])
Conversions
richset.to_list() # => [Something(1, 'one'), Something(2, 'one'), Something(3, 'three')]
richset.to_tuple() # => (Something(1, 'one'), Something(2, 'two'), Something(3, 'three'))
richset.to_set() # => {Something(1, 'one'), Something(2, 'two'), Something(3, 'three')}
richset.to_frozenset() # => frozenset({Something(1, 'one'), Something(2, 'two'), Something(3, 'three')})
richset.to_dict(lambda s: s.id) # => {1: Something(1, 'one'), 2: Something(2, 'two'), 3: Something(3, 'three')}
to_dict()
takes second argument duplicated
which is a choice of 'error'
, 'first'
or 'last'
.
- if
duplicated
is'error'
, thento_dict()
raisesValueError
if there is a duplicated key. - if
duplicated
is'first'
, thento_dict()
picks the first one of duplicated key. - if
duplicated
is'last'
, thento_dict()
picks the last one of duplicated key.
to_dict_of_list()
is similar to to_dict()
but it returns a dict of list.
richset.to_dict_of_list(lambda s: s.name) # => {'john': [Something(1, 'john'), Something(2, 'john')], 'jane': [Something(3, 'jane')]}
List accessors
richset.first() # => returns first item `Something(1, 'one')` or raise Error (if empty)
richset.get_first() # => returns first item `Something(1, 'one')` or None (if empty)
richset.last() # => returns last item `Something(3, 'three')` or raise Error (if empty)
richset.get_last() # => returns last item `Something(3, 'three')` or None (if empty)
richset.nth(2) # => returns 3rd item `Something(3, 'three')` or raise Error (if empty)
richset.get_nth(2) # => returns 3rd item `Something(3, 'three')` or None (if empty)
richset.one() # => returns one item `Something(1, 'one')` or raise Error (if empty)
richset.get_one() # => returns one item `Something(1, 'one')` or None (if empty)
Note: get_first
, get_last
, get_nth
and get_one
accept default
argument that returns specified value instead of None.
richset.get_nth(100, default=Something(-1, 'default')) # => Something(-1, 'default')
List basic manipulations
richset.pushed(Something(4, 'four')).to_list() # => [Something(1, 'one'), Something(2, 'two'), Something(3, 'three'), Something(4, 'four')]
richset.unshift(Something(4, 'four')).to_list() # => [Something(4, 'four'), Something(1, 'one'), Something(2, 'two'), Something(3, 'three')]
richset.popped() # => Something(3, 'three'), RichSet([Something(1, 'one'), Something(2, 'two')])
richset.shift() # => Something(1, 'one'), RichSet([Something(2, 'two'), Something(3, 'three')])
richset.slice(1, 2).to_list() # => [Something(2, 'two')]
richset.divide_at(1) # => RichSet([Something(1, 'one')]), RichSet([Something(2, 'two'), Something(3, 'three')])
pushed_all()
andunshift_all()
are similar topushed()
andunshift()
but they accept multiple items.popped_n()
andshift_n()
are similar topopped()
andshift()
but they accept count of items.
List functional manipulations
richset.unique(lambda s: s.id) # => unique by id
richset.map(lambda s: s.id).to_list() # => [1, 2]
richset.filter(lambda s: s.id > 1).to_list() # => [Something(2, 'two'), Something(3, 'three')]
Search
richset.index(lambda s: s.id == 2) # => 1
richset.indices(lambda s: s.id == 2) # => [1]
richset.search_first(lambda s: s.id == 2) # => Something(2, 'two')
richset.search_last(lambda s: s.id == 2) # => Something(2, 'two')
richset.search_all(lambda s: s.id == 2) # => [Something(2, 'two')]
richset.contains(lambda s: s.id == 2) # => True
richset.has(Something(2, 'two')) # => True
Sorts
richset.sorted(key=lambda s: s.name, reverse=True).to_list() # => [Something(2, 'two'), Something(3, 'three'), Something(1, 'one')]
richset.reversed().to_list() # => [Something(3, 'three'), Something(2, 'two'), Something(1, 'one')]
Statistics
richset.is_empty() # => True if empty
richset.is_not_empty() # => True if not empty
richset.size() # => 3
richset.count(lambda s: s.id > 1) # => 2
Set operations
richset = RichSet.from_list([
Something(3, 'three'),
Something(4, 'four'),
Something(5, 'five'),
])
richset2 = RichSet.from_list([
Something(3, 'three'),
Something(4, 'four'),
Something(6, 'six'),
])
richset.union(richset2).to_set() # => {Something(3, 'three'), Something(4, 'four'), Something(5, 'five'), Something(6, 'six')}
richset.intersection(richset2).to_set() # => {Something(3, 'three'), Something(4, 'four')}
richset.difference(richset2).to_set() # => {Something(5, 'five')}
richset.symmetric_difference(richset2).to_set() # => {Something(5, 'five'), Something(6, 'six')}
richset.cartesian_product(richset2).to_set() # => {(Something(3, 'three'), Something(3, 'three')), (Something(3, 'three'), Something(4, 'four')), (Something(3, 'three'), Something(6, 'six')), (Something(4, 'four'), Something(3, 'three')), (Something(4, 'four'), Something(4, 'four')), (Something(4, 'four'), Something(6, 'six')), (Something(5, 'five'), Something(3, 'three')), (Something(5, 'five'), Something(4, 'four')), (Something(5, 'five'), Something(6, 'six'))}
richset.zip(richset2).to_set() # => {(Something(3, 'three'), Something(3, 'three')), (Something(4, 'four'), Something(4, 'four')), (Something(5, 'five'), Something(6, 'six')}
Also is_subset()
, is_superset()
, is_disjoint()
, is_equal_as_set()
and zip_longest()
are available.
Grouping
richset.group_by(lambda item: item.id % 2) # => {1: RichSet(records=(Something(id=1, name='one'), Something(id=3, name='three'))), 0: RichSet(records=(Something(id=2, name='two'),))}
richset.size_of_group_by(lambda item: item.id % 2) # => {1: 2, 0: 1}
richset.count_of_group_by(key=lambda item: item.id % 2, predicate=lambda item: item.name.startswith('t')) # => {1: 1, 0: 1}
richset.aggregate_by(key=lambda r: r.id % 2, fn=lambda a, b: a + b.name, initial='') # => {1: 'onethree', 0: 'two'}
Paging
richset.page(1, 2).to_list() # => [Something(1, 'one'), Something(2, 'two')]
richset.split_into_pages(2).to_list() # => [RichSet([Something(1, 'one'), Something(2, 'two')]), RichSet([Something(3, 'three')])]
LICENSE
The 3-Clause BSD License. See also LICENSE file.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
richset-0.1.7.tar.gz
(28.8 kB
view details)
Built Distribution
File details
Details for the file richset-0.1.7.tar.gz
.
File metadata
- Download URL: richset-0.1.7.tar.gz
- Upload date:
- Size: 28.8 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/4.0.1 CPython/3.11.1
File hashes
Algorithm | Hash digest | |
---|---|---|
SHA256 | d29c53253c433fce65f3e80f9ac37e1066e074ea38eef46ffab76e8e0c7ec13e |
|
MD5 | 4f748108deb73e5c7e0cd250497375fc |
|
BLAKE2b-256 | bf28cd1eaf8a17f982375b9a7594d3f66cc5f82df8729153e509d96db9eccd07 |
File details
Details for the file richset-0.1.7-py3-none-any.whl
.
File metadata
- Download URL: richset-0.1.7-py3-none-any.whl
- Upload date:
- Size: 8.4 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/4.0.1 CPython/3.11.1
File hashes
Algorithm | Hash digest | |
---|---|---|
SHA256 | 2fc448c7c88da3f1e97d16bfe587600f48b79942aaa71582e32188f23f002417 |
|
MD5 | fd56ef87b7a882286a4920f1872b868e |
|
BLAKE2b-256 | 24c9b4a9f3d9fecfc2547e8bc81b1b4298156e3d4f3233801a7eaf0db16a94af |