Cai Xuetong

Cai Xuetong (Chinese: 蔡雪桐; pinyin: Cài Xuětóng; Mandarin pronunciation: [tsʰâi ɕɥè tʰʊ̌ŋ]; born 26 September 1993) is a Chinese snowboarder.[1]

Xuetong Cai
Personal information
NationalityChinese
Born (1993-09-26) 26 September 1993
Harbin, China
Height1.61 m (5 ft 3 in)
Weight55 kg (121 lb)
Sport
CountryChina
SportSnowboarding
Event(s)Halfpipe

2010 Olympics

Cai represented China at the 2010 Winter Olympics in Vancouver, competing in the halfpipe discipline. She was the youngest competitor in the competition.

FIS Snowboard World Championships

Cai claimed the gold medal at the 2015 halfpipe events at the FIS Snowboard World Championships, and the silver medal in 2019.

FIS Snowboard World Cup

At the FIS Snowboard World Cup, Cai topped the halfpipe rankings in 2009–10, 2010–11, 2011–12, 2015–16, and 2018–19, as well as the freestyle overall ranking in 2010–11 and 2011–12. She has claimed 10 wins and 23 podiums in 32 starts.

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


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