Town Planning and Development Act 1928

The Town Planning and Development Act 1928 was an Act of the Western Australian Parliament which laid down specific controls over planning at a metropolitan and local level as well as establishing more general controls over the subdivision of land. The Act was based on earlier British legislation.[1] It took 13 years for the Act to pass through the parliament. The Act formed the basis of the planning system of Western Australia into the early 21st Century when the Act was repealed and replaced by the Planning and Development Act 2005.[2]

Powers and Functions

The Act provided for the following powers and functions:

  • Appointment of a Town Planning Board as a statutory approval authority.
  • Procedures and requirements for obtaining subdivision approval; land use zoning and development.
  • Empowered the Town Planning Board to require the provision of open space in new subdivisions (although no minimum requirements were included).
  • Provided for local authorities to implement redevelopment schemes for established areas.
  • Uniform by-laws.
gollark: Also, in that version there, patterns got fed in as a table with numeric indices from 1-9 representing each slot of the crafting table plus an optional qty key for how much the recipe produces.
gollark: Ridiculous. We *need* to be able to break maths in a snippet of code.
gollark: Here is a copy of the code I don't understand from the old version:```lualocal function descend(intermediateFn, terminalFn, i) local pattern = patterns[i] if pattern then intermediateFn(pattern) local pqty = pattern.qty -- Qty keys must be removed from the pattern for collation -- Otherwise, it shows up as a number stuck in the items needed table, which is bad. pattern.qty = nil local needs = util.collate(pattern) pattern.qty = pqty local has = {} for slot, item in pairs(pattern) do if util.satisfied(needs, has) then break end if patterns[item] then descend(intermediateFn, terminalFn, item) has[item] = (has[item] or 0) + (patterns[item].count or 1) end end else terminalFn(i) endendlocal function cost(i) local items = {} descend(function() end, function(i) table.insert(items, i) end, i) return util.collate(items)endlocal function tasks(i) local t = {} descend(function(pat) table.insert(t, pat) end, function() end, i) return tend```
gollark: Also, implementing whatever is done internally for finding free space to transfer to is hard!
gollark: I'm unlikely to have stupidly large autocrafting trees.

See also

References
  1. Hipkins, Max (August 1982). "Perth shops for a retail policy". Australian Planner. 20 (3): 124–127. doi:10.1080/07293682.1982.9656961.
  2. Hedgcock and Yiftachel. pg 3
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.