The Blade, Reading

The Blade, also known as Abbey Mill House, is a high-rise and the tallest building in Reading, Berkshire, England. Used for office space, it is 86 metres (282 ft) tall and is visible from many places in the town. The first tenant to occupy the building was Kaplan Financial, who moved to the building from Thames Tower.[4][5]

The Blade
View from the west
Location within Reading town centre
Alternative namesAbbey Mill House[1]
General information
StatusComplete
Coordinates51°27′20.03″N 0°57′59.15″W
Construction started2007[2]
Completed2009[2]
Cost£32 million[3]
Height
Antenna spire86 m (282 ft)
Roof59 m (194 ft)
Technical details
Floor count15 (14 above ground, 1 below)
Lifts/elevators5
Design and construction
ArchitectSheppard Robson
DeveloperPMB Holdings and Aviva Investors
References
[1]

Building

The high rise building was proposed in 2001, and construction lasted from 2007 to 2009.[6] It cost £32 million to build.[3]

The 86-metre (282 ft) steel building has 14 floors above ground level; the floor-to-floor height is 3.77 metres (12.4 ft). The building's façade is a curtain wall system of aluminium and glass, and the building is strengthened with a pile foundation.[1] The spire atop the building is a lattice frame covered with rainscreen panels.[1] The height of the building is 128m above ground level.[6]

The Blade has 110,000 sq ft for office use, 7,200 sq ft of space of which was let to Gateley, a law firm, for £34 per sq ft, one of the highest rents Reading has achieved.[7]

gollark: - Checks if the available-items list already contains the item needed. If so, just return that.- If not, checks for recipes to do what is wanted- If one exists, iterate over them (not sure what to *do* with them)- If none exists, we can't do anything, so just return no tasks, no costs and no outputs.
gollark: ```rusttype Items = HashMap<ItemType, u32>;fn quantity(items: &Items, desired: &ItemType) -> u32 { if let Some(available_quantity) = items.get(desired) { *available_quantity } else { 0 }}fn contains(items: &Items, desired: &Item) -> bool { quantity(items, &to_item_type(desired)) >= desired.quantity}fn satisfies(available: &Items, desired: &Items) -> bool { for (typ, desired_quantity) in desired.iter() { if quantity(available, typ) < *desired_quantity { return false } } true}fn to_map(is: &Vec<Item>) -> Items { let out = HashMap::new(); for i in is.iter() { out.entry(to_item_type_clone(i)) .and_modify(|e| { *e += 1 }) .or_insert(0); } out}fn one_item(i: Item) -> Items { let out = HashMap::new(); out.insert(to_item_type(&i), i.quantity); out}#[derive(Debug, Deserialize, PartialEq, Eq, Serialize, Clone)]pub struct CraftingResult { pub tasks: Vec<Recipe>, pub costs: Items, pub outputs: Items}fn solve(desired: Item, available: Items, recipes: &MultiMap<ItemType, Recipe>) -> CraftingResult { if contains(&available, &desired) { // If our available items list already contains the desired item, yay, we can just do nothing return CraftingResult { tasks: vec![], costs: one_item(desired), outputs: one_item(desired) } } if let Some(recipes) = recipes.get_vec(&to_item_type(&desired)) { for recipe in recipes.iter() { let result = solve() // ??? } } else { CraftingResult { tasks: vec![], costs: HashMap::new(), outputs: HashMap::new() } }}```My code, or at least part of it.
gollark: That is NOT THE HARD PART.
gollark: (I'm still confused though)
gollark: People have already given helpful suggestions how to, soo...

References

  1. "The Blade". Emporis. Retrieved 13 November 2013.
  2. Skyscrapernews's building database, 23/11/09 version
  3. BBC Berkshire, Places, The Blade, By Linda Serck, April 2009
  4. getreading, "Blade a different class for finance firm" 2 February 2010, retrieved 23 July 2011
  5. Paul Robins, getreading
  6. "The Blade, Reading - Building #1910". skyscrapernews.com. Retrieved 17 July 2019.
  7. "The Blade in Reading is up for sale". Get Reading. 12 July 2017. Retrieved 17 July 2019.

Media related to The Blade Reading at Wikimedia Commons


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