2016 Challenger La Manche – Doubles
Andreas Beck and Jan Mertl are the defending champions, but chose not to defend their title .
Doubles | |
---|---|
2016 Challenger La Manche | |
Champions | |
Runners-up | |
Final score | 4–6 , 6–3 , [10–6] |
Ken Skupski and Neal Skupski won the title, defeating Yoshihito Nishioka and Aldin Setkic in the final 4–6, 6–3, [10–6] .
Seeds
Ken Skupski / Neal Skupski (Champions) Johan Brunström / Frederik Nielsen (Quarterfinals) Dino Marcan / Divij Sharan (First round) Andrea Arnaboldi / Adrian Ungur (First round)
Draw
Key
- Q = Qualifier
- WC = Wild Card
- LL = Lucky Loser
- Alt = Alternate
- SE = Special Exempt
- PR = Protected Ranking
- ITF = ITF entry
- JE = Junior Exempt
- w/o = Walkover
- r = Retired
- d = Defaulted
First Round | Quarterfinals | Semifinals | Final | ||||||||||||||||||||||||
1 | 6 | 6 | |||||||||||||||||||||||||
3 | 4 | 1 | 6 | 78 | |||||||||||||||||||||||
WC | 5 | 77 | [10] | WC | 4 | 66 | |||||||||||||||||||||
WC | 7 | 61 | [2] | 1 | 7 | 6 | |||||||||||||||||||||
3 | 68 | 1 | 5 | 3 | |||||||||||||||||||||||
710 | 6 | 6 | 6 | ||||||||||||||||||||||||
WC | 5 | 77 | [10] | 1 | 4 | ||||||||||||||||||||||
7 | 65 | [12] | 1 | 4 | 6 | [10] | |||||||||||||||||||||
5 | 6 | [8] | 6 | 3 | [6] | ||||||||||||||||||||||
7 | 3 | [10] | 3 | 3 | |||||||||||||||||||||||
6 | 6 | 6 | 6 | ||||||||||||||||||||||||
4 | 2 | 0 | 5 | 6 | [7] | ||||||||||||||||||||||
4 | 6 | [10] | 7 | 4 | [10] | ||||||||||||||||||||||
6 | 4 | [5] | 7 | 6 | |||||||||||||||||||||||
3 | 66 | 2 | 5 | 3 | |||||||||||||||||||||||
2 | 6 | 78 |
gollark: Why wouldn't they?
gollark: I don't see how it isn't. Those are actual Haskell typeclasses. My view on FP is mostly that it has many nice ideas but probably should not be followed all the way to zygohistomorphic prepromorphisms.
gollark: It fundamentally cannot work, but companies seem determined to try.
gollark: javascript_irl
gollark: I don't really know how to look at any traffic which it might be trying to send other than tcpdump (which works for non-TCP things also).
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.