Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[WIP - discussion] - Alternate Method of Seq.map chaining #2 #1566

Closed
wants to merge 39 commits into from

Conversation

manofstick
Copy link
Contributor

@liboz in #1528 introduced a method of chaining consecutive map statements, this is a bit more general approach which allows combining both filter and map, hopefully making it a bit more useful.

It could be extended to a range of other functions as well, as well as potentially more efficent generators (i.e. indexing through an array etc.)

Anway, feel like I'm bombing the PRs, without finishing off things. Sorry about that. But if you think any of them are actually wanted, then nag me for that one, and then I'll have more inspiration to complete it.

liboz and others added 7 commits August 31, 2016 13:45
…elease. 2. remove a couple of reference tests that were flaky on many platforms due to a dependence on specific VS installation options. 3. Update a test that was relient on an installation of .Net 2.0
A generalized version, with a bit more flexible composition, of dotnet#1528.
@manofstick
Copy link
Contributor Author

Sorry all, looks like my git skills are letting me down again. I tried to pick an earlier spot to go from, as I'm having problems with nuget and VisualCppTools, but looks like the file list is just bad... Anyway, the files changed seems to be correct...

@manofstick
Copy link
Contributor Author

I've reworked this, and going to branch from a cleaner spot. So killing this PR.

@manofstick manofstick closed this Sep 28, 2016
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

8 participants