r"""
Wrappers around hashlib functions to generate hash signatures for common data.
The hashes are deterministic across Python versions and operating systems.
This is verified by CI testing on 32 and 64 bit versions of Windows, Linux, and
OSX with all supported Python.
Use Case #1: You have data that you want to hash. If we assume the data is in
standard python scalars or ordered sequences: e.g. tuple, list, OrderedDict,
OrderedSet, int, str, etc..., then the solution is :func:`hash_data`.
Use Case #2: You have a file you want to hash, but your system doesn't have a
sha1sum executable (or you dont want to use Popen). The solution is
:func:`hash_file`
The :func:`ubelt.util_hash.hash_data` function recursively hashes most builtin
python data structures. This is similar to the deephash functionality provided
in [PypiDeepDiff]_.
The :func:`ubelt.util_hash.hash_file` function hashes data on disk. Both of
the aforementioned functions have options for different hashers and alphabets.
References:
.. [PypiDeepDiff] https://pypi.org/project/deepdiff/
Example:
>>> import ubelt as ub
>>> data = ub.odict(sorted({
>>> 'param1': True,
>>> 'param2': 0,
>>> 'param3': [None],
>>> 'param4': ('str', 4.2),
>>> }.items()))
>>> # hash_data can hash any ordered builtin object
>>> ub.hash_data(data, hasher='sha256')
0b101481e4b894ddf6de57...
Example:
>>> import ubelt as ub
>>> from os.path import join
>>> fpath = (ub.Path.appdir('ubelt/tests').ensuredir() / 'empty_file').touch()
>>> ub.hash_file(fpath, hasher='sha1')
da39a3ee5e6b4b0d3255bfef95601890afd80709
Note:
The exact hashes generated for data object and files may change in the
future. When this happens the ``HASH_VERSION`` attribute will be
incremented.
Note:
[util_hash.Note.1] pre 0.10.2, the protected function
_hashable_sequence defaulted to types=True setting to True here for
backwards compat. This means that extensions using the
``_hashable_sequence`` helper will always include types in their hashable
encoding regardless of the argument setting. We may change this in the
future, to be more consistent. This is a minor detail unless you are
getting into the weeds of how we coerce technically non-hashable sequences
into a hashable encoding.
"""
import hashlib
import math
from collections import OrderedDict
from ubelt.util_const import NoParam
__all__ = ['hash_data', 'hash_file']
# incremented when we make a change that modifies hashes
HASH_VERSION = 2 # type: int
_ALPHABET_10 = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9'] # type: List[str]
_ALPHABET_16 = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
'a', 'b', 'c', 'd', 'e', 'f']
_ALPHABET_26 = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j',
'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't',
'u', 'v', 'w', 'x', 'y', 'z']
_ALPHABET_36 = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j',
'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't',
'u', 'v', 'w', 'x', 'y', 'z']
# RFC 4648 Base32 alphabet
_ALPHABET_32 = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L',
'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X',
'Y', 'Z', '2', '3', '4', '5', '6', '7']
DEFAULT_ALPHABET = _ALPHABET_16 # type: List[str]
def b(s):
"""
Args:
s (str):
Returns:
bytes
"""
return s.encode("latin-1")
# Sensible choices for default hashers are sha1, sha512, and xxh64.
# xxhash.xxh64 is very fast, but non-crypto-grade and not in the standard lib
# Reference: http://cyan4973.github.io/xxHash/
# Reference: https://github.com/Cyan4973/xxHash
# We dont default to sha1 because it has a known collision and other issues
# Reference: https://stackoverflow.com/questions/28159071/more-modern-sha
# Reference: https://security.googleblog.com/2017/02/announcing-first-sha1-collision.html
# Default to 512 because it is often faster than 256 on 64bit systems:
# Reference: https://crypto.stackexchange.com/questions/26336/faster
# DEFAULT_HASHER = xxhash.xxh32
# DEFAULT_HASHER = xxhash.xxh64 # xxh64 is the fastest, but non-standard
# DEFAULT_HASHER = hashlib.sha1 # fast algo, but has a known collision
# DEFAULT_HASHER = hashlib.sha512 # most robust algo, but slower than others
DEFAULT_HASHER = hashlib.sha512 # type: Callable
_COMPATIBLE_HASHABLE_SEQUENCE_TYPES_DEFAULT = True
# Note: the Hasher refers to hashlib._hashlib.HASH
# but this does not play well with type annotations
# try:
# HASH = hashlib._hashlib.HASH
# except AttributeError: # nocover
# # Python seems to have been compiled without OpenSSL
# HASH = None
def _int_to_bytes(int_):
r"""
Converts an integer into its byte representation
assumes int32 by default, but dynamically handles larger ints
Args:
int_ (int):
Returns:
bytes
Example:
>>> from ubelt.util_hash import _int_to_bytes, _bytes_to_int
>>> int_ = 1
>>> assert _bytes_to_int((_int_to_bytes(int_))) == int_
>>> assert _int_to_bytes(int_) == b'\x01'
>>> assert _bytes_to_int((_int_to_bytes(0))) == 0
>>> assert _bytes_to_int((_int_to_bytes(-1))) == -1
>>> assert _bytes_to_int((_int_to_bytes(-1000000))) == -1000000
>>> assert _bytes_to_int((_int_to_bytes(1000000))) == 1000000
"""
bit_length = int_.bit_length() + 1
length = math.ceil(bit_length / 8.0) # bytelength
bytes_ = int_.to_bytes(length, byteorder='big', signed=True)
return bytes_
def _bytes_to_int(bytes_):
r"""
Converts a string of bytes into its integer representation (big-endian)
Args:
bytes_ (bytes):
Returns:
int
Example:
>>> bytes_ = b'\x01'
>>> assert _int_to_bytes((_bytes_to_int(bytes_))) == bytes_
>>> assert _bytes_to_int(bytes_) == 1
"""
int_ = int.from_bytes(bytes_, 'big', signed=True)
return int_
class _Hashers(object):
"""
We offer hashers beyond what is available in hashlib.
This class is used to lazy load them.
Attributes:
algos (Dict[str, object]):
aliases (Dict[str, str]):
"""
def __init__(self):
self.algos = {} # type: Dict[str, object]
self.aliases = {} # type: Dict[str, str]
self._lazy_queue = [
self._register_xxhash,
self._register_blake3,
self._register_hashlib,
]
def available(self):
"""
The names of available hash algorithms
Returns:
List[str]
"""
if self._lazy_queue: # nocover
self._evaluate_registration_queue()
return list(self.algos.keys())
def _evaluate_registration_queue(self):
for func in self._lazy_queue:
try:
func()
except ImportError: # nocover
...
self._lazy_queue.clear()
def __contains__(self, key):
"""
Args:
key (str): name of hash algo to check
Returns:
bool: if the algo is available
"""
if self._lazy_queue: # nocover
self._evaluate_registration_queue()
return key in self.algos or key in self.aliases
def _register_xxhash(self): # nocover
import xxhash # type: ignore
self.algos['xxh32'] = xxhash.xxh32
self.algos['xxh64'] = xxhash.xxh64
self.aliases.update({
'xxhash': 'xxh32',
'xx32': 'xxh32',
'xx64': 'xxh64',
})
def _register_blake3(self): # nocover
import blake3 # type: ignore
self.algos['blake3'] = blake3.blake3
self.aliases['b3'] = 'blake3'
def _register_hashlib(self):
guaranteed = set(hashlib.algorithms_guaranteed)
for key in guaranteed: # nocover
self.algos[key] = getattr(hashlib, key)
if 0: # nocover
# Do we want to expose these hash algos?
available = set(hashlib.algorithms_available)
extra = available - guaranteed
for key in extra:
self.algos[key] = hashlib.new(key)
def lookup(self, hasher):
"""
Args:
hasher (NoParamType | str | Any):
something coercable to a hasher
Returns:
Callable: a function to construct the requested hahser
"""
if hasher is NoParam or hasher == 'default':
hasher = DEFAULT_HASHER
elif hasattr(hasher, 'hexdigest'):
# HASH is not None and isinstance(hasher, HASH):
# by default the result of this function is a class we will make an
# instance of, if we already have an instance, wrap it in a
# callable so the external syntax does not need to change.
return lambda: hasher
else:
# Ensure lazy registration functions have been executed
if self._lazy_queue:
self._evaluate_registration_queue()
if isinstance(hasher, str):
hasher_ = self.aliases.get(hasher, hasher)
if hasher_ in self.algos: # pragma: no cover
return self.algos[hasher_]
else:
# TODO: provide pip install messages for known hashers.
raise KeyError('unknown hasher: {}'.format(hasher))
return hasher
_HASHERS = _Hashers()
def _rectify_hasher(hasher):
"""
Convert a string-based key into a hasher class
Note:
In terms of speed on 64bit systems, sha1 is the fastest followed by md5
and sha512. The slowest algorithm is sha256. If xxhash is installed
the fastest algorithm is xxh64.
Example:
>>> from ubelt.util_hash import (_rectify_hasher, DEFAULT_HASHER,
>>> hashlib, NoParam, _HASHERS)
>>> assert _rectify_hasher(NoParam) is DEFAULT_HASHER
>>> assert _rectify_hasher('sha1') is hashlib.sha1
>>> assert _rectify_hasher('sha256') is hashlib.sha256
>>> assert _rectify_hasher('sha512') is hashlib.sha512
>>> assert _rectify_hasher('md5') is hashlib.md5
>>> assert _rectify_hasher(hashlib.sha1) is hashlib.sha1
>>> #if HASH is not None:
>>> assert _rectify_hasher(hashlib.sha1())().name == 'sha1'
>>> import pytest
>>> assert pytest.raises(KeyError, _rectify_hasher, '42')
>>> #assert pytest.raises(TypeError, _rectify_hasher, object)
>>> if 'xxh32' in _HASHERS:
>>> import xxhash
>>> assert _rectify_hasher('xxh64') is xxhash.xxh64
>>> assert _rectify_hasher('xxh32') is xxhash.xxh32
>>> if 'blake3' in _HASHERS:
>>> import blake3
>>> assert _rectify_hasher('blake3') is blake3.blake3
>>> if 'whirlpool' in _HASHERS:
>>> assert _rectify_hasher('whirlpool') is blake3.blake3
"""
# Keeping this function for backwards compatibility (even though its not
# part of the public API)
return _HASHERS.lookup(hasher)
def _rectify_base(base):
"""
transforms base shorthand into the full list representation
Example:
>>> assert _rectify_base(NoParam) is DEFAULT_ALPHABET
>>> assert _rectify_base('hex') is _ALPHABET_16
>>> assert _rectify_base('abc') is _ALPHABET_26
>>> assert _rectify_base('alphanum') is _ALPHABET_36
>>> assert _rectify_base(10) is _ALPHABET_10
>>> assert _rectify_base(['1', '2']) == ['1', '2']
>>> import pytest
>>> assert pytest.raises(TypeError, _rectify_base, 'uselist')
"""
if base is NoParam or base == 'default':
return DEFAULT_ALPHABET
elif base in [36, 'abc123', 'alphanum']:
return _ALPHABET_36
# elif base in [32, 'rfc4648']:
elif base in [32]:
return _ALPHABET_32 # cant call it RFC until it conforms to a standard
elif base in [26, 'abc', 'alpha']:
return _ALPHABET_26
elif base in [16, 'hex']:
return _ALPHABET_16
elif base in [10, 'dec']:
return _ALPHABET_10
else:
if not isinstance(base, (list, tuple)):
raise TypeError(
'Argument `base` must be a key, list, or tuple; not {}'.format(
type(base)))
return base
class HashableExtensions(object):
"""
Helper class for managing non-primitive (e.g. numpy) hash types
Note:
We are introducing experimental functionality where custom instances of
this class can be created and passed as arguments to hash_data.
Attributes:
iterable_checks (List[Callable]):
"""
def __init__(self):
self.iterable_checks = []
self._lazy_queue = [] # type: List[Callable] # NOQA
# New singledispatch registry implementation
from functools import singledispatch
def _hash_dispatch(data):
raise NotImplementedError
_hash_dispatch.__is_base__ = True
self._hash_dispatch = singledispatch(_hash_dispatch)
def _evaluate_lazy_queue(self):
for func in self._lazy_queue:
func()
self._lazy_queue.clear()
def register(self, hash_types):
"""
Registers a function to generate a hash for data of the appropriate
types. This can be used to register custom classes. Internally this is
used to define how to hash non-builtin objects like ndarrays and uuids.
The registered function should return a tuple of bytes. First a small
prefix hinting at the data type, and second the raw bytes that can be
hashed.
Args:
hash_types (type | Tuple[type]):
Returns:
Callable: closure to be used as the decorator
Example:
>>> import ubelt as ub
>>> import pytest
>>> class MyType(object):
... def __init__(self, id):
... self.id = id
>>> data = MyType(1)
>>> # Custom types won't work with ub.hash_data by default
>>> with pytest.raises(TypeError):
... ub.hash_data(data)
>>> # To handle custom types, you can create custom extensions
>>> # and pass them to hash_data explicitly.
>>> extensions = ub.util_hash.HashableExtensions()
>>> @extensions.register(MyType)
>>> def hash_my_type(data):
... return b'mytype', b(ub.hash_data(data.id))
>>> my_instance = MyType(1)
>>> ub.hash_data(my_instance, extensions=extensions)
Example:
>>> # xdoctest: +SKIP
>>> # Simple example
>>> import ubelt as ub
>>> ub.hash_data.register(pathlib.Path)(lambda x: (b'PATH', str))
Example:
>>> # Can specify more than one type when you register
>>> import ubelt as ub
>>> import pytest
>>> extensions = ub.util_hash.HashableExtensions()
>>> class Type1(object):
>>> ...
>>> class Type2(object):
>>> ...
>>> @extensions.register([Type1, Type2])
>>> def hash_my_type(data):
... return b'mytype', b'constant'
>>> inst1 = Type1()
>>> inst2 = Type2()
>>> ub.hash_data(inst1, extensions=extensions)
>>> ub.hash_data(inst2, extensions=extensions)
Example:
>>> # xdoctest: +SKIP
>>> # Skip this doctest because we dont want tests to modify
>>> # the global state.
>>> import ubelt as ub
>>> import pytest
>>> class MyType(object):
... def __init__(self, id):
... self.id = id
>>> data = MyType(1)
>>> # Custom types won't work with ub.hash_data by default
>>> with pytest.raises(TypeError):
... ub.hash_data(data)
>>> # You can register your functions with ubelt's internal
>>> # hashable_extension registry.
>>> @ub.util_hash._HASHABLE_EXTENSIONS.register(MyType)
>>> def hash_my_type(data):
... return b'mytype', b(ub.hash_data(data.id))
>>> my_instance = MyType(1)
>>> ub.hash_data(my_instance)
>>> # New in ubelt 1.1.0: you can now do:
>>> # You can register your functions with ubelt's internal
>>> # hashable_extension registry.
>>> @ub.hash_data.register(MyType)
>>> def hash_my_type(data):
... return b'mytype', b(ub.hash_data(data.id))
>>> my_instance = MyType(1)
>>> ub.hash_data(my_instance)
"""
# ensure iterable
if not isinstance(hash_types, (list, tuple)):
hash_types = [hash_types]
def _decor_closure(hash_func):
for hash_type in hash_types:
self._hash_dispatch.register(hash_type)(hash_func)
return hash_func
return _decor_closure
def lookup(self, data):
"""
Returns an appropriate function to hash ``data`` if one has been
registered.
Args:
data (object): the object the user would like to hash
Returns:
Callable: a function that can hash the object
Raises:
TypeError : if data has no registered hash methods
Example:
>>> import ubelt as ub
>>> import pytest
>>> if not ub.modname_to_modpath('numpy'):
... raise pytest.skip('numpy is optional')
>>> self = ub.util_hash.HashableExtensions()
>>> self._register_numpy_extensions()
>>> self._register_builtin_class_extensions()
>>> import numpy as np
>>> data = np.array([1, 2, 3])
>>> self.lookup(data[0])
>>> class Foo(object):
>>> def __init__(f):
>>> f.attr = 1
>>> data = Foo()
>>> assert pytest.raises(TypeError, self.lookup, data)
>>> # If ub.hash_data does not support your object,
>>> # then you can register it.
>>> @self.register(Foo)
>>> def _hashfoo(data):
>>> return b'FOO', data.attr
>>> func = self.lookup(data)
>>> assert func(data)[1] == 1
>>> import uuid
>>> data = uuid.uuid4()
>>> self.lookup(data)
Example:
>>> # xdoctest: +REQUIRES(module:numpy)
>>> import numpy as np
>>> import ubelt as ub
>>> self = ub.util_hash.HashableExtensions()
>>> self._register_numpy_extensions()
>>> self._register_builtin_class_extensions()
>>> #f1 = self.lookup(3)
>>> data = np.array([1, 2, 3])
>>> f2 = self.lookup(data)
>>> print(f2(data))
>>> data = np.uint8(3)
>>> f3 = self.lookup(data)
>>> print(f3(data))
"""
# Evaluate the lazy queue if anything is in it
if self._lazy_queue: # nocover
# Added nocover, because a bugfix prevents this from running and it
# is unclear how to build a test in for this.
self._evaluate_lazy_queue()
query_hash_type = data.__class__
# TODO: recognize some special dunder method instead
# of strictly using this registry.
hash_func = self._hash_dispatch.dispatch(query_hash_type)
if getattr(hash_func, '__is_base__', False):
raise TypeError(
'No registered hash func for hashable type={!r}'.format(
query_hash_type))
return hash_func
def add_iterable_check(self, func):
"""
Registers a function that detects when a type is iterable
Args:
func (Callable):
Returns:
Callable
"""
self.iterable_checks.append(func)
return func
def _register_numpy_extensions(self):
"""
Registers custom functions to hash numpy data structures.
By default ubelt enables numpy extensions
"""
# system checks
import numpy as np
@self.add_iterable_check
def is_object_ndarray(data):
# ndarrays of objects cannot be hashed directly.
return isinstance(data, np.ndarray) and data.dtype.kind == 'O'
@self.register(np.ndarray)
def _convert_numpy_array(data):
"""
Example:
>>> import ubelt as ub
>>> if not ub.modname_to_modpath('numpy'):
... raise pytest.skip()
>>> import numpy as np
>>> data_f32 = np.zeros((3, 3, 3), dtype=np.float64)
>>> data_i64 = np.zeros((3, 3, 3), dtype=np.int64)
>>> data_i32 = np.zeros((3, 3, 3), dtype=np.int32)
>>> hash_f64 = _hashable_sequence(data_f32, types=True)
>>> hash_i64 = _hashable_sequence(data_i64, types=True)
>>> hash_i32 = _hashable_sequence(data_i64, types=True)
>>> assert hash_i64 != hash_f64
>>> assert hash_i64 != hash_i32
"""
if data.dtype.kind == 'O':
msg = 'directly hashing ndarrays with dtype=object is unstable'
raise TypeError(msg)
else:
# tobytes() views the array in 1D (via ravel())
# encode the shape as well
# See: [util_hash.Note.1]
header = b''.join(_hashable_sequence(
(len(data.shape), data.shape), extensions=self,
types=_COMPATIBLE_HASHABLE_SEQUENCE_TYPES_DEFAULT))
dtype = b''.join(_hashable_sequence(
data.dtype.descr, extensions=self,
types=_COMPATIBLE_HASHABLE_SEQUENCE_TYPES_DEFAULT))
hashable = header + dtype + data.tobytes()
prefix = b'NDARR'
return prefix, hashable
@self.register(np.random.RandomState)
def _convert_numpy_random_state(data):
"""
Example:
>>> import ubelt as ub
>>> if not ub.modname_to_modpath('numpy'):
... raise pytest.skip()
>>> import numpy as np
>>> rng = np.random.RandomState(0)
>>> _hashable_sequence(rng, types=True)
"""
# See: [util_hash.Note.1]
hashable = b''.join(_hashable_sequence(
data.get_state(), extensions=self,
types=_COMPATIBLE_HASHABLE_SEQUENCE_TYPES_DEFAULT))
prefix = b'RNG'
return prefix, hashable
def _register_builtin_class_extensions(self):
"""
Register hashing extensions for a selection of classes included in
python stdlib.
This registers extensions for the following types:
* uuid.UUID
* collections.OrderedDict
* dict (caveat: will be sorted, so must be sortable)
CommandLine:
xdoctest -m ubelt.util_hash HashableExtensions._register_builtin_class_extensions:0
xdoctest -m ubelt.util_hash HashableExtensions._register_builtin_class_extensions:1
Example:
>>> import uuid
>>> data = uuid.UUID('7e9d206b-dc02-4240-8bdb-fffe858121d0')
>>> print(hash_data(data, base='abc', hasher='sha512', types=True)[0:8])
cryarepd
>>> data = OrderedDict([('a', 1), ('b', 2), ('c', [1, 2, 3]),
>>> (4, OrderedDict())])
>>> print(hash_data(data, base='abc', hasher='sha512', types=True)[0:8])
qjspicvv
Example:
>>> # Ordered dictionaries are hashed differently that builtin dicts
>>> import ubelt as ub
>>> from collections import OrderedDict
>>> datas = {}
>>> datas['odict_data1'] = OrderedDict([
>>> ('4', OrderedDict()),
>>> ('a', 1),
>>> ('b', 2),
>>> ('c', [1, 2, 3]),
>>> ])
>>> datas['udict_data1'] = {
>>> '4': {},
>>> 'a': 1,
>>> 'b': 2,
>>> 'c': [1, 2, 3],
>>> }
>>> datas['odict_data2'] = ub.dict_subset(datas['odict_data1'], ['a', '4', 'c', 'b'])
>>> datas['udict_data2'] = ub.dict_isect(datas['udict_data1'], ['a', '4', 'c', 'b'])
>>> datas['odict_data3'] = ub.dict_subset(datas['odict_data1'], ['c', 'b', 'a', '4'])
>>> datas['udict_data3'] = ub.dict_isect(datas['udict_data1'], ['c', 'b', 'a', '4'])
>>> # print('datas = {}'.format(ub.urepr(datas, nl=-1)))
>>> for key, val in sorted(datas.items()):
>>> hashstr = ub.hash_data(val, base='abc', hasher='sha512', types=True)[0:8]
>>> print('{} = {}'.format(key, hashstr))
odict_data1 = omnqalbe
odict_data2 = tjrlsoel
odict_data3 = cycowefz
udict_data1 = bvshfmzm
udict_data2 = bvshfmzm
udict_data3 = bvshfmzm
Example:
>>> # Ordered dictionaries are hashed differently that builtin dicts
>>> import ubelt as ub
>>> print(ub.hash_data({1, 2, 3})[0:8])
>>> print(ub.hash_data({2, 3, 1})[0:8])
36fb38a1
36fb38a1
>>> # xdoctest: +REQUIRES(PY3):
>>> print(ub.hash_data({'2', 3, 1})[0:8])
>>> print(ub.hash_data({3, 1, '2'})[0:8])
742ae82d
742ae82d
Example:
>>> import ubelt as ub
>>> assert ub.hash_data(slice(None)).startswith('0178e55a247d09ad282dc2e44f5388f477')
Example:
>>> import ubelt as ub
>>> print(ub.hash_data(ub.Path('foo'))[0:8])
>>> print(ub.hash_data('foo')[0:8])
>>> print(ub.hash_data(ub.Path('foo'), types=True)[0:8])
>>> print(ub.hash_data('foo', types=True)[0:8])
f7fbba6e
f7fbba6e
cc21b9fa
bd1cabd0
"""
import uuid
import pathlib
import numbers
@self.register(numbers.Integral)
def _convert_numpy_int(data):
return _convert_to_hashable(int(data), extensions=self)
@self.register(numbers.Real)
def _convert_numpy_float(data):
return _convert_to_hashable(float(data), extensions=self)
@self.register(uuid.UUID)
def _convert_uuid(data):
hashable = data.bytes
prefix = b'UUID'
return prefix, hashable
@self.register(set)
def _convert_set(data):
try:
# what raises a TypeError differs between Python 2 and 3
ordered_ = sorted(data)
except TypeError:
from ubelt.util_list import argsort
data_ = list(data)
sortx = argsort(data_, key=str)
ordered_ = [data_[k] for k in sortx]
# See: [util_hash.Note.1]
hashable = b''.join(_hashable_sequence(
ordered_, extensions=self,
types=_COMPATIBLE_HASHABLE_SEQUENCE_TYPES_DEFAULT))
prefix = b'SET'
return prefix, hashable
@self.register(dict)
def _convert_dict(data):
try:
ordered_ = sorted(data.items())
# what raises a TypeError differs between Python 2 and 3
except TypeError:
from ubelt.util_list import argsort
sortx = argsort(data, key=str)
ordered_ = [(k, data[k]) for k in sortx]
# See: [util_hash.Note.1]
hashable = b''.join(_hashable_sequence(
ordered_, extensions=self,
types=_COMPATIBLE_HASHABLE_SEQUENCE_TYPES_DEFAULT))
prefix = b'DICT'
return prefix, hashable
@self.register(OrderedDict)
def _convert_ordered_dict(data):
"""
Currently ordered dictionaries are considered separately from
regular dictionaries. I'm not sure what the right thing to do is.
"""
# See: [util_hash.Note.1]
hashable = b''.join(_hashable_sequence(
list(data.items()), extensions=self,
types=_COMPATIBLE_HASHABLE_SEQUENCE_TYPES_DEFAULT))
prefix = b'ODICT'
return prefix, hashable
@self.register(slice)
def _convert_slice(data):
"""
Currently ordered dictionaries are considered separately from
regular dictionaries. I'm not sure what the right thing to do is.
"""
# See: [util_hash.Note.1]
hashable = b''.join(_hashable_sequence(
[data.start, data.stop, data.step], extensions=self,
types=_COMPATIBLE_HASHABLE_SEQUENCE_TYPES_DEFAULT))
prefix = b'SLICE'
return prefix, hashable
self.register(pathlib.Path)(lambda x: (b'PATH', str(x).encode('utf-8')))
# other data structures
def _register_agressive_extensions(self): # nocover
"""
Extensions that might be desired, but we do not enable them by default
This registers extensions for the following types:
* none right now *
"""
pass
def _register_torch_extensions(self): # nocover
"""
Experimental. Define a default hash function for torch tensors, but do
not use it by default. Currently, the user must call this explicitly.
"""
import torch
@self.register(torch.Tensor)
def _convert_torch_tensor(data):
data_ = data.data.cpu().numpy()
prefix = b'TORCH_TENSOR'
return prefix, _convert_to_hashable(data_, extensions=self)[1]
_HASHABLE_EXTENSIONS = HashableExtensions()
def _lazy_init():
"""
Delay the registration of any external libraries until a hashable extension
is needed.
"""
try:
_HASHABLE_EXTENSIONS._register_builtin_class_extensions()
_HASHABLE_EXTENSIONS._register_numpy_extensions()
except ImportError: # nocover
pass
_HASHABLE_EXTENSIONS._lazy_queue.append(_lazy_init)
class _HashTracer(object):
"""
Helper class to extract hashed sequences
Attributes:
sequence (List[bytes]):
"""
def __init__(self):
self.sequence = [] # type: List[bytes]
def update(self, item):
"""
Args:
item (bytes):
"""
self.sequence.append(item)
def hexdigest(self):
"""
Returns:
bytes
"""
return b''.join(self.sequence)
def _hashable_sequence(data, types=False, extensions=None):
r"""
Extracts the sequence of bytes that would be hashed by hash_data
Example:
>>> data = [2, (3, 4)]
>>> result1 = (b''.join(_hashable_sequence(data, types=False)))
>>> result2 = (b''.join(_hashable_sequence(data, types=True)))
>>> assert result1 == b'_[_\x02_,__[_\x03_,_\x04_,__]__]_'
>>> assert result2 == b'_[_INT\x02_,__[_INT\x03_,_INT\x04_,__]__]_'
"""
hasher = _HashTracer()
_update_hasher(hasher, data, types=types, extensions=extensions)
return hasher.sequence
def _convert_to_hashable(data, types=True, extensions=None):
r"""
Converts ``data`` into a hashable byte representation if an appropriate
hashing function is known.
Args:
data (object): ordered data with structure
types (bool): include type prefixes in the hash
Returns:
Tuple[bytes, bytes]: prefix, hashable:
a prefix hinting the original data type and the byte representation
of ``data``.
Raises:
TypeError : if data has no registered hash methods
Example:
>>> from ubelt.util_hash import _convert_to_hashable
>>> assert _convert_to_hashable(None) == (b'NULL', b'NONE')
>>> assert _convert_to_hashable('string') == (b'TXT', b'string')
>>> assert _convert_to_hashable(1) == (b'INT', b'\x01')
>>> assert _convert_to_hashable(1.0) == (b'FLT', b'\x01/\x01')
>>> assert _convert_to_hashable(int(1)) == (b'INT', b'\x01')
>>> import uuid
>>> data = uuid.UUID('7e9d206b-dc02-4240-8bdb-fffe858121d0')
>>> assert _convert_to_hashable(data) == (b'UUID', b'~\x9d k\xdc\x02B@\x8b\xdb\xff\xfe\x85\x81!\xd0')
>>> # Test special floats
>>> assert _convert_to_hashable(float('nan')) == (b'FLT', b'nan')
>>> assert _convert_to_hashable(float('inf')) == (b'FLT', b'inf')
>>> assert _convert_to_hashable(-float('inf')) == (b'FLT', b'-inf')
>>> assert _convert_to_hashable(-0.) == (b'FLT', b'\x00/\x01')
>>> assert _convert_to_hashable(+0.) == (b'FLT', b'\x00/\x01')
"""
# HANDLE MOST COMMON TYPES FIRST
if data is None:
hashable = b'NONE'
prefix = b'NULL'
elif isinstance(data, bytes):
hashable = data
prefix = b'TXT'
elif isinstance(data, str):
# convert unicode into bytes
hashable = data.encode('utf-8')
prefix = b'TXT'
elif isinstance(data, int):
# warnings.warn('Hashing ints is slow, numpy is preferred')
hashable = _int_to_bytes(data)
# hashable = data.to_bytes(8, byteorder='big')
prefix = b'INT'
elif isinstance(data, float):
data_ = float(data) # convert to a base-float
try:
a, b = data_.as_integer_ratio()
except (ValueError, OverflowError):
hashable = str(data_).encode('utf-8') # handle and nan, inf
else:
hashable = _int_to_bytes(a) + b'/' + _int_to_bytes(b)
prefix = b'FLT'
else:
if extensions is None:
extensions = _HASHABLE_EXTENSIONS
# Then dynamically look up any other type
hash_func = extensions.lookup(data)
prefix, hashable = hash_func(data)
if types:
return prefix, hashable
else:
return b'', hashable
# TODO: convert to an iterative variant?
# See ~/code/ubelt/dev/bench/bench_hash_impls.py
_SEP = b'_,_'
_ITER_PREFIX = b'_[_'
_ITER_SUFFIX = b'_]_'
def _update_hasher(hasher, data, types=True, extensions=None):
"""
Converts ``data`` into a byte representation and calls update on the hasher
:class:`hashlib._hashlib.HASH` algorithm.
Args:
hasher (Hasher): instance of a hashlib algorithm
data (object): ordered data with structure
types (bool): include type prefixes in the hash
extensions (HashableExtensions | None): overrides global extensions
Example:
>>> hasher = hashlib.sha512()
>>> data = [1, 2, ['a', 2, 'c']]
>>> _update_hasher(hasher, data)
>>> print(hasher.hexdigest()[0:8])
e2c67675
"""
if extensions is None:
extensions = _HASHABLE_EXTENSIONS
# bugfix: ensure the lazy registration queue is evaluated before running
# the iterable checks.
if extensions._lazy_queue:
extensions._evaluate_lazy_queue()
# Determine if the data should be hashed directly or iterated through
if isinstance(data, (tuple, list, zip)):
needs_iteration = True
else:
needs_iteration = any(check(data) for check in
extensions.iterable_checks)
if needs_iteration:
# Denote that we are hashing over an iterable
# Multiple structure bytes make it harder to accidentally introduce
# conflicts, but this is not perfect.
# SEP = b'_,_'
# ITER_PREFIX = b'_[_'
# ITER_SUFFIX = b'_]_'
iter_ = iter(data)
hasher.update(_ITER_PREFIX)
# first, try to nest quickly without recursive calls
# (this works if all data in the sequence is a non-iterable)
try:
for item in iter_:
prefix, hashable = _convert_to_hashable(item, types,
extensions=extensions)
binary_data = prefix + hashable + _SEP
hasher.update(binary_data)
hasher.update(_ITER_SUFFIX)
except TypeError:
# need to use recursive calls
# Update based on current item
_update_hasher(hasher, item, types, extensions=extensions)
# !>> WHOOPS: THIS IS A BUG. THERE SHOULD BE A
# !>> hasher.update(_SEP)
# !>> SEPERATOR HERE.
# !>> BUT FIXING IT WILL BREAK BACKWARDS COMPAT.
# !>> We will need to expose versions of the hasher that can be
# configured, and ideally new versions will have speed improvments.
for item in iter_:
# Ensure the items have a spacer between them
_update_hasher(hasher, item, types, extensions=extensions)
hasher.update(_SEP)
hasher.update(_ITER_SUFFIX)
else:
prefix, hashable = _convert_to_hashable(data, types,
extensions=extensions)
binary_data = prefix + hashable
hasher.update(binary_data)
def _convert_hexstr_base(hexstr, base):
r"""
Packs a long hexstr into a shorter length string with a larger base.
Args:
hexstr (str): string of hexadecimal symbols to convert
base (list): symbols of the conversion base
Example:
>>> print(_convert_hexstr_base('ffffffff', _ALPHABET_26))
nxmrlxv
>>> print(_convert_hexstr_base('0', _ALPHABET_26))
0
>>> print(_convert_hexstr_base('-ffffffff', _ALPHABET_26))
-nxmrlxv
>>> print(_convert_hexstr_base('aafffff1', _ALPHABET_16))
aafffff1
Sympy:
>>> import sympy as sy
>>> # Determine the length savings with lossless conversion
>>> consts = dict(hexbase=16, hexlen=256, baselen=27)
>>> symbols = sy.symbols('hexbase, hexlen, baselen, newlen')
>>> haexbase, hexlen, baselen, newlen = symbols
>>> eqn = sy.Eq(16 ** hexlen, baselen ** newlen)
>>> newlen_ans = sy.solve(eqn, newlen)[0].subs(consts).evalf()
>>> print('newlen_ans = %r' % (newlen_ans,))
>>> # for a 26 char base we can get 216
>>> print('Required length for lossless conversion len2 = %r' % (len2,))
>>> def info(base, len):
>>> bits = base ** len
>>> print('base = %r' % (base,))
>>> print('len = %r' % (len,))
>>> print('bits = %r' % (bits,))
>>> info(16, 256)
>>> info(27, 16)
>>> info(27, 64)
>>> info(27, 216)
"""
if base is _ALPHABET_16:
# already in hex, no conversion needed
return hexstr
baselen = len(base)
if 1:
# NOTE: This code has an incompatability with standard base encodings
# because it does not pad the bytes.
# In general for an input of M bytes, we need to use N = log(256 **
# M)/log(B) symbols in base B to represent it.
# This is not always an integer, so RFC encodings use paddings, but
# we don't do that here.
# TODO: we can probably do this faster if we implement the logic in
# a similar way to base64, but for now this is fine.
x = int(hexstr, 16) # first convert to an integer in base 16
if x == 0:
return '0' # bug: should be base[0]
sign = 1 if x > 0 else -1
x *= sign
digits = []
while x:
digits.append(base[x % baselen])
x //= baselen
if sign < 0:
digits.append('-')
digits.reverse()
newbase_str = ''.join(digits)
return newbase_str
def _digest_hasher(hasher, base):
""" counterpart to _update_hasher """
# Get a 128 character hex string
hex_text = hasher.hexdigest()
# Shorten length of string (by increasing base)
base_text = _convert_hexstr_base(hex_text, base)
# Truncate
text = base_text
return text
# @profile
[docs]
def hash_data(data, hasher=NoParam, base=NoParam, types=False, convert=False,
extensions=None):
"""
Get a unique hash depending on the state of the data.
Args:
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 :py:obj:`hashlib.algorithms_guaranteed`
(e.g. 'sha1', 'sha512', 'md5') as well as 'xxh32' and 'xxh64' if
:mod:`xxhash` 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 :class:`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:
str: text representing the hashed data
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 setting ``base='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
"""
if convert and not isinstance(data, str): # nocover
import json
try:
data = json.dumps(data)
except TypeError:
# import warnings
# warnings.warn('Unable to encode input as json due to: {!r}'.format(ex))
pass
base = _rectify_base(base)
hasher = _rectify_hasher(hasher)()
# Feed the data into the hasher
_update_hasher(hasher, data, types=types, extensions=extensions)
# Get the hashed representation
text = _digest_hasher(hasher, base)
return text
[docs]
def hash_file(fpath, blocksize=1048576, stride=1, maxbytes=None,
hasher=NoParam, base=NoParam):
r"""
Hashes the data in a file on disk.
The results of this function agree with standard hashing programs (e.g.
sha1sum, sha512sum, md5sum, etc...)
Args:
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 :py:obj:`hashlib.algorithms_guaranteed`
(e.g. 'sha1', 'sha512', 'md5') as well as 'xxh32' and 'xxh64' if
:mod:`xxhash` 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'.
Returns:
str: the hash text
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)
Ignore:
# Our hashdata with base32 should be compatible with the standard
# (note: in general depending on the base it isn't because I think a padding issue)
text = 'foobar2'
std_result = ub.cmd(f'printf "{text}" | sha1sum', shell=True)['out'].split(' ')[0]
our_result = ub.hash_data(text, hasher='sha1', types=False)
print(f'std_result={std_result}')
print(f'our_result={our_result}')
assert our_result == std_result
std_result = ub.cmd(fr'printf "{text}" | sha1sum | cut -f1 -d\ | xxd -r -p | base32', shell=True)['out'].split()[0]
our_result = ub.hash_data(text, hasher='sha1', base=32)
print(f'std_result={std_result}')
print(f'our_result={our_result}')
assert our_result == std_result
"""
# TODO: add logic such that you can update an existing hasher
base = _rectify_base(base)
hasher = _rectify_hasher(hasher)()
with open(fpath, 'rb') as file:
buf = file.read(blocksize)
# We separate implementations for speed. Haven't benchmarked, but the
# idea is to keep the inner loop extremely tight
if maxbytes is None:
if stride > 1:
# skip blocks when stride is greater than 1
while len(buf) > 0:
hasher.update(buf)
file.seek(blocksize * (stride - 1), 1)
buf = file.read(blocksize)
else:
# otherwise hash the entire file
while len(buf) > 0:
hasher.update(buf)
buf = file.read(blocksize)
else:
# In this case we hash at most ``maxbytes``
maxremain = maxbytes
if stride > 1:
while len(buf) > 0 and maxremain > 0:
buf = buf[:maxremain]
maxremain -= len(buf)
hasher.update(buf)
if maxremain > 0:
file.seek(blocksize * (stride - 1), 1)
buf = file.read(blocksize)
else:
while len(buf) > 0 and maxremain > 0:
buf = buf[:maxremain]
maxremain -= len(buf)
hasher.update(buf)
if maxremain > 0:
buf = file.read(blocksize)
# Get the hashed representation
text = _digest_hasher(hasher, base)
return text
# Give the hash_data function itself a reference to the default extensions
# register method so the user can modify them without accessing this module
hash_data.extensions = _HASHABLE_EXTENSIONS
hash_data.register = _HASHABLE_EXTENSIONS.register
# class Hasher:
# """
# TODO
# """
# def __init__(self, hasher):
# ...
# hash_data = ...
# hash_file = ...