ID: 12
Type: feature
Title: simplify testing.fixtures.mock_pkg
Status: done
Priority: high
Created: 2025-06-21
Description: Only bootstrap a package mock with the minimum requirements for a
Python module and let the consumer handle the directory layout.
being more explicit about what the fixture provides as an output, instead of
solely describing the site effects.
Also the consumer is now responsible for the module directory layout.
ID: 11
Type: bugfix
Title: move testing utils out of utils
Status: in-progres
Priority: high
Created: 2025-06-20
Description: to shorten the namespace and also indicate that testing utilities
are different from regular utilities
ID: 6
Type: feature
Title: implement importlib.resources handler for urllib
Status: done
Priority: high
Created: 2025-06-20
Description: A handler that can be registered with an urllib.request
OpenerDirector to open importlib.resources package files.
ID: 10
Type: feature
Title: pytest current test context fixtures
Status: done
Priority: high
Created: 2025-06-20
Description: add fixtures for doing things in relation to the active testing
context
ID: 9
Type: bugfix
Title: fix LICENSE reference
Status: done
Priority: high
Created: 2025-06-20
Description: license specification is no longer a trove classifier in
pyproject.toml, hence the reference to LICENSE must be changed
ID: 8
Type: bugfix
Title: rename package
Status: done
Priority: high
Created: 2025-06-20
Description: use dot namespaces to make the package a little more elegant
pytest compared to built-in unittest does not discover test suites based on a
directory being marked as a module, instead matching against the basename of a
file to determine whether it is a test suite or not.
I don't have a real use for KMP at the moment. I'm putting it on hold but
leaning towards cancelling the feature completely as I'm not trying to create a
collection of algorithms... My utilities should only contain what I really
need...
ID: 4
Type: feature
Title: implement Rabin-Karp rolling hash algorithm
Status: done
Priority: high
Created: 2025-05-05
Description: After testing a couple of string search algorithms, I've ditched
the idea of using KMP as my use-case gives no advantage compared to
naive searching. In addition I've came upon the challenge that many
string search algorithms are optimized for search on a linear
buffer, which in my case is not applicable as the implementation
the search algorithm is for uses a circular buffer. Rabin-Karp
seemed promising. I've come up with a different approach though,
which is still based on rolling hashes, therefore, as a base, I
need an implementation of the original Rabin-Karp rolling hash
algorithm
