ubelt package¶
Submodules¶
- ubelt.orderedset module
OrderedSet
OrderedSet.copy()
OrderedSet.add()
OrderedSet.append()
OrderedSet.update()
OrderedSet.index()
OrderedSet.get_loc()
OrderedSet.get_indexer()
OrderedSet.pop()
OrderedSet.discard()
OrderedSet.clear()
OrderedSet.union()
OrderedSet.intersection()
OrderedSet.difference()
OrderedSet.issubset()
OrderedSet.issuperset()
OrderedSet.symmetric_difference()
OrderedSet.difference_update()
OrderedSet.intersection_update()
OrderedSet.symmetric_difference_update()
oset
- ubelt.progiter module
- ubelt.util_arg module
- ubelt.util_cache module
- ubelt.util_cmd module
- ubelt.util_colors module
- ubelt.util_const module
- ubelt.util_dict module
- ubelt.util_download module
- ubelt.util_download_manager module
- ubelt.util_format module
- ubelt.util_func module
- ubelt.util_futures module
- ubelt.util_hash module
- ubelt.util_import module
- ubelt.util_indexable module
- ubelt.util_io module
- ubelt.util_links module
- ubelt.util_list module
- ubelt.util_memoize module
- ubelt.util_mixins module
- ubelt.util_path module
- ubelt.util_platform module
- ubelt.util_str module
- ubelt.util_stream module
- ubelt.util_time module
- ubelt.util_zip module
Module contents¶
UBelt is a “utility belt” of commonly needed utility and helper functions. It is a currated collection of top-level utilities with functionality that falls into a mixture of categories.
The source code is available at https://github.com/Erotemic/ubelt. We also have Jupyter notebook demos.
The ubelt API is organized by submodules containing related functionality. Each submodule contains top level overview documentation, and each function contains a docstring with at least one example.
NOTE: The README on github contains information and examples complementary to these docs.
- class ubelt.AutoDict[source]¶
Bases:
UDict
An infinitely nested default dict of dicts.
Implementation of Perl’s autovivification feature that follows [SO_651794].
References
Example
>>> import ubelt as ub >>> auto = ub.AutoDict() >>> auto[0][10][100] = None >>> assert str(auto) == '{0: {10: {100: None}}}'
- to_dict()[source]¶
Recursively casts a AutoDict into a regular dictionary. All directly nested AutoDict values are also converted.
This effectively de-defaults the structure.
- Returns
a copy of this dict without autovivification
- Return type
Example
>>> import ubelt as ub >>> auto = ub.AutoDict() >>> auto[1] = 1 >>> auto['n1'] = ub.AutoDict() >>> static = auto.to_dict() >>> assert not isinstance(static, ub.AutoDict) >>> assert not isinstance(static['n1'], ub.AutoDict)
Example
>>> import ubelt as ub >>> auto = ub.AutoOrderedDict() >>> auto[0][3] = 3 >>> auto[0][2] = 2 >>> auto[0][1] = 1 >>> assert list(auto[0].values()) == [3, 2, 1]
- class ubelt.CacheStamp(fname, dpath, cfgstr=None, product=None, hasher='sha1', verbose=None, enabled=True, depends=None, meta=None, hash_prefix=None, expires=None, ext='.pkl')[source]¶
Bases:
object
Quickly determine if a file-producing computation has been done.
Check if the computation needs to be redone by calling
expired
. If the stamp is not expired, the user can expect that the results exist and could be loaded. If the stamp is expired, the computation should be redone. After the result is updated, the callsrenew
, which writes a “stamp” file to disk that marks that the procedure has been done.There are several ways to control how a stamp expires. At a bare minimum, removing the stamp file will force expiration. However, in this circumstance CacheStamp only knows that something has been done, but it doesn’t have any information about what was done, so in general this is not sufficient.
To achieve more robust expiration behavior, the user should specify the
product
argument, which is a list of file paths that are expected to exist whenever the stamp is renewed. When this is specified the CacheStamp will expire if any of these products are deleted, their size changes, their modified timestamp changes, or their hash (i.e. checksum) changes. Note that by settinghasher=None
, running and verifying checksums can be disabled.If the user knows what the hash of the file should be this can be specified to prevent renewal of the stamp unless these match the files on disk. This can be useful for security purposes.
The stamp can also be set to expire at a specified time or after a specified duration using the
expires
argument.- Parameters
fname (str) – Name of the stamp file
dpath (str | PathLike | None) – Where to store the cached stamp file
product (str | PathLike | Sequence[str | PathLike] | None) – Path or paths that we expect the computation to produce. If specified the hash of the paths are stored.
hasher (str, default=’sha1’) – The type of hasher used to compute the file hash of product. If None, then we assume the file has not been corrupted or changed if the mtime and size are the same. Defaults to sha1.
verbose (bool, default=None) – Passed to internal
ubelt.Cacher
objectenabled (bool, default=True) – if False, expired always returns True
depends (str | List[str] | None) – Indicate dependencies of this cache. If the dependencies change, then the cache is recomputed. New to CacheStamp in version 0.9.2.
meta (object | None) – Metadata that is also saved as a sidecar file. New to CacheStamp in version 0.9.2. Note: this is a candidate for deprecation.
expires (str | int | datetime.datetime | datetime.timedelta | None) – If specified, sets an expiration date for the certificate. This can be an absolute datetime or a timedelta offset. If specified as an int, this is interpreted as a time delta in seconds. If specified as a str, this is interpreted as an absolute timestamp. Time delta offsets are coerced to absolute times at “renew” time.
hash_prefix (None | str | List[str]) – If specified, we verify that these match the hash(s) of the product(s) in the stamp certificate.
ext (str, default=’.pkl’) – File extension for the cache format. Can be
'.pkl'
or'.json'
.cfgstr (str | None) – DEPRECATED.
Notes
The size, mtime, and hash mechanism is similar to how Makefile and redo caches work.
Example
>>> import ubelt as ub >>> # Stamp the computation of expensive-to-compute.txt >>> dpath = ub.Path.appdir('ubelt/tests/cache-stamp') >>> dpath.delete().ensuredir() >>> product = dpath / 'expensive-to-compute.txt' >>> self = ub.CacheStamp('somedata', depends='someconfig', dpath=dpath, >>> product=product, hasher='sha256') >>> self.clear() >>> print(f'self.fpath={self.fpath}') >>> if self.expired(): >>> product.write_text('very expensive') >>> self.renew() >>> assert not self.expired() >>> # corrupting the output will cause the stamp to expire >>> product.write_text('very corrupted') >>> assert self.expired()
- property fpath¶
- expired(cfgstr=None, product=None)[source]¶
Check to see if a previously existing stamp is still valid, if the expected result of that computation still exists, and if all other expiration criteria are met.
- Parameters
cfgstr (Any) – DEPRECATED
product (Any) – DEPRECATED
- Returns
True(-thy) if the stamp is invalid, expired, or does not exist. When the stamp is expired, the reason for expiration is returned as a string. If the stamp is still valid, False is returned.
- Return type
Example
>>> import ubelt as ub >>> import time >>> import os >>> # Stamp the computation of expensive-to-compute.txt >>> dpath = ub.Path.appdir('ubelt/tests/cache-stamp-expired') >>> dpath.delete().ensuredir() >>> products = [ >>> dpath / 'product1.txt', >>> dpath / 'product2.txt', >>> ] >>> self = ub.CacheStamp('myname', depends='myconfig', dpath=dpath, >>> product=products, hasher='sha256', >>> expires=0) >>> if self.expired(): >>> for fpath in products: >>> fpath.write_text(fpath.name) >>> self.renew() >>> fpath = products[0] >>> # Because we set the expiration delta to 0, we should already be expired >>> assert self.expired() == 'expired_cert' >>> # Disable the expiration date, renew and we should be ok >>> self.expires = None >>> self.renew() >>> assert not self.expired() >>> # Modify the mtime to cause expiration >>> orig_atime = fpath.stat().st_atime >>> orig_mtime = fpath.stat().st_mtime >>> os.utime(fpath, (orig_atime, orig_mtime + 200)) >>> assert self.expired() == 'mtime_diff' >>> self.renew() >>> assert not self.expired() >>> # rewriting the file will cause the size constraint to fail >>> # even if we hack the mtime to be the same >>> orig_atime = fpath.stat().st_atime >>> orig_mtime = fpath.stat().st_mtime >>> fpath.write_text('corrupted') >>> os.utime(fpath, (orig_atime, orig_mtime)) >>> assert self.expired() == 'size_diff' >>> self.renew() >>> assert not self.expired() >>> # Force a situation where the hash is the only thing >>> # that saves us, write a different file with the same >>> # size and mtime. >>> orig_atime = fpath.stat().st_atime >>> orig_mtime = fpath.stat().st_mtime >>> fpath.write_text('corrApted') >>> os.utime(fpath, (orig_atime, orig_mtime)) >>> assert self.expired() == 'hash_diff' >>> # Test what a wrong hash prefix causes expiration >>> certificate = self.renew() >>> self.hash_prefix = certificate['hash'] >>> self.expired() >>> self.hash_prefix = ['bad', 'hashes'] >>> self.expired() >>> # A bad hash will not allow us to renew >>> import pytest >>> with pytest.raises(RuntimeError): ... self.renew()
- renew(cfgstr=None, product=None)[source]¶
Recertify that the product has been recomputed by writing a new certificate to disk.
- Returns
certificate information if enabled otherwise None.
- Return type
None | dict
Example
>>> # Test that renew does nothing when the cacher is disabled >>> import ubelt as ub >>> dpath = ub.Path.appdir('ubelt/tests/cache-stamp-renew').ensuredir() >>> self = ub.CacheStamp('foo', dpath=dpath, enabled=False) >>> assert self.renew() is None
- class ubelt.Cacher(fname, depends=None, dpath=None, appname='ubelt', ext='.pkl', meta=None, verbose=None, enabled=True, log=None, hasher='sha1', protocol=-1, cfgstr=None, backend='auto')[source]¶
Bases:
object
Saves data to disk and reloads it based on specified dependencies.
Cacher uses pickle to save/load data to/from disk. Dependencies of the cached process can be specified, which ensures the cached data is recomputed if the dependencies change. If the location of the cache is not specified, it will default to the system user’s cache directory.
- Parameters
fname (str) – A file name. This is the prefix that will be used by the cache. It will always be used as-is.
depends (str | List[str] | None) – Indicate dependencies of this cache. If the dependencies change, then the cache is recomputed. New in version 0.8.9, replaces
cfgstr
.dpath (str | PathLike | None) – Specifies where to save the cache. If unspecified, Cacher defaults to an application cache dir as given by appname. See
ub.get_app_cache_dir()
for more details.appname (str, default=’ubelt’) – Application name Specifies a folder in the application cache directory where to cache the data if
dpath
is not specified.ext (str, default=’.pkl’) – File extension for the cache format. Can be
'.pkl'
or'.json'
.meta (object | None) – Metadata that is also saved with the
cfgstr
. This can be useful to indicate how thecfgstr
was constructed. Note: this is a candidate for deprecation.verbose (int, default=1) – Level of verbosity. Can be 1, 2 or 3.
enabled (bool, default=True) – If set to False, then the load and save methods will do nothing.
log (Callable[[str], Any]) – Overloads the print function. Useful for sending output to loggers (e.g. logging.info, tqdm.tqdm.write, …)
hasher (str, default=’sha1’) – Type of hashing algorithm to use if
cfgstr
needs to be condensed to less than 49 characters.protocol (int, default=-1) – Protocol version used by pickle. Defaults to the -1 which is the latest protocol.
backend (str) – Set to either
'pickle'
or'json'
to force backend. Defaults to auto which chooses one based on the extension.cfgstr (str | None) – Deprecated in favor of
depends
.
Example
>>> import ubelt as ub >>> depends = 'repr-of-params-that-uniquely-determine-the-process' >>> # Create a cacher and try loading the data >>> cacher = ub.Cacher('demo_process', depends, verbose=4) >>> cacher.clear() >>> print(f'cacher.fpath={cacher.fpath}') >>> data = cacher.tryload() >>> if data is None: >>> # Put expensive functions in if block when cacher misses >>> myvar1 = 'result of expensive process' >>> myvar2 = 'another result' >>> # Tell the cacher to write at the end of the if block >>> # It is idomatic to put results in an object named data >>> data = myvar1, myvar2 >>> cacher.save(data) >>> # Last part of the Cacher pattern is to unpack the data object >>> myvar1, myvar2 = data >>> # >>> # If we know the data exists, we can also simply call load >>> data = cacher.tryload()
Example
>>> # The previous example can be shorted if only a single value >>> from ubelt.util_cache import Cacher >>> depends = 'repr-of-params-that-uniquely-determine-the-process' >>> # Create a cacher and try loading the data >>> cacher = Cacher('demo_process', depends) >>> myvar = cacher.tryload() >>> if myvar is None: >>> myvar = ('result of expensive process', 'another result') >>> cacher.save(myvar) >>> assert cacher.exists(), 'should now exist'
- VERBOSE = 1¶
- FORCE_DISABLE = False¶
- property fpath¶
- get_fpath(cfgstr=None)[source]¶
Reports the filepath that the cacher will use.
It will attempt to use ‘{fname}_{cfgstr}{ext}’ unless that is too long. Then cfgstr will be hashed.
- Parameters
cfgstr (str | None) – overrides the instance-level cfgstr
- Returns
str | PathLike
Example
>>> # xdoctest: +REQUIRES(module:pytest) >>> from ubelt.util_cache import Cacher >>> import pytest >>> #with pytest.warns(UserWarning): >>> if 1: # we no longer warn here >>> cacher = Cacher('test_cacher1') >>> cacher.get_fpath() >>> self = Cacher('test_cacher2', depends='cfg1') >>> self.get_fpath() >>> self = Cacher('test_cacher3', depends='cfg1' * 32) >>> self.get_fpath()
- exists(cfgstr=None)[source]¶
Check to see if the cache exists
- Parameters
cfgstr (str | None) – overrides the instance-level cfgstr
- Returns
bool
- existing_versions()[source]¶
Returns data with different cfgstr values that were previously computed with this cacher.
- Yields
str – paths to cached files corresponding to this cacher
Example
>>> # Ensure that some data exists >>> import ubelt as ub >>> dpath = ub.Path.appdir( >>> 'ubelt/tests/util_cache', >>> 'test-existing-versions').delete().ensuredir() >>> cacher = ub.Cacher('versioned_data_v2', depends='1', dpath=dpath) >>> cacher.ensure(lambda: 'data1') >>> known_fpaths = set() >>> known_fpaths.add(cacher.get_fpath()) >>> cacher = ub.Cacher('versioned_data_v2', depends='2', dpath=dpath) >>> cacher.ensure(lambda: 'data2') >>> known_fpaths.add(cacher.get_fpath()) >>> # List previously computed configs for this type >>> from os.path import basename >>> cacher = ub.Cacher('versioned_data_v2', depends='2', dpath=dpath) >>> exist_fpaths = set(cacher.existing_versions()) >>> exist_fnames = list(map(basename, exist_fpaths)) >>> print('exist_fnames = {!r}'.format(exist_fnames)) >>> print('exist_fpaths = {!r}'.format(exist_fpaths)) >>> print('known_fpaths={!r}'.format(known_fpaths)) >>> assert exist_fpaths.issubset(known_fpaths)
- clear(cfgstr=None)[source]¶
Removes the saved cache and metadata from disk
- Parameters
cfgstr (str | None) – overrides the instance-level cfgstr
- tryload(cfgstr=None, on_error='raise')[source]¶
Like load, but returns None if the load fails due to a cache miss.
- Parameters
cfgstr (str | None) – overrides the instance-level cfgstr
on_error (str, default=’raise’) – How to handle non-io errors errors. Either ‘raise’, which re-raises the exception, or ‘clear’ which deletes the cache and returns None.
- Returns
the cached data if it exists, otherwise returns None
- Return type
None | object
- load(cfgstr=None)[source]¶
Load the data cached and raise an error if something goes wrong.
- Parameters
cfgstr (str | None) – overrides the instance-level cfgstr
- Returns
the cached data
- Return type
- Raises
IOError - if the data is unable to be loaded. This could be due to – a cache miss or because the cache is disabled.
Example
>>> from ubelt.util_cache import * # NOQA >>> # Setting the cacher as enabled=False turns it off >>> cacher = Cacher('test_disabled_load', '', enabled=True, >>> appname='ubelt/tests/util_cache') >>> cacher.save('data') >>> assert cacher.load() == 'data' >>> cacher.enabled = False >>> assert cacher.tryload() is None
- save(data, cfgstr=None)[source]¶
Writes data to path specified by
self.fpath
.Metadata containing information about the cache will also be appended to an adjacent file with the .meta suffix.
- Parameters
data (object) – arbitrary pickleable object to be cached
cfgstr (str | None) – overrides the instance-level cfgstr
Example
>>> from ubelt.util_cache import * # NOQA >>> # Normal functioning >>> depends = 'long-cfg' * 32 >>> cacher = Cacher('test_enabled_save', depends=depends, >>> appname='ubelt/tests/util_cache') >>> cacher.save('data') >>> assert exists(cacher.get_fpath()), 'should be enabled' >>> assert exists(cacher.get_fpath() + '.meta'), 'missing metadata' >>> # Setting the cacher as enabled=False turns it off >>> cacher2 = Cacher('test_disabled_save', 'params', enabled=False, >>> appname='ubelt/tests/util_cache') >>> cacher2.save('data') >>> assert not exists(cacher2.get_fpath()), 'should be disabled'
- ensure(func, *args, **kwargs)[source]¶
Wraps around a function. A cfgstr must be stored in the base cacher.
- Parameters
func (Callable) – function that will compute data on cache miss
*args – passed to func
**kwargs – passed to func
Example
>>> from ubelt.util_cache import * # NOQA >>> def func(): >>> return 'expensive result' >>> fname = 'test_cacher_ensure' >>> depends = 'func params' >>> cacher = Cacher(fname, depends=depends) >>> cacher.clear() >>> data1 = cacher.ensure(func) >>> data2 = cacher.ensure(func) >>> assert data1 == 'expensive result' >>> assert data1 == data2 >>> cacher.clear()
- class ubelt.CaptureStdout(suppress=True, enabled=True)[source]¶
Bases:
CaptureStream
Context manager that captures stdout and stores it in an internal stream
- Parameters
suppress (bool, default=True) – if True, stdout is not printed while captured
enabled (bool, default=True) – does nothing if this is False
**kwargs – used for backwards compatibility with misspelled deprecated params.
- SeeAlso:
Example
>>> import ubelt as ub >>> self = ub.CaptureStdout(suppress=True) >>> print('dont capture the table flip (╯°□°)╯︵ ┻━┻') >>> with self: ... text = 'capture the heart ♥' ... print(text) >>> print('dont capture look of disapproval ಠ_ಠ') >>> assert isinstance(self.text, str) >>> assert self.text == text + '\n', 'failed capture text'
Example
>>> import ubelt as ub >>> self = ub.CaptureStdout(suppress=False) >>> with self: ... print('I am captured and printed in stdout') >>> assert self.text.strip() == 'I am captured and printed in stdout'
Example
>>> import ubelt as ub >>> self = ub.CaptureStdout(suppress=True, enabled=False) >>> with self: ... print('dont capture') >>> assert self.text is None
- class ubelt.CaptureStream[source]¶
Bases:
object
Generic class for capturing streaming output from stdout or stderr
- class ubelt.DownloadManager(download_root=None, mode='thread', max_workers=None, cache=True)[source]¶
Bases:
object
Simple implementation of the download manager
- Variables
download_root (str | PathLike) – default download location
jobs (List[concurrent.futures.Future]) – list of jobs
Example
>>> # xdoctest: +REQUIRES(--network) >>> import ubelt as ub >>> # Download a file with a known hash >>> manager = ub.DownloadManager() >>> job = manager.submit( >>> 'http://i.imgur.com/rqwaDag.png', >>> hash_prefix='31a129618c87dd667103e7154182e3c39a605eefe90f84f2283f3c87efee8e40' >>> ) >>> fpath = job.result() >>> print('fpath = {!r}'.format(fpath))
Example
>>> # Does not require network >>> import ubelt as ub >>> manager = ub.DownloadManager() >>> for i in range(100): ... job = manager.submit('localhost/might-not-exist-i-{}'.format(i)) >>> file_paths = [] >>> for job in manager.as_completed(prog=True): ... try: ... fpath = job.result() ... file_paths += [fpath] ... except Exception: ... pass >>> print('file_paths = {!r}'.format(file_paths))
Example
>>> # xdoctest: +REQUIRES(--network) >>> import pytest >>> import ubelt as ub >>> manager = ub.DownloadManager() >>> item1 = { >>> 'url': 'https://data.kitware.com/api/v1/item/5b4039308d777f2e6225994c/download', >>> 'dst': 'forgot_what_the_name_really_is', >>> 'hash_prefix': 'c98a46cb31205cf', >>> 'hasher': 'sha512', >>> } >>> item2 = { >>> 'url': 'http://i.imgur.com/rqwaDag.png', >>> 'hash_prefix': 'f79ea24571da6ddd2ba12e3d57b515249ecb8a35', >>> 'hasher': 'sha1', >>> } >>> item1 = item2 # hack around SSL error >>> manager.submit(**item1) >>> manager.submit(**item2) >>> for job in manager.as_completed(prog=True, verbose=3): >>> fpath = job.result() >>> print('fpath = {!r}'.format(fpath))
- submit(url, dst=None, hash_prefix=None, hasher='sha256')[source]¶
Add a job to the download Queue
- Parameters
url (str | PathLike) – pointer to the data to download
dst (str | None) – The relative or absolute path to download to. If unspecified, the destination name is derived from the url.
hash_prefix (str | None) – If specified, verifies that the hash of the downloaded file starts with this.
hasher (str, default=’sha256’) – hashing algorithm to use if hash_prefix is specified.
- Returns
a Future object that will point to the downloaded location.
- Return type
- as_completed(prog=None, desc=None, verbose=1)[source]¶
Generate completed jobs as they become available
Example
>>> import pytest >>> import ubelt as ub >>> download_root = ub.ensure_app_config_dir('ubelt', 'dlman') >>> manager = ub.DownloadManager(download_root=download_root, >>> cache=False) >>> for i in range(3): >>> manager.submit('localhost') >>> results = list(manager) >>> print('results = {!r}'.format(results)) >>> manager.shutdown()
- class ubelt.Executor(mode='thread', max_workers=0)[source]¶
Bases:
object
A concrete asynchronous executor with a configurable backend.
The type of parallelism (or lack thereof) is configured via the
mode
parameter, which can be: “process”, “thread”, or “serial”. This allows the user to easily enable / disable parallelism or switch between processes and threads without modifying the surrounding logic.- SeeAlso:
Example
>>> import ubelt as ub >>> # Prototype code using simple serial processing >>> executor = ub.Executor(mode='serial', max_workers=0) >>> jobs = [executor.submit(sum, [i + 1, i]) for i in range(10)] >>> print([job.result() for job in jobs]) [1, 3, 5, 7, 9, 11, 13, 15, 17, 19]
>>> # Enable parallelism by only changing one parameter >>> executor = ub.Executor(mode='process', max_workers=0) >>> jobs = [executor.submit(sum, [i + 1, i]) for i in range(10)] >>> print([job.result() for job in jobs]) [1, 3, 5, 7, 9, 11, 13, 15, 17, 19]
- submit(func, *args, **kw)[source]¶
Calls the submit function of the underlying backend.
- Returns
a future representing the job
- Return type
- map(fn, *iterables, **kwargs)[source]¶
Calls the map function of the underlying backend.
CommandLine
xdoctest -m ubelt.util_futures Executor.map
Example
>>> import ubelt as ub >>> import concurrent.futures >>> import string >>> with ub.Executor(mode='serial') as executor: ... result_iter = executor.map(int, string.digits) ... results = list(result_iter) >>> print('results = {!r}'.format(results)) results = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] >>> with ub.Executor(mode='thread', max_workers=2) as executor: ... result_iter = executor.map(int, string.digits) ... results = list(result_iter) >>> # xdoctest: +IGNORE_WANT >>> print('results = {!r}'.format(results)) results = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
- class ubelt.FormatterExtensions[source]¶
Bases:
object
Helper class for managing non-builtin (e.g. numpy) format types.
This module (
ubelt.util_format
) maintains a global set of basic extensions, but it is also possible to create a locally scoped set of extensions and explicitly pass it to urepr. The following example demonstrates this.Example
>>> import ubelt as ub >>> class MyObject(object): >>> pass >>> data = {'a': [1, 2.2222, MyObject()], 'b': MyObject()} >>> # Create a custom set of extensions >>> extensions = ub.FormatterExtensions() >>> # Register a function to format your specific type >>> @extensions.register(MyObject) >>> def format_myobject(data, **kwargs): >>> return 'I can do anything here' >>> # Repr2 will now respect the passed custom extensions >>> # Note that the global extensions will still be respected >>> # unless they are overloaded. >>> print(ub.urepr(data, nl=-1, precision=1, extensions=extensions)) { 'a': [1, 2.2, I can do anything here], 'b': I can do anything here } >>> # Overload the formatter for float and int >>> @extensions.register((float, int)) >>> def format_myobject(data, **kwargs): >>> return str((data + 10) // 2) >>> print(ub.urepr(data, nl=-1, precision=1, extensions=extensions)) { 'a': [5, 6.0, I can do anything here], 'b': I can do anything here }
- class ubelt.IndexableWalker(data, dict_cls=(<class 'dict'>, ), list_cls=(<class 'list'>, <class 'tuple'>))[source]¶
Bases:
Generator
Traverses through a nested tree-liked indexable structure.
Generates a path and value to each node in the structure. The path is a list of indexes which if applied in order will reach the value.
The
__setitem__
method can be used to modify a nested value based on the path returned by the generator.When generating values, you can use “send” to prevent traversal of a particular branch.
- RelatedWork:
- https://pypi.org/project/python-benedict/ - implements a dictionary
subclass with similar nested indexing abilities.
- Variables
Example
>>> import ubelt as ub >>> # Given Nested Data >>> data = { >>> 'foo': {'bar': 1}, >>> 'baz': [{'biz': 3}, {'buz': [4, 5, 6]}], >>> } >>> # Create an IndexableWalker >>> walker = ub.IndexableWalker(data) >>> # We iterate over the data as if it was flat >>> # ignore the <want> string due to order issues on older Pythons >>> # xdoctest: +IGNORE_WANT >>> for path, val in walker: >>> print(path) ['foo'] ['baz'] ['baz', 0] ['baz', 1] ['baz', 1, 'buz'] ['baz', 1, 'buz', 0] ['baz', 1, 'buz', 1] ['baz', 1, 'buz', 2] ['baz', 0, 'biz'] ['foo', 'bar'] >>> # We can use "paths" as keys to getitem into the walker >>> path = ['baz', 1, 'buz', 2] >>> val = walker[path] >>> assert val == 6 >>> # We can use "paths" as keys to setitem into the walker >>> assert data['baz'][1]['buz'][2] == 6 >>> walker[path] = 7 >>> assert data['baz'][1]['buz'][2] == 7 >>> # We can use "paths" as keys to delitem into the walker >>> assert data['baz'][1]['buz'][1] == 5 >>> del walker[['baz', 1, 'buz', 1]] >>> assert data['baz'][1]['buz'][1] == 7
Example
>>> # Create nested data >>> # xdoctest: +REQUIRES(module:numpy) >>> import numpy as np >>> import ubelt as ub >>> data = ub.ddict(lambda: int) >>> data['foo'] = ub.ddict(lambda: int) >>> data['bar'] = np.array([1, 2, 3]) >>> data['foo']['a'] = 1 >>> data['foo']['b'] = np.array([1, 2, 3]) >>> data['foo']['c'] = [1, 2, 3] >>> data['baz'] = 3 >>> print('data = {}'.format(ub.repr2(data, nl=True))) >>> # We can walk through every node in the nested tree >>> walker = ub.IndexableWalker(data) >>> for path, value in walker: >>> print('walk path = {}'.format(ub.repr2(path, nl=0))) >>> if path[-1] == 'c': >>> # Use send to prevent traversing this branch >>> got = walker.send(False) >>> # We can modify the value based on the returned path >>> walker[path] = 'changed the value of c' >>> print('data = {}'.format(ub.repr2(data, nl=True))) >>> assert data['foo']['c'] == 'changed the value of c'
Example
>>> # Test sending false for every data item >>> import ubelt as ub >>> data = {1: [1, 2, 3], 2: [1, 2, 3]} >>> walker = ub.IndexableWalker(data) >>> # Sending false means you wont traverse any further on that path >>> num_iters_v1 = 0 >>> for path, value in walker: >>> print('[v1] walk path = {}'.format(ub.repr2(path, nl=0))) >>> walker.send(False) >>> num_iters_v1 += 1 >>> num_iters_v2 = 0 >>> for path, value in walker: >>> # When we dont send false we walk all the way down >>> print('[v2] walk path = {}'.format(ub.repr2(path, nl=0))) >>> num_iters_v2 += 1 >>> assert num_iters_v1 == 2 >>> assert num_iters_v2 == 8
Example
>>> # Test numpy >>> # xdoctest: +REQUIRES(CPython) >>> # xdoctest: +REQUIRES(module:numpy) >>> import ubelt as ub >>> import numpy as np >>> # By default we don't recurse into ndarrays because they >>> # Are registered as an indexable class >>> data = {2: np.array([1, 2, 3])} >>> walker = ub.IndexableWalker(data) >>> num_iters = 0 >>> for path, value in walker: >>> print('walk path = {}'.format(ub.repr2(path, nl=0))) >>> num_iters += 1 >>> assert num_iters == 1 >>> # Currently to use top-level ndarrays, you need to extend what the >>> # list class is. This API may change in the future to be easier >>> # to work with. >>> data = np.random.rand(3, 5) >>> walker = ub.IndexableWalker(data, list_cls=(list, tuple, np.ndarray)) >>> num_iters = 0 >>> for path, value in walker: >>> print('walk path = {}'.format(ub.repr2(path, nl=0))) >>> num_iters += 1 >>> assert num_iters == 3 + 3 * 5
- throw(typ[, val[, tb]]) raise exception in generator, [source]¶
return next yielded value or raise StopIteration.
- allclose(other, rel_tol=1e-09, abs_tol=0.0, return_info=False)[source]¶
Walks through this and another nested data structures and checks if everything is roughly the same.
- Parameters
other (IndexableWalker | List | Dict) – a nested indexable item to compare against.
rel_tol (float) – maximum difference for being considered “close”, relative to the magnitude of the input values
abs_tol (float) – maximum difference for being considered “close”, regardless of the magnitude of the input values
return_info (bool, default=False) – if true, return extra info dict
- Returns
A boolean result if
return_info
is false, otherwise a tuple of the boolean result and an “info” dict containing detailed results indicating what matched and what did not.- Return type
Example
>>> import ubelt as ub >>> items1 = ub.IndexableWalker({ >>> 'foo': [1.222222, 1.333], >>> 'bar': 1, >>> 'baz': [], >>> }) >>> items2 = ub.IndexableWalker({ >>> 'foo': [1.22222, 1.333], >>> 'bar': 1, >>> 'baz': [], >>> }) >>> flag, return_info = items1.allclose(items2, return_info=True) >>> print('return_info = {}'.format(ub.repr2(return_info, nl=1))) >>> print('flag = {!r}'.format(flag)) >>> for p1, v1, v2 in return_info['faillist']: >>> v1_ = items1[p1] >>> print('*fail p1, v1, v2 = {}, {}, {}'.format(p1, v1, v2)) >>> for p1 in return_info['passlist']: >>> v1_ = items1[p1] >>> print('*pass p1, v1_ = {}, {}'.format(p1, v1_)) >>> assert not flag
>>> import ubelt as ub >>> items1 = ub.IndexableWalker({ >>> 'foo': [1.0000000000000000000000001, 1.], >>> 'bar': 1, >>> 'baz': [], >>> }) >>> items2 = ub.IndexableWalker({ >>> 'foo': [0.9999999999999999, 1.], >>> 'bar': 1, >>> 'baz': [], >>> }) >>> flag, return_info = items1.allclose(items2, return_info=True) >>> print('return_info = {}'.format(ub.repr2(return_info, nl=1))) >>> print('flag = {!r}'.format(flag)) >>> assert flag
Example
>>> import ubelt as ub >>> flag, return_info = ub.IndexableWalker([]).allclose(ub.IndexableWalker([]), return_info=True) >>> print('return_info = {!r}'.format(return_info)) >>> print('flag = {!r}'.format(flag)) >>> assert flag
Example
>>> import ubelt as ub >>> flag = ub.IndexableWalker([]).allclose([], return_info=False) >>> print('flag = {!r}'.format(flag)) >>> assert flag
Example
>>> import ubelt as ub >>> flag, return_info = ub.IndexableWalker([]).allclose([1], return_info=True) >>> print('return_info = {!r}'.format(return_info)) >>> print('flag = {!r}'.format(flag)) >>> assert not flag
Example
>>> # xdoctest: +REQUIRES(module:numpy) >>> import ubelt as ub >>> import numpy as np >>> a = np.random.rand(3, 5) >>> b = a + 1 >>> wa = ub.IndexableWalker(a, list_cls=(np.ndarray,)) >>> wb = ub.IndexableWalker(b, list_cls=(np.ndarray,)) >>> flag, return_info = wa.allclose(wb, return_info=True) >>> print('return_info = {!r}'.format(return_info)) >>> print('flag = {!r}'.format(flag)) >>> assert not flag >>> a = np.random.rand(3, 5) >>> b = a.copy() + 1e-17 >>> wa = ub.IndexableWalker([a], list_cls=(np.ndarray, list)) >>> wb = ub.IndexableWalker([b], list_cls=(np.ndarray, list)) >>> flag, return_info = wa.allclose(wb, return_info=True) >>> assert flag >>> print('return_info = {!r}'.format(return_info)) >>> print('flag = {!r}'.format(flag))
- class ubelt.JobPool(mode='thread', max_workers=0, transient=False)[source]¶
Bases:
object
Abstracts away boilerplate of submitting and collecting jobs
This is a basic wrapper around
ubelt.util_futures.Executor
that simplifies the most basic case by 1. keeping track of references to submitted futures for you and 2. providing an as_completed method to consume those futures as they are ready.- Parameters
mode (str) – The backend parallelism mechanism. Can be either thread, serial, or process. Defaults to ‘thread’.
max_workers (int) – number of workers. If 0, serial is forced. Defaults to 0.
transient (bool) – if True, references to jobs will be discarded as they are returned by
as_completed()
. Otherwise thejobs
attribute holds a reference to all jobs ever submitted. Default to False.
Example
>>> import ubelt as ub >>> def worker(data): >>> return data + 1 >>> pool = ub.JobPool('thread', max_workers=16) >>> for data in ub.ProgIter(range(10), desc='submit jobs'): >>> pool.submit(worker, data) >>> final = [] >>> for job in pool.as_completed(desc='collect jobs'): >>> info = job.result() >>> final.append(info) >>> print('final = {!r}'.format(final))
- submit(func, *args, **kwargs)[source]¶
Submit a job managed by the pool
- Parameters
func (Callable[…, Any]) – A callable that will take as many arguments as there are passed iterables.
*args – positional arguments to pass to the function
*kwargs – keyword arguments to pass to the function
- Returns
a future representing the job
- Return type
- as_completed(timeout=None, desc=None, progkw=None)[source]¶
Generates completed jobs in an arbitrary order
- Parameters
timeout (float | None) – Specify the the maximum number of seconds to wait for a job. Note: this is ignored in serial mode.
desc (str | None) – if specified, reports progress with a
ubelt.progiter.ProgIter
object.progkw (dict | None) – extra keyword arguments to
ubelt.progiter.ProgIter
.
- Yields
concurrent.futures.Future – The completed future object containing the results of a job.
CommandLine
xdoctest -m ubelt.util_futures JobPool.as_completed
Example
>>> import ubelt as ub >>> pool = ub.JobPool('thread', max_workers=8) >>> text = ub.paragraph( ... ''' ... UDP is a cool protocol, check out the wiki: ... ... UDP-based Data Transfer Protocol (UDT), is a high-performance ... data transfer protocol designed for transferring large ... volumetric datasets over high-speed wide area networks. Such ... settings are typically disadvantageous for the more common TCP ... protocol. ... ''') >>> for word in text.split(' '): ... pool.submit(print, word) >>> for _ in pool.as_completed(): ... pass >>> pool.shutdown()
- join(**kwargs)[source]¶
Like
JobPool.as_completed()
, but executes the result method of each future and returns only after all processes are complete. This allows for lower-boilerplate prototyping.- Parameters
**kwargs – passed to
JobPool.as_completed()
- Returns
list of results
- Return type
List[Any]
Example
>>> import ubelt as ub >>> # We just want to try replacing our simple iterative algorithm >>> # with the embarrassingly parallel version >>> arglist = list(zip(range(1000), range(1000))) >>> func = ub.identity >>> # >>> # Original version >>> for args in arglist: >>> func(*args) >>> # >>> # Potentially parallel version >>> jobs = ub.JobPool(max_workers=0) >>> for args in arglist: >>> jobs.submit(func, *args) >>> _ = jobs.join(desc='running')
- class ubelt.NiceRepr[source]¶
Bases:
object
Inherit from this class and define
__nice__
to “nicely” print your objects.Defines
__str__
and__repr__
in terms of__nice__
function Classes that inherit fromNiceRepr
should redefine__nice__
. If the inheriting class has a__len__
, method then the default__nice__
method will return its length.Example
>>> import ubelt as ub >>> class Foo(ub.NiceRepr): ... def __nice__(self): ... return 'info' >>> foo = Foo() >>> assert str(foo) == '<Foo(info)>' >>> assert repr(foo).startswith('<Foo(info) at ')
Example
>>> import ubelt as ub >>> class Bar(ub.NiceRepr): ... pass >>> bar = Bar() >>> import pytest >>> with pytest.warns(RuntimeWarning) as record: >>> assert 'object at' in str(bar) >>> assert 'object at' in repr(bar)
Example
>>> import ubelt as ub >>> class Baz(ub.NiceRepr): ... def __len__(self): ... return 5 >>> baz = Baz() >>> assert str(baz) == '<Baz(5)>'
Example
>>> import ubelt as ub >>> # If your nice message has a bug, it shouldn't bring down the house >>> class Foo(ub.NiceRepr): ... def __nice__(self): ... assert False >>> foo = Foo() >>> import pytest >>> with pytest.warns(RuntimeWarning) as record: >>> print('foo = {!r}'.format(foo)) foo = <...Foo ...>
Example
>>> import ubelt as ub >>> class Animal(ub.NiceRepr): ... def __init__(self): ... ... ... def __nice__(self): ... return '' >>> class Cat(Animal): >>> ... >>> class Dog(Animal): >>> ... >>> class Beagle(Dog): >>> ... >>> class Ragdoll(Cat): >>> ... >>> instances = [Animal(), Cat(), Dog(), Beagle(), Ragdoll()] >>> for inst in instances: >>> print(str(inst)) <Animal()> <Cat()> <Dog()> <Beagle()> <Ragdoll()>
- class ubelt.OrderedSet(iterable=None)[source]¶
Bases:
MutableSet
,Sequence
An OrderedSet is a custom MutableSet that remembers its order, so that every entry has an index that can be looked up.
Example
>>> OrderedSet([1, 1, 2, 3, 2]) OrderedSet([1, 2, 3])
- copy()[source]¶
Return a shallow copy of this object.
Example
>>> this = OrderedSet([1, 2, 3]) >>> other = this.copy() >>> this == other True >>> this is other False
- add(key)[source]¶
Add key as an item to this OrderedSet, then return its index.
If key is already in the OrderedSet, return the index it already had.
Example
>>> oset = OrderedSet() >>> oset.append(3) 0 >>> print(oset) OrderedSet([3])
- append(key)¶
Add key as an item to this OrderedSet, then return its index.
If key is already in the OrderedSet, return the index it already had.
Example
>>> oset = OrderedSet() >>> oset.append(3) 0 >>> print(oset) OrderedSet([3])
- update(sequence)[source]¶
Update the set with the given iterable sequence, then return the index of the last element inserted.
Example
>>> oset = OrderedSet([1, 2, 3]) >>> oset.update([3, 1, 5, 1, 4]) 4 >>> print(oset) OrderedSet([1, 2, 3, 5, 4])
- index(key)[source]¶
Get the index of a given entry, raising an IndexError if it’s not present.
key can be an iterable of entries that is not a string, in which case this returns a list of indices.
Example
>>> oset = OrderedSet([1, 2, 3]) >>> oset.index(2) 1
- get_loc(key)¶
Get the index of a given entry, raising an IndexError if it’s not present.
key can be an iterable of entries that is not a string, in which case this returns a list of indices.
Example
>>> oset = OrderedSet([1, 2, 3]) >>> oset.index(2) 1
- get_indexer(key)¶
Get the index of a given entry, raising an IndexError if it’s not present.
key can be an iterable of entries that is not a string, in which case this returns a list of indices.
Example
>>> oset = OrderedSet([1, 2, 3]) >>> oset.index(2) 1
- pop()[source]¶
Remove and return the last element from the set.
Raises KeyError if the set is empty.
Example
>>> oset = OrderedSet([1, 2, 3]) >>> oset.pop() 3
- discard(key)[source]¶
Remove an element. Do not raise an exception if absent.
The MutableSet mixin uses this to implement the .remove() method, which does raise an error when asked to remove a non-existent item.
Example
>>> oset = OrderedSet([1, 2, 3]) >>> oset.discard(2) >>> print(oset) OrderedSet([1, 3]) >>> oset.discard(2) >>> print(oset) OrderedSet([1, 3])
- union(*sets)[source]¶
Combines all unique items. Each items order is defined by its first appearance.
Example
>>> oset = OrderedSet.union(OrderedSet([3, 1, 4, 1, 5]), [1, 3], [2, 0]) >>> print(oset) OrderedSet([3, 1, 4, 5, 2, 0]) >>> oset.union([8, 9]) OrderedSet([3, 1, 4, 5, 2, 0, 8, 9]) >>> oset | {10} OrderedSet([3, 1, 4, 5, 2, 0, 10])
- intersection(*sets)[source]¶
Returns elements in common between all sets. Order is defined only by the first set.
Example
>>> from ubelt.orderedset import * # NOQA >>> oset = OrderedSet.intersection(OrderedSet([0, 1, 2, 3]), [1, 2, 3]) >>> print(oset) OrderedSet([1, 2, 3]) >>> oset.intersection([2, 4, 5], [1, 2, 3, 4]) OrderedSet([2]) >>> oset.intersection() OrderedSet([1, 2, 3])
- difference(*sets)[source]¶
Returns all elements that are in this set but not the others.
Example
>>> OrderedSet([1, 2, 3]).difference(OrderedSet([2])) OrderedSet([1, 3]) >>> OrderedSet([1, 2, 3]).difference(OrderedSet([2]), OrderedSet([3])) OrderedSet([1]) >>> OrderedSet([1, 2, 3]) - OrderedSet([2]) OrderedSet([1, 3]) >>> OrderedSet([1, 2, 3]).difference() OrderedSet([1, 2, 3])
- issubset(other)[source]¶
Report whether another set contains this set.
Example
>>> OrderedSet([1, 2, 3]).issubset({1, 2}) False >>> OrderedSet([1, 2, 3]).issubset({1, 2, 3, 4}) True >>> OrderedSet([1, 2, 3]).issubset({1, 4, 3, 5}) False
- issuperset(other)[source]¶
Report whether this set contains another set.
Example
>>> OrderedSet([1, 2]).issuperset([1, 2, 3]) False >>> OrderedSet([1, 2, 3, 4]).issuperset({1, 2, 3}) True >>> OrderedSet([1, 4, 3, 5]).issuperset({1, 2, 3}) False
- symmetric_difference(other)[source]¶
Return the symmetric difference of two OrderedSets as a new set. That is, the new set will contain all elements that are in exactly one of the sets.
Their order will be preserved, with elements from self preceding elements from other.
Example
>>> this = OrderedSet([1, 4, 3, 5, 7]) >>> other = OrderedSet([9, 7, 1, 3, 2]) >>> this.symmetric_difference(other) OrderedSet([4, 5, 9, 2])
- difference_update(*sets)[source]¶
Update this OrderedSet to remove items from one or more other sets.
Example
>>> this = OrderedSet([1, 2, 3]) >>> this.difference_update(OrderedSet([2, 4])) >>> print(this) OrderedSet([1, 3])
>>> this = OrderedSet([1, 2, 3, 4, 5]) >>> this.difference_update(OrderedSet([2, 4]), OrderedSet([1, 4, 6])) >>> print(this) OrderedSet([3, 5])
- intersection_update(other)[source]¶
Update this OrderedSet to keep only items in another set, preserving their order in this set.
Example
>>> this = OrderedSet([1, 4, 3, 5, 7]) >>> other = OrderedSet([9, 7, 1, 3, 2]) >>> this.intersection_update(other) >>> print(this) OrderedSet([1, 3, 7])
- symmetric_difference_update(other)[source]¶
Update this OrderedSet to remove items from another set, then add items from the other set that were not present in this set.
Example
>>> this = OrderedSet([1, 4, 3, 5, 7]) >>> other = OrderedSet([9, 7, 1, 3, 2]) >>> this.symmetric_difference_update(other) >>> print(this) OrderedSet([4, 5, 9, 2])
- class ubelt.Path(*args, **kwargs)[source]¶
Bases:
PosixPath
This class extends
pathlib.Path
with extra functionality and convenience methods.New methods are designed to support chaining.
In addition to new methods this class supports the addition (
+
) operator via which allows for better drop-in compatibility with code using existing string-based paths.Note
On windows this inherits from
pathlib.WindowsPath
.New methods are
ubelt.Path.ensuredir()
- Like mkdir but with easier defaults.ubelt.Path.delete()
- Previously pathlib could only remove one file at a time.ubelt.Path.copy()
- Pathlib has no similar functionality.ubelt.Path.move()
- Pathlib has no similar functionality.ubelt.Path.augment()
- Unifies and extends disparate functionality across pathlib.ubelt.Path.expand()
- Unifies existing environ and home expansion.ubelt.Path.ls()
- Like iterdir, but more interactive.ubelt.Path.shrinkuser()
- Python has no similar functionality.ubelt.Path.walk()
- Pathlib had no similar functionality.
New classmethods are
ubelt.Path.appdir()
- application directories
Modified methods are
ubelt.Path.touch()
- returns self to support chaining
Example
>>> # Ubelt extends pathlib functionality >>> import ubelt as ub >>> # Chain expansion and mkdir with cumbersome args. >>> dpath = ub.Path('~/.cache/ubelt/demo_path').expand().ensuredir() >>> fpath = dpath / 'text_file.txt' >>> # Augment is concise and chainable >>> aug_fpath = fpath.augment(stemsuffix='.aux', ext='.jpg').touch() >>> aug_dpath = dpath.augment(stemsuffix='demo_path2') >>> assert aug_fpath.read_text() == '' >>> fpath.write_text('text data') >>> assert aug_fpath.exists() >>> # Delete is akin to "rm -rf" and is also chainable. >>> assert not aug_fpath.delete().exists() >>> assert dpath.exists() >>> assert not dpath.delete().exists() >>> print(f'{str(fpath.shrinkuser()).replace(os.path.sep, "/")}') >>> print(f'{str(dpath.shrinkuser()).replace(os.path.sep, "/")}') >>> print(f'{str(aug_fpath.shrinkuser()).replace(os.path.sep, "/")}') >>> print(f'{str(aug_dpath.shrinkuser()).replace(os.path.sep, "/")}') ~/.cache/ubelt/demo_path/text_file.txt ~/.cache/ubelt/demo_path ~/.cache/ubelt/demo_path/text_file.aux.jpg ~/.cache/ubelt/demo_pathdemo_path2
Inherited unmodified properties from
pathlib.Path
are:pathlib.PurePath.anchor
pathlib.PurePath.name
pathlib.PurePath.parts
pathlib.PurePath.parts
pathlib.PurePath.parent
pathlib.PurePath.parents
pathlib.PurePath.suffix
pathlib.PurePath.suffixes
pathlib.PurePath.stem
pathlib.PurePath.drive
pathlib.PurePath.root
Inherited unmodified classmethods from
pathlib.Path
are:Inherited unmodified methods from
pathlib.Path
are:pathlib.Path.mkdir()
- we recommendubelt.Path.ensuredir()
instead.pathlib.Path.link_to()
- deprecatedpathlib.Path.expanduser()
- we recommendubelt.Path.expand()
instead.pathlib.PurePath.with_name()
- we recommendubelt.Path.augment()
instead.pathlib.PurePath.with_stem()
- we recommendubelt.Path.augment()
instead.pathlib.PurePath.with_suffix()
- we recommendubelt.Path.augment()
instead.
- classmethod appdir(appname=None, *args, type='cache')[source]¶
Returns a standard platform specific directory for an application to use as cache, config, or data.
The default root location depends on the platform and is specified the the following table:
TextArt
| POSIX | Windows | MacOSX data | $XDG_DATA_HOME | %APPDATA% | ~/Library/Application Support config | $XDG_CONFIG_HOME | %APPDATA% | ~/Library/Application Support cache | $XDG_CACHE_HOME | %LOCALAPPDATA% | ~/Library/Caches If an environment variable is not specified the defaults are: APPDATA = ~/AppData/Roaming LOCALAPPDATA = ~/AppData/Local XDG_DATA_HOME = ~/.local/share XDG_CACHE_HOME = ~/.cache XDG_CONFIG_HOME = ~/.config
- Parameters
appname (str | None) – The name of the application.
*args – optional subdirs
type (str) – the type of data the expected to be stored in this application directory. Valid options are ‘cache’, ‘config’, or ‘data’.
- Returns
a new path object for the specified application directory.
- Return type
- SeeAlso:
This provides functionality similar to the appdirs - and platformdirs - packages.
Example
>>> # xdoctest: +IGNORE_WANT >>> import ubelt as ub >>> print(ub.Path.appdir('ubelt', type='cache').shrinkuser()) >>> print(ub.Path.appdir('ubelt', type='config').shrinkuser()) >>> print(ub.Path.appdir('ubelt', type='data').shrinkuser()) ~/.cache/ubelt ~/.config/ubelt ~/.local/share/ubelt >>> import pytest >>> with pytest.raises(KeyError): >>> ub.Path.appdir('ubelt', type='other')
Example
>>> # xdoctest: +IGNORE_WANT >>> import ubelt as ub >>> # Can now call appdir without any arguments >>> print(ub.Path.appdir().shrinkuser()) ~/.cache
- augment(prefix='', stemsuffix='', ext=None, stem=None, dpath=None, tail='', relative=None, multidot=False, suffix='')[source]¶
Create a new path with a different extension, basename, directory, prefix, and/or suffix.
See
augpath()
for more details.- Parameters
prefix (str) – Text placed in front of the stem. Defaults to ‘’.
stemsuffix (str) – Text placed between the stem and extension. Default to ‘’. Note: this is just called suffix in
ub.augpath()
.ext (str | None) – If specified, replaces the extension
stem (str | None) – If specified, replaces the stem (i.e. basename without extension). Note: named base in
augpath()
.dpath (str | PathLike | None) – If specified, replaces the specified “relative” directory, which by default is the parent directory.
tail (str | None) – If specified, appends this text the very end of the path - after the extension.
relative (str | PathLike | None) – Replaces
relative
withdpath
inpath
. Has no effect ifdpath
is not specified. Defaults to the dirname of the inputpath
. experimental not currently implemented.multidot (bool) – Allows extensions to contain multiple dots. Specifically, if False, everything after the last dot in the basename is the extension. If True, everything after the first dot in the basename is the extension.
- SeeAlso:
pathlib.Path.with_stem()
pathlib.Path.with_name()
pathlib.Path.with_suffix()
- Returns
augmented path
- Return type
Note
NOTICE OF BACKWARDS INCOMPATABILITY.
THE INITIAL RELEASE OF Path.augment suffered from an unfortunate variable naming decision that conflicts with pathlib.Path
p = ub.Path(‘the.entire.fname.or.dname.is.the.name.exe’) print(f’p ={p}’) print(f’p.name={p.name}’) p = ub.Path(‘the.stem.ends.here.ext’) print(f’p ={p}’) print(f’p.stem={p.stem}’) p = ub.Path(‘only.the.last.dot.is.the.suffix’) print(f’p ={p}’) print(f’p.suffix={p.suffix}’) p = ub.Path(‘but.all.suffixes.can.be.recovered’) print(f’p ={p}’) print(f’p.suffixes={p.suffixes}’)
p.name p.stem p.suffixes p.parts
Example
>>> import ubelt as ub >>> path = ub.Path('foo.bar') >>> suffix = '_suff' >>> prefix = 'pref_' >>> ext = '.baz' >>> newpath = path.augment(prefix=prefix, stemsuffix=suffix, ext=ext, stem='bar') >>> print('newpath = {!r}'.format(newpath)) newpath = Path('pref_bar_suff.baz')
Example
>>> import ubelt as ub >>> path = ub.Path('foo.bar') >>> stemsuffix = '_suff' >>> prefix = 'pref_' >>> ext = '.baz' >>> newpath = path.augment(prefix=prefix, stemsuffix=stemsuffix, ext=ext, stem='bar') >>> print('newpath = {!r}'.format(newpath))
Example
>>> # Compare our augpath(ext=...) versus pathlib with_suffix(...) >>> import ubelt as ub >>> cases = [ >>> ub.Path('no_ext'), >>> ub.Path('one.ext'), >>> ub.Path('double..dot'), >>> ub.Path('two.many.cooks'), >>> ub.Path('path.with.three.dots'), >>> ub.Path('traildot.'), >>> ub.Path('doubletraildot..'), >>> ub.Path('.prefdot'), >>> ub.Path('..doubleprefdot'), >>> ] >>> for path in cases: >>> print('--') >>> print('path = {}'.format(ub.repr2(path, nl=1))) >>> ext = '.EXT' >>> method_pathlib = path.with_suffix(ext) >>> method_augment = path.augment(ext=ext) >>> if method_pathlib == method_augment: >>> print(ub.color_text('sagree', 'green')) >>> else: >>> print(ub.color_text('disagree', 'red')) >>> print('path.with_suffix({}) = {}'.format(ext, ub.repr2(method_pathlib, nl=1))) >>> print('path.augment(ext={}) = {}'.format(ext, ub.repr2(method_augment, nl=1))) >>> print('--')
- delete()[source]¶
Removes a file or recursively removes a directory. If a path does not exist, then this is does nothing.
- SeeAlso:
- Returns
reference to self
- Return type
Example
>>> import ubelt as ub >>> from os.path import join >>> base = ub.Path.appdir('ubelt', 'delete_test2') >>> dpath1 = (base / 'dir').ensuredir() >>> (base / 'dir' / 'subdir').ensuredir() >>> (base / 'dir' / 'to_remove1.txt').touch() >>> fpath1 = (base / 'dir' / 'subdir' / 'to_remove3.txt').touch() >>> fpath2 = (base / 'dir' / 'subdir' / 'to_remove2.txt').touch() >>> assert all(p.exists() for p in [dpath1, fpath1, fpath2]) >>> fpath1.delete() >>> assert all(p.exists() for p in [dpath1, fpath2]) >>> assert not fpath1.exists() >>> dpath1.delete() >>> assert not any(p.exists() for p in [dpath1, fpath1, fpath2])
- ensuredir(mode=511)[source]¶
Concise alias of
self.mkdir(parents=True, exist_ok=True)
- Returns
returns itself
- Return type
Example
>>> import ubelt as ub >>> cache_dpath = ub.Path.appdir('ubelt').ensuredir() >>> dpath = ub.Path(join(cache_dpath, 'ensuredir')) >>> if dpath.exists(): ... os.rmdir(dpath) >>> assert not dpath.exists() >>> dpath.ensuredir() >>> assert dpath.exists() >>> dpath.rmdir()
- mkdir(mode=511, parents=False, exist_ok=False)[source]¶
Create a new directory at this given path.
Note
The ubelt variant is the same, except it returns the path as well.
- Parameters
mode (int) – perms
parents (bool) – create parents
exist_ok (bool) – fail if exists
- Returns
returns itself
- Return type
- expand()[source]¶
Expands user tilde and environment variables.
Concise alias of
Path(os.path.expandvars(self.expanduser()))
- Returns
path with expanded environment variables and tildes
- Return type
Example
>>> import ubelt as ub >>> #home_v1 = ub.Path('$HOME').expand() >>> home_v2 = ub.Path('~/').expand() >>> assert isinstance(home_v2, ub.Path) >>> home_v3 = ub.Path.home() >>> #print('home_v1 = {!r}'.format(home_v1)) >>> print('home_v2 = {!r}'.format(home_v2)) >>> print('home_v3 = {!r}'.format(home_v3)) >>> assert home_v3 == home_v2 # == home_v1
- expandvars()[source]¶
As discussed in [CPythonIssue21301], CPython won’t be adding expandvars to pathlib. I think this is a mistake, so I added it in this extension.
- Returns
path with expanded environment variables
- Return type
References
- ls(pattern=None)[source]¶
A convenience function to list all paths in a directory.
This is simply a wraper around iterdir that returns the results as a list instead of a generator. This is mainly for faster navigation in IPython. In production code
iterdir
orglob
should be used instead.- Parameters
pattern (None | str) – if specified, performs a glob instead of an iterdir.
- Returns
an eagerly evaluated list of paths
- Return type
List[Path]
Note
When pattern is specified only paths matching the pattern are returned, not the paths inside matched directories. This is different than bash semantics where the pattern is first expanded and then ls is performed on all matching paths.
Example
>>> import ubelt as ub >>> self = ub.Path.appdir('ubelt/tests/ls') >>> (self / 'dir1').ensuredir() >>> (self / 'dir2').ensuredir() >>> (self / 'file1').touch() >>> (self / 'file2').touch() >>> (self / 'dir1/file3').touch() >>> (self / 'dir2/file4').touch() >>> children = self.ls() >>> assert isinstance(children, list) >>> print(ub.repr2(sorted([p.relative_to(self) for p in children]))) [ Path('dir1'), Path('dir2'), Path('file1'), Path('file2'), ] >>> children = self.ls('dir*/*') >>> assert isinstance(children, list) >>> print(ub.repr2(sorted([p.relative_to(self) for p in children]))) [ Path('dir1/file3'), Path('dir2/file4'), ]
- shrinkuser(home='~')[source]¶
Shrinks your home dir by replacing it with a tilde.
This is the inverse of
os.path.expanduser()
.- Parameters
home (str) – symbol used to replace the home path. Defaults to ‘~’, but you might want to use ‘$HOME’ or ‘%USERPROFILE%’ instead.
- Returns
path - shortened path replacing the home directory with a symbol
- Return type
Example
>>> import ubelt as ub >>> path = ub.Path('~').expand() >>> assert str(path.shrinkuser()) == '~' >>> assert str(ub.Path((str(path) + '1')).shrinkuser()) == str(path) + '1' >>> assert str((path / '1').shrinkuser()) == join('~', '1') >>> assert str((path / '1').shrinkuser('$HOME')) == join('$HOME', '1') >>> assert str(ub.Path('.').shrinkuser()) == '.'
- touch(mode=438, exist_ok=True)[source]¶
Create this file with the given access mode, if it doesn’t exist.
- Returns
returns itself
- Return type
Note
The
ubelt.util_io.touch()
function currently has a slightly different implementation. This uses whatever the pathlib version is. This may change in the future.
- walk(topdown=True, onerror=None, followlinks=False)[source]¶
A variant of
os.walk()
for pathlib- Parameters
topdown (bool) – if True starts yield nodes closer to the root first otherwise yield nodes closer to the leaves first.
onerror (Callable[[OSError], None] | None) – A function with one argument of type OSError. If the error is raised the walk is aborted, otherwise it continues.
followlinks (bool) – if True recurse into symbolic directory links
- Yields
Tuple[‘Path’, List[str], List[str]] – the root path, directory names, and file names
Example
>>> import ubelt as ub >>> self = ub.Path.appdir('ubelt/tests/ls') >>> (self / 'dir1').ensuredir() >>> (self / 'dir2').ensuredir() >>> (self / 'file1').touch() >>> (self / 'file2').touch() >>> (self / 'dir1/file3').touch() >>> (self / 'dir2/file4').touch() >>> subdirs = list(self.walk()) >>> assert len(subdirs) == 3
Example
>>> # Modified from the stdlib >>> import os >>> from os.path import join, getsize >>> import email >>> import ubelt as ub >>> base = ub.Path(email.__file__).parent >>> for root, dirs, files in base.walk(): >>> print(root, " consumes", end="") >>> print(sum(getsize(join(root, name)) for name in files), end="") >>> print("bytes in ", len(files), " non-directory files") >>> if 'CVS' in dirs: >>> dirs.remove('CVS') # don't visit CVS directories
- endswith(suffix, *args)[source]¶
Test if the fspath representation endswith a particular string
Allows ubelt.Path to be a better drop-in replacement when working with string-based paths.
- Parameters
suffix (str | Tuple[str, …]) – One or more suffixes to test for
*args – start (int): if specified begin testing at this position. end (int): if specified stop testing at this position.
- Returns
True if any of the suffixes are matched.
- Return type
Example
>>> import ubelt as ub >>> base = ub.Path('base') >>> assert base.endswith('se') >>> assert not base.endswith('be') >>> # test start / stop cases >>> assert ub.Path('aabbccdd').endswith('cdd', 5) >>> assert not ub.Path('aabbccdd').endswith('cdd', 6) >>> assert ub.Path('aabbccdd').endswith('cdd', 5, 10) >>> assert not ub.Path('aabbccdd').endswith('cdd', 5, 7) >>> # test tuple case >>> assert ub.Path('aabbccdd').endswith(('foo', 'cdd')) >>> assert ub.Path('foo').endswith(('foo', 'cdd')) >>> assert not ub.Path('bar').endswith(('foo', 'cdd'))
- startswith(prefix, *args)[source]¶
Test if the fspath representation startswith a particular string
Allows ubelt.Path to be a better drop-in replacement when working with string-based paths.
- Parameters
prefix (str | Tuple[str, …]) – One or more prefixes to test for
*args – start (int): if specified begin testing at this position. end (int): if specified stop testing at this position.
- Returns
True if any of the prefixes are matched.
- Return type
Example
>>> import ubelt as ub >>> base = ub.Path('base') >>> assert base.startswith('base') >>> assert not base.startswith('all your') >>> # test start / stop cases >>> assert ub.Path('aabbccdd').startswith('aab', 0) >>> assert ub.Path('aabbccdd').startswith('aab', 0, 5) >>> assert not ub.Path('aabbccdd').startswith('aab', 1, 5) >>> assert not ub.Path('aabbccdd').startswith('aab', 0, 2) >>> # test tuple case >>> assert ub.Path('aabbccdd').startswith(('foo', 'aab')) >>> assert ub.Path('foo').startswith(('foo', 'aab')) >>> assert not ub.Path('bar').startswith(('foo', 'aab'))
- copy(dst, follow_file_symlinks=False, follow_dir_symlinks=False, meta='stats', overwrite=False)[source]¶
Copy this file or directory to dst.
By default files are never overwritten and symlinks are copied as-is.
At a basic level (i.e. ignoring symlinks) for each path argument (
src
anddst
) these can either be files, directories, or not exist. Given these three states, the following table summarizes how this function copies this path to its destination.TextArt
+----------+------------------------+------------------------+------------+ | dst | dir | file | no-exist | +----------+ | | | | src | | | | +==========+========================+========================+============+ | dir | error-or-overwrite-dst | error | dst | +----------+------------------------+------------------------+------------+ | file | dst / src.name | error-or-overwrite-dst | dst | +----------+------------------------+------------------------+------------+ | no-exist | error | error | error | +----------+------------------------+------------------------+------------+
In general, the contents of src will be the contents of dst, except for the one case where a file is copied into an existing directory. In this case the name is used to construct a fully qualified destination.
- Parameters
dst (str | PathLike) – if src is a file and dst does not exist, copies this to dst if src is a file and dst is a directory, copies this to dst / src.name
if src is a directory and dst does not exist, copies this to dst if src is a directory and dst is a directory, errors unless overwrite is True, in which case, copies this to dst and overwrites anything conflicting path.
follow_file_symlinks (bool) – If True and src is a link, the link will be resolved before it is copied (i.e. the data is duplicated), otherwise just the link itself will be copied.
follow_dir_symlinks (bool) – if True when src is a directory and contains symlinks to other directories, the contents of the linked data are copied, otherwise when False only the link itself is copied.
meta (str | None) – Indicates what metadata bits to copy. This can be ‘stats’ which tries to copy all metadata (i.e. like
shutil.copy2()
), ‘mode’ which copies just the permission bits (i.e. likeshutil.copy()
), or None, which ignores all metadata (i.e. likeshutil.copyfile()
).overwrite (bool) – if False, and target file exists, this will raise an error, otherwise the file will be overwritten.
- Returns
where the path was actually copied to
- Return type
Note
This is implemented with a combination of
shutil.copy()
,shutil.copy2()
, andshutil.copytree()
, but the The defaults and behavior here are noticably different (and hopefully safer and more intuitive).Example
>>> import ubelt as ub >>> root = ub.Path.appdir('ubelt', 'tests', 'path', 'copy').delete().ensuredir() >>> paths = {} >>> dpath = (root / 'orig').ensuredir() >>> clone0 = (root / 'dst_is_explicit').ensuredir() >>> clone1 = (root / 'dst_is_parent').ensuredir() >>> paths['fpath'] = (dpath / 'file0.txt').touch() >>> paths['empty_dpath'] = (dpath / 'empty_dpath').ensuredir() >>> paths['nested_dpath'] = (dpath / 'nested_dpath').ensuredir() >>> (dpath / 'nested_dpath/d0').ensuredir() >>> (dpath / 'nested_dpath/d0/f1.txt').touch() >>> (dpath / 'nested_dpath/d0/f2.txt').touch() >>> print('paths = {}'.format(ub.repr2(paths, nl=1))) >>> assert all(p.exists() for p in paths.values()) >>> paths['fpath'].copy(clone0 / 'file0.txt') >>> paths['fpath'].copy(clone1) >>> paths['empty_dpath'].copy(clone0 / 'empty_dpath') >>> paths['empty_dpath'].copy((clone1 / 'empty_dpath_alt').ensuredir(), overwrite=True) >>> paths['nested_dpath'].copy(clone0 / 'nested_dpath') >>> paths['nested_dpath'].copy((clone1 / 'nested_dpath_alt').ensuredir(), overwrite=True)
- move(dst, follow_file_symlinks=False, follow_dir_symlinks=False, meta='stats')[source]¶
Move a file from one location to another, or recursively move a directory from one location to another.
This method will refuse to overwrite anything, and there is currently no overwrite option for technical reasons. This may change in the future.
- Parameters
dst (str | PathLike) – A non-existing path where this file will be moved.
follow_file_symlinks (bool) – If True and src is a link, the link will be resolved before it is copied (i.e. the data is duplicated), otherwise just the link itself will be copied.
follow_dir_symlinks (bool) – if True when src is a directory and contains symlinks to other directories, the contents of the linked data are copied, otherwise when False only the link itself is copied.
meta (str | None) – Indicates what metadata bits to copy. This can be ‘stats’ which tries to copy all metadata (i.e. like shutil.copy2), ‘mode’ which copies just the permission bits (i.e. like shutil.copy), or None, which ignores all metadata (i.e. like shutil.copyfile).
Note
This method will refuse to overwrite anything.
This is implemented via
shutil.move()
, which depends heavily onos.rename()
semantics. For this reason, this function error if it would overwrite any data. If you want an overwriting variant of move we recommend you either either copy the data, and then delete the original (potentially inefficient), or useshutil.move()
directly if you know howos.rename()
works on your system.- Returns
where the path was actually moved to
- Return type
Example
>>> import ubelt as ub >>> dpath = ub.Path.appdir('ubelt', 'tests', 'path', 'move').delete().ensuredir() >>> paths = {} >>> paths['dpath0'] = (dpath / 'dpath0').ensuredir() >>> paths['dpath00'] = (dpath / 'dpath0' / 'sub0').ensuredir() >>> paths['fpath000'] = (dpath / 'dpath0' / 'sub0' / 'f0.txt').touch() >>> paths['fpath001'] = (dpath / 'dpath0' / 'sub0' / 'f1.txt').touch() >>> paths['dpath01'] = (dpath / 'dpath0' / 'sub1').ensuredir() >>> print('paths = {}'.format(ub.repr2(paths, nl=1))) >>> assert all(p.exists() for p in paths.values()) >>> # xdev.tree_repr(dpath, max_files=10) >>> paths['dpath0'].move(dpath / 'dpath1') >>> # xdev.tree_repr(dpath, max_files=10)
- class ubelt.ProgIter(iterable=None, desc=None, total=None, freq=1, initial=0, eta_window=64, clearline=True, adjust=True, time_thresh=2.0, show_percent=True, show_times=True, show_rate=True, show_eta=True, show_total=True, show_wall=False, enabled=True, verbose=None, stream=None, chunksize=None, rel_adjust_limit=4.0, homogeneous='auto', timer=None, **kwargs)[source]¶
Bases:
_TQDMCompat
,_BackwardsCompat
Prints progress as an iterator progresses
ProgIter is an alternative to tqdm. ProgIter implements much of the tqdm-API. The main difference between ProgIter and tqdm is that ProgIter does not use threading whereas tqdm does.
- Variables
iterable (List | Iterable) – A list or iterable to loop over
desc (str) – description label to show with progress
total (int) – Maximum length of the process. If not specified, we estimate it from the iterable, if possible.
freq (int) – How many iterations to wait between messages. Defaults to 1.
eta_window (int) – number of previous measurements to use in eta calculation, default=64
clearline (bool) – if True messages are printed on the same line otherwise each new progress message is printed on new line. default=True
adjust (bool) – if True freq is adjusted based on time_thresh. This may be overwritten depending on the setting of verbose. default=True
time_thresh (float) – desired amount of time to wait between messages if adjust is True otherwise does nothing, default=2.0
show_percent (bool) – if True show percent progress. Default=True
show_times (bool) – if False do not show rate, eta, or wall time. default=True Deprecated. Use show_rate / show_eta / show_wall instead.
show_rate (bool) – show / hide rate, default=True
show_eta (bool) – show / hide estimated time of arival (i.e. time to completion), default=True
show_wall (bool) – show / hide wall time, default=False
initial (int) – starting index offset, default=0
stream (IO) – stream where progress information is written to, default=sys.stdout
timer (callable) – the timer object to use. Defaults to
time.perf_counter()
.enabled (bool) – if False nothing happens. default=True
chunksize (int | None) – indicates that each iteration processes a batch of this size. Iteration rate is displayed in terms of single-items.
rel_adjust_limit (float) – Maximum factor update frequency can be adjusted by in a single step. default=4.0
verbose (int) – verbosity mode, which controls clearline, adjust, and enabled. The following maps the value of verbose to its effect. 0: enabled=False, 1: enabled=True with clearline=True and adjust=True, 2: enabled=True with clearline=False and adjust=True, 3: enabled=True with clearline=False and adjust=False
homogeneous (bool | str) – Indicate if the iterable is likely to take a uniform or homogeneous amount of time per iteration. When True we can enable a speed optimization. When False, the time estimates are more accurate. Default to “auto”, which attempts to determine if it is safe to use True. Has no effect if
adjust
is False.
Note
Either use ProgIter in a with statement or call prog.end() at the end of the computation if there is a possibility that the entire iterable may not be exhausted.
Note
ProgIter is an alternative to tqdm. The main difference between ProgIter and tqdm is that ProgIter does not use threading whereas tqdm does. ProgIter is simpler than tqdm and thus more stable in certain circumstances.
- SeeAlso:
References
http://datagenetics.com/blog/february12017/index.html
Example
>>> >>> def is_prime(n): ... return n >= 2 and not any(n % i == 0 for i in range(2, n)) >>> for n in ProgIter(range(100), verbose=1, show_wall=True): >>> # do some work >>> is_prime(n) 100/100... rate=... Hz, total=..., wall=...
- set_extra(extra)[source]¶
specify a custom info appended to the end of the next message
- Parameters
extra (str | Callable) – a constant or dynamically constructed extra message.
Todo
[ ] extra is a bad name; come up with something better and rename
Example
>>> prog = ProgIter(range(100, 300, 100), show_times=False, verbose=3) >>> for n in prog: >>> prog.set_extra('processesing num {}'.format(n)) 0.00% 0/2... 50.00% 1/2...processesing num 100 100.00% 2/2...processesing num 200
- begin()[source]¶
Initializes information used to measure progress
This only needs to be used if this ProgIter is not wrapping an iterable. Does nothing if this ProgIter is disabled.
- Returns
a chainable self-reference
- Return type
- end()[source]¶
Signals that iteration has ended and displays the final message.
This only needs to be used if this ProgIter is not wrapping an iterable. Does nothing if this ProgIter object is disabled or has already finished.
- step(inc=1, force=False)[source]¶
Manually step progress update, either directly or by an increment.
- Parameters
inc (int, default=1) – number of steps to increment
force (bool, default=False) – if True forces progress display
Example
>>> n = 3 >>> prog = ProgIter(desc='manual', total=n, verbose=3) >>> # Need to manually begin and end in this mode >>> prog.begin() >>> for _ in range(n): ... prog.step() >>> prog.end()
Example
>>> n = 3 >>> # can be used as a context manager in manual mode >>> with ProgIter(desc='manual', total=n, verbose=3) as prog: ... for _ in range(n): ... prog.step()
- format_message()[source]¶
Exists only for backwards compatibility.
See format_message_parts for more recent API.
- format_message_parts()[source]¶
builds a formatted progres message with the current values. This contains the special characters needed to clear lines.
Example
>>> self = ProgIter(clearline=False, show_times=False) >>> print(repr(self.format_message_parts()[1])) ' 0/?... ' >>> self.begin() >>> self.step() >>> print(repr(self.format_message_parts()[1])) ' 1/?... '
Example
>>> self = ProgIter(chunksize=10, total=100, clearline=False, >>> show_times=False, microseconds=True) >>> # hack, microseconds=True for coverage, needs real test >>> print(repr(self.format_message_parts()[1])) ' 0.00% of 10x100... ' >>> self.begin() >>> self.update() # tqdm alternative to step >>> print(repr(self.format_message_parts()[1])) ' 1.00% of 10x100... '
- ensure_newline()[source]¶
use before any custom printing when using the progress iter to ensure your print statement starts on a new line instead of at the end of a progress line
Example
>>> # Unsafe version may write your message on the wrong line >>> prog = ProgIter(range(3), show_times=False, freq=2, adjust=False, ... time_thresh=0) >>> for n in prog: ... print('unsafe message') 0.00% 0/3... unsafe message unsafe message 66.67% 2/3... unsafe message 100.00% 3/3... >>> # apparently the safe version does this too. >>> print('---') --- >>> prog = ProgIter(range(3), show_times=False, freq=2, adjust=False, ... time_thresh=0) >>> for n in prog: ... prog.ensure_newline() ... print('safe message') 0.00% 0/3... safe message safe message 66.67% 2/3... safe message 100.00% 3/3...
- class ubelt.SetDict[source]¶
Bases:
dict
A dictionary subclass where all set operations are defined.
All of the set operations are defined in a key-wise fashion, that is it is like performing the operation on sets of keys.
Note
The SetDict class only defines key-wise set operations. Value-wise or item-wise operations are in general not hashable and therefore not supported. A heavier extension would be needed for that.
Example
>>> import ubelt as ub >>> primes = ub.sdict({v: f'prime_{v}' for v in [2, 3, 5, 7, 11]}) >>> evens = ub.sdict({v: f'even_{v}' for v in [0, 2, 4, 6, 8, 10]}) >>> odds = ub.sdict({v: f'odd_{v}' for v in [1, 3, 5, 7, 9, 11]}) >>> squares = ub.sdict({v: f'square_{v}' for v in [0, 1, 4, 9]}) >>> div3 = ub.sdict({v: f'div3_{v}' for v in [0, 3, 6, 9]}) >>> # All of the set methods are defined >>> results1 = {} >>> results1['ints'] = ints = odds.union(evens) >>> results1['composites'] = ints.difference(primes) >>> results1['even_primes'] = evens.intersection(primes) >>> results1['odd_nonprimes_and_two'] = odds.symmetric_difference(primes) >>> print('results1 = {}'.format(ub.repr2(results1, nl=2, sort=True))) results1 = { 'composites': { 0: 'even_0', 1: 'odd_1', 4: 'even_4', 6: 'even_6', 8: 'even_8', 9: 'odd_9', 10: 'even_10', }, 'even_primes': { 2: 'even_2', }, 'ints': { 0: 'even_0', 1: 'odd_1', 2: 'even_2', 3: 'odd_3', 4: 'even_4', 5: 'odd_5', 6: 'even_6', 7: 'odd_7', 8: 'even_8', 9: 'odd_9', 10: 'even_10', 11: 'odd_11', }, 'odd_nonprimes_and_two': { 1: 'odd_1', 2: 'prime_2', 9: 'odd_9', }, } >>> # As well as their corresponding binary operators >>> assert results1['ints'] == odds | evens >>> assert results1['composites'] == ints - primes >>> assert results1['even_primes'] == evens & primes >>> assert results1['odd_nonprimes_and_two'] == odds ^ primes >>> # These can also be used as classmethods >>> assert results1['ints'] == ub.sdict.union(odds, evens) >>> assert results1['composites'] == ub.sdict.difference(ints, primes) >>> assert results1['even_primes'] == ub.sdict.intersection(evens, primes) >>> assert results1['odd_nonprimes_and_two'] == ub.sdict.symmetric_difference(odds, primes) >>> # The narry variants are also implemented >>> results2 = {} >>> results2['nary_union'] = ub.sdict.union(primes, div3, odds) >>> results2['nary_difference'] = ub.sdict.difference(primes, div3, odds) >>> results2['nary_intersection'] = ub.sdict.intersection(primes, div3, odds) >>> # Note that the definition of symmetric difference might not be what you think in the nary case. >>> results2['nary_symmetric_difference'] = ub.sdict.symmetric_difference(primes, div3, odds) >>> print('results2 = {}'.format(ub.repr2(results2, nl=2, sort=True))) results2 = { 'nary_difference': { 2: 'prime_2', }, 'nary_intersection': { 3: 'prime_3', }, 'nary_symmetric_difference': { 0: 'div3_0', 1: 'odd_1', 2: 'prime_2', 3: 'odd_3', 6: 'div3_6', }, 'nary_union': { 0: 'div3_0', 1: 'odd_1', 2: 'prime_2', 3: 'odd_3', 5: 'odd_5', 6: 'div3_6', 7: 'odd_7', 9: 'odd_9', 11: 'odd_11', }, }
Example
>>> # A neat thing about our implementation is that often the right >>> # hand side is not required to be a dictionary, just something >>> # that can be cast to a set. >>> import ubelt as ub >>> primes = ub.sdict({2: 'a', 3: 'b', 5: 'c', 7: 'd', 11: 'e'}) >>> assert primes - {2, 3} == {5: 'c', 7: 'd', 11: 'e'} >>> assert primes & {2, 3} == {2: 'a', 3: 'b'} >>> # Union does need to have a second dictionary >>> import pytest >>> with pytest.raises(AttributeError): >>> primes | {2, 3}
- copy()[source]¶
Example
>>> import ubelt as ub >>> a = ub.sdict({1: 1, 2: 2, 3: 3}) >>> b = ub.udict({1: 1, 2: 2, 3: 3}) >>> c = a.copy() >>> d = b.copy() >>> assert c is not a >>> assert d is not b >>> assert d == b >>> assert c == a >>> list(map(type, [a, b, c, d])) >>> assert isinstance(c, ub.sdict) >>> assert isinstance(d, ub.udict)
- union(*others, cls=None)[source]¶
Return the key-wise union of two or more dictionaries.
For items with intersecting keys, dictionaries towards the end of the sequence are given precedence.
- Parameters
self (SetDict | dict) – if called as a static method this must be provided.
*others – other dictionary like objects that have an
items
method. (i.e. it must return an iterable of 2-tuples where the first item is hashable.)cls (type | None) – the desired return dictionary type.
- Returns
whatever the dictionary type of the first argument is
- Return type
Example
>>> import ubelt as ub >>> a = ub.SetDict({k: 'A_' + chr(97 + k) for k in [2, 3, 5, 7]}) >>> b = ub.SetDict({k: 'B_' + chr(97 + k) for k in [2, 4, 0, 7]}) >>> c = ub.SetDict({k: 'C_' + chr(97 + k) for k in [2, 8, 3]}) >>> d = ub.SetDict({k: 'D_' + chr(97 + k) for k in [9, 10, 11]}) >>> e = ub.SetDict({k: 'E_' + chr(97 + k) for k in []}) >>> assert a | b == {2: 'B_c', 3: 'A_d', 5: 'A_f', 7: 'B_h', 4: 'B_e', 0: 'B_a'} >>> a.union(b) >>> a | b | c >>> res = ub.SetDict.union(a, b, c, d, e) >>> print(ub.repr2(res, sort=1, nl=0, si=1)) {0: B_a, 2: C_c, 3: C_d, 4: B_e, 5: A_f, 7: B_h, 8: C_i, 9: D_j, 10: D_k, 11: D_l}
- intersection(*others, cls=None)[source]¶
Return the key-wise intersection of two or more dictionaries.
All items returned will be from the first dictionary for keys that exist in all other dictionaries / sets provided.
- Parameters
self (SetDict | dict) – if called as a static method this must be provided.
*others – other dictionary or set like objects that can be coerced into a set of keys.
cls (type | None) – the desired return dictionary type.
- Returns
whatever the dictionary type of the first argument is
- Return type
Example
>>> import ubelt as ub >>> a = ub.SetDict({k: 'A_' + chr(97 + k) for k in [2, 3, 5, 7]}) >>> b = ub.SetDict({k: 'B_' + chr(97 + k) for k in [2, 4, 0, 7]}) >>> c = ub.SetDict({k: 'C_' + chr(97 + k) for k in [2, 8, 3]}) >>> d = ub.SetDict({k: 'D_' + chr(97 + k) for k in [9, 10, 11]}) >>> e = ub.SetDict({k: 'E_' + chr(97 + k) for k in []}) >>> assert a & b == {2: 'A_c', 7: 'A_h'} >>> a.intersection(b) >>> a & b & c >>> res = ub.SetDict.intersection(a, b, c, d, e) >>> print(ub.repr2(res, sort=1, nl=0, si=1)) {}
- difference(*others, cls=None)[source]¶
Return the key-wise difference between this dictionary and one or more other dictionary / keys.
The returned items will be from the first dictionary, and will only contain keys that do not appear in any of the other dictionaries / sets.
- Parameters
self (SetDict | dict) – if called as a static method this must be provided.
*others – other dictionary or set like objects that can be coerced into a set of keys.
cls (type | None) – the desired return dictionary type.
- Returns
whatever the dictionary type of the first argument is
- Return type
Example
>>> import ubelt as ub >>> a = ub.SetDict({k: 'A_' + chr(97 + k) for k in [2, 3, 5, 7]}) >>> b = ub.SetDict({k: 'B_' + chr(97 + k) for k in [2, 4, 0, 7]}) >>> c = ub.SetDict({k: 'C_' + chr(97 + k) for k in [2, 8, 3]}) >>> d = ub.SetDict({k: 'D_' + chr(97 + k) for k in [9, 10, 11]}) >>> e = ub.SetDict({k: 'E_' + chr(97 + k) for k in []}) >>> assert a - b == {3: 'A_d', 5: 'A_f'} >>> a.difference(b) >>> a - b - c >>> res = ub.SetDict.difference(a, b, c, d, e) >>> print(ub.repr2(res, sort=1, nl=0, si=1)) {5: A_f}
- symmetric_difference(*others, cls=None)[source]¶
Return the key-wise symmetric difference between this dictionary and one or more other dictionaries.
Returns items that are (key-wise) in an odd number of the given dictionaries. This is consistent with the standard n-ary definition of symmetric difference [WikiSymDiff] and corresponds with the xor operation.
- Parameters
self (SetDict | dict) – if called as a static method this must be provided.
*others – other dictionary or set like objects that can be coerced into a set of keys.
cls (type | None) – the desired return dictionary type.
- Returns
whatever the dictionary type of the first argument is
- Return type
References
Example
>>> import ubelt as ub >>> a = ub.SetDict({k: 'A_' + chr(97 + k) for k in [2, 3, 5, 7]}) >>> b = ub.SetDict({k: 'B_' + chr(97 + k) for k in [2, 4, 0, 7]}) >>> c = ub.SetDict({k: 'C_' + chr(97 + k) for k in [2, 8, 3]}) >>> d = ub.SetDict({k: 'D_' + chr(97 + k) for k in [9, 10, 11]}) >>> e = ub.SetDict({k: 'E_' + chr(97 + k) for k in []}) >>> a ^ b {3: 'A_d', 5: 'A_f', 4: 'B_e', 0: 'B_a'} >>> a.symmetric_difference(b) >>> a - b - c >>> res = ub.SetDict.symmetric_difference(a, b, c, d, e) >>> print(ub.repr2(res, sort=1, nl=0, si=1)) {0: B_a, 2: C_c, 4: B_e, 5: A_f, 8: C_i, 9: D_j, 10: D_k, 11: D_l}
- class ubelt.TeeStringIO(redirect=None)[source]¶
Bases:
StringIO
An IO object that writes to itself and another IO stream.
- Variables
redirect (io.IOBase) – The other stream to write to.
Example
>>> import ubelt as ub >>> redirect = io.StringIO() >>> self = ub.TeeStringIO(redirect)
- isatty()[source]¶
Returns true of the redirect is a terminal.
Note
Needed for
IPython.embed
to work properly when this class is used to override stdout / stderr.
- fileno()[source]¶
Returns underlying file descriptor of the redirected IOBase object if one exists.
Example
>>> # Not sure the best way to test, this func is important for >>> # capturing stdout when ipython embedding >>> import pytest >>> with pytest.raises(io.UnsupportedOperation): >>> TeeStringIO(redirect=io.StringIO()).fileno() >>> with pytest.raises(io.UnsupportedOperation): >>> TeeStringIO(None).fileno()
- property encoding¶
Gets the encoding of the redirect IO object
Example
>>> import ubelt as ub >>> redirect = io.StringIO() >>> assert ub.TeeStringIO(redirect).encoding is None >>> assert ub.TeeStringIO(None).encoding is None >>> assert ub.TeeStringIO(sys.stdout).encoding is sys.stdout.encoding >>> redirect = io.TextIOWrapper(io.StringIO()) >>> assert ub.TeeStringIO(redirect).encoding is redirect.encoding
- class ubelt.TempDir[source]¶
Bases:
object
Context for creating and cleaning up temporary directories.
Note
This class will be DEPRECATED. The exact deprecation version and mitigation plan has not yet been developed.
Note
This exists because
tempfile.TemporaryDirectory
was introduced in Python 3.2. Thus once ubelt no longer supports python 2.7, this class will be deprecated.Example
>>> from ubelt.util_path import * # NOQA >>> with TempDir() as self: >>> dpath = self.dpath >>> assert exists(dpath) >>> assert not exists(dpath)
Example
>>> from ubelt.util_path import * # NOQA >>> self = TempDir() >>> dpath = self.ensure() >>> assert exists(dpath) >>> self.cleanup() >>> assert not exists(dpath)
- class ubelt.Timer(label='', verbose=None, newline=True, ns=False)[source]¶
Bases:
object
Measures time elapsed between a start and end point. Can be used as a with-statement context manager, or using the tic/toc api.
- Parameters
label (str, default=’’) – identifier for printing
verbose (int, default=None) – verbosity flag, defaults to True if label is given, otherwise 0.
newline (bool, default=True) – if False and verbose, print tic and toc on the same line.
ns (bool, default=False) – if True, a nano-second resolution timer to avoid precision loss caused by the float type.
- Variables
Example
>>> # Create and start the timer using the context manager >>> import math >>> import ubelt as ub >>> timer = ub.Timer('Timer test!', verbose=1) >>> with timer: >>> math.factorial(10) >>> assert timer.elapsed > 0 tic('Timer test!') ...toc('Timer test!')=...
Example
>>> # Create and start the timer using the tic/toc interface >>> import ubelt as ub >>> timer = ub.Timer().tic() >>> elapsed1 = timer.toc() >>> elapsed2 = timer.toc() >>> elapsed3 = timer.toc() >>> assert elapsed1 <= elapsed2 >>> assert elapsed2 <= elapsed3
Example
>>> # In Python 3.7+ nanosecond resolution can be enabled >>> import ubelt as ub >>> import sys >>> if sys.version_info[0:2] <= (3, 6): >>> import pytest >>> pytest.skip() >>> # xdoctest +REQUIRES(Python>=3.7) # fixme directive doesnt exist yet >>> timer = ub.Timer(label='perf_counter_ns', ns=True).tic() >>> elapsed1 = timer.toc() >>> elapsed2 = timer.toc() >>> assert elapsed1 <= elapsed2 >>> assert isinstance(elapsed1, int)
- class ubelt.UDict[source]¶
Bases:
SetDict
A subclass of dict with ubelt enhancements
This builds on top of
SetDict
which itself is a simple extension that contains only that extra functionality. The extra invert, map, sorted, and peek functions are less fundamental and there are at least reasonable workarounds when they are not available.The UDict class is a simple subclass of dict that provides the following upgrades:
- set operations - inherited from
SetDict
intersection - find items in common
union - merge dicts
difference - find items in one but not the other
symmetric_difference - find items that appear an odd number of times
- set operations - inherited from
subdict - take a subset with optional default values. (similar to intersection, but the later ignores non-common values)
- inversion -
invert - swaps a dictionary keys and values (with options for dealing with duplicates).
- mapping -
map_keys - applies a function over each key and keeps the values the same
map_values - applies a function over each key and keeps the values the same
- sorting -
sorted_keys - returns a dictionary ordered by the keys
sorted_values - returns a dictionary ordered by the values
IMO key-wise set operations on dictionaries are fundamentaly and sorely missing from the stdlib, mapping is super convinient, sorting and inversion are less common, but still useful to have.
Todo
[ ] UbeltDict, UltraDict, not sure what the name is. We may just rename this to Dict,
Example
>>> import ubelt as ub >>> a = ub.udict({1: 20, 2: 20, 3: 30, 4: 40}) >>> b = ub.udict({0: 0, 2: 20, 4: 42}) >>> c = ub.udict({3: -1, 5: -1}) >>> # Demo key-wise set operations >>> assert a & b == {2: 20, 4: 40} >>> assert a - b == {1: 20, 3: 30} >>> assert a ^ b == {1: 20, 3: 30, 0: 0} >>> assert a | b == {1: 20, 2: 20, 3: 30, 4: 42, 0: 0} >>> # Demo new n-ary set methods >>> a.union(b, c) == {1: 20, 2: 20, 3: -1, 4: 42, 0: 0, 5: -1} >>> a.intersection(b, c) == {} >>> a.difference(b, c) == {1: 20} >>> a.symmetric_difference(b, c) == {1: 20, 0: 0, 5: -1} >>> # Demo new quality of life methods >>> assert a.subdict({2, 4, 6, 8}, default=None) == {8: None, 2: 20, 4: 40, 6: None} >>> assert a.invert() == {20: 2, 30: 3, 40: 4} >>> assert a.invert(unique_vals=0) == {20: {1, 2}, 30: {3}, 40: {4}} >>> assert a.peek_key() == ub.peek(a.keys()) >>> assert a.peek_value() == ub.peek(a.values()) >>> assert a.map_keys(lambda x: x * 10) == {10: 20, 20: 20, 30: 30, 40: 40} >>> assert a.map_values(lambda x: x * 10) == {1: 200, 2: 200, 3: 300, 4: 400}
- subdict(keys, default=NoParam)[source]¶
Get a subset of a dictionary
- Parameters
self (Dict[KT, VT]) – dictionary or the implicit instance
keys (Iterable[KT]) – keys to take from
self
default (Optional[object] | NoParamType) – if specified uses default if keys are missing.
- Raises
KeyError – if a key does not exist and default is not specified
Example
>>> import ubelt as ub >>> a = ub.udict({k: 'A_' + chr(97 + k) for k in [2, 3, 5, 7]}) >>> s = a.subdict({2, 5}) >>> print('s = {}'.format(ub.repr2(s, nl=0, sort=1))) s = {2: 'A_c', 5: 'A_f'} >>> import pytest >>> with pytest.raises(KeyError): >>> s = a.subdict({2, 5, 100}) >>> s = a.subdict({2, 5, 100}, default='DEF') >>> print('s = {}'.format(ub.repr2(s, nl=0, sort=1))) s = {2: 'A_c', 5: 'A_f', 100: 'DEF'}
- take(keys, default=NoParam)[source]¶
Get values of an iterable of keys.
- Parameters
self (Dict[KT, VT]) – dictionary or the implicit instance
keys (Iterable[KT]) – keys to take from
self
default (Optional[object] | NoParamType) – if specified uses default if keys are missing.
- Yields
VT – a selected value within the dictionary
- Raises
KeyError – if a key does not exist and default is not specified
Example
>>> import ubelt as ub >>> a = ub.udict({k: 'A_' + chr(97 + k) for k in [2, 3, 5, 7]}) >>> s = list(a.take({2, 5})) >>> print('s = {}'.format(ub.repr2(s, nl=0, sort=1))) s = ['A_c', 'A_f'] >>> import pytest >>> with pytest.raises(KeyError): >>> s = a.subdict({2, 5, 100}) >>> s = list(a.take({2, 5, 100}, default='DEF')) >>> print('s = {}'.format(ub.repr2(s, nl=0, sort=1))) s = ['A_c', 'A_f', 'DEF']
- invert(unique_vals=True)[source]¶
Swaps the keys and values in a dictionary.
- Parameters
self (Dict[KT, VT]) – dictionary or the implicit instance to invert
unique_vals (bool, default=True) – if False, the values of the new dictionary are sets of the original keys.
cls (type | None) – specifies the dict subclassof the result. if unspecified will be dict or OrderedDict. This behavior may change.
- Returns
the inverted dictionary
- Return type
Dict[VT, KT] | Dict[VT, Set[KT]]
Note
The must values be hashable.
If the original dictionary contains duplicate values, then only one of the corresponding keys will be returned and the others will be discarded. This can be prevented by setting
unique_vals=False
, causing the inverted keys to be returned in a set.Example
>>> import ubelt as ub >>> inverted = ub.udict({'a': 1, 'b': 2}).invert() >>> assert inverted == {1: 'a', 2: 'b'}
- map_keys(func)[source]¶
Apply a function to every value in a dictionary.
Creates a new dictionary with the same keys and modified values.
- Parameters
self (Dict[KT, VT]) – a dictionary or the implicit instance.
func (Callable[[VT], T] | Mapping[VT, T]) – a function or indexable object
- Returns
transformed dictionary
- Return type
Dict[KT, T]
Example
>>> import ubelt as ub >>> new = ub.udict({'a': [1, 2, 3], 'b': []}).map_keys(ord) >>> assert new == {97: [1, 2, 3], 98: []}
- map_values(func)[source]¶
Apply a function to every value in a dictionary.
Creates a new dictionary with the same keys and modified values.
- Parameters
self (Dict[KT, VT]) – a dictionary or the implicit instance.
func (Callable[[VT], T] | Mapping[VT, T]) – a function or indexable object
- Returns
transformed dictionary
- Return type
Dict[KT, T]
Example
>>> import ubelt as ub >>> newdict = ub.udict({'a': [1, 2, 3], 'b': []}).map_values(len) >>> assert newdict == {'a': 3, 'b': 0}
- sorted_keys(key=None, reverse=False)[source]¶
Return an ordered dictionary sorted by its keys
- Parameters
self (Dict[KT, VT]) – dictionary to sort or the implicit instance. The keys must be of comparable types.
key (Callable[[KT], Any] | None) – If given as a callable, customizes the sorting by ordering using transformed keys.
reverse (bool, default=False) – if True returns in descending order
- Returns
new dictionary where the keys are ordered
- Return type
OrderedDict[KT, VT]
Example
>>> import ubelt as ub >>> new = ub.udict({'spam': 2.62, 'eggs': 1.20, 'jam': 2.92}).sorted_keys() >>> assert new == ub.odict([('eggs', 1.2), ('jam', 2.92), ('spam', 2.62)])
- sorted_values(key=None, reverse=False)[source]¶
Return an ordered dictionary sorted by its values
- Parameters
self (Dict[KT, VT]) – dictionary to sort or the implicit instance. The values must be of comparable types.
key (Callable[[VT], Any] | None) – If given as a callable, customizes the sorting by ordering using transformed values.
reverse (bool, default=False) – if True returns in descending order
- Returns
new dictionary where the values are ordered
- Return type
OrderedDict[KT, VT]
Example
>>> import ubelt as ub >>> new = ub.udict({'spam': 2.62, 'eggs': 1.20, 'jam': 2.92}).sorted_values() >>> assert new == ub.odict([('eggs', 1.2), ('spam', 2.62), ('jam', 2.92)])
- peek_key(default=NoParam)[source]¶
Get the first key in the dictionary
- Parameters
self (Dict) – a dictionary or the implicit instance
default (KT | NoParamType) – default item to return if the iterable is empty, otherwise a StopIteration error is raised
- Returns
the first value or the default
- Return type
KT
Example
>>> import ubelt as ub >>> assert ub.udict({1: 2}).peek_key() == 1
- peek_value(default=NoParam)[source]¶
Get the first value in the dictionary
- Parameters
self (Dict[KT, VT]) – a dictionary or the implicit instance
default (VT | NoParamType) – default item to return if the iterable is empty, otherwise a StopIteration error is raised
- Returns
the first value or the default
- Return type
VT
Example
>>> import ubelt as ub >>> assert ub.udict({1: 2}).peek_value() == 2
- ubelt.allsame(iterable, eq=<built-in function eq>)[source]¶
Determine if all items in a sequence are the same
- Parameters
iterable (Iterable[T]) – items to determine if they are all the same
eq (Callable[[T, T], bool], default=operator.eq) – function used to test for equality
- Returns
True if all items are equal, otherwise False
- Return type
Notes
Similar to
more_itertools.all_equal()
Example
>>> import ubelt as ub >>> ub.allsame([1, 1, 1, 1]) True >>> ub.allsame([]) True >>> ub.allsame([0, 1]) False >>> iterable = iter([0, 1, 1, 1]) >>> next(iterable) >>> ub.allsame(iterable) True >>> ub.allsame(range(10)) False >>> ub.allsame(range(10), lambda a, b: True) True
- ubelt.argflag(key, argv=None)[source]¶
Determines if a key is specified on the command line.
This is a functional alternative to
key in sys.argv
, but it also allows for multiple aliases of the same flag to be specified.- Parameters
key (str | Tuple[str, …]) – string or tuple of strings. Each key should be prefixed with two hyphens (i.e.
--
).argv (List[str] | None, default=None) – overrides
sys.argv
if specified
- Returns
flag - True if the key (or any of the keys) was specified
- Return type
CommandLine
xdoctest -m ubelt.util_arg argflag:0 xdoctest -m ubelt.util_arg argflag:0 --devflag xdoctest -m ubelt.util_arg argflag:0 -df xdoctest -m ubelt.util_arg argflag:0 --devflag2 xdoctest -m ubelt.util_arg argflag:0 -df2
Example
>>> # Everyday usage of this function might look like this >>> import ubelt as ub >>> # Check if either of these strings are in sys.argv >>> flag = ub.argflag(('-df', '--devflag')) >>> if flag: >>> print(ub.color_text( >>> 'A hidden developer flag was given!', 'blue')) >>> print('Pass the hidden CLI flag to see a secret message')
Example
>>> import ubelt as ub >>> argv = ['--spam', '--eggs', 'foo'] >>> assert ub.argflag('--eggs', argv=argv) is True >>> assert ub.argflag('--ans', argv=argv) is False >>> assert ub.argflag('foo', argv=argv) is True >>> assert ub.argflag(('bar', '--spam'), argv=argv) is True
- ubelt.argmax(indexable, key=None)[source]¶
Returns index / key of the item with the largest value.
This is similar to
numpy.argmax()
, but it is written in pure python and works on both lists and dictionaries.- Parameters
indexable (Iterable[VT] | Mapping[KT, VT]) – indexable to sort by
key (Callable[[VT], Any] | None, default=None) – customizes the ordering of the indexable
- Returns
the index of the item with the maximum value.
- Return type
int | KT
Example
>>> import ubelt as ub >>> assert ub.argmax({'a': 3, 'b': 2, 'c': 100}) == 'c' >>> assert ub.argmax(['a', 'c', 'b', 'z', 'f']) == 3 >>> assert ub.argmax([[0, 1], [2, 3, 4], [5]], key=len) == 1 >>> assert ub.argmax({'a': 3, 'b': 2, 3: 100, 4: 4}) == 3 >>> assert ub.argmax(iter(['a', 'c', 'b', 'z', 'f'])) == 3
- ubelt.argmin(indexable, key=None)[source]¶
Returns index / key of the item with the smallest value.
This is similar to
numpy.argmin()
, but it is written in pure python and works on both lists and dictionaries.- Parameters
indexable (Iterable[VT] | Mapping[KT, VT]) – indexable to sort by
key (Callable[[VT], VT] | None, default=None) – customizes the ordering of the indexable
- Returns
the index of the item with the minimum value.
- Return type
int | KT
Example
>>> import ubelt as ub >>> assert ub.argmin({'a': 3, 'b': 2, 'c': 100}) == 'b' >>> assert ub.argmin(['a', 'c', 'b', 'z', 'f']) == 0 >>> assert ub.argmin([[0, 1], [2, 3, 4], [5]], key=len) == 2 >>> assert ub.argmin({'a': 3, 'b': 2, 3: 100, 4: 4}) == 'b' >>> assert ub.argmin(iter(['a', 'c', 'A', 'z', 'f'])) == 2
- ubelt.argsort(indexable, key=None, reverse=False)[source]¶
Returns the indices that would sort a indexable object.
This is similar to
numpy.argsort()
, but it is written in pure python and works on both lists and dictionaries.- Parameters
indexable (Iterable[VT] | Mapping[KT, VT]) – indexable to sort by
key (Callable[[VT], VT] | None, default=None) – customizes the ordering of the indexable
reverse (bool, default=False) – if True returns in descending order
- Returns
indices - list of indices that sorts the indexable
- Return type
List[int] | List[KT]
Example
>>> import ubelt as ub >>> # argsort works on dicts by returning keys >>> dict_ = {'a': 3, 'b': 2, 'c': 100} >>> indices = ub.argsort(dict_) >>> assert list(ub.take(dict_, indices)) == sorted(dict_.values()) >>> # argsort works on lists by returning indices >>> indexable = [100, 2, 432, 10] >>> indices = ub.argsort(indexable) >>> assert list(ub.take(indexable, indices)) == sorted(indexable) >>> # Can use iterators, but be careful. It exhausts them. >>> indexable = reversed(range(100)) >>> indices = ub.argsort(indexable) >>> assert indices[0] == 99 >>> # Can use key just like sorted >>> indexable = [[0, 1, 2], [3, 4], [5]] >>> indices = ub.argsort(indexable, key=len) >>> assert indices == [2, 1, 0] >>> # Can use reverse just like sorted >>> indexable = [0, 2, 1] >>> indices = ub.argsort(indexable, reverse=True) >>> assert indices == [1, 2, 0]
- ubelt.argunique(items, key=None)[source]¶
Returns indices corresponding to the first instance of each unique item.
- Parameters
items (Sequence[VT]) – indexable collection of items
key (Callable[[VT], Any] | None, default=None) – custom normalization function. If specified returns items where
key(item)
is unique.
- Returns
indices of the unique items
- Return type
Iterator[int]
Example
>>> import ubelt as ub >>> items = [0, 2, 5, 1, 1, 0, 2, 4] >>> indices = list(ub.argunique(items)) >>> assert indices == [0, 1, 2, 3, 7] >>> indices = list(ub.argunique(items, key=lambda x: x % 2 == 0)) >>> assert indices == [0, 2]
- ubelt.argval(key, default=NoParam, argv=None)[source]¶
Get the value of a keyword argument specified on the command line.
Values can be specified as
<key> <value>
or<key>=<value>
The use-case for this function is to add hidden command line feature where a developer can pass in a special value. This can be used to prototype a command line interface, provide an easter egg, or add some other command line parsing that wont be exposed in CLI help docs.
- Parameters
key (str | Tuple[str, …]) – string or tuple of strings. Each key should be prefixed with two hyphens (i.e.
--
)default (T | NoParamType, default=NoParam) – a value to return if not specified.
argv (List[str] | None, default=None) – uses
sys.argv
if unspecified
- Returns
value - the value specified after the key. It they key is specified multiple times, then the first value is returned.
- Return type
str | T
Todo
[x] Can we handle the case where the value is a list of long paths? - No
[ ] Should we default the first or last specified instance of the flag.
CommandLine
xdoctest -m ubelt.util_arg argval:0 xdoctest -m ubelt.util_arg argval:0 --devval xdoctest -m ubelt.util_arg argval:0 --devval=1 xdoctest -m ubelt.util_arg argval:0 --devval=2 xdoctest -m ubelt.util_arg argval:0 --devval 3 xdoctest -m ubelt.util_arg argval:0 --devval "4 5 6"
Example
>>> # Everyday usage of this function might look like this where >>> import ubelt as ub >>> # grab a key/value pair if is given on the command line >>> value = ub.argval('--devval', default='1') >>> print('Checking if the hidden CLI key/value pair is given') >>> if value != '1': >>> print(ub.color_text( >>> 'A hidden developer secret: {!r}'.format(value), 'yellow')) >>> print('Pass the hidden CLI key/value pair to see a secret message')
Example
>>> import ubelt as ub >>> argv = ['--ans', '42', '--quest=the grail', '--ans=6', '--bad'] >>> assert ub.argval('--spam', argv=argv) == ub.NoParam >>> assert ub.argval('--quest', argv=argv) == 'the grail' >>> assert ub.argval('--ans', argv=argv) == '42' >>> assert ub.argval('--bad', argv=argv) == ub.NoParam >>> assert ub.argval(('--bad', '--bar'), argv=argv) == ub.NoParam
Example
>>> # Test fix for GH Issue #41 >>> import ubelt as ub >>> argv = ['--path=/path/with/k=3'] >>> ub.argval('--path', argv=argv) == '/path/with/k=3'
- ubelt.augpath(path, suffix='', prefix='', ext=None, tail='', base=None, dpath=None, relative=None, multidot=False)[source]¶
Create a new path with a different extension, basename, directory, prefix, and/or suffix.
A prefix is inserted before the basename. A suffix is inserted between the basename and the extension. The basename and extension can be replaced with a new one. Essentially a path is broken down into components (dpath, base, ext), and then recombined as (dpath, prefix, base, suffix, ext) after replacing any specified component.
- Parameters
path (str | PathLike) – a path to augment
suffix (str) – placed between the basename and extension Note: this is referred to as stemsuffix in
ub.Path.augment()
.prefix (str) – placed in front of the basename
ext (str | None) – if specified, replaces the extension
tail (str | None) – If specified, appends this text to the extension
base (str | None) – if specified, replaces the basename without extension. Note: this is referred to as stem in
ub.Path.augment()
.dpath (str | PathLike | None) – if specified, replaces the specified “relative” directory, which by default is the parent directory.
relative (str | PathLike | None) – Replaces
relative
withdpath
inpath
. Has no effect ifdpath
is not specified. Defaults to the dirname of the inputpath
. experimental not currently implemented.multidot (bool) – Allows extensions to contain multiple dots. Specifically, if False, everything after the last dot in the basename is the extension. If True, everything after the first dot in the basename is the extension.
- Returns
augmented path
- Return type
Example
>>> import ubelt as ub >>> path = 'foo.bar' >>> suffix = '_suff' >>> prefix = 'pref_' >>> ext = '.baz' >>> newpath = ub.augpath(path, suffix, prefix, ext=ext, base='bar') >>> print('newpath = %s' % (newpath,)) newpath = pref_bar_suff.baz
Example
>>> from ubelt.util_path import * # NOQA >>> augpath('foo.bar') 'foo.bar' >>> augpath('foo.bar', ext='.BAZ') 'foo.BAZ' >>> augpath('foo.bar', suffix='_') 'foo_.bar' >>> augpath('foo.bar', prefix='_') '_foo.bar' >>> augpath('foo.bar', base='baz') 'baz.bar' >>> augpath('foo.tar.gz', ext='.zip', multidot=True) foo.zip >>> augpath('foo.tar.gz', ext='.zip', multidot=False) foo.tar.zip >>> augpath('foo.tar.gz', suffix='_new', multidot=True) foo_new.tar.gz >>> augpath('foo.tar.gz', suffix='_new', tail='.cache', multidot=True) foo_new.tar.gz.cache
- ubelt.boolmask(indices, maxval=None)[source]¶
Constructs a list of booleans where an item is True if its position is in
indices
otherwise it is False.- Parameters
indices (List[int]) – list of integer indices
maxval (int | None) – length of the returned list. If not specified this is inferred using
max(indices)
- Returns
mask - a list of booleans. mask[idx] is True if idx in indices
- Return type
List[bool]
Note
In the future the arg
maxval
may change its name toshape
Example
>>> import ubelt as ub >>> indices = [0, 1, 4] >>> mask = ub.boolmask(indices, maxval=6) >>> assert mask == [True, True, False, False, True, False] >>> mask = ub.boolmask(indices) >>> assert mask == [True, True, False, False, True]
- class ubelt.chunks(items, chunksize=None, nchunks=None, total=None, bordermode='none', legacy=False)[source]¶
Bases:
object
Generates successive n-sized chunks from
items
.If the last chunk has less than n elements,
bordermode
is used to determine fill values.- Parameters
items (Iterable[T]) – input to iterate over
chunksize (int) – size of each sublist yielded
nchunks (int) – number of chunks to create ( cannot be specified if chunksize is specified)
bordermode (str) – determines how to handle the last case if the length of the input is not divisible by chunksize valid values are: {‘none’, ‘cycle’, ‘replicate’}
total (int) – hints about the length of the input
Note
- FIXME:
When nchunks is given, that’s how many chunks we should get but the issue is that chunksize is not well defined in that instance For instance how do we turn a list with 4 elements into 3 chunks where does the extra item go?
In ubelt <= 0.10.3 there is a bug when specifying nchunks, where it chooses a chunksize that is too large. Specify
legacy=True
to get the old buggy behavior if needed.Notes
- This is similar to functionality provided by
more_itertools.chunked()
,more_itertools.chunked_even()
,more_itertools.sliced()
,more_itertools.divide()
,
- Yields
List[T] – subsequent non-overlapping chunks of the input items
References
Example
>>> import ubelt as ub >>> items = '1234567' >>> genresult = ub.chunks(items, chunksize=3) >>> list(genresult) [['1', '2', '3'], ['4', '5', '6'], ['7']]
Example
>>> import ubelt as ub >>> items = [1, 2, 3, 4, 5, 6, 7] >>> genresult = ub.chunks(items, chunksize=3, bordermode='none') >>> assert list(genresult) == [[1, 2, 3], [4, 5, 6], [7]] >>> genresult = ub.chunks(items, chunksize=3, bordermode='cycle') >>> assert list(genresult) == [[1, 2, 3], [4, 5, 6], [7, 1, 2]] >>> genresult = ub.chunks(items, chunksize=3, bordermode='replicate') >>> assert list(genresult) == [[1, 2, 3], [4, 5, 6], [7, 7, 7]]
Example
>>> import ubelt as ub >>> assert len(list(ub.chunks(range(2), nchunks=2))) == 2 >>> assert len(list(ub.chunks(range(3), nchunks=2))) == 2 >>> # Note: ub.chunks will not do the 2,1,1 split >>> assert len(list(ub.chunks(range(4), nchunks=3))) == 3 >>> assert len(list(ub.chunks([], 2, bordermode='none'))) == 0 >>> assert len(list(ub.chunks([], 2, bordermode='cycle'))) == 0 >>> assert len(list(ub.chunks([], 2, None, bordermode='replicate'))) == 0
Example
>>> from ubelt.util_list import * # NOQA >>> def _check_len(self): ... assert len(self) == len(list(self)) >>> _check_len(chunks(list(range(3)), nchunks=2)) >>> _check_len(chunks(list(range(2)), nchunks=2)) >>> _check_len(chunks(list(range(2)), nchunks=3))
Example
>>> from ubelt.util_list import * # NOQA >>> import pytest >>> assert pytest.raises(ValueError, chunks, range(9)) >>> assert pytest.raises(ValueError, chunks, range(9), chunksize=2, nchunks=2) >>> assert pytest.raises(TypeError, len, chunks((_ for _ in range(2)), 2))
Example
>>> from ubelt.util_list import * # NOQA >>> import ubelt as ub >>> basis = { >>> 'legacy': [False, True], >>> 'chunker': [{'nchunks': 3}, {'nchunks': 4}, {'nchunks': 5}, {'nchunks': 7}, {'chunksize': 3}], >>> 'items': [range(2), range(4), range(5), range(7), range(9)], >>> 'bordermode': ['none', 'cycle', 'replicate'], >>> } >>> grid_items = list(ub.named_product(basis)) >>> rows = [] >>> for grid_item in ub.ProgIter(grid_items): >>> chunker = grid_item.get('chunker') >>> grid_item.update(chunker) >>> kw = ub.dict_diff(grid_item, {'chunker'}) >>> self = chunk_iter = ub.chunks(**kw) >>> chunked = list(chunk_iter) >>> chunk_lens = list(map(len, chunked)) >>> row = ub.dict_union(grid_item, {'chunk_lens': chunk_lens, 'chunks': chunked}) >>> row['chunker'] = str(row['chunker']) >>> if not row['legacy'] and 'nchunks' in kw: >>> assert kw['nchunks'] == row['nchunks'] >>> row.update(chunk_iter.__dict__) >>> rows.append(row) >>> # xdoctest: +SKIP >>> import pandas as pd >>> df = pd.DataFrame(rows) >>> for _, subdf in df.groupby('chunker'): >>> print(subdf)
- ubelt.cmd(command, shell=False, detach=False, verbose=0, tee=None, cwd=None, env=None, tee_backend='auto', check=False, system=False, timeout=None)[source]¶
Executes a command in a subprocess.
The advantage of this wrapper around subprocess is that (1) you control if the subprocess prints to stdout, (2) the text written to stdout and stderr is returned for parsing, (3) cross platform behavior that lets you specify the command as a string or tuple regardless of whether or not shell=True. (4) ability to detach, return the process object and allow the process to run in the background (eventually we may return a Future object instead).
- Parameters
command (str | List[str]) – command string, tuple of executable and args, or shell command.
shell (bool, default=False) – if True, process is run in shell.
detach (bool, default=False) – if True, process is detached and run in background.
verbose (int, default=0) – verbosity mode. Can be 0, 1, 2, or 3.
tee (bool | None) – if True, simultaneously writes to stdout while capturing output from the command. If not specified, defaults to True if verbose > 0. If detach is True, then this argument is ignored.
cwd (str | PathLike | None) – Path to run command. Defaults to current working directory if unspecified.
env (Dict[str, str] | None) – environment passed to Popen
tee_backend (str, default=’auto’) – backend for tee output. Valid choices are: “auto”, “select” (POSIX only), and “thread”.
check (bool, default=False) – if True, check that the return code was zero before returning, otherwise raise a
subprocess.CalledProcessError
. Does nothing if detach is True.system (bool, default=False) – if True, most other considerations are dropped, and
os.system()
is used to execute the command in a platform dependant way. Other arguments such as env, tee, timeout, and shell are all ignored. (new in version 1.1.0)timeout (float | None) – If the process does not complete in timeout seconds, raises a
subprocess.TimeoutExpired
. (new in version 1.1.0) Currently unhandled when tee is True.log (Callable | None) – If specified, verbose output is written using this function, otherwise the builtin print function is used.
- Returns
info - information about command status. if detach is False
info
contains captured standard out, standard error, and the return code if detach is Trueinfo
contains a reference to the process.- Return type
- Raises
ValueError - on an invalid configuration –
subprocess.TimeoutExpired - if the timeout limit is exceeded –
subprocess.CalledProcessError - if check and the return value is non zero –
Note
When using the tee output, the stdout and stderr may be shuffled from what they would be on the command line.
- Related Work:
https://github.com/pycontribs/subprocess-tee https://github.com/mortoray/shelljob https://github.com/netinvent/command_runner https://www.pyinvoke.org/prior-art.html
References
- SO_11495783
https://stackoverflow.com/questions/11495783/redirect-subprocess-stderr-to-stdout
- SO_7729336
- SO_33560364
https://stackoverflow.com/questions/33560364/python-windows-parsing-command-lines-with-shlex
CommandLine
xdoctest -m ubelt.util_cmd cmd:6 python -c "import ubelt as ub; ub.cmd('ping localhost -c 2', verbose=2)" pytest "$(python -c 'import ubelt; print(ubelt.util_cmd.__file__)')" -sv --xdoctest-verbose 2
Example
>>> import ubelt as ub >>> info = ub.cmd(('echo', 'simple cmdline interface'), verbose=1) simple cmdline interface >>> assert info['ret'] == 0 >>> assert info['out'].strip() == 'simple cmdline interface' >>> assert info['err'].strip() == ''
Example
>>> import ubelt as ub >>> info = ub.cmd('echo str noshell', verbose=0) >>> assert info['out'].strip() == 'str noshell'
Example
>>> # windows echo will output extra single quotes >>> import ubelt as ub >>> info = ub.cmd(('echo', 'tuple noshell'), verbose=0) >>> assert info['out'].strip().strip("'") == 'tuple noshell'
Example
>>> # Note this command is formatted to work on win32 and unix >>> import ubelt as ub >>> info = ub.cmd('echo str&&echo shell', verbose=0, shell=True) >>> assert info['out'].strip() == 'str' + chr(10) + 'shell'
Example
>>> import ubelt as ub >>> info = ub.cmd(('echo', 'tuple shell'), verbose=0, shell=True) >>> assert info['out'].strip().strip("'") == 'tuple shell'
Example
>>> import pytest >>> import ubelt as ub >>> info = ub.cmd('echo hi', check=True) >>> import subprocess >>> with pytest.raises(subprocess.CalledProcessError): >>> ub.cmd('exit 1', check=True, shell=True)
Example
>>> import ubelt as ub >>> from os.path import join, exists >>> dpath = ub.Path.appdir('ubelt', 'test').ensuredir() >>> fpath1 = (dpath / 'cmdout1.txt').delete() >>> fpath2 = (dpath / 'cmdout2.txt').delete() >>> # Start up two processes that run simultaneously in the background >>> info1 = ub.cmd(('touch', str(fpath1)), detach=True) >>> info2 = ub.cmd('echo writing2 > ' + str(fpath2), shell=True, detach=True) >>> # Detached processes are running in the background >>> # We can run other code while we wait for them. >>> while not exists(fpath1): ... pass >>> while not exists(fpath2): ... pass >>> # communicate with the process before you finish >>> # (otherwise you may leak a text wrapper) >>> info1['proc'].communicate() >>> info2['proc'].communicate() >>> # Check that the process actually did finish >>> assert (info1['proc'].wait()) == 0 >>> assert (info2['proc'].wait()) == 0 >>> # Check that the process did what we expect >>> assert fpath1.read_text() == '' >>> assert fpath2.read_text().strip() == 'writing2'
Example
>>> # Can also use ub.cmd to call os.system >>> import pytest >>> import ubelt as ub >>> import subprocess >>> info = ub.cmd('echo hi', check=True, system=True) >>> with pytest.raises(subprocess.CalledProcessError): >>> ub.cmd('exit 1', check=True, shell=True)
- ubelt.codeblock(text)[source]¶
Create a block of text that preserves all newlines and relative indentation
Wraps multiline string blocks and returns unindented code. Useful for templated code defined in indented parts of code.
- Parameters
text (str) – typically a multiline string
- Returns
the unindented string
- Return type
Example
>>> import ubelt as ub >>> # Simulate an indented part of code >>> if True: >>> # notice the indentation on this will be normal >>> codeblock_version = ub.codeblock( ... ''' ... def foo(): ... return 'bar' ... ''' ... ) >>> # notice the indentation and newlines on this will be odd >>> normal_version = (''' ... def foo(): ... return 'bar' ... ''') >>> assert normal_version != codeblock_version >>> print('Without codeblock') >>> print(normal_version) >>> print('With codeblock') >>> print(codeblock_version)
- ubelt.color_text(text, color)[source]¶
Colorizes text a single color using ansi tags.
- Parameters
text (str) – text to colorize
color (str) – color code. different systems may have different colors. commonly available colors are: ‘red’, ‘brown’, ‘yellow’, ‘green’, ‘blue’, ‘black’, and ‘white’.
- Returns
text - colorized text. If pygments is not installed plain text is returned.
- Return type
Example
>>> text = 'raw text' >>> import pytest >>> import ubelt as ub >>> if ub.modname_to_modpath('pygments'): >>> # Colors text only if pygments is installed >>> ansi_text = ub.color_text(text, 'red') >>> prefix = '\x1b[31' >>> print('prefix = {!r}'.format(prefix)) >>> print('ansi_text = {!r}'.format(ansi_text)) >>> assert ansi_text.startswith(prefix) >>> assert ub.color_text(text, None) == 'raw text' >>> else: >>> # Otherwise text passes through unchanged >>> assert ub.color_text(text, 'red') == 'raw text' >>> assert ub.color_text(text, None) == 'raw text'
Example
>>> # xdoctest: +REQUIRES(module:pygments) >>> import pygments.console >>> import ubelt as ub >>> known_colors = pygments.console.codes.keys() >>> for color in known_colors: ... print(ub.color_text(color, color))
- ubelt.compatible(config, func, start=0, keywords=True)[source]¶
Take the “compatible” subset of a dictionary that a function will accept as keyword arguments.
A common pattern is to track the configuration of a program in a single dictionary. Often there will be functions that only require subsets of this dictionary, and they will be written such that those items are passed via keyword arguments. The
ubelt.compatible()
utility makes it easier select only the relevant config variables. It does this by inspecting the signature of the function to determine what keyword arguments it accepts, and returns the dictionary intersection of the full config and the allowed keywords. The user can then call the function with the normal**
mechanism.- Parameters
config (Dict[str, Any]) – A dictionary that contains keyword arguments that might be passed to a function.
func (Callable) – A function or method to check the arguments of
start (int) – Only take args after this position. Set to 1 if calling with an unbound method to avoid the
self
argument. Defaults to 0.keywords (bool | Iterable[str]) – If True (default), and
**kwargs
is in the signature, prevent any filtering of theconfig
dictionary. If False, then ignore that**kwargs
is in the signature and only return the subset ofconfig
that matches the explicit signature. Otherwise if specified as a non-string iterable of strings, assume these are the allowed keys that are compatible with the waykwargs
is handled in the function.
- Returns
A subset of
config
that only contains items compatible with the signature offunc
.- Return type
Dict[str, Any]
Example
>>> # An example use case is to select a subset of of a config >>> # that can be passed to some function as kwargs >>> import ubelt as ub >>> # Define a function with args that match some keys in a config. >>> def func(a, e, f): >>> return a * e * f >>> # Define a config that has a superset of items needed by the func >>> config = { ... 'a': 2, 'b': 3, 'c': 7, ... 'd': 11, 'e': 13, 'f': 17, ... } >>> # Call the function only with keys that are compatible >>> func(**ub.compatible(config, func)) 442
Example
>>> # Test case with kwargs >>> import ubelt as ub >>> def func(a, e, f, *args, **kwargs): >>> return a * e * f >>> config = { ... 'a': 2, 'b': 3, 'c': 7, ... 'd': 11, 'e': 13, 'f': 17, ... } >>> func(**ub.compatible(config, func)) 442 >>> print(sorted(ub.compatible(config, func))) ['a', 'b', 'c', 'd', 'e', 'f'] >>> print(sorted(ub.compatible(config, func, keywords=False))) ['a', 'e', 'f'] >>> print(sorted(ub.compatible(config, func, keywords={'b'}))) ['a', 'b', 'e', 'f']
- ubelt.compress(items, flags)[source]¶
Selects from
items
where the corresponding value inflags
is True.- Parameters
items (Iterable[Any]) – a sequence to select items from
flags (Iterable[bool]) – corresponding sequence of bools
- Returns
a subset of masked items
- Return type
Iterable[Any]
Notes
This function is based on
numpy.compress()
, but is pure Python and swaps the condition and array argument to be consistent withubelt.take()
.This is equivalent to
itertools.compress()
.Example
>>> import ubelt as ub >>> items = [1, 2, 3, 4, 5] >>> flags = [False, True, True, False, True] >>> list(ub.compress(items, flags)) [2, 3, 5]
- ubelt.ddict¶
alias of
defaultdict
- ubelt.delete(path, verbose=False)[source]¶
Removes a file or recursively removes a directory. If a path does not exist, then this is does nothing.
- Parameters
path (str | PathLike) – file or directory to remove
verbose (bool) – if True prints what is being done
- SeeAlso:
- send2trash -
A cross-platform Python package for sending files to the trash instead of irreversibly deleting them.
Notes
This can call
os.unlink()
,os.rmdir()
, orshutil.rmtree()
, depending on whatpath
references on the filesystem. (On windows may also call a customubelt._win32_links._win32_rmtree()
).Example
>>> import ubelt as ub >>> from os.path import join >>> base = ub.Path.appdir('ubelt', 'delete_test').ensuredir() >>> dpath1 = ub.ensuredir(join(base, 'dir')) >>> ub.ensuredir(join(base, 'dir', 'subdir')) >>> ub.touch(join(base, 'dir', 'to_remove1.txt')) >>> fpath1 = join(base, 'dir', 'subdir', 'to_remove3.txt') >>> fpath2 = join(base, 'dir', 'subdir', 'to_remove2.txt') >>> ub.touch(fpath1) >>> ub.touch(fpath2) >>> assert all(map(exists, (dpath1, fpath1, fpath2))) >>> ub.delete(fpath1) >>> assert all(map(exists, (dpath1, fpath2))) >>> assert not exists(fpath1) >>> ub.delete(dpath1) >>> assert not any(map(exists, (dpath1, fpath1, fpath2)))
Example
>>> import ubelt as ub >>> from os.path import exists, join >>> dpath = ub.Path.appdir('ubelt', 'delete_test2').ensuredir() >>> dpath1 = ub.ensuredir(join(dpath, 'dir')) >>> fpath1 = ub.touch(join(dpath1, 'to_remove.txt')) >>> assert exists(fpath1) >>> ub.delete(dpath) >>> assert not exists(fpath1)
- ubelt.dict_diff(*args)[source]¶
Dictionary set extension for
set.difference()
Constructs a dictionary that contains any of the keys in the first arg, which are not in any of the following args.
- Parameters
*args (List[Dict[KT, VT] | Iterable[KT]]) – A sequence of dictionaries (or sets of keys). The first argument should always be a dictionary, but the subsequent arguments can just be sets of keys.
- Returns
OrderedDict if the first argument is an OrderedDict, otherwise dict
- Return type
Dict[KT, VT] | OrderedDict[KT, VT]
- SeeAlso:
:
UDict.difference()
- object oriented version of this function
Example
>>> import ubelt as ub >>> ub.dict_diff({'a': 1, 'b': 1}, {'a'}, {'c'}) {'b': 1} >>> ub.dict_diff(odict([('a', 1), ('b', 2)]), odict([('c', 3)])) OrderedDict([('a', 1), ('b', 2)]) >>> ub.dict_diff() {} >>> ub.dict_diff({'a': 1, 'b': 2}, {'c'})
- ubelt.dict_hist(items, weights=None, ordered=False, labels=None)[source]¶
Builds a histogram of items, counting the number of time each item appears in the input.
- Parameters
items (Iterable[T]) – hashable items (usually containing duplicates)
weights (Iterable[float] | None, default=None) – Corresponding weights for each item, defaults to 1 if unspecified.
ordered (bool, default=False) – If True the result is ordered by frequency.
labels (Iterable[T] | None, default=None) – Expected labels. Allows this function to pre-initialize the histogram. If specified the frequency of each label is initialized to zero and
items
can only contain items specified in labels.
- Returns
dictionary where the keys are unique elements from
items
, and the values are the number of times the item appears initems
.- Return type
- SeeAlso:
Example
>>> import ubelt as ub >>> items = [1, 2, 39, 900, 1232, 900, 1232, 2, 2, 2, 900] >>> hist = ub.dict_hist(items) >>> print(ub.repr2(hist, nl=0)) {1: 1, 2: 4, 39: 1, 900: 3, 1232: 2}
Example
>>> import ubelt as ub >>> import pytest >>> items = [1, 2, 39, 900, 1232, 900, 1232, 2, 2, 2, 900] >>> hist1 = ub.dict_hist(items) >>> hist2 = ub.dict_hist(items, ordered=True) >>> with pytest.raises(KeyError): >>> hist3 = ub.dict_hist(items, labels=[]) >>> weights = [1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1] >>> hist4 = ub.dict_hist(items, weights=weights) >>> print(ub.repr2(hist1, nl=0)) {1: 1, 2: 4, 39: 1, 900: 3, 1232: 2} >>> print(ub.repr2(hist4, nl=0)) {1: 1, 2: 4, 39: 1, 900: 1, 1232: 0}
- ubelt.dict_isect(*args)[source]¶
Dictionary set extension for
set.intersection()
Constructs a dictionary that contains keys common between all inputs. The returned values will only belong to the first dictionary.
- Parameters
*args (List[Dict[KT, VT] | Iterable[KT]]) – A sequence of dictionaries (or sets of keys). The first argument should always be a dictionary, but the subsequent arguments can just be sets of keys.
- Returns
OrderedDict if the first argument is an OrderedDict, otherwise dict
- Return type
Dict[KT, VT] | OrderedDict[KT, VT]
- SeeAlso:
:
UDict.intersection()
- object oriented version of this function
Note
This function can be used as an alternative to
dict_subset()
where any key not in the dictionary is ignored. See the following example:>>> import ubelt as ub >>> # xdoctest: +IGNORE_WANT >>> ub.dict_isect({'a': 1, 'b': 2, 'c': 3}, ['a', 'c', 'd']) {'a': 1, 'c': 3}
Example
>>> import ubelt as ub >>> ub.dict_isect({'a': 1, 'b': 1}, {'b': 2, 'c': 2}) {'b': 1} >>> ub.dict_isect(odict([('a', 1), ('b', 2)]), odict([('c', 3)])) OrderedDict() >>> ub.dict_isect() {}
- ubelt.dict_subset(dict_, keys, default=NoParam, cls=<class 'collections.OrderedDict'>)[source]¶
Get a subset of a dictionary
- Parameters
dict_ (Dict[KT, VT]) – superset dictionary
keys (Iterable[KT]) – keys to take from
dict_
default (Optional[object] | NoParamType) – if specified uses default if keys are missing.
cls (Type[Dict], default=OrderedDict) – type of the returned dictionary.
- Returns
subset dictionary
- Return type
Dict[KT, VT]
- SeeAlso:
dict_isect()
- similar functionality, but ignores missing keys :UDict.subdict()
- object oriented version of this function
Example
>>> import ubelt as ub >>> dict_ = {'K': 3, 'dcvs_clip_max': 0.2, 'p': 0.1} >>> keys = ['K', 'dcvs_clip_max'] >>> subdict_ = ub.dict_subset(dict_, keys) >>> print(ub.repr2(subdict_, nl=0)) {'K': 3, 'dcvs_clip_max': 0.2}
- ubelt.dict_union(*args)[source]¶
Dictionary set extension for
set.union
Combines items with from multiple dictionaries. For items with intersecting keys, dictionaries towards the end of the sequence are given precedence.
- Parameters
*args (List[Dict]) – A sequence of dictionaries. Values are taken from the last
- Returns
OrderedDict if the first argument is an OrderedDict, otherwise dict
- Return type
Dict | OrderedDict
Notes
In Python 3.8+, the bitwise or operator “|” operator performs a similar operation, but as of 2022-06-01 there is still no public method for dictionary union (or any other dictionary set operator).
References
https://stackoverflow.com/questions/38987/merge-two-dict
- SeeAlso:
collections.ChainMap()
- a standard python builtin data structure that provides a view that treats multiple dicts as a single dict. https://docs.python.org/3/library/collections.html#chainmap-objects :UDict.union()
- object oriented version of this function
Example
>>> import ubelt as ub >>> result = ub.dict_union({'a': 1, 'b': 1}, {'b': 2, 'c': 2}) >>> assert result == {'a': 1, 'b': 2, 'c': 2} >>> ub.dict_union( >>> ub.odict([('a', 1), ('b', 2)]), >>> ub.odict([('c', 3), ('d', 4)])) OrderedDict([('a', 1), ('b', 2), ('c', 3), ('d', 4)]) >>> ub.dict_union() {}
- ubelt.download(url, fpath=None, dpath=None, fname=None, appname=None, hash_prefix=None, hasher='sha512', chunksize=8192, filesize=None, verbose=1, timeout=NoParam, progkw=None)[source]¶
Downloads a url to a file on disk.
If unspecified the location and name of the file is chosen automatically. A hash_prefix can be specified to verify the integrity of the downloaded data. This function will download the data every time its called. For cached downloading see grabdata.
- Parameters
url (str) – The url to download.
fpath (Optional[str | PathLike | io.BytesIO]) – The path to download to. Defaults to basename of url and ubelt’s application cache. If this is a io.BytesIO object then information is directly written to this object (note this prevents the use of temporary files).
dpath (Optional[PathLike]) – where to download the file. If unspecified appname is used to determine this. Mutually exclusive with fpath.
fname (Optional[str]) – What to name the downloaded file. Defaults to the url basename. Mutually exclusive with fpath.
appname (str | None) – set dpath to
ub.get_app_cache_dir(appname or 'ubelt')
if dpath and fpath are not given.hash_prefix (None | str) – If specified, download will retry / error if the file hash does not match this value. Defaults to None.
hasher (str | Hasher) – If hash_prefix is specified, this indicates the hashing algorithm to apply to the file. Defaults to sha512.
chunksize (int) – Download chunksize in bytes. Default to
2 ** 13
filesize (int | None) – If known, the filesize in bytes. If unspecified, attempts to read that data from content headers.
verbose (int | bool) – Verbosity flag. Quiet is 0, higher is more verbose. Defaults to 1.
timeout (float | NoParamType) – Specify timeout in seconds for
urllib.request.urlopen()
. (if not specified, the global default timeout setting will be used) This only works for HTTP, HTTPS and FTP connections for blocking operations like the connection attempt.progkw (Dict | NoParamType | None) – if specified provides extra arguments to the progress iterator. See
ubelt.progiter.ProgIter
for available options.
- Returns
fpath - path to the downloaded file.
- Return type
str | PathLike
- Raises
URLError - if there is problem downloading the url –
RuntimeError - if the hash does not match the hash_prefix –
Note
Based largely on code in pytorch [TorchDL] with modifications influenced by other resources [Shichao_2012] [SO_15644964] [SO_16694907].
References
- Shichao_2012
https://blog.shichao.io/2012/10/04/progress_speed_indicator_for_urlretrieve_in_python.html
- SO_15644964
http://stackoverflow.com/questions/15644964/python-progress-bar-and-downloads
- SO_16694907
http://stackoverflow.com/questions/16694907/how-to-download-large-file-in-python-with-requests-py
- TorchDL
https://github.com/pytorch/pytorch/blob/2787f1d8edbd4aadd4a8680d204341a1d7112e2d/torch/hub.py#L347
Example
>>> # xdoctest: +REQUIRES(--network) >>> from ubelt.util_download import * # NOQA >>> url = 'http://i.imgur.com/rqwaDag.png' >>> fpath = download(url) >>> print(basename(fpath)) rqwaDag.png
Example
>>> # xdoctest: +REQUIRES(--network) >>> import ubelt as ub >>> import io >>> url = 'http://i.imgur.com/rqwaDag.png' >>> file = io.BytesIO() >>> fpath = ub.download(url, file) >>> file.seek(0) >>> data = file.read() >>> assert ub.hash_data(data, hasher='sha1').startswith('f79ea24571')
Example
>>> # xdoctest: +REQUIRES(--network) >>> url = 'http://i.imgur.com/rqwaDag.png' >>> fpath = download(url, hasher='sha1', hash_prefix='f79ea24571da6ddd2ba12e3d57b515249ecb8a35') Downloading url='http://i.imgur.com/rqwaDag.png' to fpath=...rqwaDag.png ... ...1233/1233... rate=... Hz, eta=..., total=...
Example
>>> # xdoctest: +REQUIRES(--network) >>> import pytest >>> import ubelt as ub >>> url = 'http://i.imgur.com/rqwaDag.png' >>> #fpath = download(url, hasher='sha1', hash_prefix='f79ea24571da6ddd2ba12e3d57b515249ecb8a35') >>> # test download from girder >>> #url = 'https://data.kitware.com/api/v1/item/5b4039308d777f2e6225994c/download' >>> #ub.download(url, hasher='sha512', hash_prefix='c98a46cb31205cf') >>> with pytest.raises(RuntimeError): >>> ub.download(url, hasher='sha512', hash_prefix='BAD_HASH')
- ubelt.dzip(items1, items2, cls=<class 'dict'>)[source]¶
Zips elementwise pairs between items1 and items2 into a dictionary.
Values from items2 can be broadcast onto items1.
- Parameters
items1 (Iterable[KT]) – full sequence
items2 (Iterable[VT]) – can either be a sequence of one item or a sequence of equal length to
items1
cls (Type[dict], default=dict) – dictionary type to use.
- Returns
similar to
dict(zip(items1, items2))
.- Return type
Dict[KT, VT]
Example
>>> import ubelt as ub >>> assert ub.dzip([1, 2, 3], [4]) == {1: 4, 2: 4, 3: 4} >>> assert ub.dzip([1, 2, 3], [4, 4, 4]) == {1: 4, 2: 4, 3: 4} >>> assert ub.dzip([], [4]) == {}
- ubelt.ensure_app_cache_dir(appname, *args)[source]¶
Calls
get_app_cache_dir()
but ensures the directory exists.Note
New applications should prefer
ubelt.util_path.Path.appdir()
i.e.ubelt.Path.appdir(appname, *args, type='cache').ensuredir()
.- Parameters
appname (str) – the name of the application
*args – any other subdirectories may be specified
- Returns
the path to the ensured directory
- Return type
- SeeAlso:
Example
>>> import ubelt as ub >>> dpath = ub.ensure_app_cache_dir('ubelt') >>> assert exists(dpath)
- ubelt.ensure_app_config_dir(appname, *args)[source]¶
Calls
get_app_config_dir()
but ensures the directory exists.Note
New applications should prefer
ubelt.util_path.Path.appdir()
i.e.ubelt.Path.appdir(appname, *args, type='config').ensuredir()
.- Parameters
appname (str) – the name of the application
*args – any other subdirectories may be specified
- Returns
the path to the ensured directory
- Return type
- SeeAlso:
Example
>>> import ubelt as ub >>> dpath = ub.ensure_app_config_dir('ubelt') >>> assert exists(dpath)
- ubelt.ensure_app_data_dir(appname, *args)[source]¶
Calls
get_app_data_dir()
but ensures the directory exists.Note
New applications should prefer
ubelt.util_path.Path.appdir()
i.e.ubelt.Path.appdir(appname, *args, type='data').ensuredir()
.- Parameters
appname (str) – the name of the application
*args – any other subdirectories may be specified
- Returns
the path to the ensured directory
- Return type
- SeeAlso:
Example
>>> import ubelt as ub >>> dpath = ub.ensure_app_data_dir('ubelt') >>> assert exists(dpath)
- ubelt.ensure_unicode(text)[source]¶
Casts bytes into utf8 (mostly for python2 compatibility)
- Parameters
text (str | bytes) – text to ensure is decoded as unicode
- Returns
str
References
[SO_12561063] http://stackoverflow.com/questions/12561063/extract-data-from-file
Example
>>> from ubelt.util_str import * >>> import codecs # NOQA >>> assert ensure_unicode('my ünicôdé strįng') == 'my ünicôdé strįng' >>> assert ensure_unicode('text1') == 'text1' >>> assert ensure_unicode('text1'.encode('utf8')) == 'text1' >>> assert ensure_unicode('text1'.encode('utf8')) == 'text1' >>> assert (codecs.BOM_UTF8 + 'text»¿'.encode('utf8')).decode('utf8')
- ubelt.ensuredir(dpath, mode=1023, verbose=0, recreate=False)[source]¶
Ensures that directory will exist. Creates new dir with sticky bits by default
- Parameters
dpath (str | PathLike | Tuple[str | PathLike]) – dir to ensure. Can also be a tuple to send to join
mode (int) – octal mode of directory
verbose (int) – verbosity
recreate (bool) – if True removes the directory and all of its contents and creates a fresh new directory. USE CAREFULLY.
- Returns
path - the ensured directory
- Return type
- SeeAlso:
Note
This function is not thread-safe in Python2
Example
>>> from ubelt.util_path import * # NOQA >>> import ubelt as ub >>> cache_dpath = ub.Path.appdir('ubelt').ensuredir() >>> dpath = join(cache_dpath, 'ensuredir') >>> if exists(dpath): ... os.rmdir(dpath) >>> assert not exists(dpath) >>> ub.ensuredir(dpath) >>> assert exists(dpath) >>> os.rmdir(dpath)
- ubelt.expandpath(path)[source]¶
Shell-like environment variable and tilde path expansion.
- Parameters
path (str | PathLike) – string representation of a path
- Returns
expanded path
- Return type
Example
>>> from ubelt.util_path import * # NOQA >>> import ubelt as ub >>> assert normpath(ub.expandpath('~/foo')) == join(ub.userhome(), 'foo') >>> assert ub.expandpath('foo') == 'foo'
- ubelt.find_duplicates(items, k=2, key=None)[source]¶
Find all duplicate items in a list.
Search for all items that appear more than
k
times and return a mapping from each (k)-duplicate item to the positions it appeared in.- Parameters
items (Iterable[T]) – hashable items possibly containing duplicates
k (int, default=2) – only return items that appear at least
k
times.key (Callable[[T], Any] | None, default=None) – Returns indices where key(items[i]) maps to a particular value at least k times.
- Returns
maps each duplicate item to the indices at which it appears
- Return type
Notes
Similar to
more_itertools.duplicates_everseen()
,more_itertools.duplicates_justseen()
.Example
>>> import ubelt as ub >>> items = [0, 0, 1, 2, 3, 3, 0, 12, 2, 9] >>> duplicates = ub.find_duplicates(items) >>> # Duplicates are a mapping from each item that occurs 2 or more >>> # times to the indices at which they occur. >>> assert duplicates == {0: [0, 1, 6], 2: [3, 8], 3: [4, 5]} >>> # You can set k=3 if you want to don't mind duplicates but you >>> # want to find triplicates or quadruplets etc. >>> assert ub.find_duplicates(items, k=3) == {0: [0, 1, 6]}
Example
>>> import ubelt as ub >>> items = [0, 0, 1, 2, 3, 3, 0, 12, 2, 9] >>> # note: k can less then 2 >>> duplicates = ub.find_duplicates(items, k=0) >>> print(ub.repr2(duplicates, nl=0)) {0: [0, 1, 6], 1: [2], 2: [3, 8], 3: [4, 5], 9: [9], 12: [7]}
Example
>>> import ubelt as ub >>> items = [10, 11, 12, 13, 14, 15, 16] >>> duplicates = ub.find_duplicates(items, key=lambda x: x // 2) >>> print(ub.repr2(duplicates, nl=0)) {5: [0, 1], 6: [2, 3], 7: [4, 5]}
- ubelt.find_exe(name, multi=False, path=None)[source]¶
Locate a command.
Search your local filesystem for an executable and return the first matching file with executable permission.
- Parameters
name (str | PathLike) – globstr of matching filename
multi (bool, default=False) – if True return all matches instead of just the first.
path (str | PathLike | Iterable[str | PathLike] | None, default=None) – overrides the system PATH variable.
- Returns
returns matching executable(s).
- Return type
- SeeAlso:
shutil.which()
- which is available in Python 3.3+.
Note
This is essentially the
which
UNIX commandReferences
- SO_377017
https://stackoverflow.com/questions/377017/test-if-executable-exists-in-python/377028#377028
- shutil_which
https://docs.python.org/dev/library/shutil.html#shutil.which
Example
>>> # The following are programs commonly exposed via the PATH variable. >>> # Exact results may differ between machines. >>> # xdoctest: +IGNORE_WANT >>> import ubelt as ub >>> print(ub.find_exe('ls')) >>> print(ub.find_exe('ping')) >>> print(ub.find_exe('which')) >>> print(ub.find_exe('which', multi=True)) >>> print(ub.find_exe('ping', multi=True)) >>> print(ub.find_exe('noexist', multi=True)) /usr/bin/ls /usr/bin/ping /usr/bin/which ['/usr/bin/which', '/bin/which'] ['/usr/bin/ping', '/bin/ping'] []
Example
>>> import ubelt as ub >>> assert not ub.find_exe('!noexist', multi=False) >>> assert ub.find_exe('ping', multi=False) or ub.find_exe('ls', multi=False) >>> assert not ub.find_exe('!noexist', multi=True) >>> assert ub.find_exe('ping', multi=True) or ub.find_exe('ls', multi=True)
Benchmark
>>> # xdoctest: +IGNORE_WANT >>> import ubelt as ub >>> import shutil >>> from timerit import Timerit >>> for timer in Timerit(1000, bestof=10, label='ub.find_exe'): >>> ub.find_exe('which') >>> for timer in Timerit(1000, bestof=10, label='shutil.which'): >>> shutil.which('which') Timed best=25.339 µs, mean=25.809 ± 0.3 µs for ub.find_exe Timed best=28.600 µs, mean=28.986 ± 0.3 µs for shutil.which
- ubelt.find_path(name, path=None, exact=False)[source]¶
Search for a file or directory on your local filesystem by name (file must be in a directory specified in a PATH environment variable)
- Parameters
name (str | PathLike) – file name to match. If exact is False this may be a glob pattern
path (str | Iterable[str | PathLike] | None, default=None) – list of directories to search either specified as an
os.pathsep
separated string or a list of directories. Defaults to environment PATH.exact (bool, default=False) – if True, only returns exact matches.
- Yields
str – candidate - a path that matches
name
Note
Running with
name=''
(i.e.ub.find_path('')
) will simply yield all directories in your PATH.Note
For recursive behavior set
path=(d for d, _, _ in os.walk('.'))
, where ‘.’ might be replaced by the root directory of interest.Example
>>> # xdoctest: +IGNORE_WANT >>> import ubelt as ub >>> print(list(ub.find_path('ping', exact=True))) >>> print(list(ub.find_path('bin'))) >>> print(list(ub.find_path('gcc*'))) >>> print(list(ub.find_path('cmake*'))) ['/usr/bin/ping', '/bin/ping'] [] [... '/usr/bin/gcc-11', '/usr/bin/gcc-ranlib', ...] [... '/usr/bin/cmake-gui', '/usr/bin/cmake', ...]
Example
>>> import ubelt as ub >>> from os.path import dirname >>> path = dirname(dirname(ub.util_platform.__file__)) >>> res = sorted(ub.find_path('ubelt/util_*.py', path=path)) >>> assert len(res) >= 10 >>> res = sorted(ub.find_path('ubelt/util_platform.py', path=path, exact=True)) >>> print(res) >>> assert len(res) == 1
- ubelt.flatten(nested)[source]¶
Transforms a nested iterable into a flat iterable.
- Parameters
nested (Iterable[Iterable[Any]]) – list of lists
- Returns
flattened items
- Return type
Iterable[Any]
Notes
Equivalent to
more_itertools.flatten()
anditertools.chain.from_iterable()
.Example
>>> import ubelt as ub >>> nested = [['a', 'b'], ['c', 'd']] >>> list(ub.flatten(nested)) ['a', 'b', 'c', 'd']
- ubelt.get_app_cache_dir(appname, *args)[source]¶
Returns a writable directory for an application. This should be used for temporary deletable data.
Note
New applications should prefer
ubelt.util_path.Path.appdir()
i.e.ubelt.Path.appdir(appname, *args, type='cache')
.- Parameters
appname (str) – the name of the application
*args – any other subdirectories may be specified
- Returns
the path to the ensured directory
- Return type
- Returns
dpath - writable cache directory for this application
- Return type
- SeeAlso:
- ubelt.get_app_config_dir(appname, *args)[source]¶
Returns a writable directory for an application This should be used for persistent configuration files.
Note
New applications should prefer
ubelt.util_path.Path.appdir()
i.e.ubelt.Path.appdir(appname, *args, type='config')
.- Parameters
appname (str) – the name of the application
*args – any other subdirectories may be specified
- Returns
dpath - writable config directory for this application
- Return type
- SeeAlso:
- ubelt.get_app_data_dir(appname, *args)[source]¶
Returns a writable directory for an application. This should be used for temporary deletable data.
Note
New applications should prefer
ubelt.util_path.Path.appdir()
i.e.ubelt.Path.appdir(appname, *args, type='data')
.- Parameters
appname (str) – the name of the application
*args – any other subdirectories may be specified
- Returns
dpath - writable data directory for this application
- Return type
- SeeAlso:
- ubelt.grabdata(url, fpath=None, dpath=None, fname=None, redo=False, verbose=1, appname=None, hash_prefix=None, hasher='sha512', expires=None, **download_kw)[source]¶
Downloads a file, caches it, and returns its local path.
If unspecified the location and name of the file is chosen automatically. A hash_prefix can be specified to verify the integrity of the downloaded data.
- Parameters
url (str) – url of the file to download
fpath (Optional[str | PathLike]) – The full path to download the file to. If unspecified, the arguments dpath and fname are used to determine this.
dpath (Optional[str | PathLike]) – where to download the file. If unspecified appname is used to determine this. Mutually exclusive with fpath.
fname (Optional[str]) – What to name the downloaded file. Defaults to the url basename. Mutually exclusive with fpath.
redo (bool, default=False) – if True forces redownload of the file
verbose (int) – Verbosity flag. Quiet is 0, higher is more verbose. Defaults to 1.
appname (str | None) – set dpath to
ub.get_app_cache_dir(appname or 'ubelt')
if dpath and fpath are not given.hash_prefix (None | str) – If specified, grabdata verifies that this matches the hash of the file, and then saves the hash in a adjacent file to certify that the download was successful. Defaults to None.
hasher (str | Hasher) – If hash_prefix is specified, this indicates the hashing algorithm to apply to the file. Defaults to sha512. NOTE: Only pass hasher as a string. Passing as an instance is deprecated and can cause unexpected results.
expires (str | int | datetime.datetime | None) – when the cache should expire and redownload or the number of seconds to wait before the cache should expire.
**download_kw – additional kwargs to pass to
ubelt.util_download.download()
- Returns
fpath - path to downloaded or cached file.
- Return type
str | PathLike
CommandLine
xdoctest -m ubelt.util_download grabdata --network
Example
>>> # xdoctest: +REQUIRES(--network) >>> import ubelt as ub >>> url = 'http://i.imgur.com/rqwaDag.png' >>> fpath = ub.grabdata(url, fname='mario.png') >>> result = basename(fpath) >>> print(result) mario.png
Example
>>> # xdoctest: +REQUIRES(--network) >>> import ubelt as ub >>> import json >>> fname = 'foo.bar' >>> url = 'http://i.imgur.com/rqwaDag.png' >>> prefix1 = '944389a39dfb8fa9' >>> fpath = ub.grabdata(url, fname=fname, hash_prefix=prefix1, verbose=3) >>> stamp_fpath = ub.Path(fpath + '.stamp_sha512.json') >>> assert json.loads(stamp_fpath.read_text())['hash'][0].startswith(prefix1) >>> # Check that the download doesn't happen again >>> fpath = ub.grabdata(url, fname=fname, hash_prefix=prefix1) >>> # todo: check file timestamps have not changed >>> # >>> # Check redo works with hash >>> fpath = ub.grabdata(url, fname=fname, hash_prefix=prefix1, redo=True) >>> # todo: check file timestamps have changed >>> # >>> # Check that a redownload occurs when the stamp is changed >>> with open(stamp_fpath, 'w') as file: >>> file.write('corrupt-stamp') >>> fpath = ub.grabdata(url, fname=fname, hash_prefix=prefix1) >>> assert json.loads(stamp_fpath.read_text())['hash'][0].startswith(prefix1) >>> # >>> # Check that a redownload occurs when the stamp is removed >>> ub.delete(stamp_fpath) >>> with open(fpath, 'w') as file: >>> file.write('corrupt-data') >>> assert not ub.hash_file(fpath, base='hex', hasher='sha512').startswith(prefix1) >>> fpath = ub.grabdata(url, fname=fname, hash_prefix=prefix1) >>> assert ub.hash_file(fpath, base='hex', hasher='sha512').startswith(prefix1) >>> # >>> # Check that requesting new data causes redownload >>> #url2 = 'https://data.kitware.com/api/v1/item/5b4039308d777f2e6225994c/download' >>> #prefix2 = 'c98a46cb31205cf' # hack SSL >>> url2 = 'http://i.imgur.com/rqwaDag.png' >>> prefix2 = '944389a39dfb8fa9' >>> fpath = ub.grabdata(url2, fname=fname, hash_prefix=prefix2) >>> assert json.loads(stamp_fpath.read_text())['hash'][0].startswith(prefix2)
- ubelt.group_items(items, key)[source]¶
Groups a list of items by group id.
- Parameters
items (Iterable[VT]) – a list of items to group
key (Iterable[KT] | Callable[[VT], KT]) – either a corresponding list of group-ids for each item or a function used to map each item to a group-id.
- Returns
a mapping from each group id to the list of corresponding items
- Return type
dict[KT, List[VT]]
Example
>>> import ubelt as ub >>> items = ['ham', 'jam', 'spam', 'eggs', 'cheese', 'banana'] >>> groupids = ['protein', 'fruit', 'protein', 'protein', 'dairy', 'fruit'] >>> id_to_items = ub.group_items(items, groupids) >>> print(ub.repr2(id_to_items, nl=0)) {'dairy': ['cheese'], 'fruit': ['jam', 'banana'], 'protein': ['ham', 'spam', 'eggs']}
- ubelt.hash_data(data, hasher=NoParam, base=NoParam, types=False, convert=False, extensions=None)[source]¶
Get a unique hash depending on the state of the data.
- Parameters
data (object) – Any sort of loosely organized data
hasher (str | Hasher | NoParamType) – string code or a hash algorithm from hashlib. Valid hashing algorithms are defined by
hashlib.algorithms_guaranteed
(e.g. ‘sha1’, ‘sha512’, ‘md5’) as well as ‘xxh32’ and ‘xxh64’ ifxxhash
is installed. Defaults to ‘sha512’.base (List[str] | str | NoParamType) – list of symbols or shorthand key. Valid keys are ‘abc’, ‘hex’, and ‘dec’. Defaults to ‘hex’
types (bool) – If True data types are included in the hash, otherwise only the raw data is hashed. Defaults to False.
convert (bool, default=True) – if True, try and convert the data to json an the json is hashed instead. This can improve runtime in some instances, however the hash may differ from the case where convert=False.
extensions (HashableExtensions | None) – a custom
HashableExtensions
instance that can overwrite or define how different types of objects are hashed.
Note
The types allowed are specified by the HashableExtensions object. By default ubelt will register:
OrderedDict, uuid.UUID, np.random.RandomState, np.int64, np.int32, np.int16, np.int8, np.uint64, np.uint32, np.uint16, np.uint8, np.float16, np.float32, np.float64, np.float128, np.ndarray, bytes, str, int, float, long (in python2), list, tuple, set, and dict
- Returns
text representing the hashed data
- Return type
Note
The alphabet26 base is a pretty nice base, I recommend it. However we default to
base='hex'
because it is standard. You can try the alphabet26 base by settingbase='abc'
.Example
>>> import ubelt as ub >>> print(ub.hash_data([1, 2, (3, '4')], convert=False)) 60b758587f599663931057e6ebdf185a... >>> print(ub.hash_data([1, 2, (3, '4')], base='abc', hasher='sha512')[:32]) hsrgqvfiuxvvhcdnypivhhthmrolkzej
- ubelt.hash_file(fpath, blocksize=1048576, stride=1, maxbytes=None, hasher=NoParam, base=NoParam)[source]¶
Hashes the data in a file on disk.
The results of this function agree with standard hashing programs (e.g. sha1sum, sha512sum, md5sum, etc…)
- Parameters
fpath (PathLike) – location of the file to be hashed.
blocksize (int) – Amount of data to read and hash at a time. There is a trade off and the optimal number will depend on specific hardware. This number was chosen to be optimal on a developer system. See “dev/bench_hash_file” for methodology to choose this number for your use case. Defaults to 2 ** 20.
stride (int) – strides > 1 skip data to hash, useful for faster hashing, but less accurate, also makes hash dependent on blocksize. Defaults to 1.
maxbytes (int | None) – if specified, only hash the leading maxbytes of data in the file.
hasher (str | Hasher | NoParamType) – string code or a hash algorithm from hashlib. Valid hashing algorithms are defined by
hashlib.algorithms_guaranteed
(e.g. ‘sha1’, ‘sha512’, ‘md5’) as well as ‘xxh32’ and ‘xxh64’ ifxxhash
is installed. Defaults to ‘sha512’.base (List[str] | int | str | NoParamType) – list of symbols or shorthand key. Valid keys are ‘abc’, ‘hex’, and ‘dec’, 10, 16, 26, 32. Defaults to ‘hex’.
References
- SO_3431825
http://stackoverflow.com/questions/3431825/md5-checksum-of-a-file
- SO_5001893
http://stackoverflow.com/questions/5001893/when-to-use-sha-1-vs-sha-2
Example
>>> import ubelt as ub >>> from os.path import join >>> dpath = ub.Path.appdir('ubelt/tests/test-hash').ensuredir() >>> fpath = dpath / 'tmp1.txt' >>> fpath.write_text('foobar') >>> print(ub.hash_file(fpath, hasher='sha1', base='hex')) 8843d7f92416211de9ebb963ff4ce28125932878
Example
>>> import ubelt as ub >>> dpath = ub.Path.appdir('ubelt/tests/test-hash').ensuredir() >>> fpath = dpath / 'tmp2.txt' >>> # We have the ability to only hash at most ``maxbytes`` in a file >>> fpath.write_text('abcdefghijklmnop') >>> h0 = ub.hash_file(fpath, hasher='sha1', base='hex', maxbytes=11, blocksize=3) >>> h1 = ub.hash_file(fpath, hasher='sha1', base='hex', maxbytes=32, blocksize=3) >>> h2 = ub.hash_file(fpath, hasher='sha1', base='hex', maxbytes=32, blocksize=32) >>> h3 = ub.hash_file(fpath, hasher='sha1', base='hex', maxbytes=16, blocksize=1) >>> h4 = ub.hash_file(fpath, hasher='sha1', base='hex', maxbytes=16, blocksize=18) >>> assert h1 == h2 == h3 == h4 >>> assert h1 != h0
>>> # Using a stride makes the result dependent on the blocksize >>> h0 = ub.hash_file(fpath, hasher='sha1', base='hex', maxbytes=11, blocksize=3, stride=2) >>> h1 = ub.hash_file(fpath, hasher='sha1', base='hex', maxbytes=32, blocksize=3, stride=2) >>> h2 = ub.hash_file(fpath, hasher='sha1', base='hex', maxbytes=32, blocksize=32, stride=2) >>> h3 = ub.hash_file(fpath, hasher='sha1', base='hex', maxbytes=16, blocksize=1, stride=2) >>> h4 = ub.hash_file(fpath, hasher='sha1', base='hex', maxbytes=16, blocksize=18, stride=2) >>> assert h1 != h2 != h3 >>> assert h1 == h0 >>> assert h2 == h4
Example
>>> import ubelt as ub >>> from os.path import join >>> dpath = ub.Path.appdir('ubelt/tests/test-hash').ensuredir() >>> fpath = ub.touch(join(dpath, 'empty_file')) >>> # Test that the output is the same as sha1sum executable >>> if ub.find_exe('sha1sum'): >>> want = ub.cmd(['sha1sum', fpath], verbose=2)['out'].split(' ')[0] >>> got = ub.hash_file(fpath, hasher='sha1') >>> print('want = {!r}'.format(want)) >>> print('got = {!r}'.format(got)) >>> assert want.endswith(got) >>> # Do the same for sha512 sum and md5sum >>> if ub.find_exe('sha512sum'): >>> want = ub.cmd(['sha512sum', fpath], verbose=2)['out'].split(' ')[0] >>> got = ub.hash_file(fpath, hasher='sha512') >>> print('want = {!r}'.format(want)) >>> print('got = {!r}'.format(got)) >>> assert want.endswith(got) >>> if ub.find_exe('md5sum'): >>> want = ub.cmd(['md5sum', fpath], verbose=2)['out'].split(' ')[0] >>> got = ub.hash_file(fpath, hasher='md5') >>> print('want = {!r}'.format(want)) >>> print('got = {!r}'.format(got)) >>> assert want.endswith(got)
- ubelt.highlight_code(text, lexer_name='python', **kwargs)[source]¶
Highlights a block of text using ANSI tags based on language syntax.
- Parameters
text (str) – plain text to highlight
lexer_name (str) – name of language. eg: python, docker, c++
**kwargs – passed to pygments.lexers.get_lexer_by_name
- Returns
text - highlighted text If pygments is not installed, the plain text is returned.
- Return type
Example
>>> import ubelt as ub >>> text = 'import ubelt as ub; print(ub)' >>> new_text = ub.highlight_code(text) >>> print(new_text)
- ubelt.hzcat(args, sep='')[source]¶
Horizontally concatenates strings preserving indentation
Concatenates a list of objects ensuring that the next item in the list is all the way to the right of any previous items.
- Parameters
args (List[str]) – strings to concatenate
sep (str, default=’’) – separator
- Example1:
>>> import ubelt as ub >>> B = ub.repr2([[1, 2], [3, 457]], nl=1, cbr=True, trailsep=False) >>> C = ub.repr2([[5, 6], [7, 8]], nl=1, cbr=True, trailsep=False) >>> args = ['A = ', B, ' * ', C] >>> print(ub.hzcat(args)) A = [[1, 2], * [[5, 6], [3, 457]] [7, 8]]
- Example2:
>>> import ubelt as ub >>> import unicodedata >>> aa = unicodedata.normalize('NFD', 'á') # a unicode char with len2 >>> B = ub.repr2([['θ', aa], [aa, aa, aa]], nl=1, si=True, cbr=True, trailsep=False) >>> C = ub.repr2([[5, 6], [7, 'θ']], nl=1, si=True, cbr=True, trailsep=False) >>> args = ['A', '=', B, '*', C] >>> print(ub.hzcat(args, sep='|')) A|=|[[θ, á], |*|[[5, 6], | | [á, á, á]]| | [7, θ]]
- ubelt.identity(arg=None, *args, **kwargs)[source]¶
Return the value of the first argument unchanged.
All other positional and keyword inputs are ignored. Defaults to None if called without any args.
The name identity is used in the mathematical sense [WikiIdentity]. This is slightly different than the pure identity function, which is defined strictly with a single argument. This implementation allows but ignores extra arguments, making it easier to use as a drop in replacement for functions that accept extra configuration arguments that change their behavior and aren’t true inputs.
The value of this utility is a cleaner way to write
lambda x: x
or more preciselylambda x=None, *a, **k: x
or writing the function inline. Unlike the lambda variant, this does not trigger common linter errors when assigning it to a value.- Parameters
arg (Any | None, default=None) – The value to return unchanged.
*args – Ignored
**kwargs – Ignored
- Returns
arg - The same value of the first positional argument.
- Return type
Any
References
Example
>>> import ubelt as ub >>> ub.identity(42) 42 >>> ub.identity(42, 43) 42 >>> ub.identity() None
- ubelt.import_module_from_name(modname)[source]¶
Imports a module from its string name (i.e.
__name__
)This is a simple wrapper around
importlib.import_module()
, but is provided as a companion function toimport_module_from_path()
, which contains functionality not provided in the Python standard library.- Parameters
modname (str) – module name
- Returns
module
- Return type
ModuleType
- SeeAlso:
Example
>>> # test with modules that won't be imported in normal circumstances >>> # todo write a test where we guarantee this >>> modname_list = [ >>> 'pickletools', >>> 'lib2to3.fixes.fix_apply', >>> ] >>> #assert not any(m in sys.modules for m in modname_list) >>> modules = [import_module_from_name(modname) for modname in modname_list] >>> assert [m.__name__ for m in modules] == modname_list >>> assert all(m in sys.modules for m in modname_list)
- ubelt.import_module_from_path(modpath, index=-1)[source]¶
Imports a module via a filesystem path.
This works by modifying
sys.path
, importing the module name, and then attempting to undo the change to sys.path. This function may produce unexpected results in the case where the imported module itself itself modifiessys.path
or if there is another conflicting module with the same name.- Parameters
modpath (str | PathLike) – Path to the module on disk or within a zipfile. Paths within a zipfile can be given by
<path-to>.zip/<path-inside-zip>.py
.index (int) – Location at which we modify PYTHONPATH if necessary. If your module name does not conflict, the safest value is -1, However, if there is a conflict, then use an index of 0. The default may change to 0 in the future.
- Returns
the imported module
- Return type
ModuleType
References
- Raises
IOError - when the path to the module does not exist –
ImportError - when the module is unable to be imported –
Note
If the module is part of a package, the package will be imported first. These modules may cause problems when reloading via IPython magic
This can import a module from within a zipfile. To do this modpath should specify the path to the zipfile and the path to the module within that zipfile separated by a colon or pathsep. E.g. “/path/to/archive.zip:mymodule.pl”
Warning
It is best to use this with paths that will not conflict with previously existing modules.
If the modpath conflicts with a previously existing module name. And the target module does imports of its own relative to this conflicting path. In this case, the module that was loaded first will win.
For example if you try to import ‘/foo/bar/pkg/mod.py’ from the folder structure:
- foo/ +- bar/ +- pkg/ + __init__.py |- mod.py |- helper.py
If there exists another module named
pkg
already in sys.modules and mod.py does something likefrom . import helper
, Python will assume helper belongs to thepkg
module already in sys.modules. This can cause a NameError or worse — a incorrect helper module.- SeeAlso:
Example
>>> import xdoctest >>> modpath = xdoctest.__file__ >>> module = import_module_from_path(modpath) >>> assert module is xdoctest
Example
>>> # Test importing a module from within a zipfile >>> import zipfile >>> from xdoctest import utils >>> from os.path import join, expanduser, normpath >>> dpath = expanduser('~/.cache/xdoctest') >>> dpath = utils.ensuredir(dpath) >>> #dpath = utils.TempDir().ensure() >>> # Write to an external module named bar >>> external_modpath = join(dpath, 'bar.py') >>> # For pypy support we have to write this using with >>> with open(external_modpath, 'w') as file: >>> file.write('testvar = 1') >>> internal = 'folder/bar.py' >>> # Move the external bar module into a zipfile >>> zippath = join(dpath, 'myzip.zip') >>> with zipfile.ZipFile(zippath, 'w') as myzip: >>> myzip.write(external_modpath, internal) >>> # Import the bar module from within the zipfile >>> modpath = zippath + ':' + internal >>> modpath = zippath + os.path.sep + internal >>> module = import_module_from_path(modpath) >>> assert normpath(module.__name__) == normpath('folder/bar') >>> assert module.testvar == 1
Example
>>> import pytest >>> with pytest.raises(IOError): >>> import_module_from_path('does-not-exist') >>> with pytest.raises(IOError): >>> import_module_from_path('does-not-exist.zip/')
- ubelt.indent(text, prefix=' ')[source]¶
Indents a block of text
- Parameters
text (str) – text to indent
prefix (str, default = ‘ ‘) – prefix to add to each line
- Returns
indented text
- Return type
Example
>>> import ubelt as ub >>> NL = chr(10) # newline character >>> text = 'Lorem ipsum' + NL + 'dolor sit amet' >>> prefix = ' ' >>> result = ub.indent(text, prefix) >>> assert all(t.startswith(prefix) for t in result.split(NL))
- ubelt.indexable_allclose(items1, items2, rel_tol=1e-09, abs_tol=0.0, return_info=False)[source]¶
Walks through two nested data structures and ensures that everything is roughly the same.
Note
- Deprecated. Instead use:
ub.IndexableWalker(items1).allclose(items2)
- Parameters
items1 (dict | list | tuple) – a nested indexable item
items2 (dict | list | tuple) – a nested indexable item
rel_tol (float) – maximum difference for being considered “close”, relative to the magnitude of the input values
abs_tol (float) – maximum difference for being considered “close”, regardless of the magnitude of the input values
return_info (bool, default=False) – if true, return extra info
- Returns
A boolean result if
return_info
is false, otherwise a tuple of the boolean result and an “info” dict containing detailed results indicating what matched and what did not.- Return type
Example
>>> import ubelt as ub >>> items1 = { >>> 'foo': [1.222222, 1.333], >>> 'bar': 1, >>> 'baz': [], >>> } >>> items2 = { >>> 'foo': [1.22222, 1.333], >>> 'bar': 1, >>> 'baz': [], >>> } >>> flag, return_info = ub.indexable_allclose(items1, items2, return_info=True) >>> print('return_info = {}'.format(ub.repr2(return_info, nl=1))) >>> print('flag = {!r}'.format(flag))
- ubelt.inject_method(self, func, name=None)[source]¶
Injects a function into an object instance as a bound method
The main use case of this function is for monkey patching. While monkey patching is sometimes necessary it should generally be avoided. Thus, we simply remind the developer that there might be a better way.
- Parameters
self (T) – Instance to inject a function into.
func (Callable[…, Any]) – The function to inject (must contain an arg for self).
name (str | None, default=None) – Name of the method. optional. If not specified the name of the function is used.
Example
>>> import ubelt as ub >>> class Foo(object): >>> def bar(self): >>> return 'bar' >>> def baz(self): >>> return 'baz' >>> self = Foo() >>> assert self.bar() == 'bar' >>> assert not hasattr(self, 'baz') >>> ub.inject_method(self, baz) >>> assert not hasattr(Foo, 'baz'), 'should only change one instance' >>> assert self.baz() == 'baz' >>> ub.inject_method(self, baz, 'bar') >>> assert self.bar() == 'baz'
- ubelt.invert_dict(dict_, unique_vals=True, cls=None)[source]¶
Swaps the keys and values in a dictionary.
- Parameters
dict_ (Dict[KT, VT]) – dictionary to invert
unique_vals (bool, default=True) – if False, the values of the new dictionary are sets of the original keys.
cls (type | None) – specifies the dict subclassof the result. if unspecified will be dict or OrderedDict. This behavior may change.
- SeeAlso:
:
UDict.invert()
- object oriented version of this function
- Returns
the inverted dictionary
- Return type
Dict[VT, KT] | Dict[VT, Set[KT]]
Note
The must values be hashable.
If the original dictionary contains duplicate values, then only one of the corresponding keys will be returned and the others will be discarded. This can be prevented by setting
unique_vals=False
, causing the inverted keys to be returned in a set.Example
>>> import ubelt as ub >>> dict_ = {'a': 1, 'b': 2} >>> inverted = ub.invert_dict(dict_) >>> assert inverted == {1: 'a', 2: 'b'}
Example
>>> import ubelt as ub >>> dict_ = ub.odict([(2, 'a'), (1, 'b'), (0, 'c'), (None, 'd')]) >>> inverted = ub.invert_dict(dict_) >>> assert list(inverted.keys())[0] == 'a'
Example
>>> import ubelt as ub >>> dict_ = {'a': 1, 'b': 0, 'c': 0, 'd': 0, 'f': 2} >>> inverted = ub.invert_dict(dict_, unique_vals=False) >>> assert inverted == {0: {'b', 'c', 'd'}, 1: {'a'}, 2: {'f'}}
- ubelt.iter_window(iterable, size=2, step=1, wrap=False)[source]¶
Iterates through iterable with a window size. This is essentially a 1D sliding window.
- Parameters
iterable (Iterable[T]) – an iterable sequence
size (int, default=2) – sliding window size
step (int, default=1) – sliding step size
wrap (bool, default=False) – wraparound flag
- Returns
returns a possibly overlapping windows in a sequence
- Return type
Iterable[T]
Notes
Similar to
more_itertools.windowed()
, Similar tomore_itertools.pairwise()
, Similar tomore_itertools.triplewise()
, Similar tomore_itertools.sliding_window()
Example
>>> import ubelt as ub >>> iterable = [1, 2, 3, 4, 5, 6] >>> size, step, wrap = 3, 1, True >>> window_iter = ub.iter_window(iterable, size, step, wrap) >>> window_list = list(window_iter) >>> print('window_list = %r' % (window_list,)) window_list = [(1, 2, 3), (2, 3, 4), (3, 4, 5), (4, 5, 6), (5, 6, 1), (6, 1, 2)]
Example
>>> import ubelt as ub >>> iterable = [1, 2, 3, 4, 5, 6] >>> size, step, wrap = 3, 2, True >>> window_iter = ub.iter_window(iterable, size, step, wrap) >>> window_list = list(window_iter) >>> print('window_list = {!r}'.format(window_list)) window_list = [(1, 2, 3), (3, 4, 5), (5, 6, 1)]
Example
>>> import ubelt as ub >>> iterable = [1, 2, 3, 4, 5, 6] >>> size, step, wrap = 3, 2, False >>> window_iter = ub.iter_window(iterable, size, step, wrap) >>> window_list = list(window_iter) >>> print('window_list = {!r}'.format(window_list)) window_list = [(1, 2, 3), (3, 4, 5)]
Example
>>> import ubelt as ub >>> iterable = [] >>> size, step, wrap = 3, 2, False >>> window_iter = ub.iter_window(iterable, size, step, wrap) >>> window_list = list(window_iter) >>> print('window_list = {!r}'.format(window_list)) window_list = []
- ubelt.iterable(obj, strok=False)[source]¶
Checks if the input implements the iterator interface. An exception is made for strings, which return False unless
strok
is True- Parameters
obj (object) – a scalar or iterable input
strok (bool, default=False) – if True allow strings to be interpreted as iterable
- Returns
True if the input is iterable
- Return type
Example
>>> import ubelt as ub >>> obj_list = [3, [3], '3', (3,), [3, 4, 5], {}] >>> result = [ub.iterable(obj) for obj in obj_list] >>> assert result == [False, True, False, True, True, True] >>> result = [ub.iterable(obj, strok=True) for obj in obj_list] >>> assert result == [False, True, True, True, True, True]
- ubelt.map_keys(func, dict_, cls=None)[source]¶
Apply a function to every key in a dictionary.
Creates a new dictionary with the same values and modified keys. An error is raised if the new keys are not unique.
- Parameters
func (Callable[[KT], T] | Mapping[KT, T]) – a function or indexable object
dict_ (Dict[KT, VT]) – a dictionary
cls (type | None) – specifies the dict subclassof the result. if unspecified will be dict or OrderedDict. This behavior may change.
- SeeAlso:
:
UDict.map_keys()
- object oriented version of this function
- Returns
transformed dictionary
- Return type
Dict[T, VT]
- Raises
Exception – if multiple keys map to the same value
Example
>>> import ubelt as ub >>> dict_ = {'a': [1, 2, 3], 'b': []} >>> func = ord >>> newdict = ub.map_keys(func, dict_) >>> print(newdict) >>> assert newdict == {97: [1, 2, 3], 98: []} >>> dict_ = {0: [1, 2, 3], 1: []} >>> func = ['a', 'b'] >>> newdict = ub.map_keys(func, dict_) >>> print(newdict) >>> assert newdict == {'a': [1, 2, 3], 'b': []}
- ubelt.map_vals(func, dict_, cls=None)¶
Apply a function to every value in a dictionary.
Creates a new dictionary with the same keys and modified values.
- Parameters
func (Callable[[VT], T] | Mapping[VT, T]) – a function or indexable object
dict_ (Dict[KT, VT]) – a dictionary
cls (type | None) – specifies the dict subclassof the result. if unspecified will be dict or OrderedDict. This behavior may change.
- SeeAlso:
:
UDict.map_values()
- object oriented version of this function
- Returns
transformed dictionary
- Return type
Dict[KT, T]
Notes
Similar to
dictmap.dict_map
Example
>>> import ubelt as ub >>> dict_ = {'a': [1, 2, 3], 'b': []} >>> newdict = ub.map_values(len, dict_) >>> assert newdict == {'a': 3, 'b': 0}
Example
>>> # Can also use an indexable as ``func`` >>> import ubelt as ub >>> dict_ = {'a': 0, 'b': 1} >>> func = [42, 21] >>> newdict = ub.map_values(func, dict_) >>> assert newdict == {'a': 42, 'b': 21} >>> print(newdict)
- ubelt.map_values(func, dict_, cls=None)[source]¶
Apply a function to every value in a dictionary.
Creates a new dictionary with the same keys and modified values.
- Parameters
func (Callable[[VT], T] | Mapping[VT, T]) – a function or indexable object
dict_ (Dict[KT, VT]) – a dictionary
cls (type | None) – specifies the dict subclassof the result. if unspecified will be dict or OrderedDict. This behavior may change.
- SeeAlso:
:
UDict.map_values()
- object oriented version of this function
- Returns
transformed dictionary
- Return type
Dict[KT, T]
Notes
Similar to
dictmap.dict_map
Example
>>> import ubelt as ub >>> dict_ = {'a': [1, 2, 3], 'b': []} >>> newdict = ub.map_values(len, dict_) >>> assert newdict == {'a': 3, 'b': 0}
Example
>>> # Can also use an indexable as ``func`` >>> import ubelt as ub >>> dict_ = {'a': 0, 'b': 1} >>> func = [42, 21] >>> newdict = ub.map_values(func, dict_) >>> assert newdict == {'a': 42, 'b': 21} >>> print(newdict)
- ubelt.memoize(func)[source]¶
memoization decorator that respects args and kwargs
In Python 3.9. The
functools
introduces the cache method, which is currently faster than memoize for simple functions [FunctoolsCache]. However, memoize can handle more general non-natively hashable inputs.- Parameters
func (Callable) – live python function
- Returns
memoized wrapper
- Return type
Callable
References
- WikiMemoize
- FunctoolsCache
Example
>>> import ubelt as ub >>> closure = {'a': 'b', 'c': 'd'} >>> incr = [0] >>> def foo(key): >>> value = closure[key] >>> incr[0] += 1 >>> return value >>> foo_memo = ub.memoize(foo) >>> assert foo('a') == 'b' and foo('c') == 'd' >>> assert incr[0] == 2 >>> print('Call memoized version') >>> assert foo_memo('a') == 'b' and foo_memo('c') == 'd' >>> assert incr[0] == 4 >>> assert foo_memo('a') == 'b' and foo_memo('c') == 'd' >>> print('Counter should no longer increase') >>> assert incr[0] == 4 >>> print('Closure changes result without memoization') >>> closure = {'a': 0, 'c': 1} >>> assert foo('a') == 0 and foo('c') == 1 >>> assert incr[0] == 6 >>> assert foo_memo('a') == 'b' and foo_memo('c') == 'd'
- class ubelt.memoize_method(func)[source]¶
Bases:
object
memoization decorator for a method that respects args and kwargs
References
- ActiveState_Miller_2010
http://code.activestate.com/recipes/577452-a-memoize-decorator-for-instance-methods
Example
>>> import ubelt as ub >>> closure = {'a': 'b', 'c': 'd'} >>> incr = [0] >>> class Foo(object): >>> @ub.memoize_method >>> def foo_memo(self, key): >>> "Wrapped foo_memo docstr" >>> value = closure[key] >>> incr[0] += 1 >>> return value >>> def foo(self, key): >>> value = closure[key] >>> incr[0] += 1 >>> return value >>> self = Foo() >>> assert self.foo('a') == 'b' and self.foo('c') == 'd' >>> assert incr[0] == 2 >>> print('Call memoized version') >>> assert self.foo_memo('a') == 'b' and self.foo_memo('c') == 'd' >>> assert incr[0] == 4 >>> assert self.foo_memo('a') == 'b' and self.foo_memo('c') == 'd' >>> print('Counter should no longer increase') >>> assert incr[0] == 4 >>> print('Closure changes result without memoization') >>> closure = {'a': 0, 'c': 1} >>> assert self.foo('a') == 0 and self.foo('c') == 1 >>> assert incr[0] == 6 >>> assert self.foo_memo('a') == 'b' and self.foo_memo('c') == 'd' >>> print('Constructing a new object should get a new cache') >>> self2 = Foo() >>> self2.foo_memo('a') >>> assert incr[0] == 7 >>> self2.foo_memo('a') >>> assert incr[0] == 7 >>> assert self.foo_memo.__doc__ == 'Wrapped foo_memo docstr' >>> assert self.foo_memo.__name__ == 'foo_memo'
- ubelt.memoize_property(fget)[source]¶
Return a property attribute for new-style classes that only calls its getter on the first access. The result is stored and on subsequent accesses is returned, preventing the need to call the getter any more.
This decorator can either be used by itself or by decorating another property. In either case the method will always become a property.
Note
implementation is a modified version of [estebistec_memoize].
References
Example
>>> import ubelt as ub >>> class C(object): ... load_name_count = 0 ... @ub.memoize_property ... def name(self): ... "name's docstring" ... self.load_name_count += 1 ... return "the name" ... @ub.memoize_property ... @property ... def another_name(self): ... "name's docstring" ... self.load_name_count += 1 ... return "the name" >>> c = C() >>> c.load_name_count 0 >>> c.name 'the name' >>> c.load_name_count 1 >>> c.name 'the name' >>> c.load_name_count 1 >>> c.another_name
- ubelt.modname_to_modpath(modname, hide_init=True, hide_main=False, sys_path=None)[source]¶
Finds the path to a python module from its name.
Determines the path to a python module without directly import it
Converts the name of a module (__name__) to the path (__file__) where it is located without importing the module. Returns None if the module does not exist.
- Parameters
modname (str) – The name of a module in
sys_path
.hide_init (bool) – if False, __init__.py will be returned for packages. Defaults to True.
hide_main (bool) – if False, and
hide_init
is True, __main__.py will be returned for packages, if it exists. Defautls to False.sys_path (None | List[str | PathLike]) – The paths to search for the module. If unspecified, defaults to
sys.path
.
- Returns
modpath - path to the module, or None if it doesn’t exist
- Return type
str | None
Example
>>> modname = 'xdoctest.__main__' >>> modpath = modname_to_modpath(modname, hide_main=False) >>> assert modpath.endswith('__main__.py') >>> modname