/
SpelledDyad.swift
51 lines (39 loc) · 1.38 KB
/
SpelledDyad.swift
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
//
// SpelledDyad.swift
// SpelledPitch
//
// Created by James Bean on 5/12/16.
//
//
import Algorithms
/// Dyad of `SpelledPitch` values.
public struct SpelledDyad {
// MARK: - Instance Properties
/// Lower of the two `SpelledPitch` values.
public let lower: SpelledPitch
/// Higher of the two `SpelledPitch` values.
public let higher: SpelledPitch
/// - returns: Relative named interval, which does not ordering of `SpelledPitch` values
/// contained herein.
public var relativeInterval: NamedUnorderedInterval {
// TODO: Make convenience init
let lowerSPC = SpelledPitchClass(lower.pitch.class, lower.spelling)
let higherSPC = SpelledPitchClass(higher.pitch.class, higher.spelling)
return NamedUnorderedInterval(lowerSPC, higherSPC)
}
/// - returns: Absolute named interval, which honors ordering of `SpelledPitch` values
/// contained herein.
//
// FIXME: Implement
public var absoluteInterval: NamedOrderedInterval {
fatalError()
}
// MARK: - Initializers
/// Create a `SpelledDyad` with two `SpelledPitch` values.
public init(_ lower: SpelledPitch, _ higher: SpelledPitch) {
let (lower, higher) = ordered(lower, higher)
self.lower = lower
self.higher = higher
}
}
extension SpelledDyad: Equatable, Hashable { }