C routine detects single high bits
Sometimes, one needs to be able to verify the existence of just one high bit in a word. This ability can be useful, for example, to verify whether just one bit in a mask of mutually exclusive flags is set or if an incongruence exists in a word representing a set of input contacts. A listing is prese...
Saved in:
Published in | EDN p. 74 |
---|---|
Main Author | |
Format | Magazine Article |
Language | English |
Published |
Cambridge
AspenCore
17.02.1997
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Sometimes, one needs to be able to verify the existence of just one high bit in a word. This ability can be useful, for example, to verify whether just one bit in a mask of mutually exclusive flags is set or if an incongruence exists in a word representing a set of input contacts. A listing is presented that shows a C routine for the verification function. |
---|---|
ISSN: | 0012-7515 2163-4084 |