Re: Is there an easy way to scan for bits? -- MI400

Subject: Re: [MI400] Is there an easy way to scan for bits?
From: "Bob Donovan" <rjd@xxxxxxxxxx>
Date: Thu, 20 Dec 2001 20:57:05 -0600
Importance: Normal
List-archive: <http://archive.midrange.com/mi400/>
List-help: <mailto:mi400-request@midrange.com?subject=help>
List-id: MI Programming on the AS400 / iSeries <mi400.midrange.com>
List-post: <mailto:mi400@midrange.com>
List-subscribe: <http://lists.midrange.com/cgi-bin/listinfo/mi400>,<mailto:mi400-request@midrange.com?subject=subscribe>
List-unsubscribe: <http://lists.midrange.com/cgi-bin/listinfo/mi400>,<mailto:mi400-request@midrange.com?subject=unsubscribe>
Sensitivity:

I like Leif's binary tree approach.  Another name for the data structure he
described is a trie.

Bit twiddling in a HLL (like C) might be a "bit" faster than MI.   If you
go with C or C++, you should be able to find plenty of online examples.

Bob Donovan/Rochester/IBM
rjd@us.ibm.com

As an Amazon Associate we earn from qualifying purchases.

Follow-Ups:

Re: Is there an easy way to scan for bits? , Steve Richter

This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].

Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.