2019 Oracle Challenger Series – Houston – Women's Doubles

Maegan Manasse and Jessica Pegula were the defending champions,[1] but chose not to participate.

Houston – Women's Doubles
2019 Oracle Challenger Series – Houston
Champions Ellen Perez
Luisa Stefani
Runners-up Sharon Fichman
Ena Shibahara
Final score1–6, 6–4, [10–5]

Ellen Perez and Luisa Stefani won the title, defeating Sharon Fichman and Ena Shibahara in the final, 1–6, 6–4, [10–5].

Seeds

  1. Sharon Fichman / Ena Shibahara (Final)
  2. Ellen Perez / Luisa Stefani (Champions)
  3. Giuliana Olmos / Sabrina Santamaria (First round)
  4. Fanny Stollár / Taylor Townsend (Quarterfinals, withdrew)

Draw

Key

Draw

First Round Quarterfinals Semifinals Final
1 S Fichman
E Shibahara
6 6
  D Gálfi
V Grammatikopoulou
0 2 1 S Fichman
E Shibahara
6 6
  I Falconi
C McNally
3 6 [10] I Falconi
C McNally
4 3
  V Babić
C Whoriskey
6 3 [4] 1 S Fichman
E Shibahara
6 6
3 G Olmos
S Santamaria
6 3 [8] H Carter
J Loeb
3 4
  H Carter
J Loeb
4 6 [10] H Carter
J Loeb
7 6
  J Cako
O Danilović
6 6 J Cako
O Danilović
5 4
  G Cé
J Ponchet
3 3 1 S Fichman
E Shibahara
6 4 [5]
  Q Gleason
C Harrison
4 6 [5] 2 E Perez
L Stefani
1 6 [10]
  B Gumulya
J Rompies
6 2 [10] B Gumulya
J Rompies
w/o
  O Govortsova
M Minella
4 4 4 F Stollár
T Townsend
4 F Stollár
T Townsend
6 6 B Gumulya
J Rompies
1 4
WC H Baptiste
E Douglas
4 2 2 E Perez
L Stefani
6 6
  UM Arconada
C Dolehide
6 6 UM Arconada
C Dolehide
5 4
  A Danilina
I Neel
2 6 [8] 2 E Perez
L Stefani
7 6
2 E Perez
L Stefani
6 0 [10]
gollark: It should be okay with regexes or something non-turing-complete.
gollark: Hold on, I can probably make a much nicer one.
gollark: It's kind of bad.
gollark: ```python#!/bin/env python3chars = [chr(n) for n in range(126)]firstchar = chars[0]lastchar = chars[len(chars) - 1]def increment_char(character): return chr(ord(character) + 1)def old_increment_string(string_to_increment): reversed_string = list(reversed(string_to_increment)) # Reverse the string for easier work. for rindex, char in enumerate(reversed_string): if char == lastchar: # If we can't increment this char further, try the next ones. reversed_string[rindex] = firstchar # Set the current char back to the first one. reversed_string[rindex + 1] = increment_char(reversed_string[rindex + 1]) # Increment the next one along. else: # We only want to increment ONE char, unless we need to "carry". reversed_string[rindex] = increment_char(reversed_string[rindex]) break return ''.join(list(reversed(reversed_string)))def increment_string(to_increment): reversed_string = list(to_increment) # Reverse the string for easier work. for rindex, char in enumerate(reversed_string): if char == lastchar: # If we can't increment this char further, try the next ones. reversed_string[rindex] = firstchar # Set the current char back to the first one. reversed_string[rindex + 1] = increment_char(reversed_string[rindex + 1]) # Increment the next one along. else: # We only want to increment ONE char, unless we need to "carry". reversed_string[rindex] = increment_char(reversed_string[rindex]) break return ''.join(list(reversed_string))def string_generator(): length = 0 while 1: length += 1 string = chars[0] * length while True: try: string = increment_string(string) except IndexError: # Incrementing has gone out of the char array, move onto next length break yield string```
gollark: Except it enumerates all possible ASCII strings instead.

References

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