2013 Wimbledon Championships – Gentlemen's Invitation Doubles

Draw

References

Key

Final

Group A

Group B

Gentlemen's Invitation Doubles
	2013 Wimbledon Championships
Champions	Thomas Enqvist ; Mark Philippoussis
Runners-up	Greg Rusedski ; Fabrice Santoro
Final score	7–6(8–6), 6–3

Thomas Enqvist and Mark Philippoussis defeated the defending champions Greg Rusedski and Fabrice Santoro in the final, 6–7^(6–8), 3–6 to win the Gentlemen's Invitation Doubles tennis title at the 2013 Wimbledon Championships.

	Björkman Woodbridge	Gimelstob Martin	Krajicek Petchey	Rusedski Santoro	RR W–L	Set W–L	Game W–L	Standings
Jonas Björkman Todd Woodbridge		6–3, 2–6, [10–12]	7–6^(7–1), 6–2	3–6, 6–7^(4–7)	1–2	3–4	30–31	3
Justin Gimelstob Todd Martin	3–6, 6–2, [12–10]		6–1, 6–4	1–6, 6–4, [10–12]	2–1	5–3	29–24	2
Richard Krajicek Mark Petchey	6–7^(1–7), 2–6	1–6, 4–6		w/o	0–3	0–4	13–25	4
Greg Rusedski Fabrice Santoro	6–3, 7–6^(7–4)	6–1, 4–6, [12–10]	w/o		3–0	4–1	24–16	1

Standings are determined by: 1) Number of wins; 2) Number of matches; 3) In two-players-ties, head-to-head records; 4) In three-players-ties, percentage of sets won, or of games won; 5) Steering Committee decision.

	Eltingh Haarhuis	Enqvist Philippoussis	Ferreira Wilkinson	Cowan Pioline	RR W–L	Set W–L	Game W–L	Standings
Jacco Eltingh Paul Haarhuis		4–6, 4–6	6–3, 7–6^(7–3)	7–6^(7–2), 6–2	2–1	4–2	34–29	2
Thomas Enqvist Mark Philippoussis	6–4, 6–4		6–4, 6–4	6–4, 6–4	3–0	6–0	36–24	1
Wayne Ferreira Chris Wilkinson	3–6, 6–7^(3–7)	4–6, 4–6		4–6, 2–6	0–3	0–6	17–25	4
Barry Cowan Cédric Pioline	6–7^(2–7), 2–6	4–6, 4–6	6–4, 6–2		1–2	2–4	16–25	3

Standings are determined by: 1) Number of wins; 2) Number of matches; 3) In two-players-ties, head-to-head records; 4) In three-players-ties, percentage of sets won, or of games won; 5) Steering Committee decision.

gollark: Extra friction with creating types discourages good practice in the form of creating dedicated sensible types where necessary.

gollark: In Java if you want to declare a new type to store some data and have equality and hashing and whatnot, it's horrible and complex and you can't even do operator overloading.

gollark: I mean, in sane languages if you want to declare a new type you can do `data Bees = Bees Int String deriving (Show, Eq)` or whatever.

gollark: It's harder to understand if it's verbose and whatnot.

gollark: ... being... sane?

Greg Rusedski
Fabrice Santoro

Thomas Enqvist
Mark Philippoussis

Draw

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.