-
Notifications
You must be signed in to change notification settings - Fork 2
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
2 changed files
with
138 additions
and
8 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,93 @@ | ||
| var infoblocks_by_module = []; | ||
| var dists_by_module = []; | ||
| var dists = []; | ||
| var dependent_counts = []; | ||
| var num_dists_fetched = 0; | ||
| var num_dists = 0; | ||
|
|
||
| // the DOM for search.cpan.org isn't easy to parse | ||
| // this function recursively finds DOM siblings by tagname | ||
| function find_sibling_by_tagname(start, tagname, failsafe, iteration) { | ||
| next = start.nextSibling; | ||
| if ( ! next ) { | ||
| return; | ||
| } | ||
| if ( next.tagName ) { | ||
| if ( next.tagName == failsafe ) { | ||
| return; | ||
| } | ||
| if ( next.tagName == tagname ) { | ||
| if ( ! iteration || iteration == 0 ) { | ||
| return next; | ||
| } | ||
| else { | ||
| iteration = iteration - 1; | ||
| } | ||
| } | ||
| } | ||
| return find_sibling_by_tagname(next, tagname, failsafe, iteration); | ||
| } | ||
|
|
||
| // this queries the external deps.cpantesters.org for the distribution | ||
| // and counts the number of dependents | ||
| // and calls the callback to have the page updated for all modules that are part of the distribution | ||
| function gather_cpan_dependents(dist) { | ||
| GM_xmlhttpRequest({ | ||
| method: "GET", | ||
| url: 'http://deps.cpantesters.org/depended-on-by.pl?dist=' + escape(dist), | ||
| onload: function( resp ) { | ||
| num = '0'; | ||
| if ( resp.responseText ) { | ||
| num = resp.responseText.split('<li>').length-1; | ||
| } | ||
| dependent_counts[dist] = num; | ||
| add_dependents_to_page(dist); | ||
| num_dists_fetched += 1; | ||
| if ( num_dists_fetched == num_dists ) { | ||
| show_top_dists(); | ||
| } | ||
| } | ||
| }); | ||
| } | ||
|
|
||
| // this is the callback to update the page | ||
| // for the distribution, it updates the page for each module that is part of the distribution | ||
| function add_dependents_to_page(dist) { | ||
| for ( var module in infoblocks_by_module ) { | ||
| if ( infoblocks_by_module[module] && dists_by_module[module] == dist ) { | ||
| infoblocks_by_module[module].innerHTML += "(<a href=\"http://deps.cpantesters.org/depended-on-by.pl?dist=" + dists_by_module[module] + "\">CPAN dependents</a>: " + dependent_counts[dist] + ")"; | ||
| } | ||
| } | ||
| } | ||
|
|
||
| function show_top_dists() { | ||
| var newP = document.createElement("p"); | ||
| var txt = 'Distributions in order of number of CPAN dependents: <pre>'; | ||
| dependent_counts = assocSort(dependent_counts); | ||
| for ( var dist in dependent_counts ) { | ||
| txt += dist + " (" + dependent_counts[dist] + " dependents)"; | ||
| txt += "\n"; | ||
| for ( module in infoblocks_by_module ) { | ||
| if ( infoblocks_by_module[module] && dists_by_module[module] == dist ) { | ||
| txt += " " + module + "\n"; | ||
| } | ||
| } | ||
| txt += "\n"; | ||
| } | ||
| txt += "</pre>"; | ||
| newP.innerHTML = txt; | ||
| document.getElementsByTagName('h2')[0].parentNode.insertBefore(newP,document.getElementsByTagName('h2')[0].previousSibling); | ||
| } | ||
|
|
||
| // found this function on the interwebs for sorting an associative array by value | ||
| function assocSort (oAssoc) { | ||
| var idx; var key; var arVal = []; var arValKey = []; var oRes = {}; | ||
| for (key in oAssoc) { | ||
| arVal[arVal.length] = oAssoc[key]; | ||
| arValKey[oAssoc[key]] = key; | ||
| } | ||
| arVal.sort().reverse(); | ||
| for (idx in arVal) | ||
| oRes[arValKey[arVal[idx]]] = arVal[idx]; | ||
| return oRes; | ||
| } |