diff options
| author | Nick Lewycky <nicholas@mxc.ca> | 2007-07-14 17:41:03 +0000 |
|---|---|---|
| committer | Nick Lewycky <nicholas@mxc.ca> | 2007-07-14 17:41:03 +0000 |
| commit | 28753f8df2921fa9e9d60717c2078c826ea82bb4 (patch) | |
| tree | de4c89c8a789d92e7b22e34d7026d64b2491aa09 /include/llvm/Support/ConstantRange.h | |
| parent | 6d4b711e7f2e27d94d3c49dc9e7575dbe0f242e0 (diff) | |
Clarify the language. Pointed out by Duncan Sands.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@39857 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include/llvm/Support/ConstantRange.h')
| -rw-r--r-- | include/llvm/Support/ConstantRange.h | 7 |
1 files changed, 5 insertions, 2 deletions
diff --git a/include/llvm/Support/ConstantRange.h b/include/llvm/Support/ConstantRange.h index 00c525ebf3..778827c0e0 100644 --- a/include/llvm/Support/ConstantRange.h +++ b/include/llvm/Support/ConstantRange.h @@ -145,8 +145,11 @@ class ConstantRange { /// maximalIntersectWith - Return the range that results from the intersection /// of this range with another range. The resultant range is guaranteed to - /// include all elements contained in both input ranges, and is also - /// guaranteed to be the smallest possible set that does so. + /// include all elements contained in both input ranges, and to have the + /// 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; /// unionWith - Return the range that results from the union of this range |