strif 1.0.0__py3-none-any.whl

strif-1.0.0.dist-info/LICENSE

@@ -0,0 +1,202 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "{}"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright {yyyy} {name of copyright owner}
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
+

strif-1.0.0.dist-info/METADATA

@@ -0,0 +1,31 @@
+Metadata-Version: 2.1
+Name: strif
+Version: 1.0.0
+Summary: Tiny, useful lib for strings and files
+Home-page: https://github.com/jlevy/strif
+Author: Joshua Levy
+License: Apache 2
+Classifier: Development Status :: 4 - Beta
+Classifier: Environment :: Console
+Classifier: Intended Audience :: Developers
+Classifier: License :: OSI Approved :: Apache Software License
+Classifier: Operating System :: MacOS :: MacOS X
+Classifier: Operating System :: POSIX
+Classifier: Operating System :: Unix
+Classifier: Programming Language :: Python :: 3.6
+Classifier: Programming Language :: Python :: 3.7
+Classifier: Programming Language :: Python :: 3.8
+Classifier: Programming Language :: Python :: 3.9
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Topic :: Utilities
+Classifier: Topic :: Software Development
+Requires-Python: >=3.6,<4.0
+License-File: LICENSE
+
+
+Strif is a tiny (<1000 loc) library of string and file utilities for Python 3.6+.
+
+More information: https://github.com/jlevy/strif

strif-1.0.0.dist-info/RECORD

@@ -0,0 +1,6 @@
+strif.py,sha256=-prTCpuwjHX9SeDGMdQZqZdNxpP5j9LFW3_FHBJhb7A,14818
+strif-1.0.0.dist-info/LICENSE,sha256=xllut76FgcGL5zbIRvuRc7aezPbvlMUTWJPsVr2Sugg,11358
+strif-1.0.0.dist-info/METADATA,sha256=qpPgmmBjcBLu6MeZpw7FLWIojaYSt1Azo1CHe9FEmQM,1147
+strif-1.0.0.dist-info/WHEEL,sha256=cpQTJ5IWu9CdaPViMhC9YzF8gZuS5-vlfoFihTBC86A,91
+strif-1.0.0.dist-info/top_level.txt,sha256=O-shGNa3EMM4UEJfuO9FItCha5wSUneLiKec3grlhQM,6
+strif-1.0.0.dist-info/RECORD,,

strif-1.0.0.dist-info/WHEEL

@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: setuptools (70.1.0)
+Root-Is-Purelib: true
+Tag: py3-none-any
+

strif-1.0.0.dist-info/top_level.txt

@@ -0,0 +1 @@
+strif

strif.py

