https://bugs.kde.org/show_bug.cgi?id=381326
--- Comment #9 from John Reiser <jrei...@bitwagon.com> --- (In reply to John Reiser from comment #8) > The underlying principle is that it can be useful to view "a bit is > initialized" as equivalent to "the cardinality of the set of possible values > is 1, not 2." Expanding: if 'a' is initialized and 'x' is not, then > > It also applies to <, <=, >=, > when there are enough Valid bits that are > contiguous with the MostSignificantBit, and the operands satisfy the > relation when restricted to those contiguous bits. -- You are receiving this mail because: You are watching all bug changes.
