当前位置: 首页>>代码示例>>C#>>正文


C# LinkedList.Back方法代码示例

本文整理汇总了C#中LinkedList.Back方法的典型用法代码示例。如果您正苦于以下问题:C# LinkedList.Back方法的具体用法?C# LinkedList.Back怎么用?C# LinkedList.Back使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在LinkedList的用法示例。


在下文中一共展示了LinkedList.Back方法的6个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C#代码示例。

示例1: StringsMustBePushedToTheBack

            public void StringsMustBePushedToTheBack()
            {

                LinkedList<string> sut = new LinkedList<string>();

                sut.PushBack("1");
                Assert.Equal("1", sut.Back());

                sut.PushBack("2");
                Assert.Equal("2", sut.Back());

                sut.PushBack("3");
                Assert.Equal("3", sut.Back());

            }
开发者ID:RobbieBrandrick,项目名称:AlgorithmsAndCollectionsInDotNet,代码行数:15,代码来源:LinkedListTests.cs

示例2: IntsMustBePushedToTheBack

            public void IntsMustBePushedToTheBack()
            {

                LinkedList<int> sut = new LinkedList<int>();

                sut.PushBack(1);
                Assert.Equal(1, sut.Back());

                sut.PushBack(2);
                Assert.Equal(2, sut.Back());

                sut.PushBack(3);
                Assert.Equal(3, sut.Back());

            }
开发者ID:RobbieBrandrick,项目名称:AlgorithmsAndCollectionsInDotNet,代码行数:15,代码来源:LinkedListTests.cs

示例3: MustRemoveFromFront

            public void MustRemoveFromFront()
            {

                LinkedList<int> sut = new LinkedList<int>();

                sut.PushBack(1);
                Assert.Equal(1, sut.Back());
                Assert.Equal(1, sut.Front());
                Assert.Equal(1, sut.Count);

                sut.PushFront(2);
                Assert.Equal(1, sut.Back());
                Assert.Equal(2, sut.Front());
                Assert.Equal(2, sut.Count);

                sut.PushBack(3);
                Assert.Equal(3, sut.Back());
                Assert.Equal(2, sut.Front());
                Assert.Equal(3, sut.Count);

                sut.RemoveFront();
                Assert.Equal(3, sut.Back());
                Assert.Equal(1, sut.Front());
                Assert.Equal(2, sut.Count);
            }
开发者ID:RobbieBrandrick,项目名称:AlgorithmsAndCollectionsInDotNet,代码行数:25,代码来源:LinkedListTests.cs

示例4: MustRemoveAnyElementThatExists

            public void MustRemoveAnyElementThatExists()
            {
                var sut = new LinkedList<int>();

                sut.PushBack(1);
                sut.PushBack(2);
                sut.PushBack(3);

                Assert.True(sut.Remove(2));
                Assert.Equal(2, sut.Count);
                Assert.Equal(1, sut.Front());
                Assert.Equal(3, sut.Back());

                Assert.True(sut.Remove(3));
                Assert.Equal(1, sut.Count);
                Assert.Equal(1, sut.Front());
                Assert.Equal(1, sut.Back());

                Assert.True(sut.Remove(1));
                Assert.Equal(0, sut.Count);
                Assert.Throws<InvalidOperationException>(() => sut.Front());
                Assert.Throws<InvalidOperationException>(() => sut.Back());

                sut.PushFront(1);
                sut.PushBack(2);
                sut.PushFront(3);

                Assert.True(sut.Remove(1));
                Assert.Equal(2, sut.Count);
                Assert.Equal(3, sut.Front());
                Assert.Equal(2, sut.Back());

                Assert.True(sut.Remove(2));
                Assert.Equal(1, sut.Count);
                Assert.Equal(3, sut.Front());
                Assert.Equal(3, sut.Back());

                Assert.True(sut.Remove(3));
                Assert.Equal(0, sut.Count);
                Assert.Throws<InvalidOperationException>(() => sut.Front());
                Assert.Throws<InvalidOperationException>(() => sut.Back());

            }
开发者ID:RobbieBrandrick,项目名称:AlgorithmsAndCollectionsInDotNet,代码行数:43,代码来源:LinkedListTests.cs

示例5: ThereMustBeNoElementsInTheList

            public void ThereMustBeNoElementsInTheList()
            {

                var sut = new LinkedList<int>();

                for (int i = 0; i < 100; i++)
                {
                    sut.Add(i);
                }

                sut.Clear();

                Assert.Equal(0, sut.Count);
                Assert.Throws<InvalidOperationException>(() => sut.Front());
                Assert.Throws<InvalidOperationException>(() => sut.Back());

            }
开发者ID:RobbieBrandrick,项目名称:AlgorithmsAndCollectionsInDotNet,代码行数:17,代码来源:LinkedListTests.cs

示例6: MustRemoveFromBackWhenOnlyOneItemIsInList

            public void MustRemoveFromBackWhenOnlyOneItemIsInList()
            {

                LinkedList<int> sut = new LinkedList<int>();

                sut.PushBack(1);
                Assert.Equal(1, sut.Back());
                Assert.Equal(1, sut.Front());
                Assert.Equal(1, sut.Count);

                sut.RemoveBack();
                Assert.Equal(0, sut.Count);
                Assert.Throws<InvalidOperationException>(() => sut.Front());
                Assert.Throws<InvalidOperationException>(() => sut.Back());

            }
开发者ID:RobbieBrandrick,项目名称:AlgorithmsAndCollectionsInDotNet,代码行数:16,代码来源:LinkedListTests.cs


注:本文中的LinkedList.Back方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。