public virtual void Test()
{
int ITERS;
// LUCENENET specific: NUnit will crash with an OOM if we do the full test
// with verbosity enabled. So, decreasing the number of iterations by 1/2
// to keep it from crashing.
if (Verbose)
{
ITERS = AtLeast(500);
}
else
{
ITERS = AtLeast(1000);
}
var buffer = new RollingCharBuffer();
var random = LuceneTestCase.Random;
for (var iter = 0; iter < ITERS; iter++)
{
var stringLen = random.NextBoolean() ? random.Next(50) : random.Next(20000);
string s;
if (stringLen == 0)
{
s = "";
}
else
{
s = TestUtil.RandomUnicodeString(random, stringLen);
}
if (Verbose)
{
Console.WriteLine("\nTEST: iter=" + iter + " s.length()=" + s.Length);
}
buffer.Reset(new StringReader(s));
var nextRead = 0;
var availCount = 0;
while (nextRead < s.Length)
{
if (Verbose)
{
Console.WriteLine(" cycle nextRead=" + nextRead + " avail=" + availCount);
}
if (availCount == 0 || random.NextBoolean())
{
// Read next char
if (Verbose)
{
Console.WriteLine(" new char");
}
assertEquals(s[nextRead], buffer.Get(nextRead));
nextRead++;
availCount++;
}
else if (random.NextBoolean())
{
// Read previous char
var pos = TestUtil.NextInt32(random, nextRead - availCount, nextRead - 1);
if (Verbose)
{
Console.WriteLine(" old char pos=" + pos);
}
assertEquals(s[pos], buffer.Get(pos));
}
else
{
// Read slice
int length;
if (availCount == 1)
{
length = 1;
}
else
{
length = TestUtil.NextInt32(random, 1, availCount);
}
int start;
if (length == availCount)
{
start = nextRead - availCount;
}
else
{
start = nextRead - availCount + random.Next(availCount - length);
}
if (Verbose)
{
Console.WriteLine(" slice start=" + start + " length=" + length);
}
assertEquals(s.Substring(start, length), new string(buffer.Get(start, length)));
}
if (availCount > 0 && random.Next(20) == 17)
{
var toFree = random.Next(availCount);
if (Verbose)
{
Console.WriteLine(" free " + toFree + " (avail=" + (availCount - toFree) + ")");
}
buffer.FreeBefore(nextRead - (availCount - toFree));
availCount -= toFree;
}
}
}
}
public virtual void Test()
{
var ITERS = AtLeast(1000);
var buffer = new RollingCharBuffer();
var random = Random();
for (var iter = 0; iter < ITERS; iter++)
{
var stringLen = random.NextBoolean() ? random.Next(50) : random.Next(20000);
string s;
if (stringLen == 0)
{
s = "";
}
else
{
s = TestUtil.RandomUnicodeString(random, stringLen);
}
if (VERBOSE)
{
Console.WriteLine("\nTEST: iter=" + iter + " s.length()=" + s.Length);
}
buffer.Reset(new StringReader(s));
var nextRead = 0;
var availCount = 0;
while (nextRead < s.Length)
{
if (VERBOSE)
{
Console.WriteLine(" cycle nextRead=" + nextRead + " avail=" + availCount);
}
if (availCount == 0 || random.NextBoolean())
{
// Read next char
if (VERBOSE)
{
Console.WriteLine(" new char");
}
assertEquals(s[nextRead], buffer.Get(nextRead));
nextRead++;
availCount++;
}
else if (random.NextBoolean())
{
// Read previous char
var pos = TestUtil.NextInt(random, nextRead - availCount, nextRead - 1);
if (VERBOSE)
{
Console.WriteLine(" old char pos=" + pos);
}
assertEquals(s[pos], buffer.Get(pos));
}
else
{
// Read slice
int length;
if (availCount == 1)
{
length = 1;
}
else
{
length = TestUtil.NextInt(random, 1, availCount);
}
int start;
if (length == availCount)
{
start = nextRead - availCount;
}
else
{
start = nextRead - availCount + random.Next(availCount - length);
}
if (VERBOSE)
{
Console.WriteLine(" slice start=" + start + " length=" + length);
}
assertEquals(s.Substring(start, length), new string(buffer.Get(start, length)));
}
if (availCount > 0 && random.Next(20) == 17)
{
var toFree = random.Next(availCount);
if (VERBOSE)
{
Console.WriteLine(" free " + toFree + " (avail=" + (availCount - toFree) + ")");
}
buffer.FreeBefore(nextRead - (availCount - toFree));
availCount -= toFree;
}
}
}
}
public virtual void Test()
{
var ITERS = AtLeast(1000);
var buffer = new RollingCharBuffer();
var random = Random();
for (var iter = 0; iter < ITERS; iter++)
{
var stringLen = random.NextBoolean() ? random.Next(50) : random.Next(20000);
string s;
if (stringLen == 0)
{
s = "";
}
else
{
s = TestUtil.RandomUnicodeString(random, stringLen);
}
if (VERBOSE)
{
Console.WriteLine("\nTEST: iter=" + iter + " s.length()=" + s.Length);
}
buffer.Reset(new StringReader(s));
var nextRead = 0;
var availCount = 0;
while (nextRead < s.Length)
{
if (VERBOSE)
{
Console.WriteLine(" cycle nextRead=" + nextRead + " avail=" + availCount);
}
if (availCount == 0 || random.NextBoolean())
{
// Read next char
if (VERBOSE)
{
Console.WriteLine(" new char");
}
assertEquals(s[nextRead], buffer.Get(nextRead));
nextRead++;
availCount++;
}
else if (random.NextBoolean())
{
// Read previous char
var pos = TestUtil.NextInt(random, nextRead - availCount, nextRead - 1);
if (VERBOSE)
{
Console.WriteLine(" old char pos=" + pos);
}
assertEquals(s[pos], buffer.Get(pos));
}
else
{
// Read slice
int length;
if (availCount == 1)
{
length = 1;
}
else
{
length = TestUtil.NextInt(random, 1, availCount);
}
int start;
if (length == availCount)
{
start = nextRead - availCount;
}
else
{
start = nextRead - availCount + random.Next(availCount - length);
}
if (VERBOSE)
{
Console.WriteLine(" slice start=" + start + " length=" + length);
}
assertEquals(s.Substring(start, length), new string(buffer.Get(start, length)));
}
if (availCount > 0 && random.Next(20) == 17)
{
var toFree = random.Next(availCount);
if (VERBOSE)
{
Console.WriteLine(" free " + toFree + " (avail=" + (availCount - toFree) + ")");
}
buffer.FreeBefore(nextRead - (availCount - toFree));
availCount -= toFree;
}
}
}
}