2019 Internazionali di Tennis di Manerbio – Trofeo Dimmidisì

The 2019 Internazionali di Tennis di Manerbio – Trofeo Dimmidisì was a professional tennis tournament played on clay courts. It was the seventeenth edition of the tournament which was part of the 2019 ATP Challenger Tour. It took place in Manerbio, Italy between 5 and 11 August 2019.

2019 Internazionali di Tennis di Manerbio – Trofeo Dimmidisì
Date5 – 11 August
Edition17th
LocationManerbio, Italy
Champions
Singles
Federico Gaio
Doubles
Fabrício Neis / Fernando Romboli

Singles main draw entrants

Seeds

Country Player Rank1 Seed
 ITA Paolo Lorenzi 114 1
 ITA Lorenzo Giustino 131 2
 BEL Kimmer Coppejans 133 3
 ARG Federico Coria 165 4
 ITA Federico Gaio 175 5
 SRB Nikola Milojević 180 6
 CRO Viktor Galović 221 7
 ITA Andrea Arnaboldi 225 8
 EGY Mohamed Safwat 235 9
 POR Gonçalo Oliveira 251 10
 CRO Nino Serdarušić 269 11
 POR Frederico Ferreira Silva 273 12
 RUS Pavel Kotov 287 13
 USA Evan King 301 14
 CHI Alejandro Tabilo 304 15
 ARG Andrea Collarini 305 16
  • 1 Rankings are as of 29 July 2019.[1]

Other Entrants

The following players received wildcards into the singles main draw:

The following players received entry into the singles main draw using protected rankings:

The following players received entry into the singles main draw as using their ITF World Tennis Ranking:

The following players received entry from the qualifying draw:

The following player received entry as a lucky loser:

  • Nikola Čačić

Champions

Singles

Doubles

gollark: Fiiiiine.
gollark: I agree. It's precisely [NUMBER OF AVAILABLE CPU THREADS] parallelized.
gollark: > While W is busy with a, other threads might come along and take b from its queue. That is called stealing b. Once a is done, W checks whether b was stolen by another thread and, if not, executes b itself. If W runs out of jobs in its own queue, it will look through the other threads' queues and try to steal work from them.
gollark: > Behind the scenes, Rayon uses a technique called work stealing to try and dynamically ascertain how much parallelism is available and exploit it. The idea is very simple: we always have a pool of worker threads available, waiting for some work to do. When you call join the first time, we shift over into that pool of threads. But if you call join(a, b) from a worker thread W, then W will place b into its work queue, advertising that this is work that other worker threads might help out with. W will then start executing a.
gollark: >

References

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