To clear my thoughts up a bit, that wasn't an "I'm too lazy to Google what these functions normally do" comment, but rather an "I believe proposals should provide as much context as possible about what you'd like to add along with the benefits of doing so" comment.<br><div class="gmail_quote"><div dir="ltr">On Sun, Jan 10, 2016 at 9:48 PM Seth Friedman <<a href="mailto:sethfri@gmail.com">sethfri@gmail.com</a>> wrote:<br></div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">I'm not familiar with any of the functions listed and would love to see more about them and their usefulness to Swift as part of the proposal.<br><br>Thanks!<br><br>Seth<br><div class="gmail_quote"><div dir="ltr">On Sat, Jan 9, 2016 at 5:30 PM Kevin Ballard via swift-evolution <<a href="mailto:swift-evolution@swift.org" target="_blank">swift-evolution@swift.org</a>> wrote:<br></div><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">Proposal PR submitted as <a href="https://github.com/apple/swift-evolution/pull/95" rel="noreferrer" target="_blank">https://github.com/apple/swift-evolution/pull/95</a><br>
<br>
-Kevin Ballard<br>
<br>
On Mon, Dec 28, 2015, at 03:59 PM, Kevin Ballard wrote:<br>
> ## Introduction<br>
><br>
> Add a few more functional sequence utilities to the standard library.<br>
><br>
> ## Motivation<br>
><br>
> We have map, filter, and reduce, but we're missing a bunch of useful utilities like scan, iterate, takeWhile, and dropWhile. Interestingly, the stdlib includes an implementation of scan in the doc comment for LazySequenceType, it just doesn't actually provide it as API.<br>
><br>
> ## Proposed solution<br>
><br>
> We extend SequenceType with 3 new methods scan, takeWhile, and dropWhile. We also add a single global function iterate.<br>
><br>
> ## Detailed design<br>
><br>
> We add the following extension to SequenceType:<br>
><br>
> extension SequenceType {<br>
> func scan<T>(initial: T, @noescape combine: (T, Self.Generator.Element) throws -> T) rethrows -> [T]<br>
> func dropWhile(@noescape dropElement: (Self.Generator.Element) throws -> Bool) rethrows -> [Self.Generator.Element]<br>
> func takeWhile(@noescape takeElement: (Self.Generator.Element) throws -> Bool) rethrows -> [Self.Generator.Element]<br>
> }<br>
><br>
> These all take functions, so to follow convention they're @noescape and return arrays. We also provide an extension of CollectionType that overrides a couple of these methods:<br>
><br>
> extension CollectionType {<br>
> func dropWhile(@noescape dropElement: (Self.Generator.Element) throws -> Bool) rethrows -> Self.SubSequence<br>
> func takeWhile(@noescape takeElement: (Self.Generator.Element) throws -> Bool) rethrows -> Self.SubSequence<br>
> }<br>
><br>
> We also provide lazy versions:<br>
><br>
> extension LazySequenceType {<br>
> func scan<T>(initial: T, combine: (T, Self.Generator.Element) -> T) -> LazyScanSequence<Self.Elements, T><br>
> func dropWhile(dropElement: (Self.Generator.Element) -> Bool) -> LazyDropWhileSequence<Self.Elements><br>
> func takeWhile(takeElement: (Self.Generator.Element) -> Bool) -> LazyTakeWhileSequence<Self.Elements><br>
> }<br>
><br>
> extension LazyCollectionType {<br>
> func dropWhile(dropElement: (Self.Generator.Element) -> Bool) -> LazyDropWhileCollection<Self.Elements><br>
> func takeWhile(takeElement: (Self.Generator.Element) -> Bool) -> LazyTakeWhileCollection<Self.Elements><br>
> }<br>
><br>
> No collection variant of scan is provided because that would require storing the last value in the index itself, which would cause problems if the combine function isn't pure.<br>
><br>
> LazyDropWhileCollection would behave similarly to LazyFilterCollection in that it runs the predicate against the elements to drop when accessing startIndex; unlike LazyFilterCollection, because there's nothing else to skip after that point, the index itself can actually be Self.Elements.Index (just like a slice). LazyTakeWhileCollection also runs the predicate against the first element when accessing startIndex, but it does need a unique index type (because endIndex has to be some sentinel value, as it doesn't know where the end is until you reach that point; this index type would therefore only conform to ForwardIndexType).<br>
><br>
> And finally, we provide a global function<br>
><br>
> func iterate<T>(initial: T, _ f: T -> T) -> IterateSequence<T><br>
><br>
> This function is inherently lazy and yields an infinite list of nested applications of the function, so iterate(x, f) yields a sequence like [x, f(x), f(f(x)), ...].<br>
><br>
> -Kevin Ballard<br>
_______________________________________________<br>
swift-evolution mailing list<br>
<a href="mailto:swift-evolution@swift.org" target="_blank">swift-evolution@swift.org</a><br>
<a href="https://lists.swift.org/mailman/listinfo/swift-evolution" rel="noreferrer" target="_blank">https://lists.swift.org/mailman/listinfo/swift-evolution</a><br>
</blockquote></div></blockquote></div>