You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
80 lines
4.1 KiB
Kotlin
80 lines
4.1 KiB
Kotlin
/* This Source Code Form is subject to the terms of the Mozilla Public
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
|
|
|
|
package org.mozilla.fenix.ext
|
|
|
|
import mozilla.components.concept.storage.BookmarkNode
|
|
import org.junit.Assert.assertEquals
|
|
import org.junit.Test
|
|
import org.mozilla.fenix.library.bookmarks.testBookmarkItem
|
|
import org.mozilla.fenix.library.bookmarks.testFolder
|
|
|
|
class BookmarkNodeTest {
|
|
|
|
private val bookmarkChild1 = testBookmarkItem("someFolder", "http://www.mockurl.com/1", "Child 1")
|
|
private val bookmarkChild2 = testBookmarkItem("someFolder", "http://www.mockurl.com/2", "Child 2")
|
|
private val bookmarkChild3 = testBookmarkItem("someFolder", "http://www.mockurl.com/3", "Child 3")
|
|
private val allChildren = listOf(bookmarkChild1, bookmarkChild2)
|
|
|
|
@Test
|
|
fun `GIVEN a bookmark node with children WHEN minusing a sub set of children THEN the children subset is removed and rest remains`() {
|
|
val bookmarkNode = testFolder("parent1", "root", allChildren)
|
|
val subsetToSubtract = setOf(bookmarkChild1)
|
|
val expectedRemainingSubset = listOf(bookmarkChild2)
|
|
val bookmarkNodeSubsetRemoved = bookmarkNode.minus(subsetToSubtract)
|
|
assertEquals(expectedRemainingSubset, bookmarkNodeSubsetRemoved.children)
|
|
}
|
|
|
|
@Test
|
|
fun `GIVEN a bookmark node with children WHEN minusing a set of all children THEN all children are removed and empty list remains`() {
|
|
val bookmarkNode = testFolder("parent1", "root", allChildren)
|
|
val setofAllChildren = setOf(bookmarkChild1, bookmarkChild2)
|
|
val bookmarkNodeAllChildrenRemoved = bookmarkNode.minus(setofAllChildren)
|
|
assertEquals(emptyList<BookmarkNode>(), bookmarkNodeAllChildrenRemoved.children)
|
|
}
|
|
|
|
@Test
|
|
fun `GIVEN a bookmark node with children WHEN minusing a set of non-children THEN no children are removed`() {
|
|
val setofNonChildren = setOf(bookmarkChild3)
|
|
val bookmarkNode = testFolder("parent1", "root", allChildren)
|
|
val bookmarkNodeNonChildrenRemoved = bookmarkNode.minus(setofNonChildren)
|
|
assertEquals(allChildren, bookmarkNodeNonChildrenRemoved.children)
|
|
}
|
|
|
|
@Test
|
|
fun `GIVEN a bookmark node with children WHEN minusing an empty set THEN no children are removed`() {
|
|
val bookmarkNode = testFolder("parent1", "root", allChildren)
|
|
val bookmarkNodeEmptySetRemoved = bookmarkNode.minus(emptySet())
|
|
assertEquals(allChildren, bookmarkNodeEmptySetRemoved.children)
|
|
}
|
|
|
|
@Test
|
|
fun `GIVEN a bookmark node with an empty list as children WHEN minusing a set of non-children from an empty parent THEN an empty list remains`() {
|
|
val parentWithEmptyList = testFolder("parent1", "root", emptyList())
|
|
val setofAllChildren = setOf(bookmarkChild1, bookmarkChild2)
|
|
val parentWithEmptyListNonChildRemoved = parentWithEmptyList.minus(setofAllChildren)
|
|
assertEquals(emptyList<BookmarkNode>(), parentWithEmptyListNonChildRemoved.children)
|
|
}
|
|
|
|
@Test
|
|
fun `GIVEN a bookmark node with null as children WHEN minusing a set of non-children from a parent with null children THEN null remains`() {
|
|
val parentWithNullList = testFolder("parent1", "root", null)
|
|
val parentWithNullListNonChildRemoved = parentWithNullList.minus(allChildren.toSet())
|
|
assertEquals(null, parentWithNullListNonChildRemoved.children)
|
|
}
|
|
|
|
@Test
|
|
fun `GIVEN a bookmark node with children WHEN minusing a sub-set of children THEN the rest of the parents object should remain the same`() {
|
|
val bookmarkNode = testFolder("parent1", "root", allChildren)
|
|
val subsetToSubtract = setOf(bookmarkChild1)
|
|
val expectedRemainingSubset = listOf(bookmarkChild2)
|
|
val resultBookmarkNode = bookmarkNode.minus(subsetToSubtract)
|
|
|
|
// We're pinning children to the same value so we can compare the rest.
|
|
val restOfResult = resultBookmarkNode.copy(children = expectedRemainingSubset)
|
|
val restofOriginal = bookmarkNode.copy(children = expectedRemainingSubset)
|
|
assertEquals(restOfResult, restofOriginal)
|
|
}
|
|
}
|