2018 LTP Charleston Pro Tennis – Singles
Madison Brengle was the defending champion but lost in the final to Taylor Townsend, 0–6 4–6.
Singles | |
---|---|
2018 LTP Charleston Pro Tennis | |
Champion | ![]() |
Runner-up | ![]() |
Final score | 6–0, 6–4 |
Seeds
Madison Brengle (Final) Taylor Townsend (Champion) Mariana Duque Mariño (Second round) Nicole Gibbs (Second round) Kristie Ahn (First round) Anhelina Kalinina (Second round) Jamie Loeb (Quarterfinals) Irina Falconi (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 | ||||||||||||
1 | ![]() | 6 | 6 | ||||||||||
Q | ![]() | 1 | 1 | ||||||||||
1 | ![]() | 0 | 4 | ||||||||||
2 | ![]() | 6 | 6 | ||||||||||
Q | ![]() | 4 | 1 | ||||||||||
2 | ![]() | 6 | 6 | ||||||||||
Top half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
1 | ![]() | 6 | 7 | ||||||||||||||||||||||||
![]() | 0 | 5 | 1 | ![]() | 5 | 6 | 6 | ||||||||||||||||||||
![]() | 6 | 6 | ![]() | 7 | 4 | 3 | |||||||||||||||||||||
WC | ![]() | 2 | 4 | 1 | ![]() | 77 | 7 | ||||||||||||||||||||
![]() | 3 | 2 | PR | ![]() | 62 | 5 | |||||||||||||||||||||
PR | ![]() | 6 | 6 | PR | ![]() | 6 | 7 | ||||||||||||||||||||
![]() | 2 | 5 | 6 | ![]() | 2 | 5 | |||||||||||||||||||||
6 | ![]() | 6 | 7 | 1 | ![]() | 6 | 6 | ||||||||||||||||||||
3 | ![]() | 6 | 6 | Q | ![]() | 1 | 1 | ||||||||||||||||||||
![]() | 3 | 1 | 3 | ![]() | 4 | 2 | |||||||||||||||||||||
Q | ![]() | 6 | 6 | Q | ![]() | 6 | 6 | ||||||||||||||||||||
WC | ![]() | 0 | 2 | Q | ![]() | 6 | 6 | ||||||||||||||||||||
![]() | 2 | 65 | 8 | ![]() | 3 | 1 | |||||||||||||||||||||
![]() | 6 | 77 | ![]() | 77 | 5 | 0 | |||||||||||||||||||||
Q | ![]() | 0 | 2 | 8 | ![]() | 65 | 7 | 6 | |||||||||||||||||||
8 | ![]() | 6 | 6 |
Bottom half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
7 | ![]() | 6 | 6 | ||||||||||||||||||||||||
WC | ![]() | 3 | 2 | 7 | ![]() | 2 | 6 | 7 | |||||||||||||||||||
![]() | 64 | 0 | WC | ![]() | 6 | 4 | 5 | ||||||||||||||||||||
WC | ![]() | 77 | 6 | 7 | ![]() | 65 | 0 | ||||||||||||||||||||
![]() | 3 | 2 | Q | ![]() | 77 | 6 | |||||||||||||||||||||
Q | ![]() | 6 | 6 | Q | ![]() | 6 | 6 | ||||||||||||||||||||
Q | ![]() | 3 | 65 | 4 | ![]() | 0 | 1 | ||||||||||||||||||||
4 | ![]() | 6 | 77 | Q | ![]() | 4 | 1 | ||||||||||||||||||||
5 | ![]() | 1 | 1 | 2 | ![]() | 6 | 6 | ||||||||||||||||||||
JE | ![]() | 6 | 6 | JE | ![]() | 77 | 6 | ||||||||||||||||||||
![]() | 5 | 4 | ![]() | 65 | 0 | ||||||||||||||||||||||
![]() | 7 | 6 | JE | ![]() | 0 | 6 | 5 | ||||||||||||||||||||
![]() | 6 | 6 | 2 | ![]() | 6 | 1 | 7 | ||||||||||||||||||||
![]() | 4 | 2 | ![]() | 0 | 3 | ||||||||||||||||||||||
![]() | 3 | 2 | 2 | ![]() | 6 | 6 | |||||||||||||||||||||
2 | ![]() | 6 | 6 |
gollark: That's how you would do it in my thing, using a somewhat insane S-expression assembly-ish language.
gollark: Using hypothetical assembly syntax I haven't actually implemented:```# start of memory to add kittens to(add r1 r0 0x1000) # maybe there would be nice dedicated syntax for "set register" actually# end of kittenized region(add r2 r0 0x1600)(label loop (add r3 r0 40) (poke r3 r1 0) (add r3 r0 94) (poke r3 r1 1) # and so on (add r1 r1 8) (jlt r1 r2 loop))```
gollark: To create RAM kittens, all you need to do is `ADD` the ASCII value of each character into a temporary register, `POKE` them into the right memory location (using the per-instruction `POKE` offset, probably), and then do that in a loop.
gollark: I should probably implement arithmetic instructions then a basic assembler, I guess, because hand-writing machine code is unpleasant.
gollark: What? No. This doesn't really need jumps, except possibly to run it repeatedly.
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.