Editing Talk:1245: 10-Day Forecast
|
Please sign your posts with ~~~~ |
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
| Latest revision | Your text | ||
| Line 30: | Line 30: | ||
:::::Uhhh, your Postcodes are a horror for programmers, just because the length vary. The first official implementation for this was during {{w|WWII}} in Germany, the UK did implement this in the range of 1959-1974, and the US did start this system in 1963. But there are still many countries not using this system (like Ireland), which is just a double horror for programmers.--[[User:Dgbrt|Dgbrt]] ([[User talk:Dgbrt|talk]]) 20:18, 31 July 2013 (UTC) | :::::Uhhh, your Postcodes are a horror for programmers, just because the length vary. The first official implementation for this was during {{w|WWII}} in Germany, the UK did implement this in the range of 1959-1974, and the US did start this system in 1963. But there are still many countries not using this system (like Ireland), which is just a double horror for programmers.--[[User:Dgbrt|Dgbrt]] ([[User talk:Dgbrt|talk]]) 20:18, 31 July 2013 (UTC) | ||
::::::Start with "m/(\w+) (\w+)/" and then subdivide into branches according to $1's further matching? At each stage checked for more specific validity (and even existence!). If not that, "m/[A..Z]{1,2}\d{1,2}[A..Z]? \d[A..Z]{2}/i" should work if you want just a single test (with ()s around elements for the geographic validation checking part). Ok, so it's not "\d{howevermany}", then check it exists on the database, but it'd do for starters, and personally I relish such programming challenges... ;) [[Special:Contributions/178.98.215.19|178.98.215.19]] 11:36, 1 August 2013 (UTC) | ::::::Start with "m/(\w+) (\w+)/" and then subdivide into branches according to $1's further matching? At each stage checked for more specific validity (and even existence!). If not that, "m/[A..Z]{1,2}\d{1,2}[A..Z]? \d[A..Z]{2}/i" should work if you want just a single test (with ()s around elements for the geographic validation checking part). Ok, so it's not "\d{howevermany}", then check it exists on the database, but it'd do for starters, and personally I relish such programming challenges... ;) [[Special:Contributions/178.98.215.19|178.98.215.19]] 11:36, 1 August 2013 (UTC) | ||
| − | |||
:Something like "YKK". [[Special:Contributions/121.72.110.10|121.72.110.10]] 23:30, 31 July 2013 (UTC) | :Something like "YKK". [[Special:Contributions/121.72.110.10|121.72.110.10]] 23:30, 31 July 2013 (UTC) | ||
