C# LinkedList.Find方法代码示例

        static void Main(string[] args)
        {
            //creates a linked list
            LinkedList<string> linked1 = new LinkedList<string>();

            //appending three elements to the list
            linked1.AddLast("One");
            linked1.AddLast("Two");
            linked1.AddLast("Three");
            linked1.AddFirst("Zero");
            PrintLinked1(linked1);

            Console.WriteLine();
            //insterting a node between element "Two" and "Three"
            LinkedListNode<string> myNode = linked1.Find("Three");
            linked1.AddBefore(myNode, "Inserted using add before.");
            PrintLinked1(linked1);

            //removing one element
            linked1.Remove("One");
            PrintLinked1(linked1);

            //remove Three using myNode
            myNode = linked1.Find("Three");
            linked1.Remove(myNode);
            PrintLinked1(linked1);
        }

		public void SwapBlocks(LinkedList<Block> leftBlockList, Block leftBlock, LinkedList<Block> rightBlockList, Block rightBlock)
		{
			leftBlockList.AddBefore(leftBlockList.Find(leftBlock), rightBlock);
			leftBlockList.Remove(leftBlockList.Find(leftBlock));

			rightBlockList.AddBefore(rightBlockList.Find(rightBlock), leftBlock);
			rightBlockList.Remove(rightBlock);
		}

        static void Main(string[] args)
        {
            LinkedList<string> sporcular = new LinkedList<string>();
            sporcular.AddLast("A");
            sporcular.AddLast("B");
            sporcular.AddLast("C");
            sporcular.AddLast("D");
            sporcular.AddLast("E");
            sporcular.AddLast("F");
            sporcular.AddLast("G");
            sporcular.AddLast("H");

            sporcular.Remove("H");
            sporcular.AddFirst("H");

            sporcular.Remove("E");
            sporcular.AddFirst("E");

            sporcular.AddAfter(sporcular.First, "X");

            LinkedListNode<string> c =
                sporcular.Find("C");

            sporcular.AddBefore(c, "Y");

            foreach (string item in sporcular)
            {
                Console.WriteLine(item);
            }
        }

        public static void Main(string[] args)
        {
            /* Creating a Simple Linked List */

            LinkedList<Object> MyLinkedList = new LinkedList<Object>();

            /* Inserting Elements */

            MyLinkedList.AddLast ("Add");
            MyLinkedList.AddLast(4);

            /* Implementing Find */

            MyLinkedList.AddAfter(MyLinkedList.Find("Add"), 'a');

            /* Printing Elements of the List */

            PrintList (MyLinkedList);

            /* Remove a particular element from the List */

            MyLinkedList.Remove (4);

            PrintList (MyLinkedList);

            /* Printing the Count of the List */

            int linkedListCount = MyLinkedList.Count;

            Console.WriteLine (linkedListCount);
        }

 static void Main(string[] args)
 {
     LinkedListNode<string> node = new
     LinkedListNode<string>("KARTHIK");
     LinkedList<string> names = new LinkedList<string>();
     names.AddFirst(node);
     LinkedListNode<string> node1 = new
     LinkedListNode<string>
     ("ANIL");
     names.AddAfter(node, node1);
     LinkedListNode<string> node2 = new
     LinkedListNode<string>
     ("SUMAN");
     names.AddAfter(node1, node2);
     LinkedListNode<string> node3 = new LinkedListNode
     <string>(null);
     LinkedListNode<string> aNode = names.First;
     while (aNode != null)
     {
         Console.WriteLine(aNode.Value);
         aNode = aNode.Next;
     }
     aNode = names.Find("David");
     if (aNode != null) aNode = names.First;
     while (aNode != null)
     {
         Console.WriteLine(aNode.Value);
         aNode = aNode.Next;
     }
     Console.Read();
 }

        /// <summary>
        /// 获取某个角色的所有直接下级角色，形成链表返回
        /// </summary>
        /// <param name="roleName"></param>
        /// <returns></returns>
        public static LinkedList<string> Get_Direct_Child_Roles(string roleName)
        {
            LinkedList<string> LinkRole = new LinkedList<string>();

            OleDbConnection oleDB = new OleDbConnection(@"Provider=Microsoft.ACE.OLEDB.12.0;Data Source=dac.accdb");
            oleDB.Open();
            OleDbCommand cmd = new OleDbCommand();
            cmd.Connection = oleDB;
            cmd.CommandText = "select *  from  [角色关系信息表] where 父角色名称=" + "'" + roleName.ToLower() + "'";//查找账号是否已经被注册
            OleDbDataReader dr = cmd.ExecuteReader();
            if (dr.HasRows)
            {
                while (dr.Read())
                {
                    if (string.Equals(dr["子角色名称"], "(null)") == false)//存在子级角色
                    {
                        if (LinkRole.Find(dr["子角色名称"].ToString()) == null)//当前链表总不存在该名称时才查找
                        {
                            LinkedListNode<string> L = new LinkedListNode<string>(dr["子角色名称"].ToString());//将父级角色添加到链表的第一个位置
                            LinkRole.AddLast(L);
                        }

                    }

                }
            }

            dr.Close();
            oleDB.Close();
            return LinkRole;
        }

 [TestMethod] //Поиск не существующего элемента
 public void FindNotExistItemTest()
 {
     LinkedList<object> data = new LinkedList<object>();
     data.Append(8);
     data.Append(4);
     data.Find(11);
 }

 [TestMethod] // Поиск существующего элемента
 public void FindItemTest()
 {
     LinkedList<object> data = new LinkedList<object>();
     data.Append(6);
     data.Append(10);
     data.Find(10);
 }

    // Implement the data structure linked list. 
    public static void Main()
    {
        var linkedList = new LinkedList<string>();

        linkedList.AddFirst("first");
        linkedList.AddLast("second");
        Console.WriteLine(string.Join(", ", linkedList));

        linkedList.Clear();
        linkedList.AddLast("second");
        linkedList.AddFirst("first");
        Console.WriteLine(string.Join(", ", linkedList));

        string value = "first";
        Console.WriteLine("List contains \"{0}\": {1}", value, linkedList.Contains(value));

        Console.WriteLine("List contains {0} item(s)", linkedList.Count);

        var item = linkedList.Find("second");
        Console.WriteLine(item);

        linkedList.Remove("first");
        Console.WriteLine(string.Join(", ", linkedList));

        linkedList.Remove("second");
        Console.WriteLine("List contains {0} item(s): {1}", linkedList.Count, string.Join(", ", linkedList));

        linkedList.AddFirst("second");
        linkedList.AddFirst("first");
        linkedList.AddLast("third");
        Console.WriteLine(string.Join(", ", linkedList));

        linkedList.Remove("second");
        Console.WriteLine(string.Join(", ", linkedList));
    }

        public void ExploreLinkedLists()
        {
            // a LinkedList is a doubly linked list
            var linkedList = new LinkedList<string>();
            linkedList.AddFirst("1");
            // first argument accepts a "LinkedListNode"
            linkedList.AddAfter(linkedList.First, "2");
            linkedList.AddLast("3");
            linkedList.AddAfter(linkedList.Find("2"), "4");

            var orderedArray = linkedList.ToArray();
            // order should be 1,2,4,3
            Assert.That(orderedArray[0], Is.EqualTo("1"));
            Assert.That(orderedArray[1], Is.EqualTo("2"));
            Assert.That(orderedArray[2], Is.EqualTo("4"));
            Assert.That(orderedArray[3], Is.EqualTo("3"));

            // advantages:
            //  insertion is really easy

            // disadvantages:
            // looping through the objects is harder because they arent saved on contigous memory blocks

            // most of the time it is best NOT to use linked lists
            // essentially they are only good for insert/remove in the middle of lists
            // LinkedList<T> does NOT implement IList<T> - so does not have alot of useful methods
            // List<T> is much faster for random access (because backed by Array)
            // SEE: https://stackoverflow.com/questions/169973/when-should-i-use-a-list-vs-a-linkedlist
        }

        static void Main(string[] args)
        {
            List<int> list = new List<int>
            {
                3,2,
            }; // 3, 2

            list.Add(5); // 3, 2, 5
            list.Add(6); // 3, 2, 5, 6
            list.Remove(5); // 3, 2, 6

            Queue<int> queue = new Queue<int>();
            queue.Enqueue(3);// 3
            queue.Enqueue(8);// 3, 8
            queue.Dequeue(); // 8

            Stack<int> stack = new Stack<int>();
            stack.Push(2); // 2
            stack.Push(7); // 7, 2
            stack.Push(8); // 8, 7, 2
            stack.Pop();   // 7, 2

            foreach (var i in stack)
            {
                Console.WriteLine(i);
            }

            LinkedList<int> linkedList = new LinkedList<int>();
            linkedList.AddFirst(9); // 9
            linkedList.AddAfter(linkedList.Find(9), 5); // 9, 5
            linkedList.Remove(9); // 5

            Console.Read();
        }

    public override bool Move(LinkedList<MainTrack> route, List<MainTrack> usedTracks)
    {
        if (route.Find(this) == null)
        {
            return false;
        }

        if(!IsDown){

               Link1.Value.Place(route.Find(this).Previous.Value.Contains);
                route.Find(this).Previous.Value.Contains = null;
                usedTracks.Remove(route.Find(this).Previous.Value);
                usedTracks.Add(Link1.Value);
                return true;

        }
        else if(IsDown){

                Link2.Value.Place(route.Find(this).Previous.Value.Contains);
                route.Find(this).Previous.Value.Contains = null;
                usedTracks.Remove(route.Find(this).Previous.Value);
                usedTracks.Add(Link2.Value);
                return true;

        }
        return false;
    }

 public void Find()
 {
     var IntLinkedList = new LinkedList<int>();
     for (int i = 0; i < 5; i++)
     {
         IntLinkedList.AddLast(new ListItem<int>(i));
     }
     Assert.AreEqual(IntLinkedList.Find(2), 2);
 }

        public static void Main(string[] args)
        {
            LinkedList<object> linkedList = new LinkedList<object> ();
            linkedList.AddFirst (1);
            linkedList.AddAfter (linkedList.Find(1),2);
            linkedList.AddLast ("Bye");
            linkedList.AddBefore (linkedList.Find(1),3.55);

            Console.WriteLine ("The Elements are: ");

            PrintElements (linkedList);
            Console.WriteLine ("No. of items in list: {0}",linkedList.Count);

            linkedList.Remove (1);
            Console.WriteLine ("The Elements after removing are: ");
            PrintElements (linkedList);
            Console.WriteLine ("No. of items in list after removing: {0}",linkedList.Count);
        }

        public static bool GenericTest4()
        {
            var list = new LinkedList<int>();

            list.AddLast(10);
            list.AddLast(20);
            list.AddLast(30);

            return list.First.Value == 10 && list.Last.Value == 30 && list.Find(20).Value == 20;
        }