アットウィキロゴ

tamatai

ar point = new Array();
var pointx = new Array();
 
 var code = new Array();
 var v = new Array();
 
var rank = new Array();
var rankx = new Array();
 
 
function sample() {
 
        var query = "SELECT * FROM " +
            '1fgSXUCoNsXMFUIShKVmEvhOoArLyAOpM-8F8DaUR';
        var encodedQuery = encodeURIComponent(query);
 
        var url = ['https://www.googleapis.com/fusiontables/v1/query'];
        url.push('?sql=' + encodedQuery);
        url.push('&key=AIzaSyAH0WCAXRIdHdbI-6bnMSN4kVDDZZmGyqY');
        url.push('&callback=?');
 
 
 
 
 
        $.ajax({
            url: url.join(''),
            dataType: 'jsonp',
            success: function (data) {
                var rows = data['rows'];
 
 
 
                sx = 0;
 
                for (var i in rows) {
                    sx = sx + 1;
                    point[sx]=rows[i][2];
                     pointx[sx]=rows[i][14];
            code[sx]=  rows[i][1];  
            }
 
 
                number = sx;
 
for(s=1;s<number+1;s++){
if(code[s].length==5)code[s]="0"+code[s];    
}
 
 
for(s=1;s<number+1;s++){
code[s]=code[s].substring(0,5);   
}
 
ranking();
 
rankingx();
 
var sub=new svgpaint();
 str="<svg width=\"500\" height=\"500\">";
 
 
for(s=1;s<501;s++){
sx=rank[s]; 
y1=point[sx]/10000;
sx=rank[s+1];
y2=point[sx]/10000;
str=str+sub.line(s,500-y1,s+1,500-y2,2,"red");
sx=rankx[s]; 
y1=pointx[sx]/10000;
sx=rankx[s+1];
y2=pointx[sx]/10000;
str=str+sub.line(s,500-y1,s+1,500-y2,2,"blue");
}
str=str+"</svg>";
 
$("#memo").html(str);
 
 
 
 
 
           }
        });
 
}
 
 
 
 
 
  function ranking(){ 
 
var r,s,sx,h; 
var ch=new Array();
 
for(s=1;s<number+1;s++){
ch[s]=0;    
}
 
    for (r = 1; r < number+1; r++) {
        sx = 0;
        maxu = 0;
        for (s = 1; s <number+1; s++) {
            h = 0;
            if (point[s] > maxu) h = h + 1;
            if (ch[s] < 50) h = h + 1;
            if (h == 2) maxu = point[s];
            if (h == 2) sx = s;
        }
        rank[r] = sx;
        ch[sx] = 100;
    }
 
 
}
   function rankingx(){ 
 
var r,s,sx,h; 
var ch=new Array();
 
for(s=1;s<number+1;s++){
ch[s]=0;    
}
 
    for (r = 1; r < number+1; r++) {
        sx = 0;
        maxu = 0;
        for (s = 1; s <number+1; s++) {
            h = 0;
            if (pointx[s] > maxu) h = h + 1;
            if (ch[s] < 50) h = h + 1;
            if (h == 2) maxu = pointx[s];
            if (h == 2) sx = s;
        }
        rankx[r] = sx;
        ch[sx] = 100;
    }
 
 
}
 
最終更新:2017年03月18日 00:12