2000 Next Generation Adelaide International – Doubles
Gustavo Kuerten and Nicolás Lapentti were the defending champions, but did not participate this year.
Doubles | |
---|---|
2000 Next Generation Adelaide International | |
Champions | ![]() ![]() |
Runners-up | ![]() ![]() |
Final score | 6–4, 6–2 |
Todd Woodbridge and Mark Woodforde won the title, defeating Lleyton Hewitt and Sandon Stolle 6–4, 6–2 in the final.
Seeds
Todd Woodbridge / Mark Woodforde (Champions) Wayne Black / Kevin Ullyett (Quarterfinals) Andrew Kratzmann / Peter Tramacchi (First Round) Wayne Arthurs / Tim Henman (Semifinals)
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
Draw
First Round | Quarterfinals | Semifinals | Final | ||||||||||||||||||||||||
1 | ![]() ![]() | 6 | 6 | ||||||||||||||||||||||||
WC | ![]() ![]() | 4 | 3 | 1 | ![]() ![]() | 6 | 6 | ||||||||||||||||||||
![]() ![]() | 3 | 2 | Q | ![]() ![]() | 4 | 3 | |||||||||||||||||||||
Q | ![]() ![]() | 6 | 6 | 1 | ![]() ![]() | 0 | 6 | 6 | |||||||||||||||||||
3 | ![]() ![]() | 3 | 0 | ![]() ![]() | 6 | 4 | 1 | ||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 5 | 6 | 4 | |||||||||||||||||||||
![]() ![]() | 3 | 4 | ![]() ![]() | 7 | 4 | 6 | |||||||||||||||||||||
![]() ![]() | 6 | 6 | 1 | ![]() ![]() | 6 | 6 | |||||||||||||||||||||
WC | ![]() ![]() | 3 | 3 | ![]() ![]() | 4 | 2 | |||||||||||||||||||||
WC | ![]() ![]() | 6 | 6 | WC | ![]() ![]() | 3 | 2 | ||||||||||||||||||||
![]() ![]() | 77 | 2 | 63 | 4 | ![]() ![]() | 6 | 6 | ||||||||||||||||||||
4 | ![]() ![]() | 63 | 6 | 77 | 4 | ![]() ![]() | 61 | 77 | 1 | ||||||||||||||||||
![]() ![]() | 6 | 5 | 3 | ![]() ![]() | 77 | 65 | 6 | ||||||||||||||||||||
![]() ![]() | 2 | 7 | 6 | ![]() ![]() | 3 | 6 | 6 | ||||||||||||||||||||
![]() ![]() | 0 | 4 | 2 | ![]() ![]() | 6 | 3 | 4 | ||||||||||||||||||||
2 | ![]() ![]() | 6 | 6 |
gollark: > In theoretical computer science and formal language theory, a regular language (also called a rational language[1][2]) is a formal language that can be expressed using a regular expressionhow helpful.
gollark: As in "regular languages"? It's a CS thing, I don't actually know what it means.
gollark: *Regular* expressions can't do that.
gollark: Also the weird HTML5 thing where you can *sort of* self-close tags in tables and whatnot.
gollark: * attributes
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.