2018 Silicon Valley Classic – Doubles

Abigail Spears and CoCo Vandeweghe were the defending champions, but chose not to participate this year.

Doubles
2018 Silicon Valley Classic
Champions Latisha Chan
Květa Peschke
Runners-up Lyudmyla Kichenok
Nadiia Kichenok
Final score6–4, 6–1
Draw15
Seeds4
Main article: 2018 Silicon Valley Classic

Latisha Chan and Květa Peschke won the title, defeating Lyudmyla and Nadiia Kichenok in the final, 6–4, 6–1.

Seeds
  1. Latisha Chan / Květa Peschke (Champions)
  2. Mihaela Buzărnescu / Heather Watson (Semifinals)
  3. Lyudmyla Kichenok / Nadiia Kichenok (Final)
  4. Miyu Kato / Makoto Ninomiya (Semifinals)

Draw

Key

Draw
First Round Quarterfinals Semifinals Final
1 L Chan
K Peschke 		w/o
V Cepede Royg
I Falconi 		4 1 S Kenin
A Sabalenka
S Kenin
A Sabalenka 		6 6 1 L Chan
K Peschke 		6 6
4 M Kato
M Ninomiya 		1 7 [10] 4 M Kato
M Ninomiya 		1 4
M Fręch
M Sanchez 		6 5 [4] 4 M Kato
M Ninomiya 		6 6
K Bondarenko
V Savinykh 		4 4 G García Pérez
P Hon 		4 2
G García Pérez
P Hon 		6 6 1 L Chan
K Peschke 		6 6
M Irigoyen
D Krawczyk 		3 3 3 L Kichenok
N Kichenok 		4 1
A Blinkova
N Dzalamidze 		6 6 A Blinkova
N Dzalamidze 		6 2 [6]
K Christian
S Santamaria 		6 3 [7] 3 L Kichenok
N Kichenok 		1 6 [10]
3 L Kichenok
N Kichenok 		4 6 [10] 3 L Kichenok
N Kichenok 		6 3 [10]
J Cako
N Geuer 		3 2 2 M Buzărnescu
H Watson 		4 6 [8]
J Konta
S Zhang 		6 6 J Konta
S Zhang 		5 2
WC T Culibrk
S Gauvain 		3 3 2 M Buzărnescu
H Watson 		7 6
2 M Buzărnescu
H Watson 		6 6
gollark: It only works if you also have GCC installed.
gollark: That's the compiler.
gollark: Yep!
gollark: ```python#!/usr/bin/env python3import argparseimport subprocessparser = argparse.ArgumentParser(description="Compile a WHY program")parser.add_argument("input", help="File containing WHY source code")parser.add_argument("-o", "--output", help="Filename of the output executable to make", default="./a.why")parser.add_argument("-O", "--optimize", help="Optimization level", type=int, default="0")args = parser.parse_args()def build_C(args): template = """#define QUITELONG long long intconst QUITELONG max = @max@;int main() { QUITELONG i = 0; while (i < max) { i++; } @code@} """ for k, v in args.items(): template = template.replace(f"@{k}@", str(v)) return templateinput = args.inputoutput = args.outputtemp = "ignore-this-please"with open(input, "r") as f: contents = f.read() looplen = max(1000, (2 ** -args.optimize) * 1000000000) code = build_C({ "code": contents, "max": looplen }) with open(temp, "w") as out: out.write(code)subprocess.run(["gcc", "-x", "c", "-o", output, temp])```
gollark: And *is* Haskell necessarily that fast?
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.