On Sat, Jul 31, 2010 at 1:36 AM, Don Higgins <[email protected]> wrote:
> A new problem #22 - Code fastest instruction sequence to count bits in an > arbitrary string of bytes using currently available z/Architecture > instructions prior to new instruction coming with z196 which is estimated > to be 5 times faster. I've been wondering about the type of algorithms that this instruction was meant for. I know of some cases where you're interested in "any ones" but OC would do that. Or is emphasis on "string" as null-terminated sequence of bytes? But counting bits in a text string does not make much sense either... | Rob