@@ -0,0 +1,490 @@
+"""
+Strif is a tiny (<1000 loc) library of string and file utilities for Python 3.6+.
+
+More information: https://github.com/jlevy/strif
+"""
+
+from string import Template
+import re
+import os
+import errno
+import random
+import shutil
+import shlex
+import tempfile
+import hashlib
+import codecs
+from contextlib import contextmanager
+from datetime import datetime
+
+__author__ = "jlevy"
+
+VERSION = "1.0.0"
+DESCRIPTION = "Tiny, useful lib for strings and files"
+LONG_DESCRIPTION = __doc__
+
+# The subprocess module has known threading issues, so prefer subprocess32, but as a soft dependency.
+try:
+    import subprocess32 as subprocess  # type: ignore
+except ImportError:
+    import subprocess
+
+# A pre-opened handle to /dev/null.
+DEV_NULL = open(os.devnull, "wb")
+
+BACKUP_SUFFIX = ".bak"
+TIMESTAMP_VAR = "{timestamp}"
+
+_RANDOM = random.SystemRandom()
+_RANDOM.seed()
+
+
+#
+# ---- Identifiers and base36 encodings ----
+
+
+def new_uid(bits=64):
+    """
+    A random alphanumeric value with at least the specified bits of randomness. We use base 36,
+    i.e. not case sensitive. Note this makes it suitable for filenames even on case-insensitive disks.
+    """
+    return "".join(
+        _RANDOM.sample("0123456789abcdefghijklmnopqrstuvwxyz", int(bits / 5.16) + 1)
+    )  # log(26 + 10)/log(2) = 5.16
+
+
+def iso_timestamp():
+    """
+    ISO timestamp. With the Z for usual clarity.
+    Example: 2015-09-12T08:41:12.397217Z
+    """
+    return datetime.now().isoformat() + "Z"
+
+
+def new_timestamped_uid(bits=32):
+    """
+    A unique id that begins with an ISO timestamp followed by fractions of seconds and bits of
+    randomness. The advantage of this is it sorts nicely by time, while still being unique.
+    Example: 20150912T084555Z-378465-43vtwbx
+    """
+    return "%s-%s" % (
+        re.sub(r"[^\w.]", "", datetime.now().isoformat()).replace(".", "Z-"),
+        new_uid(bits),
+    )
+
+
+_NON_ALPHANUM_CHARS = re.compile("[^a-z0-9]+", re.IGNORECASE)
+
+
+def clean_alphanum(string, max_length=None):
+    """
+    Convert a string to a clean, readable identifier that includes the (first) alphanumeric
+    characters of the given string.
+
+    This mapping is for readability only, and so can easily have collisions on different inputs.
+    """
+    return _NON_ALPHANUM_CHARS.sub("_", string)[:max_length]
+
+
+def clean_alphanum_hash(string, max_length=64, max_hash_len=None):
+    """
+    Convert a string to a clean, readable identifier that includes the (first) alphanumeric
+    characters of the given string.
+
+    This includes a SHA1 hash so collisions are unlikely.
+    """
+
+    hash = hash_string_base36(string, algorithm="sha1")
+    if max_hash_len:
+        hash = hash[:max_hash_len]
+    if max_length < len(hash) + 1:
+        return hash
+    else:
+        return clean_alphanum(string, max_length=max_length - len(hash)) + "_" + hash
+
+
+def base36_encode(n):
+    """
+    Base 36 encode an integer.
+    """
+
+    chars = "0123456789abcdefghijklmnopqrstuvwxyz"
+    encoded = ""
+
+    while n > 0:
+        n, remainder = divmod(n, 36)
+        encoded = chars[remainder] + encoded
+
+    return encoded
+
+
+def hash_string_base36(string, algorithm="sha1"):
+    """
+    Hash string and return in base 36, which is good for short, friendly identifiers.
+    """
+
+    h = hashlib.new(algorithm)
+    h.update(string.encode("utf8"))
+    return base36_encode(int.from_bytes(h.digest(), byteorder="big"))
+
+
+#
+# ---- Abbreviations ----
+
+
+def abbreviate_str(string, max_len=80, indicator="…"):
+    """
+    Abbreviate a string, adding an indicator like an ellipsis if required. Set max_len to
+    None or 0 not to truncate items.
+    """
+    if not string or not max_len or len(string) <= max_len:
+        return string
+    elif max_len <= len(indicator):
+        return string[0:max_len]
+    else:
+        return string[0 : max_len - len(indicator)] + indicator
+
+
+def abbreviate_list(items, max_items=10, item_max_len=40, joiner=", ", indicator="…"):
+    """
+    Abbreviate a list, truncating each element and adding an indicator at the end if the
+    whole list was truncated. Set item_max_len to None or 0 not to truncate items.
+    """
+    if not items:
+        return items
+    else:
+        shortened = [
+            abbreviate_str("%s" % item, max_len=item_max_len) for item in items[0:max_items]
+        ]
+        if len(items) > max_items:
+            shortened.append(indicator)
+        return joiner.join(shortened)
+
+
+#
+# ---- Templating ----
+
+
+def expand_variables(template_str, value_map, transformer=None):
+    """
+    Expand a template string like "blah blah $FOO blah" using given value mapping.
+    """
+    if template_str is None:
+        return None
+    else:
+        if transformer is None:
+            transformer = lambda v: v  # noqa: E731
+        try:
+            # Don't bother iterating items for Python 2+3 compatibility.
+            transformed_value_map = {k: transformer(value_map[k]) for k in value_map}
+            return Template(template_str).substitute(transformed_value_map)
+        except Exception as e:
+            raise ValueError(
+                "could not expand variable names in command '%s': %s" % (template_str, e)
+            )
+
+
+def shell_expand_variables(template_str, value_map):
+    """
+    Expand a shell template string like "cp $SOURCE $TARGET/blah", also quoting values as needed
+    to ensure shell safety.
+    """
+    return expand_variables(template_str, value_map, transformer=shlex.quote)
+
+
+def shell_expand_to_popen(template, values):
+    """
+    Expand a template like "cp $SOURCE $TARGET/blah" into a list of popen arguments.
+    """
+    return [expand_variables(item, values) for item in shlex.split(template)]
+
+
+#
+# ---- File operations ----
+
+
+def _expand_backup_suffix(backup_suffix):
+    return (
+        backup_suffix.replace(TIMESTAMP_VAR, new_timestamped_uid())
+        if TIMESTAMP_VAR in backup_suffix
+        else backup_suffix
+    )
+
+
+def move_to_backup(path, backup_suffix=BACKUP_SUFFIX):
+    """
+    Move the given file or directory to the same name, with a backup suffix.
+    If backup_suffix not supplied, move it to the extension ".bak".
+    In backup_suffix, the string "{timestamp}", if present, will be replaced
+    by a new_timestamped_uid(), allowing infinite numbers of timestamped backups.
+    If backup_suffix is supplied and is None, don't do anything.
+
+    Important:
+    Without "{timestamp}", earlier backup files and directories, if they exist,
+    will be clobbered!
+    """
+    if backup_suffix and os.path.exists(path):
+        backup_path = path + _expand_backup_suffix(backup_suffix)
+        # Some messy corner cases need to be handled for existing backups.
+        # TODO: Note if this is a directory, and we do this twice at once, there is a potential race
+        # that could leave one backup inside the other.
+        if os.path.islink(backup_path):
+            os.unlink(backup_path)
+        elif os.path.isdir(backup_path):
+            shutil.rmtree(backup_path)
+        shutil.move(path, backup_path)
+
+
+def make_all_dirs(path, mode=0o777):
+    """
+    Ensure local dir, with all its parent dirs, are created.
+    Unlike os.makedirs(), will not fail if the path already exists.
+    """
+    # Avoid races inherent to doing this in two steps (check then create).
+    # Python 3 has exist_ok but the approach below works for Python 2+3.
+    # https://stackoverflow.com/questions/600268/mkdir-p-functionality-in-python
+    try:
+        os.makedirs(path, mode=mode)
+    except OSError as e:
+        if e.errno == errno.EEXIST and os.path.isdir(path):
+            pass
+        else:
+            raise
+    return path
+
+
+def make_parent_dirs(path, mode=0o777):
+    """
+    Ensure parent directories of a file are created as needed.
+    """
+    parent = os.path.dirname(path)
+    if parent:
+        make_all_dirs(parent, mode)
+    return path
+
+
+@contextmanager
+def atomic_output_file(dest_path, make_parents=False, backup_suffix=None, suffix=".partial.%s"):
+    """
+    A context manager for convenience in writing a file or directory in an atomic way. Set up
+    a temporary name, then rename it after the operation is done, optionally making a backup of
+    the previous file or directory, if present.
+    """
+    if dest_path == os.devnull:
+        # Handle the (probably rare) case of writing to /dev/null.
+        yield dest_path
+    else:
+        tmp_path = ("%s" + suffix) % (dest_path, new_uid())
+        if make_parents:
+            make_parent_dirs(tmp_path)
+
+        yield tmp_path
+
+        # Note this is not in a finally block, so that result won't be renamed to final location
+        # in case of abnormal exit.
+        if not os.path.exists(tmp_path):
+            raise IOError(
+                "failure in writing file '%s': target file '%s' missing" % (dest_path, tmp_path)
+            )
+        if backup_suffix:
+            move_to_backup(dest_path, backup_suffix=backup_suffix)
+        # If the target already exists, and is a directory, it has to be removed.
+        if os.path.isdir(dest_path):
+            shutil.rmtree(dest_path)
+        shutil.move(tmp_path, dest_path)
+
+
+def temp_output_file(prefix="tmp", suffix="", dir=None, make_parents=False, always_clean=False):
+    """
+    A context manager for convenience in creating a temporary file,
+    which is deleted when exiting the context.
+
+    Usage:
+      with temp_output_file() as (fd, path):
+        ...
+    """
+    return _temp_output(
+        False,
+        prefix=prefix,
+        suffix=suffix,
+        dir=dir,
+        make_parents=make_parents,
+        always_clean=always_clean,
+    )
+
+
+def temp_output_dir(prefix="tmp", suffix="", dir=None, make_parents=False, always_clean=False):
+    """
+    A context manager for convenience in creating a temporary directory,
+    which is deleted when exiting the context.
+
+    Usage:
+      with temp_output_dir() as dirname:
+        ...
+    """
+    return _temp_output(
+        True,
+        prefix=prefix,
+        suffix=suffix,
+        dir=dir,
+        make_parents=make_parents,
+        always_clean=always_clean,
+    )
+
+
+@contextmanager
+def _temp_output(is_dir, prefix="tmp", suffix="", dir=None, make_parents=False, always_clean=False):
+    if dir and make_parents:
+        make_all_dirs(dir)
+
+    if is_dir:
+        path = tempfile.mkdtemp(prefix=prefix, suffix=suffix, dir=dir)
+        result = path
+    else:
+        (fd, path) = tempfile.mkstemp(prefix=prefix, suffix=suffix, dir=dir)
+        result = (fd, path)
+
+    def clean():
+        try:
+            rmtree_or_file(path, ignore_errors=True)
+        except OSError:
+            pass
+
+    if always_clean:
+        try:
+            yield result
+        finally:
+            clean()
+    else:
+        yield result
+        clean()
+
+
+def read_string_from_file(path, encoding="utf8"):
+    """
+    Read entire contents of file into a string.
+    """
+    with codecs.open(path, "rb", encoding=encoding) as f:
+        value = f.read()
+    return value
+
+
+def write_string_to_file(
+    path, string, make_parents=False, backup_suffix=BACKUP_SUFFIX, encoding="utf8"
+):
+    """
+    Write entire file with given string contents, atomically. Keeps backup by default.
+    """
+    with atomic_output_file(
+        path, make_parents=make_parents, backup_suffix=backup_suffix
+    ) as tmp_path:
+        with codecs.open(tmp_path, "wb", encoding=encoding) as f:
+            f.write(string)
+
+
+def set_file_mtime(path, mtime, atime=None):
+    """Set access and modification times on a file."""
+    if not atime:
+        atime = mtime
+    f = open(path, "a")
+    try:
+        os.utime(path, (atime, mtime))
+    finally:
+        f.close()
+
+
+def copyfile_atomic(source_path, dest_path, make_parents=False, backup_suffix=None):
+    """
+    Copy file on local filesystem in an atomic way, so partial copies never exist. Preserves timestamps.
+    """
+    with atomic_output_file(
+        dest_path, make_parents=make_parents, backup_suffix=backup_suffix
+    ) as tmp_path:
+        shutil.copyfile(source_path, tmp_path)
+        set_file_mtime(tmp_path, os.path.getmtime(source_path))
+
+
+def copytree_atomic(source_path, dest_path, make_parents=False, backup_suffix=None, symlinks=False):
+    """
+    Copy a file or directory recursively, and atomically, reanaming file or top-level dir when done.
+    Unlike shutil.copytree, this will not fail on a file.
+    """
+    if os.path.isdir(source_path):
+        with atomic_output_file(
+            dest_path, make_parents=make_parents, backup_suffix=backup_suffix
+        ) as tmp_path:
+            shutil.copytree(source_path, tmp_path, symlinks=symlinks)
+    else:
+        copyfile_atomic(
+            source_path, dest_path, make_parents=make_parents, backup_suffix=backup_suffix
+        )
+
+
+def movefile(source_path, dest_path, make_parents=False, backup_suffix=None):
+    """
+    Move file. With a few extra options.
+    """
+    if make_parents:
+        make_parent_dirs(dest_path)
+    move_to_backup(dest_path, backup_suffix=backup_suffix)  # type: ignore
+    shutil.move(source_path, dest_path)
+
+
+def rmtree_or_file(path, ignore_errors=False, onerror=None):
+    """
+    rmtree fails on files or symlinks. This removes the target, whatever it is.
+    """
+    # TODO: Could add an rsync-based delete, as in
+    # https://github.com/vivlabs/instaclone/blob/master/instaclone/instaclone.py#L127-L143
+    if ignore_errors and not os.path.exists(path):
+        return
+    if os.path.isdir(path) and not os.path.islink(path):
+        shutil.rmtree(path, ignore_errors=ignore_errors, onerror=onerror)
+    else:
+        os.unlink(path)
+
+
+def chmod_native(path, mode_expression, recursive=False):
+    """
+    This is ugly and will only work on POSIX, but the built-in Python os.chmod support
+    is very minimal, and neither supports fast recursive chmod nor "+X" type expressions,
+    both of which are slow for large trees. So just shell out.
+    """
+    popenargs = ["chmod"]
+    if recursive:
+        popenargs.append("-R")
+    popenargs.append(mode_expression)
+    popenargs.append(path)
+    subprocess.check_call(popenargs)
+
+
+def file_sha1(path):
+    """
+    Compute SHA1 hash of a file.
+    """
+    sha1 = hashlib.sha1()
+    with open(path, "rb") as f:
+        while True:
+            block = f.read(2**10)
+            if not block:
+                break
+            sha1.update(block)
+        return sha1.hexdigest()
+
+
+#
+# --- Misc ---
+
+
+def dict_merge(*dict_list):
+    """
+    Given zero or more dicts, shallow copy and merge them into a new dict, with
+    precedence to dictionary values later in the dict list.
+    Helpful mainly before Python 3.5.
+    https://stackoverflow.com/questions/38987/how-to-merge-two-dictionaries-in-a-single-expression
+    https://docs.python.org/dev/whatsnew/3.5.html#pep-448-additional-unpacking-generalizations
+    """
+    result = {}
+    for d in dict_list:
+        result.update(d)
+    return result