mirror of
https://github.com/juce-framework/JUCE.git
synced 2026-02-02 03:20:06 +00:00
Minor code modernisations.
This commit is contained in:
parent
f3b46c9a2f
commit
b2e5ef2bd6
17 changed files with 104 additions and 96 deletions
|
|
@ -460,7 +460,7 @@ void EdgeTable::intersectWithEdgeTableLine (const int y, const int* otherLine) t
|
|||
|
||||
int destIndex = 0, destTotal = 0;
|
||||
int level1 = 0, level2 = 0;
|
||||
int lastX = INT_MIN, lastLevel = 0;
|
||||
int lastX = std::numeric_limits<int>::min(), lastLevel = 0;
|
||||
|
||||
while (srcNum1 > 0 && srcNum2 > 0)
|
||||
{
|
||||
|
|
@ -535,7 +535,7 @@ void EdgeTable::intersectWithEdgeTableLine (const int y, const int* otherLine) t
|
|||
dest[0] = destTotal;
|
||||
|
||||
#if JUCE_DEBUG
|
||||
int last = INT_MIN;
|
||||
int last = std::numeric_limits<int>::min();
|
||||
for (int i = 0; i < dest[0]; ++i)
|
||||
{
|
||||
jassert (dest[i * 2 + 1] > last);
|
||||
|
|
@ -640,7 +640,10 @@ void EdgeTable::excludeRectangle (const Rectangle& r) throw()
|
|||
|
||||
//XXX optimise here by shortening the table if it fills top or bottom
|
||||
|
||||
const int rectLine[] = { 4, INT_MIN, 255, clipped.getX() << 8, 0, clipped.getRight() << 8, 255, INT_MAX, 0 };
|
||||
const int rectLine[] = { 4, std::numeric_limits<int>::min(), 255,
|
||||
clipped.getX() << 8, 0,
|
||||
clipped.getRight() << 8, 255,
|
||||
std::numeric_limits<int>::max(), 0 };
|
||||
|
||||
for (int i = top; i < bottom; ++i)
|
||||
intersectWithEdgeTableLine (i, rectLine);
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue