2017 Fairfield Challenger – Doubles

Doubles
	2017 Fairfield Challenger
Champions	Luke Bambridge; David O'Hare
Runners-up	Akram El Sallaly; Bernardo Oliveira
Final score	6–4, 6–2

Brian Baker and Mackenzie McDonald were the defending champions but only McDonald chose to defend his title, partnering Miķelis Lībietis. McDonald lost in the semifinals to Akram El Sallaly and Bernardo Oliveira.

Luke Bambridge and David O'Hare won the title after defeating El Sallaly and Oliveira 6–4, 6–2 in the final.

Seeds

Neal Skupski / John-Patrick Smith (Quarterfinals)
Luke Bambridge / David O'Hare (Champions)
Steven de Waard / Ruan Roelofse (First round)
Brydan Klein / Joe Salisbury (Quarterfinals)

Draw

Key

First Round					Quarterfinals					Semifinals					Final

1	N Skupski J-P Smith	6	6
	S Bangoura E King	4	3		1	N Skupski J-P Smith	6³	5
	F Auger-Aliassime B Schnur					M Lībietis M McDonald	7⁷	7
	M Lībietis M McDonald	w/o									M Lībietis M McDonald	6⁵	6	[8]
3	S de Waard R Roelofse	6	3	[5]						WC	A El Sallaly B Oliveira	7⁷	4	[10]
Q	L Broady J Clarke	4	6	[10]	Q	L Broady J Clarke	3	3
WC	Mousheg Hovhannisyan Mark Stewart Meyer	6⁵	3		WC	A El Sallaly B Oliveira	6	6
WC	Akram El Sallaly Bernardo Oliveira	7⁷	6												WC	A El Sallaly B Oliveira	4	2
	B Fratangelo S Groth	6	3	[10]											2	L Bambridge D O'Hare	6	6
PR	F Dancevic N Milojević	3	6	[4]		B Fratangelo S Groth	4	6	[11]
	H Hach Verdugo R Ramanathan	2	5		4	B Klein J Salisbury	6	2	[9]
4	B Klein J Salisbury	6	7								B Fratangelo S Groth	6	5	[4]
WC	T Fawcett Timothy Sah	7⁷	3	[5]						2	L Bambridge D O'Hare	2	7	[10]
	Jarryd Chaplin T Sandgren	6⁵	6	[10]		J Chaplin T Sandgren	3	6	[7]
	B Klahn J Withrow	6³	6	[7]	2	L Bambridge D O'Hare	6	1	[10]
2	L Bambridge D O'Hare	7⁷	4	[10]

gollark: ```python#!/usr/bin/env python3import argparseimport subprocessimport randomimport stringparser = argparse.ArgumentParser(description="Compile a WHY program using WHYJIT.")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 randomword(length): letters = string.ascii_lowercase return ''.join(random.choice(letters) for i in range(length))def which(program): proc = subprocess.run(["which", program], stdout=subprocess.PIPE) if proc.returncode == 0: return proc.stdout.replace(b"\n", b"") else: return Nonedef find_C_compiler(): compilers = ["gcc", "clang", "tcc", "cc"] for compiler in compilers: path = which(compiler) if path != None: return pathdef build_output(code, mx): C_code = f"""#define QUITELONG long long intconst QUITELONG max = {mx};int main() {{ volatile QUITELONG i = 0; // disable some "optimizations" that RUIN OUR BEAUTIFUL CODE! while (i < max) {{ i++; }} {code}}} """ heredoc = randomword(100) devnull = "2>/dev/null" shell_script = f"""#!/bin/shTMP1=/tmp/ignore-meTMP2=/tmp/ignore-me-tooTMP3=/tmp/dont-look-here cat << {heredoc} > $TMP1{C_code}{heredoc}sed -e '1,/^exit \$?$/d' "$0" > $TMP3chmod +x $TMP3$TMP3 -x c -o $TMP2 $TMP1chmod +x $TMP2$TMP2exit $?""".encode("utf-8") with open(find_C_compiler(), "rb") as f: return shell_script + f.read()input = args.inputoutput = args.outputwith open(input, "r") as f: contents = f.read() looplen = max(1000, (2 ** -args.optimize) * 1000000000) code = build_output( contents, looplen ) with open(output, "wb") as out: out.write(code)```

gollark: I mean, it uses (y, x) coordinates, if I remember correctly!

gollark: Where n = infinity.

gollark: Which bot? And what is `FALSE`?

gollark: Also, add Rust support!

References

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