The hardware and bandwidth for this mirror is donated by dogado GmbH, the Webhosting and Full Service-Cloud Provider. Check out our Wordpress Tutorial.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]dogado.de.
Pairwise Hamming distances are computed between the rows of a binary (0/1) matrix using highly optimized C code. The input is an integer matrix where each row represents a binary feature vector and returns a symmetric integer matrix of pairwise distances. Internally, rows are bit-packed into 64-bit words for fast XOR-based comparisons, with hardware-accelerated popcount operations to count differences. OpenMP parallelization ensures efficient performance for large matrices.
| Version: | 1.1 |
| Depends: | R (≥ 4.0.0) |
| Published: | 2025-04-25 |
| DOI: | 10.32614/CRAN.package.FastHamming |
| Author: | Ravi Varadhan [aut, cre] |
| Maintainer: | Ravi Varadhan <ravi.varadhan at jhu.edu> |
| License: | GPL-3 |
| NeedsCompilation: | yes |
| SystemRequirements: | C compiler (C99), OpenMP |
| CRAN checks: | FastHamming results [issues need fixing before 2025-05-09] |
| Reference manual: | FastHamming.pdf |
| Package source: | FastHamming_1.1.tar.gz |
| Windows binaries: | r-devel: not available, r-release: FastHamming_1.1.zip, r-oldrel: FastHamming_1.1.zip |
| macOS binaries: | r-release (arm64): FastHamming_1.1.tgz, r-oldrel (arm64): FastHamming_1.1.tgz, r-release (x86_64): FastHamming_1.1.tgz, r-oldrel (x86_64): FastHamming_1.1.tgz |
Please use the canonical form https://CRAN.R-project.org/package=FastHamming to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.
Health stats visible at Monitor.