Harry Grimshaw (jockey)

Harry or Henry Grimshaw (1841 - 1866) was an English jockey, most famous for winning the British Triple Crown in 1865 on Gladiateur.

Harry Grimshaw
OccupationJockey
Born1841
Died4 October 1866
Major racing wins
Major races
2,000 Guineas Stakes (1865)
Epsom Derby (1865)
St Leger (1865)
Significant horses
Gladiateur

He was born in Lancashire and became apprentice to John Osborne. He was a competent jockey, but suffered from being short-sighted.[1] He married Osborne's daughter at Middleham, North Yorkshire.

For Osborne, he won the 1859 Cambridgeshire on Red Eagle. In 1862, he left Middleham for Newmarket and became jockey to Count Frédéric de Lagrange at the stables of Thomas Jennings. This meant he took the ride on Lagrange's Gladiateur in the Classics of 1865, all of which he won, becoming only the second man, after Frank Butler, to win the Triple Crown.

The following year, on 4 October, he was killed when the trap in which he was travelling home to Newmarket overturned in the dark. He is buried in Coverham churchyard near Middleham.[1]

Major wins

Great Britain

gollark: These are done → muahahaha.
gollark: ... also array literals, bee their bad docs.
gollark: Please also give me write access to the repo.
gollark: Oh, right, array indexing.
gollark: ```python# parsita-based pseudocode syntax parserfrom stmt import *from parsita import *from parsita.util import constantdef compose(f, g): return lambda x: f(g(x))def map_expr(x): start, end = x if end == "": return start return Op([start, end[1]], end[0])def map_unop_expr(x): return Op(x[1], x[0])def aliases(name, aliases): p = lit(name) for alias in aliases: p |= (lit(alias) > (lambda _: name)) return pclass ExprParser(TextParsers): ε = lit("") IntLit = reg("\-?[0-9]+") > compose(IntLit, int) StrLit = "'" >> reg("[^']*") << "'" > StrLit # TODO escapes (not in "spec" but could be needed) FloatLit = reg("\-?[0-9]+\.[0-9]+") > compose(FloatLit, float) Identifier = reg("[a-zA-Z_]+[a-zA-Z_0-9]*") > Var BracketedExpr = "(" >> Expr << ")" UnaryOperator = lit("NOT") Start = FloatLit | StrLit | IntLit | BracketedExpr | (UnaryOperator & Expr > map_unop_expr) | Identifier # avoid left recursion problems by not doing left recursion # AQA pseudocode does not appear to have a notion of "operator precedence", simplifying parsing logic nicely BinaryOperator = aliases("≤", ["<="]) | aliases("≠", ["!="]) | aliases("≥", [">="]) | lit("DIV") | lit("MOD") | lit("AND") | lit("OR") | reg("[+/*\-=<>]") End = (BinaryOperator & Expr) | ε Expr = (Start & End) > map_exprparse = ExprParser.Expr.parsex = parse("1+2+3 != 6 AND NOT 4 AND x + y")if isinstance(x, Failure): print(x.message)else: print(x.value)```

References
  1. Mortimer, Onslow & Willett 1978, p. 251.

Bibliography
  • Mortimer, Roger; Onslow, Richard; Willett, Peter (1978). Biographical Encyclopedia of British Flat Racing. Macdonald and Jane’s. ISBN 0-354-08536-0.


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