Piplani
Piplani (Hindi: पिपलानी) is a town in Bhopal, India, in the BHEL township in the city of Bhopal.
Piplani | |
|---|---|
locality | |
  Piplani Location of Piplani in Bhopal | |
| Coordinates: 23°14′49″N 77°28′7″E | |
| Country | India |
| State | Madhya Pradesh |
| District | Bhopal |
| City | Bhopal |
| Government | |
| • Body | Bhopal Municipal Corporation |
| Time zone | UTC+5:30 (IST) |
| Pincode | 462022 |
| Telephone | +91755 |
| Vehicle registration | MP-04- |
Etymology
Piplani is a derivative of Bhopal which is an adjacent village. Piplani houses the BHEL factory and offices. Nearby attractions include the NCC Grounds and the BHEL Cultural Hall.
Points of interest
Restaurants
Indian Coffee House
Balaji Restaurent
Schools
- St Theresas Girls High School
- Vikram Higher Secondary School
The Piplani has many BHEL Staff Quarters, some of which are now vacant and destroyed. The entire Piplani is divided into 4 Sectors viz A, B, C, D.
There are many beautiful temples like Jain Mandir, Ganesh Temple, Aiyappa Temple, Kalibadi Temple, Gurudwara Guru Nanak Darbar etc. which are area of attraction for locals and outsiders.
Neighbourhoods of Bhopal | ||
|---|---|---|
 | ||
gollark: getItemMeta returns a thing with stackSize, right?
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!
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.