2010 Carisap Tennis Cup – Singles
Fabio Fognini was the defending champion, but chose not to play.
Carlos Berlocq won the final against Daniel Gimeno-Traver 6–3, 4–6, 6–4.
Singles | |
---|---|
2010 Carisap Tennis Cup | |
Champion | ![]() |
Runner-up | ![]() |
Final score | 6–3, 4–6, 6–4 |
Seeds
Pere Riba (Quarterfinals) Daniel Gimeno-Traver (Finals) Paolo Lorenzi (Quarterfinals) Albert Ramos-Viñolas (Semifinals) Adrian Ungur (Semifinals) Carlos Berlocq (Champion) Dušan Lojda (Quarterfinals) Martin Kližan (Quarterfinals)
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
Finals
Semifinals | Final | ||||||||||||
6 | ![]() | 7 | 6 | ||||||||||
4 | ![]() | 5 | 3 | ||||||||||
6 | ![]() | 6 | 4 | 6 | |||||||||
2/WC | ![]() | 3 | 6 | 4 | |||||||||
5 | ![]() | 2 | 2 | ||||||||||
2/WC | ![]() | 6 | 6 | ||||||||||
Top Half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
1 | ![]() | 7 | 6 | ||||||||||||||||||||||||
![]() | 5 | 4 | 1 | ![]() | 6 | 6 | |||||||||||||||||||||
![]() | 64 | 6 | 4 | ![]() | 2 | 1 | |||||||||||||||||||||
![]() | 7 | 2 | 6 | 1 | ![]() | 4 | 2 | ||||||||||||||||||||
WC | ![]() | 6 | 6 | 6 | ![]() | 6 | 6 | ||||||||||||||||||||
Q | ![]() | 1 | 3 | WC | ![]() | 0 | 3 | ||||||||||||||||||||
![]() | 3 | 1 | 6 | ![]() | 6 | 6 | |||||||||||||||||||||
6 | ![]() | 6 | 6 | 6 | ![]() | 7 | 6 | ||||||||||||||||||||
4 | ![]() | 7 | 62 | 6 | 4 | ![]() | 5 | 3 | |||||||||||||||||||
![]() | 62 | 7 | 0 | 4 | ![]() | 7 | 6 | ||||||||||||||||||||
![]() | 6 | 5 | 4 | ![]() | 63 | 2 | |||||||||||||||||||||
![]() | 3 | 7 | 6 | 4 | ![]() | 7 | 6 | ||||||||||||||||||||
![]() | 1 | 1 | 7 | ![]() | 5 | 4 | |||||||||||||||||||||
Q | ![]() | 6 | 6 | Q | ![]() | 0 | r | ||||||||||||||||||||
WC | ![]() | 4 | 4 | 7 | ![]() | 0 | |||||||||||||||||||||
7 | ![]() | 6 | 6 |
Bottom Half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
5 | ![]() | 6 | 6 | ||||||||||||||||||||||||
![]() | 4 | 4 | 5 | ![]() | 6 | 6 | |||||||||||||||||||||
Q | ![]() | 0 | 2 | ![]() | 1 | 1 | |||||||||||||||||||||
![]() | 6 | 6 | 5 | ![]() | 6 | 6 | |||||||||||||||||||||
![]() | 5 | 6 | 6 | 3 | ![]() | 4 | 1 | ||||||||||||||||||||
Q | ![]() | 7 | 3 | 2 | ![]() | 6 | 1 | 4 | |||||||||||||||||||
WC | ![]() | 2 | 4 | 3 | ![]() | 2 | 6 | 6 | |||||||||||||||||||
3 | ![]() | 6 | 6 | 5 | ![]() | 2 | 2 | ||||||||||||||||||||
8 | ![]() | 4 | 6 | 6 | 2/WC | ![]() | 6 | 6 | |||||||||||||||||||
![]() | 6 | 3 | 4 | 8 | ![]() | 7 | 6 | ||||||||||||||||||||
![]() | 5 | 4 | ![]() | 63 | 3 | ||||||||||||||||||||||
![]() | 7 | 6 | 8 | ![]() | 4 | 0 | |||||||||||||||||||||
![]() | 6 | 3 | 2 | 2/WC | ![]() | 6 | 6 | ||||||||||||||||||||
![]() | 3 | 6 | 6 | ![]() | 3 | 4 | |||||||||||||||||||||
LL | ![]() | 1 | 4 | 2/WC | ![]() | 6 | 6 | ||||||||||||||||||||
2/WC | ![]() | 6 | 6 |
gollark: Rust could really use F#'s `|>` operator.
gollark: This will, sadly, make my previously pleasantly pointfree-looking `fetch_page` function less so.
gollark: Great, apiodone.
gollark: I'm not sure about that one.
gollark: Fair, you could probably write something eldritch out with `JOIN`s, but my question was whether revisions should have UUIDs or just be identified only by a combination of timestamp and page.
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.