| /* |
| * Copyright 2016-2017 JetBrains s.r.o. |
| * |
| * Licensed under the Apache License, Version 2.0 (the "License"); |
| * you may not use this file except in compliance with the License. |
| * You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, software |
| * distributed under the License is distributed on an "AS IS" BASIS, |
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| * See the License for the specific language governing permissions and |
| * limitations under the License. |
| */ |
| |
| package kotlinx.coroutines.experimental.internal |
| |
| import kotlin.test.Test |
| import kotlin.test.assertEquals |
| import kotlin.test.assertFalse |
| import kotlin.test.assertTrue |
| |
| class LinkedListTest { |
| data class IntNode(val i: Int) : LinkedListNode() |
| |
| @Test |
| fun testSimpleAddLastRemove() { |
| val list = LinkedListHead() |
| assertContents(list) |
| val n1 = IntNode(1).apply { list.addLast(this) } |
| assertContents(list, 1) |
| val n2 = IntNode(2).apply { list.addLast(this) } |
| assertContents(list, 1, 2) |
| val n3 = IntNode(3).apply { list.addLast(this) } |
| assertContents(list, 1, 2, 3) |
| val n4 = IntNode(4).apply { list.addLast(this) } |
| assertContents(list, 1, 2, 3, 4) |
| assertTrue(n1.remove()) |
| assertContents(list, 2, 3, 4) |
| assertTrue(n3.remove()) |
| assertContents(list, 2, 4) |
| assertTrue(n4.remove()) |
| assertContents(list, 2) |
| assertTrue(n2.remove()) |
| assertFalse(n2.remove()) |
| assertContents(list) |
| } |
| |
| private fun assertContents(list: LinkedListHead, vararg expected: Int) { |
| val n = expected.size |
| val actual = IntArray(n) |
| var index = 0 |
| list.forEach<IntNode> { actual[index++] = it.i } |
| assertEquals(n, index) |
| for (i in 0 until n) assertEquals(expected[i], actual[i], "item i") |
| assertEquals(expected.isEmpty(), list.isEmpty) |
| } |
| } |