convvbvb - 経済統計練習帳

var 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 " +
            '1SqYYlMmeIKl1HUM9h3x-wonBkyZUmxwwY7tWPoRG';
        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][38];
            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\">";
 
 
maxp=0; 
maxpx=0;
for(s=1;s<501;s++){
sx=rank[s]; 
maxp=maxp+point[sx];
sx=rankx[s]; 
maxpx=maxpx+pointx[sx];
}
 
 
for(s=1;s<501;s++){
sx=rank[s]; 
y1=100*500*point[sx]/maxp;
sx=rank[s+1];
y2=100*500*point[sx]/maxp;
str=str+sub.line(s,500-y1,s+1,500-y2,2,"red");
sx=rankx[s]; 
y1=100*500*pointx[sx]/maxpx;
sx=rankx[s+1];
y2=100*500*pointx[sx]/maxpx;
str=str+sub.line(s,500-y1,s+1,500-y2,2,"blue");
}
str=str+sub.line(0,500,0,0,2,"black");
str=str+sub.line(0,500,500,500,2,"black");
 
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;
    }
 
 
}