File: Rope%2BInvariants.swift

package info (click to toggle)
swiftlang 6.0.3-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 2,519,992 kB
  • sloc: cpp: 9,107,863; ansic: 2,040,022; asm: 1,135,751; python: 296,500; objc: 82,456; f90: 60,502; lisp: 34,951; pascal: 19,946; sh: 18,133; perl: 7,482; ml: 4,937; javascript: 4,117; makefile: 3,840; awk: 3,535; xml: 914; fortran: 619; cs: 573; ruby: 573
file content (70 lines) | stat: -rw-r--r-- 2,267 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
//===----------------------------------------------------------------------===//
//
// This source file is part of the Swift Collections open source project
//
// Copyright (c) 2023 - 2024 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
//
//===----------------------------------------------------------------------===//

extension Rope {
  @inlinable @inline(__always)
  public func _invariantCheck() {
#if COLLECTIONS_INTERNAL_CHECKS
    _root?.invariantCheck(depth: 0, height: root.height, recursive: true)
#endif
  }
}

extension Rope._Node {
#if COLLECTIONS_INTERNAL_CHECKS
  @usableFromInline
  internal func invariantCheck(depth: UInt8, height: UInt8, recursive: Bool = true) {
    precondition(height == self.height, "Mismatching rope height")
    if isLeaf {
      precondition(self.childCount <= Summary.maxNodeSize, "Oversized leaf")
      precondition(height == 0, "Leaf with height > 0")
      precondition(depth == 0 || self.childCount >= Summary.minNodeSize, "Undersized leaf")
      
      let sum: Summary = readLeaf {
        $0.children.reduce(into: .zero) { $0.add($1.summary) }
      }
      precondition(self.summary == sum, "Mismatching summary")
      
      guard recursive else { return }
      readLeaf { leaf in
        for child in leaf.children {
          child.value.invariantCheck()
        }
      }
      return
    }
    
    precondition(self.childCount <= Summary.maxNodeSize, "Oversized node")
    if depth == 0 {
      precondition(self.childCount > 1, "Undersize root node")
    } else {
      precondition(self.childCount >= Summary.minNodeSize, "Undersized internal node")
    }
    
    let sum: Summary = readInner {
      $0.children.reduce(into: .zero) { $0.add($1.summary) }
    }
    precondition(self.summary == sum, "Mismatching summary")
    
    guard recursive else { return }
    readInner { h in
      for child in h.children {
        child.invariantCheck(depth: depth + 1, height: height - 1, recursive: true)
      }
    }
  }
#else
  @inlinable @inline(__always)
  internal func invariantCheck(depth: UInt8, height: UInt8, recursive: Bool = true) {
    // Do nothing.
  }
#endif
}