Sem Verbeek
Sem Verbeek (born 12 April 1994) is a Dutch tennis player.
Country (sports) | ![]() |
---|---|
Born | Amsterdam, Netherlands | 12 April 1994
Height | 1.93 m (6 ft 4 in) |
Plays | Left-handed (two-handed backhand) |
Prize money | $72,269 |
Singles | |
Career record | 0–0 |
Career titles | 0 0 Challenger, 0 Futures |
Highest ranking | No. 531 (15 April 2019) |
Current ranking | No. 856 (16 March 2020) |
Doubles | |
Career record | 1–1 |
Career titles | 0 1 Challenger, 17 Futures |
Highest ranking | No. 128 (9 March 2020) |
Current ranking | No. 128 (16 March 2020) |
Last updated on: 22 March 2020. |
Verbeek has a career high ATP singles ranking of 531 achieved on 15 April 2019. He also has a career high doubles ranking of 128 achieved on 9 March 2020.
Verbeek won his first ATP Challenger doubles title at the 2018 Winnipeg National Bank Challenger.
Challenger and Futures finals
Doubles: 31 (21–10)
|
|
Result | W–L | Date | Tournament | Tier | Surface | Partner | Opponents | Score |
---|---|---|---|---|---|---|---|---|
Loss | 0–1 | Oct 2016 | USA F33, Berkeley | Futures | Hard | ![]() |
![]() ![]() |
4–6, 3–6 |
Win | 1–1 | Dec 2016 | Israel F16, Ramat Gan | Futures | Hard | ![]() |
![]() ![]() |
6–4, 6–4 |
Win | 2–1 | Feb 2017 | Egypt F5, Sharm El Sheikh | Futures | Hard | ![]() |
![]() ![]() |
3–6, 6–3, [10–3] |
Win | 3–1 | Feb 2017 | Egypt F6, Sharm El Sheikh | Futures | Hard | ![]() |
![]() ![]() |
6–3, 6–2 |
Win | 4–1 | Apr 2017 | Bahrain F2, Manama | Futures | Hard | ![]() |
![]() ![]() |
6–3, 6–0 |
Win | 5–1 | Apr 2017 | Qatar F1, Doha | Futures | Hard | ![]() |
![]() ![]() |
6–4, 6–7(5–7), [10–7] |
Loss | 5–2 | Apr 2017 | Qatar F3, Doha | Futures | Hard | ![]() |
![]() ![]() |
6–1, 3–3 ret. |
Win | 6–2 | May 2017 | Singapore F1, Singapore | Futures | Hard | ![]() |
![]() ![]() |
6–3, 6–2 |
Win | 7–2 | Jun 2017 | Singapore F2, Singapore | Futures | Hard | ![]() |
![]() ![]() |
6–3, 6–4 |
Win | 8–2 | Jun 2017 | Singapore F3, Singapore | Futures | Hard | ![]() |
![]() ![]() |
7–6(7–3), 6–2 |
Loss | 8–3 | Jul 2017 | Netherlands F3, Middelburg | Futures | Clay | ![]() |
![]() ![]() |
2–6, 1–6 |
Loss | 8–4 | Aug 2017 | Romania F10, Bucharest | Futures | Clay | ![]() |
![]() ![]() |
5–7, 6–7(1–7) |
Loss | 8–5 | Oct 2017 | Australia F7, Cairns | Futures | Hard | ![]() |
![]() ![]() |
2–6, 6–2, [2–10] |
Win | 9–5 | Dec 2017 | Dominican Republic F2, Santo Domingo Este | Futures | Hard | ![]() |
![]() ![]() |
7–5, 6–4 |
Win | 10–5 | Dec 2017 | Dominican Republic F3, Santo Domingo Este | Futures | Hard | ![]() |
![]() ![]() |
6–3, 6–4 |
Win | 11–5 | Mar 2018 | USA F7, Bakersfield | Futures | Hard | ![]() |
![]() ![]() |
7–6(7–2), 6–3 |
Loss | 11–6 | Mar 2018 | USA F8, Calabasas | Futures | Hard | ![]() |
![]() ![]() |
2–6, 6–7(3–7) |
Win | 12–6 | Apr 2018 | Tunisia F16, Jerba | Futures | Hard | ![]() |
![]() ![]() |
6–3, 6–1 |
Win | 13–6 | May 2018 | Tunisia F17, Jerba | Futures | Hard | ![]() |
![]() ![]() |
7–5, 6–3 |
Win | 14–6 | May 2018 | Tunisia F18, Jerba | Futures | Hard | ![]() |
![]() ![]() |
6–2, 6–4 |
Win | 15–6 | Jun 2018 | USA F13, Winston-Salem | Futures | Hard | ![]() |
![]() ![]() |
7–6(9–7), 6–1 |
Win | 16–6 | Jul 2018 | Canada F5, Saskatoon | Futures | Hard | ![]() |
![]() ![]() |
6–3, 6–3 |
Win | 17–6 | Jul 2018 | Winnipeg, Canada | Challenger | Hard | ![]() |
![]() ![]() |
6–7(5–7), 6–3, [14–12] |
Win | 18–6 | Aug 2018 | Portugal F16, Sintra | Futures | Hard | ![]() |
![]() ![]() |
6–3, 6–0 |
Loss | 18–7 | Jan 2019 | Nouméa, New Caledonia | Challenger | Hard | ![]() |
![]() ![]() |
5–7, 4–6 |
Loss | 18–8 | Jan 2019 | Canberra, Australia | Challenger | Hard | ![]() |
![]() ![]() |
6–3, 4–6, [3–10] |
Win | 19–8 | Jul 2019 | Granby, Canada | Challenger | Hard | ![]() |
![]() ![]() |
6–2, 6–4 |
Win | 20–8 | Sep 2019 | Cassis, France | Challenger | Hard | ![]() |
![]() ![]() |
7–6(8–6), 4–6, [11–9] |
Loss | 20-9 | Oct 2019 | Fairfield, USA | Challenger | Hard | ![]() |
![]() ![]() |
4-6, 6-3, [10-12] |
Loss | 20-10 | Nov 2019 | Knoxville, USA | Challenger | Hard (i) | ![]() |
![]() ![]() |
6-7(6-8), 6-4, [5-10] |
Win | 21–10 | Jan 2020 | Burnie, Australia | Challenger | Hard | ![]() |
![]() ![]() |
7–6(7–5), 7–6(7–4) |
gollark: As well as having special casing for stuff, it often is just pointlessly hostile to abstracting anything:- lol no generics- you literally cannot define a well-typed `min`/`max` function (like Lua has). Unless you do something weird like... implement an interface for that on all the builtin number types, and I don't know if it would let you do that.- no map/filter/reduce stuff- `if err != nil { return err }`- the recommended way to map over an array in parallel, if I remember right, is to run a goroutine for every element which does whatever task you want then adds the result to a shared "output" array, and use a WaitGroup thingy to wait for all the goroutines. This is a lot of boilerplate.
gollark: It also does have the whole "anything which implements the right functions implements an interface" thing, which seems very horrible to me as a random change somewhere could cause compile errors with no good explanation.
gollark: - `make`/`new` are basically magic- `range` is magic too - what it does depends on the number of return values you use, or something. Also, IIRC user-defined types can't implement it- Generics are available for all of, what, three builtin types? Maps, slices and channels, if I remember right.- `select` also only works with the built-in channels- Constants: they can only be something like four types, and what even is `iota` doing- The multiple return values can't be used as tuples or anything. You can, as far as I'm aware, only return two (or, well, more than one) things at once, or bind two returns to two variables, nothing else.- no operator overloading- it *kind of* has exceptions (panic/recover), presumably because they realized not having any would be very annoying, but they're not very usable- whether reading from a channel is blocking also depends how many return values you use because of course
gollark: What, you mean no it doesn't have weird special cases everywhere?
gollark: It pretends to be "simple", but it isn't because there are bizarre special cases everywhere to make stuff appear to work.
External links
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.