bk_tree 0.1.1 
bk_tree: ^0.1.1 copied to clipboard
A Dart BK-Tree implementation for efficient nearest neighbor searches using Hamming distance, optimized for bulk file hash processing and duplicate detection.
0.1.1 #
- Infrastructure
- Configured GitHub Actions workflow
- Added BSD-3-Clause license verification
- Integrated lints package for code analysis
0.1.0 #
- Initial implementation of BK-Tree data structure with:
- Node-based tree construction (
BKTreeNode) - Configurable distance metric support
- Nearest neighbor search with tolerance
- Bulk insertion of hash values
- Verbose logging capabilities
- Node-based tree construction (
- Core features:
- Efficient Hamming distance comparisons
- Parent-child node relationships
- Testable internal structure exposure
- Thread-safe candidate management
Metadata
2
likes
160
points
42
downloads
Publisher
unverified uploader
Weekly Downloads
Metadata
A Dart BK-Tree implementation for efficient nearest neighbor searches using Hamming distance, optimized for bulk file hash processing and duplicate detection.
Repository (GitHub)
View/report issues
Topics
Documentation
License
BSD-3-Clause (license)
