Ormesby St Michael

Ormesby St Michael is a small village and civil parish in the English county of Norfolk. It is situated some 12 km (7.5 mi) north-west of the town of Great Yarmouth and 25 km (16 mi) east of the city of Norwich. Nearby are Ormesby Broad and Ormesby Little Broad, both part of the Trinity Broads within The Broads.[1]

Ormesby St Michael

St Michael, Ormesby St Michael
Ormesby St Michael
Location within Norfolk
Area4.21 km2 (1.63 sq mi)
Population302 (2011)
• Density72/km2 (190/sq mi)
OS grid referenceTG475149
Civil parish
  • Ormesby St Michael
District
  • Great Yarmouth
Shire county
Region
CountryEngland
Sovereign stateUnited Kingdom
Post townGREAT YARMOUTH
Postcode districtNR29
PoliceNorfolk
FireNorfolk
AmbulanceEast of England

The civil parish has an area of 4.21 km2 (1.63 sq mi) and in the 2001 census had a population of 297 in 128 households, increasing to 302 at the 2011 Census.[2] For the purposes of local government, the parish falls within the district of Great Yarmouth.[3]

Ormesby Manor is a Grade II listed 19th manor house with an Italianate tower.[4]

Ormesby St Michael should not be mistaken for the village of Ormesby St Margaret, which lies some 3 km (1.9 mi) to the east.

Notes
  1. Ordnance Survey (2005). OS Explorer Map OL40 - The Broads. ISBN 0-319-23769-9.
  2. "Civil Parish population 2011". Retrieved 25 August 2015.
  3. Office for National Statistics & Norfolk County Council (2001). Census population and household counts for unparished urban areas and all parishes Archived 2017-02-11 at the Wayback Machine. Retrieved December 2, 2005.
  4. "Ormesby Manor particulars". Savills.
gollark: All three.
gollark: Unless you turn up the optimization setting to ~30, at which point it makes quite fast code.
gollark: ```python#!/usr/bin/env python3import argparseimport subprocessparser = argparse.ArgumentParser(description='Compile a WHY program')parser.add_argument("input", help="File containing WHY source code")parser.add_argument("-o", "--output", help="Filename of the output executable to make", default="./a.why")parser.add_argument("-O", "--optimize", help="Optimization level", type=int, default="0")args = parser.parse_args()def build_C(args): template = """#define QUITELONG long long intconst QUITELONG max = @max@;int main() { QUITELONG i = 0; while (i < max) { i++; } @code@} """ for k, v in args.items(): template = template.replace(f"@{k}@", str(v)) return templateinput = args.inputoutput = args.outputtemp = "ignore-this-please"with open(input, "r") as f: contents = f.read() looplen = max(1000, (2 ** -args.optimize) * 1000000000) code = build_C({ "code": contents, "max": looplen }) with open(temp, "w") as out: out.write(code)subprocess.run(["gcc", "-x", "c", "-o", output, temp])```The compiler for the new `WHY` language. Made as a joke because someone on the esolangs server insisted that all compiled languages were fast.
gollark: BT being bad, who would ever guess so?
gollark: Amazing, right?




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