class_docstr: Compute the Hamming distance between the two or more sequences.
  The Hamming distance is the number of differing items in ordered sequences.
  
  https://en.wikipedia.org/wiki/Hamming_distance
class_docstr_tok: ["Compute","the","Hamming","distance","between","the","two","or","more","sequences",".","The","Hamming","distance","is","the","number","of","differing","items","in","ordered","sequences",".","https",":","\/\/en.wikipedia.org\/wiki\/Hamming_distance"]
code: def __init__(
      self,
      qval: int = 1,
      test_func: TestFunc | None = None,
      truncate: bool = False,
      external: bool = True,
  ) -> None:
      self.qval = qval
      self.test_func = test_func or self._ident
      self.truncate = truncate
      self.external = external
  
imports: from __future__ import annotations
  from collections import defaultdict
  from itertools import zip_longest
  from typing import Any, Sequence, TypeVar
  from .base import Base, BaseSimilarity
  from .types import SimFunc, TestFunc
label_desc: Use image node_id 1 to create a new Hamming object from inherited base classes: _Base with example: obj = Hamming(qval, test_func, truncate, external)