Member Junction
    Preparing search index...
    • Hamming distance (number of differing bits, 0–64) between two hex dHash strings. Returns 64 (maximally different) if either hash is empty or the lengths differ, so an unusable hash never registers as "similar".

      Parameters

      • a: string
      • b: string

      Returns number