A Dart BK-Tree implementation for efficient nearest neighbor searches using Hamming distance, optimized for bulk file hash processing and duplicate detection.
[email protected] low health (38/100) — consider alternatives
Get this data programmatically — free, no authentication.
curl https://depscope.dev/api/check/pub/bk_treeLast updated · 2025-05-29T14:27:09.400879Z