Skip to main content

A per-character diff/compression algorithm in python

Project description

Clashgap

Version Downloads PRs Welcome Code Quality Tests Status Build Status Docs Status

A per-character diff/compression algorithm implementation in python

How it works

In case if you have two strings:

"This is a sentence..." and "This is a word..."

you could "clash" both of them together and find their gap, to get an array loking something like:

["This is a", ["sentence", "word"], "..."]

As you can the clashgap algorithm looks for collisions in the two strings to find the gap. The clashgaped string maybe used for compression or as the diff of the input strings

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

clashgap-1.0.0.tar.gz (3.2 kB view hashes)

Uploaded source

Built Distribution

clashgap-1.0.0-py3-none-any.whl (3.8 kB view hashes)

Uploaded py3

Supported by

AWS AWS Cloud computing Datadog Datadog Monitoring Facebook / Instagram Facebook / Instagram PSF Sponsor Fastly Fastly CDN Google Google Object Storage and Download Analytics Huawei Huawei PSF Sponsor Microsoft Microsoft PSF Sponsor NVIDIA NVIDIA PSF Sponsor Pingdom Pingdom Monitoring Salesforce Salesforce PSF Sponsor Sentry Sentry Error logging StatusPage StatusPage Status page