struct RangedTerm { typealias Term = Cofree> let term: Term let source: String } struct UnannotatedTerm { typealias Term = Cofree let term: Term static let indexed = (prefix: "[\n\t", separator: ",\n\t", suffix: "\n]") static let keyed = (prefix: "[\n\t", separator: ",\n\t", suffix: "\n}") var source: String { let indexed = UnannotatedTerm.indexed let keyed = UnannotatedTerm.keyed return term.cata { switch $0 { case let .Leaf(s): return s case let .Indexed(s): return indexed.prefix + s.joinWithSeparator(indexed.separator) + indexed.suffix case let .Keyed(s): return keyed.prefix + s.map { "\"\($0)\": \($1)" }.joinWithSeparator(keyed.separator) + keyed.suffix } } } var ranged: Cofree> { let indexed = UnannotatedTerm.indexed let keyed = UnannotatedTerm.keyed return term.cata { switch $0 { case let .Leaf(s): return Cofree(0..>] = [] for value in i { if results.count > 0 { length += indexed.separator.characters.count } results.append(value.map { ($0.startIndex + length)..<($0.endIndex + length) }) length += value.extract.count } return Cofree(0..<(length + indexed.suffix.characters.count), .Indexed(results)) case let .Keyed(k): var length = keyed.prefix.characters.count var results: [(String, Cofree>)] = [] for (key, value) in k { if results.count > 0 { length += keyed.separator.characters.count } results.append((key, value.map { ($0.startIndex + length)..<($0.endIndex + length) })) length += value.extract.count + 4 // for the characters around the key } return Cofree(0..<(length + keyed.suffix.characters.count), .Keyed(Dictionary(elements: results))) } } } var arranged: RangedTerm { let source = self.source return RangedTerm( term: ranged.map { source.startIndex.advancedBy($0.startIndex).. { let leaf: Gen = String.arbitrary.fmap { Term((), .Leaf($0)) } let indexed: Gen = Gen.sized { n in Gen.choose((0, n)).bind { n in sequence((0.. = Gen.sized { n in Gen.choose((0, n)).bind { n in sequence((0.. { return UnannotatedTerm.arbitrary.fmap { $0.arranged } } } @testable import Doubt import Prelude import SwiftCheck