Electoral district of Dandenong

The electoral district of Dandenong is an electoral district of the Victorian Legislative Assembly. It was first proclaimed in 1904 when the district of Dandenong and Berwick was abolished.

Dandenong
VictoriaLegislative Assembly
Location of Dandenong (dark green) in Greater Melbourne
StateVictoria
Created1904
MPGabrielle Williams
Party     Labor
NamesakeDandenong, Victoria
Electors42,361 (2018)
Area62 km2 (23.9 sq mi)
DemographicOuter metropolitan

The district is located within the outskirts of Melbourne's south-east, containing both residential and industrial areas, as well as the Dandenong Plaza and Churchill National Park.[1] A very multicultural district, it has been a safe Labor seat since the 1970s.

Dandenong District comprises the suburbs of Dandenong, Doveton, Eumemmerring and parts of Dandenong North, Dandenong South, Endeavour Hills, Noble Park, Noble Park North and Rowville.[2]

It is part of the South-Eastern Metropolitan Region for elections to the Legislative Council.

Members for Dandenong

MemberPartyTerm
  William Keast Conservative 1904–1917
  Commonwealth Liberal
  Nationalist
  Frank Groves Nationalist 1917–1929
  Bert Cremean Labor 1929–1932
  Frank Groves United Australia 1932–1937
  Frank Field Labor 1937–1947
  William Dawnay-Mould Liberal 1947–1952
  Electoral Reform League
  Les Coates Labor 1952–1955
  Ray Wiltshire Liberal 1955–1958
  Len Reid Liberal 1958–1969
  Alan Lind Labor 1969–1979
  Rob Jolly Labor 1979–1985
  Terry Norris Labor 1985–1992
  John Pandazopoulos Labor 1992–2014
  Gabrielle Williams Labor 2014–present

Election results

2018 Victorian state election: Dandenong[3]
Party Candidate Votes % ±
Labor Gabrielle Williams 21,823 66.00 +13.16
Liberal Virosh Perera 7,608 23.01 −5.96
Greens Rhonda Garad 2,483 7.51 −0.20
Transport Matters Afroz Ahmed 1,150 3.48 +3.48
Total formal votes 33,064 90.98 −0.72
Informal votes 3,278 9.02 +0.72
Turnout 36,342 85.79 −3.83
Two-party-preferred result
Labor Gabrielle Williams 24,476 73.93 +11.05
Liberal Virosh Perera 8,632 26.07 −11.05
Labor hold Swing+11.05
gollark: *considers creating an esowiki page for haskell and golang*
gollark: ``` func AddInt32(addr *int32, delta int32) (new int32) func AddInt64(addr *int64, delta int64) (new int64) func AddUint32(addr *uint32, delta uint32) (new uint32) func AddUint64(addr *uint64, delta uint64) (new uint64) func AddUintptr(addr *uintptr, delta uintptr) (new uintptr) func CompareAndSwapInt32(addr *int32, old, new int32) (swapped bool) func CompareAndSwapInt64(addr *int64, old, new int64) (swapped bool) func CompareAndSwapPointer(addr *unsafe.Pointer, old, new unsafe.Pointer) (swapped bool) func CompareAndSwapUint32(addr *uint32, old, new uint32) (swapped bool) func CompareAndSwapUint64(addr *uint64, old, new uint64) (swapped bool) func CompareAndSwapUintptr(addr *uintptr, old, new uintptr) (swapped bool) func LoadInt32(addr *int32) (val int32) func LoadInt64(addr *int64) (val int64) func LoadPointer(addr *unsafe.Pointer) (val unsafe.Pointer) func LoadUint32(addr *uint32) (val uint32) func LoadUint64(addr *uint64) (val uint64) func LoadUintptr(addr *uintptr) (val uintptr) func StoreInt32(addr *int32, val int32) func StoreInt64(addr *int64, val int64) func StorePointer(addr *unsafe.Pointer, val unsafe.Pointer) func StoreUint32(addr *uint32, val uint32) func StoreUint64(addr *uint64, val uint64) func StoreUintptr(addr *uintptr, val uintptr) func SwapInt32(addr *int32, new int32) (old int32) func SwapInt64(addr *int64, new int64) (old int64) func SwapPointer(addr *unsafe.Pointer, new unsafe.Pointer) (old unsafe.Pointer) func SwapUint32(addr *uint32, new uint32) (old uint32) func SwapUint64(addr *uint64, new uint64) (old uint64) func SwapUintptr(addr *uintptr, new uintptr) (old uintptr)```Seen in standard library docs.
gollark: Fun fact: that function cannot be written with a sane type in Go.
gollark: Esolang where multiple different garbage collectors run at the same time.
gollark: When you make an esolang in which it isn't!

References


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