[04:30:01] * comets punches Reedy [04:30:15] HAPPY BIRTHDAY!! :D [04:30:45] oh! happy birthday Reedy! [04:35:58] It's Reedy's birthday? Happy birthday :) [04:36:20] yeah no cake either :( [04:43:05] * bd808 pictures Reedy's bday cake -- https://img.memecdn.com/Birth-day_o_92764.jpg [04:46:04] lol [05:07:59] bd808: I don't see that under Cat:Sam Reed on commons >.> [05:08:44] that category is surprisingly empty compared to what I thought it would be [19:43:46] is it possible to create a template which returns a unique number each time it is called? [19:46:03] umm... shouldn't be. might be. [20:22:34] how hard would it be to get a global variable and function which was synchronous and incremented each time it was called? [20:29:19] TheDaveRoss_: I believe Lua has a random number generator that you can use, which will practically be unique [20:31:27] I am looking to get a template which gets subst'ed in with a certain type of edit which will create a unique anchor and reference number [20:31:40] so it will be called a lot and must be unique [20:32:28] I guess some combo of pageid, timestamp and parsing of page text could do it, but that is way more complicated than should be necessary [20:37:33] TheDaveRoss_: go with legoktm's suggestion -- use a randomly-generated ID rather than a monotonically incrementing one [20:37:43] that way you're stateless [20:37:53] but also can have collisions [20:38:22] https://www.mediawiki.org/wiki/Extension:Scribunto/Lua_reference_manual#math.random [20:38:28] https://en.wikipedia.org/wiki/Universally_unique_identifier#Random_UUID_probability_of_duplicates [20:38:31] TheDaveRoss_: theoretically yes, realistically I doubt it [20:38:48] "To put these numbers into perspective, the annual risk of a given person being hit by a meteorite is estimated to be one chance in 17 billion,[5] which means the probability is about 0.00000000006 (6 × 10−11), equivalent to the odds of creating a few tens of trillions of UUIDs in a year and having one duplicate. In other words, only after generating 1 billion UUIDs every second for the next 100 years, the probability of cre [20:38:48] ating just one duplicate would be about 50%." [20:39:30] fair enough [20:54:37] math.random can't generate a very big random number [20:54:46] 30 bits or so it seems [20:59:36] TheDaveRoss_: you can call it more than once :) https://gist.github.com/jrus/3197011#file-lua-uuid-lua [21:31:33] * JeanFred waves at rfarrand_ [21:36:38] Hey JeanFred :) [21:37:10] Looking forward to see you soon :D [21:45:46] does anyone else have problems connecting to wikipedia.org server? [21:46:44] onlookerlooker: only a handful European nations [21:47:23] onlookerlooker: which provider and country are you on if I may ask? (privacy) [21:47:46] curious... any known reasons? (Poland) [21:48:03] onlookerlooker, we don't know yet but it's been reported in #wikimedia-operations [21:48:20] same problem in France [21:51:22] Hi there, can somebody check ca.wikipedia? We have some reports that is not working properly. Basic troubleshooting has already been tried. [21:52:22] lluis_tgn: Thanks! This is being discussed in #wikimedia-operations and looks like a European problem so far. [21:52:36] Feel free to join and watch :) [21:52:41] thanks andre__ :) [21:52:46] thanks for reporting :) [21:56:35] thanks for the reports [22:03:18] could a user affected by the outage try to traceroute text-lb.esams.wikimedia.org? [22:03:41] ori, sure, let me do that. [22:04:31] ori, though I'm afraid that'll be pretty much the same as http://fpaste.org/321452/ against en.wp which I pasted 15min ago [22:05:16] ori: yepp. exactly the same output for text-lb.esams like for en.wp here, hence I won't repost