本文整理汇总了C#中LinkedList.FindLast方法的典型用法代码示例。如果您正苦于以下问题：C# LinkedList.FindLast方法的具体用法？C# LinkedList.FindLast怎么用？C# LinkedList.FindLast使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类LinkedList的用法示例。
在下文中一共展示了LinkedList.FindLast方法的9个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: GenericTest5
public static bool GenericTest5()
{
var list = new LinkedList<int>();
list.AddLast(30);
list.AddLast(10);
list.AddLast(30);
list.AddLast(20);
list.AddLast(30);
return list.FindLast(30) == list.Last;
}示例2: Read
public override AST Read(LinkedList<MixedToken> tokens, Grammar grammar) {
var leftBracket = tokens.FindLast(t => t.IsLexicToken && t.LexicToken is LeftBracketToken);
if (leftBracket != null) {
var rightBracket = tokens.FindFirst(leftBracket, t => t.IsLexicToken && t.LexicToken is RightBracketToken);
if (rightBracket == null)
throw new ParserException("Unmatched left bracket.");
var subList = leftBracket.GetSubList(rightBracket);
var result = grammar.CreateAST(subList);
tokens.AddBefore(leftBracket, new MixedToken(result));
leftBracket.RemoveSubList(rightBracket);
return result;
}
return null;
}示例3: Read
public override Tree<SyntaxToken> Read(LinkedList<MixedToken> tokens, Grammar grammar) {
var funcNode = tokens.FindLast(t => t.IsLexicToken && t.LexicToken is FunctionCallToken);
if (funcNode != null) {
FunctionCallToken funcCallToken = (FunctionCallToken)funcNode.Value.LexicToken;
var next = funcNode.Next;
if (next != null) {
var nextValue = next.Value;
if (nextValue.IsTree) {
UnaryStaticFunctionSyntaxToken token = new UnaryStaticFunctionSyntaxToken(funcCallToken.Method);
Tree<SyntaxToken> tree = new Tree<SyntaxToken>(token);
tree.Leafs.Add(next.Value.Tree);
tokens.AddBefore(funcNode, new MixedToken(tree));
tokens.Remove(funcNode);
tokens.Remove(next);
return tree;
}
}
}
return null;
}示例4: GenericTest6
public static bool GenericTest6()
{
var list = new LinkedList<int>();
list.Add(30);
list.Add(10);
list.Add(30);
list.Add(20);
list.Add(30);
return list.FindLast(30) != list.First;
}示例5: LinkedList
private static void LinkedList()
{
string[] words = { "the", "fox", "jumped", "over", "the", "dog" };
LinkedList<string> sentence = new LinkedList<string>(words);
// add
sentence.AddFirst("today");
sentence.AddLast("mark1");
// find
LinkedListNode<string> current = sentence.FindLast("the");
current = sentence.Find("fox");
sentence.AddAfter(current, "old");
sentence.AddBefore(current, "mark1");
//same for remove
// access previous , next
LinkedListNode<string> nodeP = current.Previous;
LinkedListNode<string> nodeN = current.Next;
// count
int size = sentence.Count;
}示例6: GetPosition
public override int GetPosition(LinkedList<MixedToken> tokens) {
var leftBracket = tokens.FindLast(t => t.IsLexicToken && t.LexicToken is LeftBracketToken);
return tokens.IndexOf(leftBracket);
}示例7: GetPosition
public override int GetPosition(LinkedList<MixedToken> tokens)
{
var funcNode = tokens.FindLast(t => t.IsLexicToken && t.LexicToken is FunctionCallToken);
return tokens.IndexOf(funcNode);
}示例8: TestFindLast
public void TestFindLast()
{
LinkedList<string> list = new LinkedList<string>();
var actual = list.Find("john");
Assert.AreEqual(null, actual);
var item = list.AddFirst("john");
actual = list.Find("john");
Assert.AreEqual(actual, item);
var item1 = list.AddFirst("Steven");
var item2 = list.AddFirst("Steven");
var item3 = list.AddFirst("Steven");
var item4 = list.AddFirst("Steven");
actual = list.FindLast("Steven");
Assert.AreEqual(item1, actual);
}示例9: ReplaceInQueue
private void ReplaceInQueue(LinkedList<Element>/*IList<Element>*/ queue, Element @out, Element @in)
{
var n = queue.FindLast(@out);
Validate.IsTrue(n != null);
queue.AddAfter(n, @in);
queue.Remove(n);
}