1
0
Fork 0
mirror of https://github.com/juce-framework/JUCE.git synced 2026-01-10 23:44:24 +00:00

Purged some warnings.

This commit is contained in:
jules 2012-04-10 10:29:14 +01:00
parent 991388d2c3
commit 1f95f54089
79 changed files with 380 additions and 352 deletions

View file

@ -25,7 +25,7 @@
namespace PrimesHelpers
{
void createSmallSieve (const int numBits, BigInteger& result)
static void createSmallSieve (const int numBits, BigInteger& result)
{
result.setBit (numBits);
result.clearBit (numBits); // to enlarge the array
@ -43,8 +43,8 @@ namespace PrimesHelpers
while (n <= (numBits >> 1));
}
void bigSieve (const BigInteger& base, const int numBits, BigInteger& result,
const BigInteger& smallSieve, const int smallSieveSize)
static void bigSieve (const BigInteger& base, const int numBits, BigInteger& result,
const BigInteger& smallSieve, const int smallSieveSize)
{
jassert (! base[0]); // must be even!
@ -81,8 +81,8 @@ namespace PrimesHelpers
while (index < smallSieveSize);
}
bool findCandidate (const BigInteger& base, const BigInteger& sieve,
const int numBits, BigInteger& result, const int certainty)
static bool findCandidate (const BigInteger& base, const BigInteger& sieve,
const int numBits, BigInteger& result, const int certainty)
{
for (int i = 0; i < numBits; ++i)
{
@ -98,7 +98,7 @@ namespace PrimesHelpers
return false;
}
bool passesMillerRabin (const BigInteger& n, int iterations)
static bool passesMillerRabin (const BigInteger& n, int iterations)
{
const BigInteger one (1), two (2);
const BigInteger nMinusOne (n - one);

View file

@ -123,7 +123,7 @@ public:
uint8 buffer [64];
const int bytesRead = input.read (buffer, (int) jmin (numBytesToRead, (int64) sizeof (buffer)));
if (bytesRead < sizeof (buffer))
if (bytesRead < (int) sizeof (buffer))
{
processFinalBlock (buffer, (unsigned int) bytesRead);
break;