List of premetro systems
This is the list of cities which have premetro systems – i.e. tram or light rail systems which are, or were, intended to be converted to full rapid transit systems.
List
Location | Country | Relevant Wikipedia article | Year opened | Stations | System length |
---|---|---|---|---|---|
Buenos Aires | PreMetro (Line E2) | 1987 | 17 | 7.4 km (4.6 mi) | |
Vienna | Vienna Pre-metro | 1969 | 8 | 3.4 km (2.1 mi) | |
Antwerp | Antwerp Pre-metro[1] | 1975 | 11 (+8 not in use) |
8.1 km (5.0 mi) | |
Brussels | Trams in Brussels[2] | 1972 | 15 | ||
Charleroi | Charleroi Metro[3] | 1976 | 48 | 33 km (21 mi) | |
Frankfurt | Frankfurt U-Bahn | 1968 | 86 | 64.85 km (40.30 mi) | |
Poznań | Poznań Fast Tram[4] | 1997 | 8 | 8.1 km (5.0 mi) | |
Kraków | Kraków Fast Tram[5] | 2008 | 22 km (14 mi) | ||
Volgograd | Volgograd Metrotram | 1984 | 22 | 17.3 km (10.7 mi) | |
Kiev | Kiev Light Rail | 1978 | 19 | 21 km (13 mi) | |
Kryvyi Rih | Kryvyi Rih Metrotram[6] | 1986 | 11 | 17.7 km (11.0 mi) |
gollark: It allocates memory and doesn't consider it a side effect.
gollark: I didn't do any horrible homoglyph hacks with THAT.
gollark: It uses the function, yes.
gollark: So, I finished that to highly dubious demand. I'd like to know how #11 and such work.
gollark: > `x = _(int(0, e), int(e, е))`You may note that this would produce slices of 0 size. However, one of the `e`s is a homoglyph; it contains `2 * e`.`return Result[0][0], x, m@set({int(e, 0), int(е, e)}), w`From this, it's fairly obvious what `strassen` *really* does - partition `m1` into 4 block matrices of half (rounded up to the nearest power of 2) size.> `E = typing(lookup[2])`I forgot what this is meant to contain. It probably isn't important.> `def exponentiate(m1, m2):`This is the actual multiplication bit.> `if m1.n == 1: return Mаtrix([[m1.bigData[0] * m2.bigData[0]]])`Recursion base case. 1-sized matrices are merely multiplied scalarly.> `aa, ab, ac, ad = strassen(m1)`> `аa, аb, аc, аd = strassen(m2)`More use of homoglyph confusion here. The matrices are quartered.> `m = m1.subtract(exponentiate(aa, аa) ** exponentiate(ab, аc), exponentiate(aa, аb) ** exponentiate(ab, аd), exponentiate(ac, аa) ** exponentiate(ad, аc), exponentiate(ac, аb) ** exponentiate(ad, аd)) @ [-0j, int.abs(m2.n * 3, m1.n)]`This does matrix multiplication in an inefficient *recursive* way; the Strassen algorithm could save one of eight multiplications here, which is more efficient (on big matrices). It also removes the zero padding.> `m = exponentiate(Mаtrix(m1), Mаtrix(m2)) @ (0j * math.sin(math.asin(math.sin(math.asin(math.sin(math.e))))), int(len(m1), len(m1)))`This multiples them and I think also removes the zero padding again, as we want it to be really very removed.> `i += 1`This was added as a counter used to ensure that it was usably performant during development.> `math.factorial = math.sinh`Unfortunately, Python's factorial function has really rather restrictive size limits.> `for row in range(m.n):`This converts back into the 2D array format.> `for performance in sorted(dir(gc)): getattr(gc, performance)()`Do random fun things to the GC.
See also
- Premetro
- Tram and light rail transit systems
- List of tram and light rail transit systems
- List of town tramway systems (all-time list)
- Medium-capacity rail transport system
- List of metro systems
- List of suburban and commuter rail systems
- List of trolleybus systems
References
- "Antwerpen Tram & Premetro". UrbanRail.net. 2013. Retrieved 2014-01-22.
Antwerpen rail network is a typical premetro network.
- Geoffroy Fabre (19 March 2014). "Une station fantôme au secours du futur Métro Nord de la STIB". RTBF. Retrieved 2014-05-09.
- "Charleroi Premetro". UrbanRail.net. 2013. Retrieved 2014-01-22.
The Charleroi Metro is a typical prémétro network, i.e. trams that run underground in the city centre and on viaducts or separate right-of-way through outer parts (similar to German Stadtbahn systems).
- "Poznański Szybki Tramwaj". 2015.
- "Krakowski Szybki Tramwaj". 2015.
- "Kryvy Rih . Krovoy Rog Rapid Tram". UrbanRail.Net. Retrieved 29 January 2016.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.