Sort a sequence, preferring some values
Project description
Partially sort a sequence, preferring some values.
from prefsort import prefsorted
seq = list('abcde')
seq2 = prefsorted(seq, 'c b')
assert seq2 == ['c', 'b', 'a', 'd', 'e']
Note that this doesn’t sort the majority of the sequence in the way Python’s normal list.sort() or sorted() do. It just pulls the preferred members to the front of the list.
This is particularly handy to have when organizing data columns, for example with pandas, the following will make sure the id and name columns come first in a DataFrame:
df = df.reindex(columns=prefsorted(df.columns, 'id name'))
There is also a reverse parameter that will put the “preferred” items at the end of the list. In this case it’s a “negative preference.”
seq2 = prefsorted(seq, 'c b', reverse=True)
assert seq2 == ['a', 'd', 'e', 'c', 'b']
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
prefsort-0.1.0.tar.gz
(3.5 kB
view hashes)
Built Distribution
Close
Hashes for prefsort-0.1.0-py2.py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | b27af30c1ee3ad86402cfffd0721872459d9eb53c06972c9de6fd0b7d4837edb |
|
MD5 | 68ce8ec5fa32119252d7f0714c24aa62 |
|
BLAKE2b-256 | b7ddc214416c70d68ccebbdf2e7392bd29f3a0c8cb8ffa3726f12ba2448bdb9f |