File: _HashNode%2BStructural%20compactMapValues.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 (46 lines) | stat: -rw-r--r-- 1,451 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
//===----------------------------------------------------------------------===//
//
// This source file is part of the Swift Collections open source project
//
// Copyright (c) 2022 - 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 _HashNode {
  @inlinable
  internal func compactMapValues<T>(
    _ level: _HashLevel,
    _ transform: (Value) throws -> T?
  ) rethrows -> _HashNode<Key, T>.Builder {
    return try self.read {
      var result: _HashNode<Key, T>.Builder = .empty(level)

      if isCollisionNode {
        let items = $0.reverseItems
        for i in items.indices {
          if let v = try transform(items[i].value) {
            result.addNewCollision(level, (items[i].key, v), $0.collisionHash)
          }
        }
        return result
      }

      for (bucket, slot) in $0.itemMap {
        let p = $0.itemPtr(at: slot)
        if let v = try transform(p.pointee.value) {
          result.addNewItem(level, (p.pointee.key, v), at: bucket)
        }
      }

      for (bucket, slot) in $0.childMap {
        let branch = try $0[child: slot]
          .compactMapValues(level.descend(), transform)
        result.addNewChildBranch(level, branch, at: bucket)
      }
      return result
    }
  }
}