hamming 0.1.3

Count ones, fast (aka popcount, hamming weight). This provides a performant popcount and bitwise hamming distance for a slice of bytes.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12

# `hamming`

[![Build Status](https://travis-ci.org/huonw/hamming.png)](https://travis-ci.org/huonw/hamming) [![Coverage Status](https://coveralls.io/repos/huonw/hamming/badge.svg?branch=master)](https://coveralls.io/r/huonw/hamming?branch=master)

A crate to compute the
[Hamming weight](https://en.wikipedia.org/wiki/Hamming_weight) of a
vector and the
[Hamming distance](https://en.wikipedia.org/wiki/Hamming_distance)
between two efficiently.

[Documentation](http://huonw.github.io/hamming/hamming),
[crates.io](https://crates.io/crates/hamming).