RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-04-10 18:11:26 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Clarify the language. Pointed out by Duncan Sands.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@39857 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Nick Lewycky 2007-07-14 17:41:03 +00:00
parent 6d4b711e7f
commit 28753f8df2
2 changed files with 9 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
include/llvm/Support/ConstantRange.h
View File

@ -145,8 +145,11 @@ class ConstantRange {
/// maximalIntersectWith - Return the range that results from the intersection /// maximalIntersectWith - Return the range that results from the intersection
/// of this range with another range. The resultant range is guaranteed to /// of this range with another range. The resultant range is guaranteed to
/// include all elements contained in both input ranges, and is also /// include all elements contained in both input ranges, and to have the
/// guaranteed to be the smallest possible set that does so. /// smallest possible set size that does so. Because there may be two
/// intersections with the same set size, A.maximalIntersectWith(B) might not
/// be equal to B.maximalIntersectWith(A).
///
ConstantRange maximalIntersectWith(const ConstantRange &CR) const; ConstantRange maximalIntersectWith(const ConstantRange &CR) const;
/// unionWith - Return the range that results from the union of this range /// unionWith - Return the range that results from the union of this range

6
lib/Support/ConstantRange.cpp
View File

@ -248,8 +248,10 @@ ConstantRange ConstantRange::intersectWith(const ConstantRange &CR) const {
/// maximalIntersectWith - Return the range that results from the intersection /// maximalIntersectWith - Return the range that results from the intersection
/// of this range with another range. The resultant range is guaranteed to /// of this range with another range. The resultant range is guaranteed to
/// include all elements contained in both input ranges, and is also guaranteed /// include all elements contained in both input ranges, and to have the
/// to be the smallest possible set that does so. /// smallest possible set size that does so. Because there may be two
/// intersections with the same set size, A.maximalIntersectWith(B) might not
/// be equal to B.maximalIntersect(A).
ConstantRange ConstantRange::maximalIntersectWith(const ConstantRange &CR) const { ConstantRange ConstantRange::maximalIntersectWith(const ConstantRange &CR) const {
assert(getBitWidth() == CR.getBitWidth() && assert(getBitWidth() == CR.getBitWidth() &&
"ConstantRange types don't agree!"); "ConstantRange types don't agree!");