2018 Australian Open – Wheelchair Quad Singles
Dylan Alcott, the three-time defending champion, successfully defended his title, defeating David Wagner in the final, 7–6(7–1), 6–1.
| Wheelchair Quad Singles | |
|---|---|
| 2018 Australian Open | |
| Champion | .svg.png){kind=small} |
| Runner-up |  |
| Final score | 7–6(7–1), 6–1 |
Seeds
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
Final
| Final | ||||||
| 1 | | 61 | 1 | |||
| 77 | 6 | ||||
Round Robin
|
|
|
|
RR W–L |
Set W–L |
Game W–L |
Standings | ||
| 1 | |
6–4, 6–7(4–7), 6–4 | 6–3, 6–2 | w/o | 3–0 | 4–1 | 30–20 | 1 | |
|
4–6, 7–6(7–4), 4–6 | 6–2, 6–0 | 6–1, 6–0 | 2–1 | 5–2 | 39–21 | 2 | ||
| WC | |
3–6, 2–6 | 2–6, 0–6 | 6–2, 6–1 | 1–2 | 2–4 | 19–27 | 3 | |
| 2 | |
w/d | 1–6, 0–6 | 2–6, 1–6 | 0–3 | 0–4 | 4–24 | 4 |
gollark: SmallVec, quite possibly.
gollark: A vector for every node is *probably* suboptimal?
gollark: The closest you're likely to get is some specialized DSLs and Haskell making it one line.
gollark: ```ruststruct Tree<T> { thing: T, children: Vec<Tree<T>>}```to be apiologically inelegant about it.
gollark: It's not *that* hard in either, is it?
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.