https://www.iran-pedia.org/w/index.php?action=history&feed=atom&title=%D9%85%D8%AF%DB%8C%D8%A7%D9%88%DB%8C%DA%A9%DB%8C%3AGadget-PageContributions.js
مدیاویکی:Gadget-PageContributions.js - تاریخچهٔ نسخهها
2026-04-26T07:36:57Z
تاریخچهٔ نسخهها برای این صفحه در ویکی
MediaWiki 1.43.0
https://www.iran-pedia.org/w/index.php?title=%D9%85%D8%AF%DB%8C%D8%A7%D9%88%DB%8C%DA%A9%DB%8C:Gadget-PageContributions.js&diff=2566&oldid=prev
Rootadmin: ۱ نسخه واردشده
2017-12-02T11:06:55Z
<p>۱ نسخه واردشده</p>
<table style="background-color: #fff; color: #202122;" data-mw="interface">
<tr class="diff-title" lang="fa">
<td colspan="1" style="background-color: #fff; color: #202122; text-align: center;">→ نسخهٔ قدیمیتر</td>
<td colspan="1" style="background-color: #fff; color: #202122; text-align: center;">نسخهٔ ۲ دسامبر ۲۰۱۷، ساعت ۱۳:۰۶</td>
</tr><tr><td colspan="2" class="diff-notice" lang="fa"><div class="mw-diff-empty">(بدون تفاوت)</div>
</td></tr></table>
Rootadmin
https://www.iran-pedia.org/w/index.php?title=%D9%85%D8%AF%DB%8C%D8%A7%D9%88%DB%8C%DA%A9%DB%8C:Gadget-PageContributions.js&diff=2565&oldid=prev
Rootadmin: ۱ نسخه واردشده
2017-08-29T15:52:15Z
<p>۱ نسخه واردشده</p>
<p><b>صفحهٔ تازه</b></p><div>(function(mw, $) {<br />
<br />
var query = {<br />
action: 'query',<br />
prop: 'revisions',<br />
titles: mw.config.get('wgPageName'),<br />
rvlimit:10,<br />
rvprop: 'ids|timestamp|user|size|content',<br />
format: 'json'<br />
};<br />
<br />
var inProgress = false;<br />
<br />
var isOpen = false;<br />
<br />
var revisions = [];<br />
<br />
var str = null;<br />
<br />
var hidden = 0;<br />
<br />
function toHex(n) {<br />
if (n < 0) n = 0xFFFFFFFF + n + 1;<br />
return n.toString(16);<br />
};<br />
<br />
function fnv(str) {<br />
// this is an implementation of the Fowler-Noll-Vo hash algorithm<br />
var hash = 2166136261; // the 32 bit offset<br />
for (var i = 0, l = str.length; i < l; i++) {<br />
hash += (hash << 1) + (hash << 4) + (hash << 7) + (hash << 8) + (hash << 24);<br />
hash = hash ^ str.charCodeAt(i);<br />
}<br />
return hash & 0x0ffffffff;<br />
};<br />
<br />
var perm = [ // permutations for the lsh algorithm<br />
1, 14, 110, 25, 97, 174, 132, 119, 138, 170, 125, 118, 27, 233, 140, 51,<br />
87, 197, 177, 107, 234, 169, 56, 68, 30, 7, 173, 73, 188, 40, 36, 65,<br />
49, 213, 104, 190, 57, 211, 148, 223, 48, 115, 15, 2, 67, 186, 210, 28,<br />
12, 181, 103, 70, 22, 58, 75, 78, 183, 167, 238, 157, 124, 147, 172, 144,<br />
176, 161, 141, 86, 60, 66, 128, 83, 156, 241, 79, 46, 168, 198, 41, 254,<br />
178, 85, 253, 237, 250, 154, 133, 88, 35, 206, 95, 116, 252, 192, 54, 221,<br />
102, 218, 255, 240, 82, 106, 158, 201, 61, 3, 89, 9, 42, 155, 159, 93,<br />
166, 80, 50, 34, 175, 195, 100, 99, 26, 150, 16, 145, 4, 33, 8, 189,<br />
121, 64, 77, 72, 208, 245, 130, 122, 143, 55, 105, 134, 29, 164, 185, 194,<br />
193, 239, 101, 242, 5, 171, 126, 11, 74, 59, 137, 228, 108, 191, 232, 139,<br />
6, 24, 81, 20, 127, 17, 91, 92, 251, 151, 225, 207, 21, 98, 113, 112,<br />
84, 226, 18, 214, 199, 187, 13, 32, 94, 220, 224, 212, 247, 204, 196, 43,<br />
249, 236, 45, 244, 111, 182, 153, 136, 129, 90, 217, 202, 19, 165, 231, 71,<br />
230, 142, 96, 227, 62, 179, 246, 114, 162, 53, 160, 215, 205, 180, 47, 109,<br />
44, 38, 31, 149, 135, 0, 216, 52, 63, 23, 37, 69, 39, 117, 146, 184,<br />
163, 200, 222, 235, 248, 243, 219, 10, 152, 131, 123, 229, 203, 76, 120, 209 ];<br />
<br />
function lsh(str) {<br />
// this is an implementation of a lsh algorithm, loosley similar to nilsimsa<br />
var arr = Array();<br />
for (var i = 0; i <= 0x0ff; i++) {<br />
arr[i] = 0;<br />
}<br />
for (var i = 0, l = str.length-2; i < l; i++) {<br />
// first we do a Pearson hash of trigram from the text<br />
var hash = 0;<br />
hash = perm[ (hash ^ str.charCodeAt(i)) & 0x0ff ];<br />
hash = perm[ (hash ^ str.charCodeAt(i+1)) & 0x0ff ];<br />
hash = perm[ (hash ^ str.charCodeAt(i+2)) & 0x0ff ];<br />
// then we accumulate in the array at indices given by the hash<br />
arr[hash]++;<br />
}<br />
// fold the array<br />
for (var i = 0; i <= 0x01f; i++) {<br />
arr[i] += arr[i+0x020] + arr[i+0x040] + arr[i+0x060] + arr[i+0x080] + arr[i+0x0a0] + arr[i+0x0c0] + arr[i+0x0e0];<br />
}<br />
var acc = 0;<br />
var lim = arr.slice(0, 0x01f).sort(function(a,b){return a-b})[0x00f];<br />
for (var i = 0; i <= 0x01f; i++) {<br />
acc |= (((lim < arr[i]) ? 0 : 1) << i);<br />
}<br />
return acc & 0x0ffffffff;<br />
};<br />
<br />
function rvec(str) {<br />
// this is an implementation of a subspace reduction algorithm based upon the Pearson hash<br />
var arr = new Array();<br />
for (var i = 0; i <= 0x0ff; i++) {<br />
arr[i] = 0;<br />
}<br />
for (var i = 0, l = str.length-2; i < l; i++) {<br />
// first we do a Pearson hash of trigram from the text<br />
var hash = 0;<br />
hash = perm[ (hash ^ str.charCodeAt(i)) & 0x0ff ];<br />
hash = perm[ (hash ^ str.charCodeAt(i+1)) & 0x0ff ];<br />
hash = perm[ (hash ^ str.charCodeAt(i+2)) & 0x0ff ];<br />
// then we accumulate in the array at indices given by the hash<br />
arr[hash]++;<br />
}<br />
return arr;<br />
};<br />
<br />
function beans(n) {<br />
// implementation of a bean counter<br />
// make an unsigned 32bits int<br />
if (n < 0) n = 0xFFFFFFFF + n + 1;<br />
// From Hacker's Delight, p. 66, Figure 5-2<br />
n = n - ((n >> 1) & 0x55555555);<br />
n = (n & 0x33333333) + ((n >> 2) & 0x33333333);<br />
n = (n + (n >> 4)) & 0x0F0F0F0F;<br />
n = n + (n >> 8);<br />
n = n + (n >> 16);<br />
return n & 0x0000003F;<br />
};<br />
<br />
function cosine(vec1, vec2) {<br />
// really just a difference measure for the trigram vectors<br />
var combined = Object();<br />
for (var x in vec1)<br />
combined[x] = vec1[x];<br />
for (var x in vec2) {<br />
if (combined[x] == null) combined[x] = 0;<br />
combined[x] -= vec2[x];<br />
}<br />
var acc = 0;<br />
for (var x in combined)<br />
acc += combined[x] * combined[x];<br />
return Math.sqrt(acc);<br />
};<br />
<br />
function rcos(vec1, vec2) {<br />
// really just a difference measure for the trigram vectors<br />
var acc = 0;<br />
for (var i = 0; i <= 0x0ff; i++)<br />
acc += Math.pow((vec1 ? vec1[i] : 0) - (vec2 ? vec2[i] : 0), 2);<br />
return Math.sqrt(acc);<br />
};<br />
<br />
function onclick() {<br />
// just an onclick handler to start processing<br />
if (str === null) {<br />
if (!inProgress) {<br />
inProgress = true;<br />
isOpen = true;<br />
jsMsg('<h3>فهرست مشارکتکنندگان اصلی</h3><small id="progress" />', 'page-authors' );<br />
$('#mw-js-message.mw-js-message-page-authors h3').each(function(i, el) { injectSpinner( el, 'page-authors' ); });<br />
getRevisions();<br />
}<br />
else {<br />
alert('Already in progress!');<br />
}<br />
}<br />
else {<br />
if (!isOpen) {<br />
isOpen = true;<br />
jsMsg('<h3>فهرست مشارکتکنندگان اصلی</h3>' + str, 'page-authors' );<br />
$('#mw-js-message.mw-js-message-page-authors').show().find('ul').slideDown(1000);<br />
<br />
}<br />
else {<br />
isOpen = false;<br />
$('#mw-js-message.mw-js-message-page-authors').slideUp(1000);<br />
}<br />
}<br />
return false;<br />
};<br />
<br />
function getRevisions() {<br />
// ajax object<br />
$.ajax({<br />
url: mw.util.wikiScript( 'api' ),<br />
dataType: 'json',<br />
data: query,<br />
context: document.body,<br />
success: function(data, textStatus) {<br />
if (textStatus != 'success') {<br />
alert('Success, but with "' + textStatus + '"');<br />
$('#mw-js-message.mw-js-message-page-authors').slideUp(1000);<br />
}<br />
var r = data['query'].pages[parseInt(mw.config.get('wgArticleId'))].revisions;<br />
for (var x = 0; x < r.length; x++) {<br />
if (typeof r[x]['*'] == 'undefined') {<br />
hidden++;<br />
continue;<br />
}<br />
r[x].lsh = lsh(r[x]['*']);<br />
r[x].fnv = toHex(fnv(r[x]['*']));<br />
if(r[x].size == 'undefined') r[x].size = r[x]['*'].length;<br />
r[x].vec = rvec(r[x]['*']);<br />
r[x]['*'] = null; // conserve space<br />
revisions.push(r[x]);<br />
}<br />
if (data['query-continue']) {<br />
$('#mw-js-message.mw-js-message-page-authors #progress').html( String(revisions.length).replace(/1/g, "۱").replace(/2/g, "۲").replace(/3/g, "۳").replace(/4/g, "۴").replace(/5/g, "۵").replace(/,/g, ".").replace(/6/g, "۶").replace(/7/g, "۷").replace(/8/g, "۸").replace(/9/g, "۹").replace(/0/g, "۰") + ' ویرایش دریافت شد&hellip;' );<br />
query.rvstartid = data['query-continue'].revisions.rvcontinue;<br />
getRevisions();<br />
}<br />
else {<br />
setResult();<br />
}<br />
},<br />
error: function(jqXHR, textStatus, errorThrown) {<br />
alert('Error, but with "' + textStatus + '"');<br />
$('#mw-js-message.mw-js-message-page-authors').slideUp(1000);<br />
}<br />
});<br />
};<br />
<br />
function setResult() {<br />
// final handler after all ajax calls has completed<br />
$('#mw-js-message.mw-js-message-page-authors #progress').html( 'All revisions loaded&hellip;' );<br />
<br />
// variables <br />
var digests = Object();<br />
var users = Object();<br />
var revids = Object();<br />
<br />
// short form to get the revisions<br />
var revs = revisions;<br />
<br />
// get the individual revisions through a revid-key<br />
for (var i = 0; i < revs.length; i++) revids[revs[i].revid] = revs[i];<br />
<br />
// get the individual revisions through the fnv-digest<br />
$('#mw-js-message.mw-js-message-page-authors #progress').html( 'Calculate FNV-digests&hellip;' );<br />
var shunted = 0;<br />
for (var i = revs.length-1; 0<=i; i--) {<br />
if (digests[revs[i].fnv]) {<br />
revs[i].previousid = digests[revs[i].fnv].revid;<br />
shunted++;<br />
}<br />
digests[revs[i].fnv] = revs[i];<br />
}<br />
<br />
// cache the cosine measure and set previousid to reflect the span<br />
$('#mw-js-message.mw-js-message-page-authors #progress').html( 'Calculate cosine measure&hellip;' );<br />
var i = 0;<br />
while (i<revs.length) {<br />
var j = i;<br />
if (revs[i].previousid) {<br />
revs[i].cosine = rcos(revs[i].vec, revids[revs[i].previousid].vec);<br />
var previousid = revs[i].previousid;<br />
while (revs[i].revid > previousid && i<revs.length) i++;<br />
}<br />
else if (revs[i].parentid) {<br />
revs[i].cosine = rcos(revs[i].vec, revids[revs[i].parentid].vec);<br />
var parentid = revs[i].parentid;<br />
while (revs[i].revid > parentid && i<revs.length) i++;<br />
}<br />
else if (i+1<revs.length) {<br />
revs[i].cosine = rcos(revs[i].vec, revs[i+1].vec);<br />
i++;<br />
}<br />
else if (i+1==revs.length) {<br />
revs[i].cosine = rcos(revs[i].vec);<br />
revs[j].previousid = 0;<br />
break; <br />
}<br />
if (i != j) revs[j].previousid = revs[i].revid;<br />
}<br />
<br />
// adjust the cosine measure if lsh is to far off<br />
$('#mw-js-message.mw-js-message-page-authors #progress').html( 'Adjust cosine measure&hellip;' );<br />
var similar = 0;<br />
var revision = revs[0];<br />
while (revision) {<br />
var previous = revids[revision.previousid];<br />
if (previous /* && revision.size > 100 */ && 64<revision.cosine) {<br />
var p=previous;<br />
var lsh=2147483647;<br />
var keep = null;<br />
for (var j = 0; j < 16; j++) {<br />
if (p) {<br />
var tmp = rcos(revision.vec, p.vec);<br />
if (lsh > tmp) {<br />
lsh = tmp;<br />
keep = p;<br />
}<br />
p = revids[p.previousid];<br />
}<br />
else {<br />
break;<br />
}<br />
}<br />
if (keep && keep != previous) {<br />
previous = keep;<br />
similar++;<br />
}<br />
}<br />
if (previous) {<br />
revision.previousid = previous.revid;<br />
revision.cosine = rcos(revision.vec, previous.vec);<br />
}<br />
revision = previous;<br />
}<br />
<br />
// accumulate the cosine measure for each user<br />
$('#mw-js-message.mw-js-message-page-authors #progress').html( 'Accumulate cosine measure&hellip;' );<br />
var revision = revs[0];<br />
var num = 0;<br />
while (revision) {<br />
if (!users[revision.user]) users[revision.user] = { cosine: 0 };<br />
users[revision.user].cosine += revision.cosine;<br />
revision = revids[revision.previousid];<br />
num++;<br />
}<br />
// accumulate the total cosine measure<br />
var acc = { cosine: 0 };<br />
for (var x in users) acc.cosine += users[x].cosine;<br />
<br />
//for (var x = 0; x < users.length; x++) acc.cosine += users[x].cosine;<br />
<br />
// sort out the main contributors<br />
$('#mw-js-message.mw-js-message-page-authors #progress').html( 'Sort out main contributors&hellip;' );<br />
var authors = Array();<br />
var pseudonyms = Array();<br />
var count = 0;<br />
for (var x in users) pseudonyms.push(x);<br />
var sorted=pseudonyms.sort(function(a, b){ return users[b].cosine - users[a].cosine });<br />
for (var x = 0; x < sorted.length; x++ ) {<br />
var name = sorted[x];<br />
var cosine = Math.round(100*users[name].cosine/acc.cosine);<br />
if (count++ < 5 && 0 < cosine) authors.push(name);<br />
else if (5 <= cosine ) authors.push(name);<br />
else if (revs[revs.length-1].user == name) authors.push(name);<br />
}<br />
<br />
// print the cosine measure for each user<br />
$('#mw-js-message.mw-js-message-page-authors #progress').html( 'Create presentation&hellip;' );<br />
str = '<p>این فهرست نشان دهندهٔ آمار ساده شدهٔ میزان مشارکت کاربرهای اصلی در این صفحه است.</p>';<br />
str += 'تعداد ' + String(num) .replace(/1/g, "۱").replace(/2/g, "۲").replace(/3/g, "۳").replace(/4/g, "۴").replace(/5/g, "۵").replace(/,/g, ".").replace(/6/g, "۶").replace(/7/g, "۷").replace(/8/g, "۸").replace(/9/g, "۹").replace(/0/g, "۰")+ ' از کل ' + String(revisions.length) .replace(/1/g, "۱").replace(/2/g, "۲").replace(/3/g, "۳").replace(/4/g, "۴").replace(/5/g, "۵").replace(/,/g, ".").replace(/6/g, "۶").replace(/7/g, "۷").replace(/8/g, "۸").replace(/9/g, "۹").replace(/0/g, "۰")+ ' نسخه در محاسبات درنظر گرفتهشدهاست. ';<br />
if (0<hidden)<br />
str += 'در میان نسخهها ' + String(hidden).replace(/1/g, "۱").replace(/2/g, "۲").replace(/3/g, "۳").replace(/4/g, "۴").replace(/5/g, "۵").replace(/,/g, ".").replace(/6/g, "۶").replace(/7/g, "۷").replace(/8/g, "۸").replace(/9/g, "۹").replace(/0/g, "۰") + ' ویرایش مخفیشده وجود دارد. ';<br />
if (0<shunted || 0<similar)<br />
str += ' از میان این نسخهها ' + String(shunted).replace(/1/g, "۱").replace(/2/g, "۲").replace(/3/g, "۳").replace(/4/g, "۴").replace(/5/g, "۵").replace(/,/g, ".").replace(/6/g, "۶").replace(/7/g, "۷").replace(/8/g, "۸").replace(/9/g, "۹").replace(/0/g, "۰") + ' نسخه بیتاثیر بودند و ' + String(similar).replace(/1/g, "۱").replace(/2/g, "۲").replace(/3/g, "۳").replace(/4/g, "۴").replace(/5/g, "۵").replace(/,/g, ".").replace(/6/g, "۶").replace(/7/g, "۷").replace(/8/g, "۸").replace(/9/g, "۹").replace(/0/g, "۰") + ' نسخه ویرایش مشابه با نسخههای قبلی یافت شد.';<br />
else<br />
str += 'مورد خاصی یافت نشد.';<br />
str += '<ul style="display:none">';<br />
var part = 0;<br />
for (var x = 0; x < authors.length; x++) {<br />
var name = authors[x];<br />
//document.write (acc.cosine);<br />
part += users[name].cosine;<br />
str += '<li>میزان مشارکت کاربر ';<br />
str += '<a href="' + mw.util.getUrl('User:' + name) + '">' + name + '</a>';<br />
str += ' (';<br />
str += '<a href="' + mw.util.getUrl('User_talk:' + name) + '">بحث</a>';<br />
str += ' | ';<br />
str += '<a href="' + mw.util.getUrl('Special:Contributions/' + name) + '">مشارکتها</a>';<br />
str += ') ';<br />
str += ' <em>';<br />
str += String((0.1<users[name].cosine/acc.cosine ? Math.round(100*users[name].cosine/acc.cosine) : Math.round(1000*users[name].cosine/acc.cosine)/10)).replace(/1/g, "۱").replace(/2/g, "۲").replace(/3/g, "۳").replace(/4/g, "۴").replace(/5/g, "۵").replace(/,/g, ".").replace(/6/g, "۶").replace(/7/g, "۷").replace(/8/g, "۸").replace(/9/g, "۹").replace(/0/g, "۰")+' ٪ ' + ' از کل مشارکتها ';<br />
if (revs[revs.length-1].user == name) str += ' و <B>شروع کنندهٔ مقاله</B> ';<br />
str += 'است.</em>';<br />
str += '</li>';<br />
}<br />
<br />
str += '<li>مشارکت ویرایشگران دیگر ' + String(Math.round(100*(acc.cosine-part)/acc.cosine)).replace(/1/g, "۱").replace(/2/g, "۲").replace(/3/g, "۳").replace(/4/g, "۴").replace(/5/g, "۵").replace(/,/g, ".").replace(/6/g, "۶").replace(/7/g, "۷").replace(/8/g, "۸").replace(/9/g, "۹").replace(/0/g, "۰") + '٪ از کل مشارکتهای مقاله است.</li>';<br />
str += '</ul>';<br />
$('#mw-js-message.mw-js-message-page-authors #progress').remove();<br />
$('#mw-js-message.mw-js-message-page-authors h3').each(function(i, el) { removeSpinner( 'page-authors' ); });<br />
$('#mw-js-message.mw-js-message-page-authors').append(str);<br />
$('#mw-js-message.mw-js-message-page-authors ul').slideDown(1000);<br />
inProgress = false;<br />
};<br />
<br />
// the strange test (2147483647 <= -1 >>> 1) is to verify that we have at least 32 bit ints<br />
// note that 32 bit ints are according to standard, while it can be longer but not shorter to respect the standard<br />
var nsnum = parseInt(mw.config.get('wgNamespaceNumber'));<br />
if (0 <= nsnum && 0 == nsnum%2 && mw.config.get('wgIsArticle') && (2147483647 <= -1 >>> 1)) {<br />
$( function() {<br />
mw.util.addPortletLink(<br />
"p-cactions",<br />
'#',<br />
"میزان مشارکت کاربرها",<br />
"t-article-authors",<br />
"نمایش میزان مشارکت کاربرها در این صفحه",<br />
null,<br />
null<br />
);<br />
$('#t-article-authors').click(onclick);<br />
});<br />
}<br />
})(mediaWiki, jQuery);</div>
Rootadmin