Next | Query returned 8 messages, browsing 1 to 10 | previous

History of commit frequency

CVS Commit History:


   2024-01-20 17:04:03 by Thomas Klausner | Files touched by this commit (1)
Log message:
py-tlsh: not for Python 2
   2024-01-14 21:08:33 by Amitai Schleier | Files touched by this commit (1)
Log message:
Add distinfo, missed in previous.
   2024-01-14 21:08:04 by Amitai Schleier | Files touched by this commit (1) | Package updated
Log message:
py-tlsh: update to 4.7.2. Changes:

4.7.2:
This Python module supercedes the python-tlsh package on PyPi.
The improvements in 4.7.2, are that we added additional functions to Python
* lvalue
* q1ratio
* q2ratio
* checksum
* bucket_value
* is_valid

4.5.0:
* fixed this package so that it works on Windows
* compatibility with VirusTotal adoption of TLSH: updated to the T1 hash
  format with backwards compatibility for old hashes
* fixed the q3=0 divide by zero bug [issue 79]

pkgsrc changes:
- Switch to PyPi upstream
   2022-01-19 18:50:48 by Thomas Klausner | Files touched by this commit (25)
Log message:
*: fix for python 3.x
   2022-01-14 18:52:07 by Thomas Klausner | Files touched by this commit (146)
Log message:
*: python2 egg files are back, add them to the PLISTs
   2022-01-10 19:56:36 by Thomas Klausner | Files touched by this commit (2)
Log message:
py-tlsh: convert to egg.mk
   2015-12-11 14:46:26 by Thomas Klausner | Files touched by this commit (3)
Log message:
Update {,py-}tlsh to 3.4.4.

Specify Tlsh::getHash() as a const method
   2015-12-02 18:22:57 by Thomas Klausner | Files touched by this commit (4)
Log message:
Import py34-tlsh-3.4.3 as devel/py-tlsh.

TLSH is a fuzzy matching library. Given a byte stream with a minimum
length of 256 bytes (and a minimum amount of randomness - see note
in Python extension below), TLSH generates a hash value which can
be used for similarity comparisons.  Similar objects will have
similar hash values which allows for the detection of similar
objects by comparing their hash values.  Note that the byte stream
should have a sufficient amount of complexity.  For example, a byte
stream of identical bytes will not generate a hash value.

Next | Query returned 8 messages, browsing 1 to 10 | previous