Persian Gulf Complex

Persian Gulf Complex is the 12th largest shopping mall in the world, located in Shiraz, Iran. [1] [2] [3] [4] It is the second biggest mall in terms of the number of shops after Iran Mall.[5]

The Fars Hotel (under construction), a part of the complex
Persian Gulf Complex
LocationSadra, Shiraz, Iran
Coordinates29°45′21″N 52°25′53″E
Opening dateSeptember 2011
DeveloperRoyal Star International
OwnerHossain Hossaini
No. of stores and services2,500
Total retail floor area450,000 square metres (4,800,000 sq ft)
Websitepersiangulfcomplex.ir

Description

The facility has space for 2,500 stores covering 450,000 square metres (4,800,000 sq ft).[6][7]

The complex includes the Burj Fars International, a 262-room hotel, an indoor and outdoor swimming pool, tennis court, convention centre and a helipad. In addition, there are two amusement parks at the mall, an outdoor amusement park called Iran Land, covering 37,000 square metres (400,000 sq ft), and an indoor amusement park covering 28,000 square metres (300,000 sq ft) with video games, a bowling alley and a 3-story billiard hall. The mall also has six 240-seat cinema. A 14,000-square-metre (150,000 sq ft) Carrefour Hypermarket is also located within the mall. The complex has four floors of parking space that can accommodate a total of 5,500 vehicles.[5][8]

Management

The Persian Gulf Complex is managed by Royal Star International (Setareh Trading Complex).

gollark: Doesn't it just segfault at some point?
gollark: It was more elegance™ to just make it able to do tail-call optimization.
gollark: I actually stole this particular quicksort from a r/haskell post talking about it.
gollark: ```lisp (let (partition_rec xs pred acc) (cond ((= xs '()) acc) (true (partition_rec (tail xs) pred (cond ((pred (head xs)) (list (cons (head xs) (head acc)) (snd acc))) (true (list (head acc) (cons (head xs) (snd acc)))) ))) )) (let (qsort xs cont) (cond ((= xs '()) (cont '())) (true (do (let h (head xs)) (let t (tail xs)) (let part_result (partition_rec t (lambda (x) (< x h)) '(() ()))) (qsort (head part_result) (lambda (ls) (qsort (snd part_result) (lambda (rs) (cont (+ ls (list h) rs)))))) )) ))```These all have to be done tail recursively or it could overflow.
gollark: Continuation passing style quicksort in a hilariously slow interpreter.

References

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