for (int i = 0; i < _size; i++)
{
- if (match!(_items[i]))
+ if (match(_items[i]))
{
return _items[i];
}
int endIndex = startIndex + count;
for (int i = startIndex; i < endIndex; i++)
{
- if (match!(_items[i])) return i;
+ if (match(_items[i])) return i;
}
return -1;
}
for (int i = _size - 1; i >= 0; i--)
{
- if (match!(_items[i]))
+ if (match(_items[i]))
{
return _items[i];
}
{
break;
}
- action!(_items[i]);
+ action(_items[i]);
}
if (version != _version)
while (current < _size)
{
// Find the first item which needs to be kept.
- while (current < _size && match!(_items[current])) current++;
+ while (current < _size && match(_items[current])) current++;
if (current < _size)
{
for (int i = 0; i < _size; i++)
{
- if (!match!(_items[i]))
+ if (!match(_items[i]))
{
return false;
}