Juárez Celman Department
Juárez Celman Department is a department of Córdoba Province in Argentina.
Juárez Celman Department Departamento Juárez Celman | |
|---|---|
.png) Location of Juárez Celman Department in Córdoba Province | |
| Coordinates: 33°25′S 63°18′W | |
| Country |  |
| Province |  |
| Foundation | 23 July 1888 |
| Founded by | provincial law |
| Capital | La Carlota |
| Area | |
| • Total | 8,902 km2 (3,437 sq mi) |
| Population | |
| • Total | 55,348 |
| • Density | 6.2/km2 (16/sq mi) |
| • Pop. change (1991-2001) | +7.49% |
| Time zone | UTC-3 (ART) |
| Postal code | X2670 |
| Dialing code | 03584 |
| Distances to | |
| Buenos Aires | 502 km (312 mi) |
| Córdoba | 257 km (160 mi) |
The provincial subdivision has a population of about 55,348 inhabitants in an area of 8,902 km², and its capital city is La Carlota, which is located around 502 km from Capital Federal.
Settlements
- Alejandro Roca
- Assunta
- Bengolea
- Carnerillo
- Charras
- El Rastreador
- General Cabrera
- General Deheza
- Huanchilla
- La Carlota
- Los Cisnes
- Olaeta
- Pacheco de Melo
- Paso del Durazno
- Reducción
- Santa Eufemia
- Ucacha
| ||
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.
gollark: I wonder if AQA pseudocode *does* have operator precedence. We may need to harvest exam papers.
gollark: This will allow 3% more efficient harnessing of character set anomalies.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.