diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..95c4320 --- /dev/null +++ b/.gitignore @@ -0,0 +1,5 @@ +.DS_Store +/.build +/Packages +/*.xcodeproj +xcuserdata/ diff --git a/LICENSE.txt b/LICENSE.txt new file mode 100644 index 0000000..261eeb9 --- /dev/null +++ b/LICENSE.txt @@ -0,0 +1,201 @@ + Apache License + Version 2.0, January 2004 + http://www.apache.org/licenses/ + + TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION + + 1. Definitions. + + "License" shall mean the terms and conditions for use, reproduction, + and distribution as defined by Sections 1 through 9 of this document. + + "Licensor" shall mean the copyright owner or entity authorized by + the copyright owner that is granting the License. + + "Legal Entity" shall mean the union of the acting entity and all + other entities that control, are controlled by, or are under common + control with that entity. For the purposes of this definition, + "control" means (i) the power, direct or indirect, to cause the + direction or management of such entity, whether by contract or + otherwise, or (ii) ownership of fifty percent (50%) or more of the + outstanding shares, or (iii) beneficial ownership of such entity. + + "You" (or "Your") shall mean an individual or Legal Entity + exercising permissions granted by this License. + + "Source" form shall mean the preferred form for making modifications, + including but not limited to software source code, documentation + source, and configuration files. + + "Object" form shall mean any form resulting from mechanical + transformation or translation of a Source form, including but + not limited to compiled object code, generated documentation, + and conversions to other media types. + + "Work" shall mean the work of authorship, whether in Source or + Object form, made available under the License, as indicated by a + copyright notice that is included in or attached to the work + (an example is provided in the Appendix below). + + "Derivative Works" shall mean any work, whether in Source or Object + form, that is based on (or derived from) the Work and for which the + editorial revisions, annotations, elaborations, or other modifications + represent, as a whole, an original work of authorship. For the purposes + of this License, Derivative Works shall not include works that remain + separable from, or merely link (or bind by name) to the interfaces of, + the Work and Derivative Works thereof. + + "Contribution" shall mean any work of authorship, including + the original version of the Work and any modifications or additions + to that Work or Derivative Works thereof, that is intentionally + submitted to Licensor for inclusion in the Work by the copyright owner + or by an individual or Legal Entity authorized to submit on behalf of + the copyright owner. For the purposes of this definition, "submitted" + means any form of electronic, verbal, or written communication sent + to the Licensor or its representatives, including but not limited to + communication on electronic mailing lists, source code control systems, + and issue tracking systems that are managed by, or on behalf of, the + Licensor for the purpose of discussing and improving the Work, but + excluding communication that is conspicuously marked or otherwise + designated in writing by the copyright owner as "Not a Contribution." + + "Contributor" shall mean Licensor and any individual or Legal Entity + on behalf of whom a Contribution has been received by Licensor and + subsequently incorporated within the Work. + + 2. Grant of Copyright License. Subject to the terms and conditions of + this License, each Contributor hereby grants to You a perpetual, + worldwide, non-exclusive, no-charge, royalty-free, irrevocable + copyright license to reproduce, prepare Derivative Works of, + publicly display, publicly perform, sublicense, and distribute the + Work and such Derivative Works in Source or Object form. + + 3. Grant of Patent License. Subject to the terms and conditions of + this License, each Contributor hereby grants to You a perpetual, + worldwide, non-exclusive, no-charge, royalty-free, irrevocable + (except as stated in this section) patent license to make, have made, + use, offer to sell, sell, import, and otherwise transfer the Work, + where such license applies only to those patent claims licensable + by such Contributor that are necessarily infringed by their + Contribution(s) alone or by combination of their Contribution(s) + with the Work to which such Contribution(s) was submitted. If You + institute patent litigation against any entity (including a + cross-claim or counterclaim in a lawsuit) alleging that the Work + or a Contribution incorporated within the Work constitutes direct + or contributory patent infringement, then any patent licenses + granted to You under this License for that Work shall terminate + as of the date such litigation is filed. + + 4. Redistribution. You may reproduce and distribute copies of the + Work or Derivative Works thereof in any medium, with or without + modifications, and in Source or Object form, provided that You + meet the following conditions: + + (a) You must give any other recipients of the Work or + Derivative Works a copy of this License; and + + (b) You must cause any modified files to carry prominent notices + stating that You changed the files; and + + (c) You must retain, in the Source form of any Derivative Works + that You distribute, all copyright, patent, trademark, and + attribution notices from the Source form of the Work, + excluding those notices that do not pertain to any part of + the Derivative Works; and + + (d) If the Work includes a "NOTICE" text file as part of its + distribution, then any Derivative Works that You distribute must + include a readable copy of the attribution notices contained + within such NOTICE file, excluding those notices that do not + pertain to any part of the Derivative Works, in at least one + of the following places: within a NOTICE text file distributed + as part of the Derivative Works; within the Source form or + documentation, if provided along with the Derivative Works; or, + within a display generated by the Derivative Works, if and + wherever such third-party notices normally appear. The contents + of the NOTICE file are for informational purposes only and + do not modify the License. You may add Your own attribution + notices within Derivative Works that You distribute, alongside + or as an addendum to the NOTICE text from the Work, provided + that such additional attribution notices cannot be construed + as modifying the License. + + You may add Your own copyright statement to Your modifications and + may provide additional or different license terms and conditions + for use, reproduction, or distribution of Your modifications, or + for any such Derivative Works as a whole, provided Your use, + reproduction, and distribution of the Work otherwise complies with + the conditions stated in this License. + + 5. Submission of Contributions. Unless You explicitly state otherwise, + any Contribution intentionally submitted for inclusion in the Work + by You to the Licensor shall be under the terms and conditions of + this License, without any additional terms or conditions. + Notwithstanding the above, nothing herein shall supersede or modify + the terms of any separate license agreement you may have executed + with Licensor regarding such Contributions. + + 6. Trademarks. This License does not grant permission to use the trade + names, trademarks, service marks, or product names of the Licensor, + except as required for reasonable and customary use in describing the + origin of the Work and reproducing the content of the NOTICE file. + + 7. Disclaimer of Warranty. Unless required by applicable law or + agreed to in writing, Licensor provides the Work (and each + Contributor provides its Contributions) on an "AS IS" BASIS, + WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or + implied, including, without limitation, any warranties or conditions + of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A + PARTICULAR PURPOSE. You are solely responsible for determining the + appropriateness of using or redistributing the Work and assume any + risks associated with Your exercise of permissions under this License. + + 8. Limitation of Liability. In no event and under no legal theory, + whether in tort (including negligence), contract, or otherwise, + unless required by applicable law (such as deliberate and grossly + negligent acts) or agreed to in writing, shall any Contributor be + liable to You for damages, including any direct, indirect, special, + incidental, or consequential damages of any character arising as a + result of this License or out of the use or inability to use the + Work (including but not limited to damages for loss of goodwill, + work stoppage, computer failure or malfunction, or any and all + other commercial damages or losses), even if such Contributor + has been advised of the possibility of such damages. + + 9. Accepting Warranty or Additional Liability. While redistributing + the Work or Derivative Works thereof, You may choose to offer, + and charge a fee for, acceptance of support, warranty, indemnity, + or other liability obligations and/or rights consistent with this + License. However, in accepting such obligations, You may act only + on Your own behalf and on Your sole responsibility, not on behalf + of any other Contributor, and only if You agree to indemnify, + defend, and hold each Contributor harmless for any liability + incurred by, or claims asserted against, such Contributor by reason + of your accepting any such warranty or additional liability. + + END OF TERMS AND CONDITIONS + + APPENDIX: How to apply the Apache License to your work. + + To apply the Apache License to your work, attach the following + boilerplate notice, with the fields enclosed by brackets "[]" + replaced with your own identifying information. (Don't include + the brackets!) The text should be enclosed in the appropriate + comment syntax for the file format. We also recommend that a + file or class name and description of purpose be included on the + same "printed page" as the copyright notice for easier + identification within third-party archives. + + Copyright [yyyy] [name of copyright owner] + + 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. diff --git a/Package.swift b/Package.swift new file mode 100644 index 0000000..fb99263 --- /dev/null +++ b/Package.swift @@ -0,0 +1,23 @@ +// swift-tools-version:5.3 + +import PackageDescription + +let package = Package( + name: "SwiftSimpleTree", + products: [ + .library(name: "SimpleTree", targets: ["SimpleTree"]), + ], + dependencies: [], + targets: [ + .target( + name: "SimpleTree", + dependencies: [], + path: "Sources" + ), + .testTarget( + name: "SimpleTreeTests", + dependencies: ["SimpleTree"], + path: "Tests" + ), + ] +) diff --git a/README.md b/README.md new file mode 100644 index 0000000..ab5020c --- /dev/null +++ b/README.md @@ -0,0 +1,110 @@ +# SwiftSimpleTree + +A nested data structure that’s flexible and easy to use. + +Available as an open source Swift library to be incorporated in other apps. + +_SwiftSimpleTree_ is part of the [OpenAlloc](https://github.com/openalloc) family of open source Swift software tools. + +## SimpleTree + +```swift +let foo = SimpleTree(value: "foo") +let bar = foo.addChild(forValue: "bar") +let baz = bar.addChild(forValue: "baz") + +print(foo.getFirst(forValue: "baz")?.value) + +=> "baz" + +print(baz.getParentValues()) + +=> ["bar", "foo"] + +print(foo.getAllChildValues()) + +=> ["bar", "baz"] +``` + +## Types + +- `typealias Node = SimpleTree` - a tree node, where `T` is your hashable type. + +- `typealias ValueSet = Set` - a set of values, where `T` is your hashable type. + +## Instance Methods + +#### Tree Maintenance + +- `init(value: T)`: Initialize a new tree (containing the specified value at the root) + +- `func addChild(forValue: T) -> Node`: Append a new node (containing the specified value) to our list of children + +#### Node Retrieval + +- `func getParent(excludeValues: ValueSet) -> Node?`: Return the immediate parent node, if any. Optional list of parent values to be excluded. A match will cause this function to return nil. + +- `func getParents(maxDepth: Int, excludeValues: ValueSet) -> [Node]`: Return the parent nodes, starting with immediate parent. Optional list of parent values to be excluded. A match will exclude further ancestors. Optional limit on depth. + +- `func getChildren(maxDepth: Int, excludeValues: ValueSet) -> [Node]`: Fetch child nodes. Optional list of values for children to be excluded, along with their progeny. Traversal is depth-first, with optional limit. + +#### Iterators + +- `func makeChildIterator(excludeValues: ValueSet) -> AnyIterator`: Create a iterator to traverse through the children (grandchildren, etc.) of the current node. Traversal is breadth-first. With short circuit of child branches on exclude filter. + +- `func makeParentIterator() -> AnyIterator`: Create a iterator to traverse up the tree through the parents of the current node, starting with the most recent parent, if any. + +#### Iterative Node Search + +- `func getFirst(forValue: T) -> Node?`: Traverse from the current node to find the first node with the specified value. Includes current node. Traversal is breadth-first. + +- `func getFirstChild(forValue: T) -> Node?`: Traverse the children from the current node to find the first child (grandchild, etc.) with the specified value. Traversal is breadth-first. + +#### Iterative Node Retrieval + +- `func getAll(excludeValues: ValueSet) -> [Node]`: Flatten tree from current node. Includes current node. Optional list of values for children to be excluded, along with their progeny. Traversal is breadth-first. + +- `func getAllChildren(excludeValues: ValueSet) -> [Node]`: Get all the child nodes from the current node. Optional list of values for children to be excluded, along with their progeny. Traversal is breadth-first. + +#### Value retrieval + +- `func getAllChildValues(excludeValues: ValueSet) -> [T]`: Get all the child values from the current node. Optional list of values for children to be excluded, along with their progeny. Traversal is breadth-first. + +- `func getAllValues(excludeValues: ValueSet) -> [T]`: Flatten tree from current node. Includes value of current node. Optional list of values for children to be excluded, along with their progeny. Traversal is breadth-first. + +- `func getChildValues(maxDepth: Int, excludeValues: ValueSet) -> [T]`: Fetch child values. Optional list of values for children to be excluded, along with their progeny. Traversal is depth-first, with optional limit. + +- `func getParentValue(excludeValues: ValueSet) -> T?`: Return the value of the immediate parent node, if any. Optional list of parent values to be excluded. A match will cause this function to return nil. + +- `func getParentValues(maxDepth: Int, excludeValues: ValueSet) -> [T]`: Return the values of the parent nodes, starting with immediate parent. Optional list of parent values to be excluded. A match will exclude further ancestors. Optional limit on depth. + +## See Also + +Swift open-source libraries (by the same author): + +* [AllocData](https://github.com/openalloc/AllocData) - standardized data formats for investing-focused apps and tools +* [FINporter](https://github.com/openalloc/FINporter) - library and command-line tool to transform various specialized finance-related formats to the standardized schema of AllocData +* [Compactor](https://github.com/openalloc/Compactor) - formatters to produce concise representations of numbers, currency, and time intervals + +And commercial apps using this library (by the same author): + +* [FlowAllocator](https://flowallocator.app/FlowAllocator/index.html) - portfolio rebalancing tool for macOS +* [FlowWorth](https://flowallocator.app/FlowWorth/index.html) - a new portfolio performance and valuation tracking tool for macOS + +## License + +Copyright 2021 FlowAllocator LLC + +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](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. + +## Contributing + +Contributions are welcome. You are encouraged to submit pull requests to fix bugs, improve documentation, or offer new features. + +The pull request need not be a production-ready feature or fix. It can be a draft of proposed changes, or simply a test to show that expected behavior is buggy. Discussion on the pull request can proceed from there. + +Contributions should ultimately have adequate test coverage. See tests for current entities to see what coverage is expected. diff --git a/Sources/SimpleTree.swift b/Sources/SimpleTree.swift new file mode 100644 index 0000000..174894d --- /dev/null +++ b/Sources/SimpleTree.swift @@ -0,0 +1,235 @@ +// +// SimpleTree.swift +// +// Copyright 2021 FlowAllocator LLC +// +// 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. +// + +import Foundation + +public class SimpleTree where T: Equatable & Hashable { + + public typealias Node = SimpleTree + public typealias ValueSet = Set + + public var value: T + private(set) var children: [Node] = [] + private(set) var parent: Node? + + public init(value: T) { + self.value = value + } +} + +// MARK: - Tree Maintenance + +extension SimpleTree { + + /// Append a new node (containing the specified value) to our list of children + public func addChild(forValue value: T) -> Node { + let nuChild = Node(value: value) + children.append(nuChild) + nuChild.parent = self + return nuChild + } + + // TODO need removeChild() which will also deal with grandchildren, etc. +} + +// MARK: - Node Retrieval + +extension SimpleTree { + + /// Return the parent nodes, starting with immediate parent. + /// Optional list of parent values to be excluded. A match will exclude further ancestors. + /// Optional limit on depth. + public func getParents(maxDepth: Int = Int.max, excludeValues: ValueSet = ValueSet()) -> [Node] { + guard maxDepth > 0 else { return [] } + let iter = self.makeParentIterator() + var depth = maxDepth + var parents = [Node]() + while let parentNode = iter.next() { + if excludeValues.contains(parentNode.value) { break } + parents.append(parentNode) + depth -= 1 + if depth == 0 { break } + } + return parents + } + + /// Return the immediate parent node, if any. + /// Optional list of parent values to be excluded. A match will cause this function to return nil. + public func getParent(excludeValues: ValueSet = ValueSet()) -> Node? { + getParents(maxDepth: 1, excludeValues: excludeValues).first + } + + /// Fetch child nodes. + /// Optional list of values for children to be excluded, along with their progeny. + /// Traversal is depth-first, with optional limit. + public func getChildren(maxDepth: Int = Int.max, excludeValues: ValueSet = ValueSet()) -> [Node] { + guard maxDepth > 0 else { return [] } + var nodes = [Node]() + for child in children { + if excludeValues.contains(child.value) { continue } + nodes.append(child) + if maxDepth > 1 { + nodes.append(contentsOf: child.getChildren(maxDepth: maxDepth - 1, excludeValues: excludeValues)) + } + } + return nodes + } +} + +// MARK: - Iterators + +extension SimpleTree { + + /// Create a iterator to traverse up the tree through the parents of the current node, starting with the most recent parent, if any. + public func makeParentIterator() -> AnyIterator { + var node: Node? = self.parent + return AnyIterator { () -> Node? in + guard let _node = node else { return nil } + let currentNode = _node + node = _node.parent // okay if nil + return currentNode + } + } + + /// Create a iterator to traverse through the children (grandchildren, etc.) of the current node. + /// Traversal is breadth-first. + /// With short circuit of child branches on exclude filter. + public func makeChildIterator(excludeValues: ValueSet = ValueSet()) -> AnyIterator { + var stack = self.children + var node: Node? = stack.isEmpty ? nil : stack.removeFirst() + return AnyIterator { () -> Node? in + guard node != nil else { return nil } + + var nextNode: Node? = nil + + // burn through stack to find next available non-excluded value + while node != nil { + nextNode = node + if let cv = nextNode?.value, + excludeValues.contains(cv) { + node = stack.isEmpty ? nil : stack.removeFirst() + nextNode = nil + continue + } + break + } + + if let _node = node { + stack.append(contentsOf: _node.children) + } + + if stack.isEmpty { + node = nil + } else { + node = stack.removeFirst() + } + + return nextNode + } + } +} + +// MARK: - Iterative Node Search + +extension SimpleTree { + + /// Traverse the children from the current node to find the first child (grandchild, etc.) with the specified value. + /// Traversal is breadth-first. + public func getFirstChild(forValue value: T) -> Node? { + let iter = self.makeChildIterator() + while let node = iter.next() { + if node.value == value { + return node + } + } + return nil + } + + /// Traverse from the current node to find the first node with the specified value. Includes current node. + /// Traversal is breadth-first. + public func getFirst(forValue value: T) -> Node? { + guard self.value != value else { return self } + return getFirstChild(forValue: value) + } +} + +// MARK: - Iterative Node Retrieval + +extension SimpleTree { + + /// Get all the child nodes from the current node. + /// Optional list of values for children to be excluded, along with their progeny. + /// Traversal is breadth-first. + public func getAllChildren(excludeValues: ValueSet = ValueSet()) -> [Node] { + var nodes = [Node]() + let iter = self.makeChildIterator(excludeValues: excludeValues) + while let node = iter.next() { + nodes.append(node) + } + return nodes + } + + /// Flatten tree from current node. Includes current node. + /// Optional list of values for children to be excluded, along with their progeny. + /// Traversal is breadth-first. + public func getAll(excludeValues: ValueSet = ValueSet()) -> [Node] { + guard !excludeValues.contains(self.value) else { return [] } + var nodes: [Node] = [self] + nodes.append(contentsOf: getAllChildren(excludeValues: excludeValues)) + return nodes + } +} + +// MARK: - Value retrieval + +extension SimpleTree { + + /// Return the values of the parent nodes, starting with immediate parent. + /// Optional list of parent values to be excluded. A match will exclude further ancestors. + /// Optional limit on depth. + public func getParentValues(maxDepth: Int = Int.max, excludeValues: ValueSet = ValueSet()) -> [T] { + getParents(maxDepth: maxDepth, excludeValues: excludeValues).map(\.value) + } + + /// Return the value of the immediate parent node, if any. + /// Optional list of parent values to be excluded. A match will cause this function to return nil. + public func getParentValue(excludeValues: ValueSet = ValueSet()) -> T? { + getParent(excludeValues: excludeValues)?.value + } + + /// Fetch child values. + /// Optional list of values for children to be excluded, along with their progeny. + /// Traversal is depth-first, with optional limit. + public func getChildValues(maxDepth: Int = Int.max, excludeValues: ValueSet = ValueSet()) -> [T] { + getChildren(maxDepth: maxDepth, excludeValues: excludeValues).map(\.value) + } + + /// Get all the child values from the current node. + /// Optional list of values for children to be excluded, along with their progeny. + /// Traversal is breadth-first. + public func getAllChildValues(excludeValues: ValueSet = ValueSet()) -> [T] { + getAllChildren(excludeValues: excludeValues).map(\.value) + } + + /// Flatten tree from current node. Includes value of current node. + /// Optional list of values for children to be excluded, along with their progeny. + /// Traversal is breadth-first. + public func getAllValues(excludeValues: ValueSet = ValueSet()) -> [T] { + getAll(excludeValues: excludeValues).map(\.value) + } +} diff --git a/Tests/SimpleTreeTests.swift b/Tests/SimpleTreeTests.swift new file mode 100644 index 0000000..0ad7a69 --- /dev/null +++ b/Tests/SimpleTreeTests.swift @@ -0,0 +1,286 @@ +// +// SimpleTreeTests.swift +// +// Copyright 2021 FlowAllocator LLC +// +// 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. +// + +import XCTest + +import SimpleTree + +/// Shallow equator, exclusively for purposes of testing +extension SimpleTree: Equatable { + public static func == (lhs: SimpleTree.Node, rhs: SimpleTree.Node) -> Bool { + lhs.value == rhs.value + } +} + +class SimpleTreeTests: XCTestCase { + + public func testGetParentValues() throws { + let foo = SimpleTree(value: "foo") + let bar = foo.addChild(forValue: "bar") + let baz2 = foo.addChild(forValue: "bar2") + let baz = bar.addChild(forValue: "baz") + let blah = bar.addChild(forValue: "blah") + + XCTAssertEqual(blah.getParentValues(), ["bar", "foo"]) + XCTAssertEqual(blah.getParentValues(maxDepth: 0), []) + XCTAssertEqual(blah.getParentValues(maxDepth: 1), ["bar"]) + XCTAssertEqual(blah.getParentValues(maxDepth: 2), ["bar", "foo"]) + XCTAssertEqual(blah.getParentValues(maxDepth: 10000), ["bar", "foo"]) + + XCTAssertEqual(blah.getParentValues(excludeValues: ["foo"]), ["bar"]) + XCTAssertEqual(blah.getParentValues(excludeValues: ["bar"]), []) + XCTAssertEqual(blah.getParentValues(excludeValues: ["bar2"]), ["bar", "foo"]) + XCTAssertEqual(blah.getParentValues(excludeValues: ["baz"]), ["bar", "foo"]) + XCTAssertEqual(blah.getParentValues(excludeValues: ["blah"]), ["bar", "foo"]) + + XCTAssertEqual(blah.getParentValue(), "bar") + XCTAssertEqual(foo.getParentValue(), nil) + XCTAssertEqual(bar.getParentValue(), "foo") + XCTAssertEqual(baz2.getParentValue(), "foo") + XCTAssertEqual(baz.getParentValue(), "bar") + } + + public func testMakeParentIterator() throws { + let foo = SimpleTree(value: "foo") + let bar = foo.addChild(forValue: "bar") + let baz2 = foo.addChild(forValue: "baz2") + let baz = bar.addChild(forValue: "baz") + let blah = bar.addChild(forValue: "blah") + + let blahIt = blah.makeParentIterator() + XCTAssertEqual("bar", blahIt.next()?.value) + XCTAssertEqual("foo", blahIt.next()?.value) + XCTAssertNil(blahIt.next()?.value) + + let baz2It = baz2.makeParentIterator() + XCTAssertEqual("foo", baz2It.next()?.value) + XCTAssertNil(baz2It.next()?.value) + + let bazIt = baz.makeParentIterator() + XCTAssertEqual("bar", bazIt.next()?.value) + XCTAssertEqual("foo", bazIt.next()?.value) + XCTAssertNil(bazIt.next()?.value) + + let barIt = bar.makeParentIterator() + XCTAssertEqual("foo", barIt.next()?.value) + XCTAssertNil(barIt.next()?.value) + + let fooIt = foo.makeParentIterator() + XCTAssertNil(fooIt.next()?.value) + } + + public func testMakeChildIterator() throws { + let foo = SimpleTree(value: "foo") + let bar = foo.addChild(forValue: "bar") + let baz2 = foo.addChild(forValue: "baz2") + let bleep = baz2.addChild(forValue: "bleep") + let blort = bleep.addChild(forValue: "blort") + let baz = bar.addChild(forValue: "baz") + let blah = bar.addChild(forValue: "blah") + + let blahIt = blah.makeChildIterator() + XCTAssertNil(blahIt.next()?.value) + + let baz2It = baz2.makeChildIterator() + XCTAssertEqual("bleep", baz2It.next()?.value) + XCTAssertEqual("blort", baz2It.next()?.value) + XCTAssertNil(baz2It.next()?.value) + + let bleepIt = bleep.makeChildIterator() + XCTAssertEqual("blort", bleepIt.next()?.value) + XCTAssertNil(bleepIt.next()?.value) + + let blortIt = blort.makeChildIterator() + XCTAssertNil(blortIt.next()?.value) + + let bazIt = baz.makeChildIterator() + XCTAssertNil(bazIt.next()?.value) + + let barIt = bar.makeChildIterator() + XCTAssertEqual("baz", barIt.next()?.value) + XCTAssertEqual("blah", barIt.next()?.value) + XCTAssertNil(barIt.next()?.value) + + let fooIt = foo.makeChildIterator() + XCTAssertEqual("bar", fooIt.next()?.value) + XCTAssertEqual("baz2", fooIt.next()?.value) + XCTAssertEqual("baz", fooIt.next()?.value) + XCTAssertEqual("blah", fooIt.next()?.value) + XCTAssertEqual("bleep", fooIt.next()?.value) + XCTAssertEqual("blort", fooIt.next()?.value) + XCTAssertNil(fooIt.next()?.value) + } + + public func testGetFirst() throws { + let foo = SimpleTree(value: "foo") + let bar = foo.addChild(forValue: "bar") + let baz = bar.addChild(forValue: "baz") + + XCTAssertNil(foo.getFirstChild(forValue: "foo")) + XCTAssertEqual(foo.getFirstChild(forValue: "bar"), bar) + XCTAssertEqual(foo.getFirstChild(forValue: "baz"), baz) + XCTAssertNil(foo.getFirstChild(forValue: "blah")) + + XCTAssertEqual(foo.getFirst(forValue: "foo"), foo) + XCTAssertEqual(foo.getFirst(forValue: "bar"), bar) + XCTAssertEqual(foo.getFirst(forValue: "baz"), baz) + XCTAssertNil(foo.getFirst(forValue: "blah")) + } + + public func testGetChildValuesNone() throws { + let foo = SimpleTree(value: "foo") + XCTAssertEqual(foo.getChildValues(), []) + } + + public func testGetChildValuesOneChild() throws { + let foo = SimpleTree(value: "foo") + _ = foo.addChild(forValue: "bar") + XCTAssertEqual(foo.getChildValues(), ["bar"]) + } + + public func testGetChildValuesOneGrandChild() throws { + let foo = SimpleTree(value: "foo") + let bar = foo.addChild(forValue: "bar") + _ = bar.addChild(forValue: "baz") + XCTAssertEqual(foo.getChildValues(), ["bar", "baz"]) + } + + public func testGetChildValues() throws { + let foo = SimpleTree(value: "foo") + let bar = foo.addChild(forValue: "bar") + let bar2 = foo.addChild(forValue: "bar2") + _ = bar2.addChild(forValue: "bar3") + let baz = bar.addChild(forValue: "baz") + let blah = bar.addChild(forValue: "blah") + _ = blah.addChild(forValue: "bleh") + + XCTAssertEqual(foo.getChildValues().sorted(), ["bar", "bar2", "bar3", "baz", "blah", "bleh"].sorted()) + XCTAssertEqual(bar.getChildValues().sorted(), ["baz", "blah", "bleh"].sorted()) + XCTAssertEqual(bar2.getChildValues(), ["bar3"]) + XCTAssertEqual(baz.getChildValues(), []) + XCTAssertEqual(blah.getChildValues(), ["bleh"]) + + XCTAssertEqual(foo.getChildValues(maxDepth: 1000).sorted(), ["bar", "bar2", "bar3", "baz", "blah", "bleh"].sorted()) + XCTAssertEqual(foo.getChildValues(maxDepth: 3).sorted(), ["bar", "bar2", "bar3", "baz", "blah", "bleh"].sorted()) + XCTAssertEqual(foo.getChildValues(maxDepth: 2).sorted(), ["bar", "bar2", "bar3", "baz", "blah"].sorted()) + XCTAssertEqual(foo.getChildValues(maxDepth: 1).sorted(), ["bar", "bar2"].sorted()) + XCTAssertEqual(foo.getChildValues(maxDepth: 0).sorted(), [].sorted()) + } + + public func testGetAllChildValues() throws { + let foo = SimpleTree(value: "foo") + let bar = foo.addChild(forValue: "bar") + let bar2 = foo.addChild(forValue: "bar2") + _ = bar2.addChild(forValue: "bar3") + let baz = bar.addChild(forValue: "baz") + let blah = bar.addChild(forValue: "blah") + _ = blah.addChild(forValue: "bleh") + + XCTAssertEqual(foo.getAllChildValues().sorted(), ["bar", "bar2", "bar3", "baz", "blah", "bleh"].sorted()) + XCTAssertEqual(bar.getAllChildValues().sorted(), ["baz", "blah", "bleh"].sorted()) + XCTAssertEqual(bar2.getAllChildValues(), ["bar3"]) + XCTAssertEqual(baz.getAllChildValues(), []) + XCTAssertEqual(blah.getAllChildValues(), ["bleh"]) + } + + public func testGetChildValuesExclude() throws { + let foo = SimpleTree(value: "foo") + let bar = foo.addChild(forValue: "bar") + let bar2 = foo.addChild(forValue: "bar2") + _ = bar2.addChild(forValue: "bar3") + _ = bar.addChild(forValue: "baz") + _ = bar.addChild(forValue: "blah") + + XCTAssertEqual(foo.getChildValues(excludeValues: ["bar"]).sorted(), ["bar2", "bar3"].sorted()) + XCTAssertEqual(foo.getChildValues(excludeValues: ["bar2"]).sorted(), ["bar", "baz", "blah"].sorted()) + XCTAssertEqual(bar.getChildValues(excludeValues: ["foo"]).sorted(), ["baz", "blah"].sorted()) + XCTAssertEqual(bar.getChildValues(excludeValues: ["blah"]).sorted(), ["baz"].sorted()) + } + + public func testGetChildValues2Exclude() throws { + let foo = SimpleTree(value: "foo") + let bar = foo.addChild(forValue: "bar") + let bar2 = foo.addChild(forValue: "bar2") + _ = bar2.addChild(forValue: "bar3") + _ = bar.addChild(forValue: "baz") + _ = bar.addChild(forValue: "blah") + + //XCTAssertEqual(foo.getChildValues2(excludeValues: ["bar"]), []) + XCTAssertEqual(foo.getAllChildValues(excludeValues: ["bar2"]), ["bar", "baz", "blah"]) + XCTAssertEqual(foo.getAllChildValues(excludeValues: ["blah"]), ["bar", "bar2", "baz", "bar3"]) + XCTAssertEqual(bar.getAllChildValues(excludeValues: ["foo"]), ["baz", "blah"]) + XCTAssertEqual(bar.getAllChildValues(excludeValues: ["blah"]), ["baz"]) + } + + public func testGetAllValues() throws { + let foo = SimpleTree(value: "foo") + let bar = foo.addChild(forValue: "bar") + let baz = bar.addChild(forValue: "baz") + + XCTAssertTrue(foo.getAllValues().contains("foo")) + XCTAssertTrue(foo.getAllValues().contains("bar")) + XCTAssertTrue(foo.getAllValues().contains("baz")) + XCTAssertFalse(foo.getAllValues().contains("blah")) + + XCTAssertFalse(bar.getAllValues().contains("foo")) + XCTAssertTrue(bar.getAllValues().contains("bar")) + XCTAssertTrue(bar.getAllValues().contains("baz")) + XCTAssertFalse(bar.getAllValues().contains("blah")) + + XCTAssertFalse(baz.getAllValues().contains("foo")) + XCTAssertFalse(baz.getAllValues().contains("bar")) + XCTAssertTrue(baz.getAllValues().contains("baz")) + XCTAssertFalse(baz.getAllValues().contains("blah")) + } + + public func testGetAllValuesExcludeRoot() throws { + let foo = SimpleTree(value: "foo") + _ = foo.addChild(forValue: "bar") + + let actual = foo.getAllValues(excludeValues: Set(["foo"])) + XCTAssertFalse(actual.contains("foo")) + XCTAssertFalse(actual.contains("bar")) + } + + public func testGetAllValuesExcludeChild() throws { + let foo = SimpleTree(value: "foo") + let bar = foo.addChild(forValue: "bar") + _ = bar.addChild(forValue: "baz") + + let actual = foo.getAllValues(excludeValues: Set(["bar"])) + XCTAssertTrue(actual.contains("foo")) + XCTAssertFalse(actual.contains("bar")) + } + + public func testGetAllValuesExcludeSibling() throws { + let foo = SimpleTree(value: "foo") + + let blah = foo.addChild(forValue: "blah") + _ = blah.addChild(forValue: "bleh") + + let bar = foo.addChild(forValue: "bar") + _ = bar.addChild(forValue: "baz") + + let actual = foo.getAllValues(excludeValues: Set(["blah"])) + XCTAssertTrue(actual.contains("foo")) + XCTAssertFalse(actual.contains("blah")) + XCTAssertFalse(actual.contains("bleh")) + XCTAssertTrue(actual.contains("bar")) + XCTAssertTrue(actual.contains("baz")) + } +}