From: Todd Broch tbr...@chromium.org
Previous algorithm was a bit conservative and complicating with
respect to identifying key ghosting. This CL uses the bitops hamming
weight function (hweight8) to count the number of matching rows for
colM colN. If that number is 1 ghosting is present.
Am 28.07.2014 14:19, schrieb Javier Martinez Canillas:
From: Todd Broch tbr...@chromium.org
Previous algorithm was a bit conservative and complicating with
respect to identifying key ghosting. This CL uses the bitops hamming
weight function (hweight8) to count the number of matching rows
From: Todd Broch tbr...@chromium.org
Previous algorithm was a bit conservative and complicating with
respect to identifying key ghosting. This CL uses the bitops hamming
weight function (hweight8) to count the number of matching rows for
colM colN. If that number is 1 ghosting is present.