Poplar Bay
Poplar Bay is a summer village in Alberta, Canada. It is located on the western shore of Pigeon Lake.
Poplar Bay | |
---|---|
Summer Village of Poplar Bay | |
Location of Poplar Bay in Alberta | |
Coordinates: 53.01131°N 114.11439°W | |
Country | |
Province | |
Census division | No. 11 |
Government | |
• Type | Municipal incorporation |
• Mayor | Fraser Hubbard |
• Governing body | Poplar Bay Summer Village Council |
Area (2016)[2] | |
• Land | 0.67 km2 (0.26 sq mi) |
Population (2016)[2] | |
• Total | 103 |
• Density | 154/km2 (400/sq mi) |
Time zone | UTC-7 (MST) |
Website | Official website |
Demographics
In the 2016 Census of Population conducted by Statistics Canada, the Summer Village of Poplar Bay recorded a population of 103 living in 46 of its 179 total private dwellings, a 28.8% change from its 2011 population of 80. With a land area of 0.67 km2 (0.26 sq mi), it had a population density of 153.7/km2 (398.2/sq mi) in 2016.[2]
In the 2011 Census, the Summer Village of Poplar Bay had a population of 80 living in 42 of its 184 total dwellings, a -4.8% change from its 2006 population of 84. With a land area of 0.79 km2 (0.31 sq mi), it had a population density of 101.3/km2 (262.3/sq mi) in 2011.[3]
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
- "Municipal Officials Search". Alberta Municipal Affairs. September 22, 2017. Retrieved September 25, 2017.
- "Population and dwelling counts, for Canada, provinces and territories, and census subdivisions (municipalities), 2016 and 2011 censuses – 100% data (Alberta)". Statistics Canada. February 8, 2017. Retrieved February 8, 2017.
- "Population and dwelling counts, for Canada, provinces and territories, and census subdivisions (municipalities), 2011 and 2006 censuses (Alberta)". Statistics Canada. 2012-02-08. Retrieved 2012-02-08.
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.