Kolyuchin Bay

Kolyuchin Bay (Russian: Колючинская губа; Kolyuchinskaya guba) is a large bay in the Chukchi Sea on the northern shore of the Chukotka Peninsula, Russia.

Kolyuchin Bay
Kolyuchin Bay
Location of Kolyuchin Bay in the Chukotka Autonomous Okrug
LocationFar North
Coordinates66.83333°N 174.4°W / 66.83333; -174.4
Native nameКолючинская губа  (Russian)
River sourcesIoniveyem and Ulyuveyem
Ocean/sea sourcesChukchi Sea
Basin countriesRussia
Max. length100 km (62 mi)
Max. width37 km (23 mi)
Average depth14 m (46 ft)

Administratively this bay belongs to the Chukotka Autonomous Okrug of the Russian Federation.

Geography

To the west is Cape Vankarem and to the east Neskynpil'gyn Lagoon and Cape Serdtse-Kamen. The length of the bay is 100 km. Its mouth is only 2.8 km because of the Serykh Gusey Islands and the Belyaka Spit (Kosa Belyaka), separate it from the Arctic Ocean. The width increases to 37 km as it goes southwards and inland.

The depth of Kolyuchinskaya Bay is 7 to 14 m. The bay is covered with ice most of the year.

This bay has an inlet in its southern end known as the Kuetkuyyim Inlet (Kuetkuyyim Zaliv). The Ioniveyem and the Ulyuveyem River flow into it from the south.

History

In 1793, the bay was named Count Bezborodko Bay in honor of Russian statesman Alexander Bezborodko.[1] The locals could not get accustomed to this name and the bay was later renamed Kolyuchinskaya after nearby Kolyuchin Island.

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.

References
  1. Леонтьев В. В., Новикова К. А. Топонимический словарь северо-востока СССР. — Магадан: Магаданское книжное издательство, 1989. — С. 199.


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