d42aa48236
git-svn-id: file:///srv/devel/repo-conversion/nusu@282 d2e56fa2-650e-0410-a79f-9358c0239efd
87 lines
2.9 KiB
C#
87 lines
2.9 KiB
C#
#region CPL License
|
|
/*
|
|
Nuclex Framework
|
|
Copyright (C) 2002-2013 Nuclex Development Labs
|
|
|
|
This library is free software; you can redistribute it and/or
|
|
modify it under the terms of the IBM Common Public License as
|
|
published by the IBM Corporation; either version 1.0 of the
|
|
License, or (at your option) any later version.
|
|
|
|
This library is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
IBM Common Public License for more details.
|
|
|
|
You should have received a copy of the IBM Common Public
|
|
License along with this library
|
|
*/
|
|
#endregion
|
|
|
|
using System;
|
|
using System.Collections.Generic;
|
|
using System.Collections;
|
|
|
|
namespace Nuclex.Support.Collections {
|
|
|
|
partial class Deque<TItem> {
|
|
|
|
/// <summary>
|
|
/// Determines the index of the first occurence of the specified item in the deque
|
|
/// </summary>
|
|
/// <param name="item">Item that will be located in the deque</param>
|
|
/// <returns>The index of the item or -1 if it wasn't found</returns>
|
|
public int IndexOf(TItem item) {
|
|
if(this.blocks.Count == 1) { // Only one block to scan?
|
|
int length = this.lastBlockEndIndex - this.firstBlockStartIndex;
|
|
int index = Array.IndexOf<TItem>(
|
|
this.blocks[0], item, this.firstBlockStartIndex, length
|
|
);
|
|
|
|
// If we found something, we need to adjust its index so the first item in
|
|
// the deque always appears at index 0 to the user
|
|
if(index != -1) {
|
|
return (index - this.firstBlockStartIndex);
|
|
} else {
|
|
return -1;
|
|
}
|
|
} else { // At least two blocks exist
|
|
|
|
// Scan the first block for the item and if found, return the index
|
|
int length = this.blockSize - this.firstBlockStartIndex;
|
|
int index = Array.IndexOf<TItem>(
|
|
this.blocks[0], item, this.firstBlockStartIndex, length
|
|
);
|
|
|
|
// If we found something, we need to adjust its index
|
|
if(index != -1) {
|
|
return (index - this.firstBlockStartIndex);
|
|
}
|
|
|
|
int lastBlock = this.blocks.Count - 1;
|
|
for(int tempIndex = 1; tempIndex < lastBlock; ++tempIndex) {
|
|
index = Array.IndexOf<TItem>(
|
|
this.blocks[tempIndex], item, 0, this.blockSize
|
|
);
|
|
if(index != -1) {
|
|
return (index - this.firstBlockStartIndex + tempIndex * this.blockSize);
|
|
}
|
|
}
|
|
|
|
// Nothing found, continue the search in the
|
|
index = Array.IndexOf<TItem>(
|
|
this.blocks[lastBlock], item, 0, this.lastBlockEndIndex
|
|
);
|
|
if(index == -1) {
|
|
return -1;
|
|
} else {
|
|
return (index - this.firstBlockStartIndex + lastBlock * this.blockSize);
|
|
}
|
|
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
} // namespace Nuclex.Support.Collections
|