public bool TryGetScriptParagraph(int paragraphIndex, out ScriptParagraph *scriptParagraph)
{
// Handle wrap-around at 32bits by thrashing all tokens.
LruEntry *firstEntry = (LruEntry *)buffer.GetPointer();
LruEntry *endEntry = firstEntry + buffer.Count;
if (nextToken == int.MaxValue)
{
nextToken = 0;
for (LruEntry *currentEntry = firstEntry; currentEntry != endEntry; currentEntry++)
{
currentEntry->Token = nextToken++;
}
}
// Search for a matching paragraph and return it if found.
// Make note of least recently used entry just in case.
LruEntry *lruEntry = null;
int lruToken = int.MaxValue;
for (LruEntry *currentEntry = firstEntry; currentEntry != endEntry; currentEntry++)
{
if (currentEntry->ParagraphIndex == paragraphIndex)
{
currentEntry->Token = nextToken++;
scriptParagraph = ¤tEntry->Paragraph;
return(true);
}
int token = currentEntry->Token;
if (token < lruToken)
{
lruToken = token;
lruEntry = currentEntry;
}
}
// Decide whether to allocate a new entry from remaining capacity or replace the least-recently used one.
LruEntry *entryToReplace;
if (buffer.Count != buffer.Capacity)
{
entryToReplace = endEntry;
entryToReplace->Paragraph.Initialize();
buffer.Count += 1;
}
else
{
entryToReplace = lruEntry;
}
// Return the entry.
entryToReplace->Token = nextToken++;
entryToReplace->ParagraphIndex = paragraphIndex;
scriptParagraph = &entryToReplace->Paragraph;
return(false);
}
private void FreeBuffer()
{
LruEntry *first = (LruEntry *)buffer.GetPointer();
LruEntry *end = first + buffer.Count;
for (LruEntry *current = first; current != end; current++)
{
current->Paragraph.Free();
}
buffer.Clear();
}
public void RemoveScriptParagraphsStartingFrom(int paragraphIndex)
{
if (paragraphIndex <= 0)
{
Clear();
}
else
{
LruEntry *firstEntry = (LruEntry *)buffer.GetPointer();
LruEntry *endEntry = firstEntry + buffer.Count;
for (LruEntry *currentEntry = firstEntry; currentEntry != endEntry; currentEntry++)
{
if (currentEntry->ParagraphIndex >= paragraphIndex)
{
currentEntry->ParagraphIndex = -1;
currentEntry->Token = 0;
}
}
}
}