https://github.com/hagemt/bloom
A simple efficient program that uses libcalg to find duplicates.
https://github.com/hagemt/bloom
Last synced: 4 months ago
JSON representation
A simple efficient program that uses libcalg to find duplicates.
- Host: GitHub
- URL: https://github.com/hagemt/bloom
- Owner: hagemt
- Created: 2012-06-07T08:46:38.000Z (about 13 years ago)
- Default Branch: master
- Last Pushed: 2013-04-01T12:47:20.000Z (over 12 years ago)
- Last Synced: 2025-01-17T06:45:38.601Z (6 months ago)
- Language: C
- Size: 172 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 2
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
bloom
=====
A simple efficient program that uses libcalg to find duplicates.
You can either use CMake or make; this project supports both.
In the future, I will probably remove support for the later.
Working on a monitoring deamon that uses libnotify.
libraries
=========
bloom plans to leverage:
* tclap (for argument parsing)
* c-algorithms (for data structures)
* libcrypt (for computing file hashes)
* syslog (for reporting and monitoring)
* gdbm (for persistence of file information)
* zlib (for compression of various data)