File: TreeTests.swift

package info (click to toggle)
swiftlang 6.2.3-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 2,856,264 kB
  • sloc: cpp: 9,995,718; ansic: 2,234,019; asm: 1,092,167; python: 313,940; objc: 82,726; f90: 80,126; lisp: 38,373; pascal: 25,580; sh: 20,378; ml: 5,058; perl: 4,751; makefile: 4,725; awk: 3,535; javascript: 3,018; xml: 918; fortran: 664; cs: 573; ruby: 396
file content (93 lines) | stat: -rw-r--r-- 2,731 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
//===----------------------------------------------------------*- swift -*-===//
//
// This source file is part of the Swift Argument Parser open source project
//
// Copyright (c) 2020 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/LICENSE.txt for license information
//
//===----------------------------------------------------------------------===//

import XCTest
@testable import ArgumentParser

final class TreeTests: XCTestCase {
}

// MARK: -

let tree: Tree<Int> = {
  let tree = Tree(1)
  for x in 11...13 {
    let node = Tree(x)
    tree.addChild(node)
    for y in 1...3 {
      let subnode = Tree(x * 10 + y)
      node.addChild(subnode)
    }
  }
  return tree
}()

extension TreeTests {
  func testHierarchy() {
    XCTAssertEqual(tree.element, 1)
    XCTAssertEqual(tree.children.map { $0.element }, [11, 12, 13])
    XCTAssertEqual(
      tree.children.flatMap { $0.children.map { $0.element } },
      [111, 112, 113, 121, 122, 123, 131, 132, 133])
  }
  
  func testSearch() {
    XCTAssertEqual(
      tree.path(toFirstWhere: { $0 == 1 }).map { $0.element },
      [1])
    XCTAssertEqual(
      tree.path(toFirstWhere: { $0 == 13 }).map { $0.element },
      [1, 13])
    XCTAssertEqual(
      tree.path(toFirstWhere: { $0 == 133 }).map { $0.element },
      [1, 13, 133])
    
    XCTAssertTrue(tree.path(toFirstWhere: { $0 < 0 }).isEmpty)
  }
}

extension TreeTests {
  struct A: ParsableCommand {
    static let configuration = CommandConfiguration(subcommands: [A.self])
  }
  struct Root: ParsableCommand {
    static let configuration = CommandConfiguration(subcommands: [Sub.self])
  }
  struct Sub: ParsableCommand {
    static let configuration = CommandConfiguration(subcommands: [Sub.self])
  }

  struct RootWithNamedNestedSub: ParsableCommand {
    static let configuration = CommandConfiguration(subcommands: [NestedSub.self])

    struct NestedSub: ParsableCommand {
      static let configuration = CommandConfiguration(commandName: "sub", aliases: ["sub"])
    }
  }
    
  struct RootWithNestedSub: ParsableCommand {
    static let configuration = CommandConfiguration(subcommands: [NestedSub.self])

    struct NestedSub: ParsableCommand {
      static let configuration = CommandConfiguration(aliases: ["nested-sub"])
    }
  }

  func testInitializationWithRecursiveSubcommand() {
    XCTAssertThrowsError(try Tree(root: A.asCommand))
    XCTAssertThrowsError(try Tree(root: Root.asCommand))
  }

  func testInitializationWithMatchingAliases() {
    XCTAssertThrowsError(try Tree(root: RootWithNamedNestedSub.asCommand))
    XCTAssertThrowsError(try Tree(root: RootWithNestedSub.asCommand))
  }
}