本文整理汇总了C#中LinkedList.IndexOf方法的典型用法代码示例。如果您正苦于以下问题：C# LinkedList.IndexOf方法的具体用法？C# LinkedList.IndexOf怎么用？C# LinkedList.IndexOf使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类LinkedList的用法示例。
在下文中一共展示了LinkedList.IndexOf方法的13个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: GetPosition
public override int GetPosition(LinkedList<MixedToken> tokens)
{
// Do not create negate syntax token if we are able to create a subtract syntax token
var lastNegateNode = tokens.FindLastNode(t => t.Value.IsLexicToken &&
t.Value.LexicToken is SubtractToken && (t.Previous != null && !t.Previous.Value.IsTree || t.Previous == null));
return tokens.IndexOf(lastNegateNode);
}示例2: IndexOfElementInEmptyListTest
public void IndexOfElementInEmptyListTest()
{
LinkedList<int> list = new LinkedList<int>();
int index = list.IndexOf(0);
Assert.AreEqual(-1, index);
}示例3: IndexOfFirstAndOnlyElementTest
public void IndexOfFirstAndOnlyElementTest()
{
LinkedList<int> list = new LinkedList<int>();
list.Add(0);
int index = list.IndexOf(0);
Assert.AreEqual(0, index);
}示例4: IndexOfFirstElementOfMultipleTest
public void IndexOfFirstElementOfMultipleTest()
{
LinkedList<int> list = new LinkedList<int>();
list.Add(0);
list.Add(15);
list.Add(1);
int index = list.IndexOf(0);
Assert.AreEqual(0, index);
}示例5: IndexOfElementFromDuplicatesTest
public void IndexOfElementFromDuplicatesTest()
{
LinkedList<int> list = new LinkedList<int>();
list.Add(15);
list.Add(1);
list.Add(0);
list.Add(0);
list.Add(1);
list.Add(0);
list.Add(144);
int index = list.IndexOf(0);
Assert.AreEqual(2, index);
}示例6: Main
public static void Main()
{
// Create LinkedList and test its methods
ListItem<int> lastElement = new ListItem<int>(5);
LinkedList<int> linkedList = new LinkedList<int>(lastElement);
ListItem<int> middleElement = new ListItem<int>(2);
linkedList.Add(middleElement);
ListItem<int> firstElement = new ListItem<int>(-3);
linkedList.Add(firstElement);
bool contains = linkedList.Contains(firstElement);
linkedList.Remove(middleElement);
int index = linkedList.IndexOf(lastElement);
int count = linkedList.Count();
ListItem<int> element = linkedList[index];
bool isSame = lastElement == element;
}示例7: Main
static void Main()
{
string decorationLine = new string('-', Console.WindowWidth);
Console.Write(decorationLine);
Console.WriteLine("***Presenting the functionality of the data structure 'Linked List'***");
Console.Write(decorationLine);
LinkedList<string> names = new LinkedList<string>();
Console.WriteLine("---Add operation---");
names.Add("Pesho");
names.Add("Gosho");
names.Add("Lili");
names.Add("Marin");
names.Add("Elena");
Console.WriteLine("Elements count after adding: " + names.Count);
Console.WriteLine();
Console.WriteLine("---Iterator functionality---");
PrintPeopleOnConsole(names);
Console.WriteLine();
Console.WriteLine("---Remove by value operation---");
names.Remove("Marin");
Console.WriteLine("Linked list after removal: ");
PrintPeopleOnConsole(names);
Console.WriteLine();
Console.WriteLine("---Remove by index operation---");
names.RemoveAt(1);
Console.WriteLine("Linked list after removal: ");
PrintPeopleOnConsole(names);
Console.WriteLine();
Console.WriteLine("---IndexOf operation---");
Console.WriteLine(names.IndexOf("Elena"));
Console.WriteLine();
Console.WriteLine("---Clear operation---");
names.Clear();
Console.WriteLine("Elements count after clearing: " + names.Count);
}示例8: GetPosition
public override int GetPosition(LinkedList<MixedToken> tokens) {
var node = tokens.FindFirst(t => t.IsLexicToken && t.LexicToken is ParameterToken);
return tokens.IndexOf(node);
}示例9: GetPosition
public override int GetPosition(LinkedList<MixedToken> tokens) {
var leftBracket = tokens.FindLast(t => t.IsLexicToken && t.LexicToken is LeftBracketToken);
return tokens.IndexOf(leftBracket);
}示例10: GetPosition
public override int GetPosition(LinkedList<MixedToken> tokens)
{
var funcNode = tokens.FindLast(t => t.IsLexicToken && t.LexicToken is FunctionCallToken);
return tokens.IndexOf(funcNode);
}示例11: ExecuteCommand
private static void ExecuteCommand(LinkedList<int> numbers, int numOne, int numTwo, string command)
{
if (numbers.Count == 0)
{
numbers.AddLast(numTwo);
}
if (!numbers.Contains(numTwo))
{
bool isAdded = false;
for (int i = 0; i < numbers.Count; i++)
{
var temp = numbers.ElementAt(i);
if (temp > numTwo)
{
LinkedListNode<int> node = numbers.Find(temp);
numbers.AddBefore(node, numTwo);
isAdded = true;
break;
}
}
if (!isAdded)
{
numbers.AddLast(numTwo);
}
}
if (numbers.Contains(numOne))
{
return;
}
LinkedListNode<int> current = numbers.Find(numTwo);
if (command == "before")
{
bool isAdded = false;
for (int i = 0; i < numbers.IndexOf(numTwo); i++)
{
var temp = numbers.ElementAt(i);
if (temp > numOne)
{
LinkedListNode<int> node = numbers.Find(temp);
numbers.AddBefore(node, numOne);
isAdded = true;
break;
}
}
if (!isAdded)
{
numbers.AddBefore(current, numOne);
}
}
else
{
bool isAdded = false;
for (int i = numbers.IndexOf(numTwo) + 1; i < numbers.Count - 1; i++)
{
var temp = numbers.ElementAt(i);
if (temp > numOne)
{
LinkedListNode<int> node = numbers.Find(temp);
numbers.AddBefore(node, numOne);
isAdded = true;
break;
}
}
if (!isAdded)
{
numbers.AddLast(numOne);
}
}
}示例12: TestIndexOfInvalidElement
public void TestIndexOfInvalidElement()
{
int number = 12;
LinkedList<int> list = new LinkedList<int>();
list.AddElement(1);
list.AddElement(10);
list.AddElement(100);
Assert.AreEqual(-1, list.IndexOf(number));
}示例13: TestIndexOfNullElement
public void TestIndexOfNullElement()
{
LinkedList<string> list = new LinkedList<string>();
list.AddElement("sample string");
list.IndexOf(null);
}