2018 Czech municipal elections
Municipal elections were held in the Czech Republic on 5 and 6 October 2018, alongside elections for the Senate.[1][2]
Results
Party | Seats |
---|---|
Christian and Democratic Union – Czechoslovak People's Party | 3,231 |
Civic Democratic Party | 2,281 |
Association STAN and Independent candidates | 2,224 |
Czech Social Democratic Party | 1,882 |
ANO 2011 | 1,676 |
STAN | 1,584 |
Communist Party of Bohemia and Moravia | 1,426 |
Association KDU-ČSL and Independent candidates | 525 |
Association ODS and Independent candidates | 351 |
Association TOP 09 and Independent candidates | 311 |
Czech Pirate Party | 275 |
SNK European Democrats | 209 |
TOP 09 | 192 |
INDEPENDENTS | 178 |
Associations of Independent candidates/local associations | 34,963 |
Other parties and subjects (256) | |
Independents | 6,232 |
Source: Novinky |
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)```
gollark: <@332271551481118732> Expression parsing is done, I think.
References
- "Volby 2018: senátní a komunální - průzkumy, výsledky - Info.cz". Info.cz (in Czech). Retrieved 2018-09-24.
- FOREIGNERS CAN VOTE IN CZECH LOCAL ELECTIONS, BUT SHOW LITTLE INTEREST
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.