pop77 - 経済統計練習帳

var point = new Array();
var rate = new Array();
var namex = new Array();
var rank = new Array();
var v = new Array();
var rate2 = new Array();
var number;
 
function sample() {
 
        var query = "SELECT * FROM " +
            '1gUG0uTbeZnijerlsVYaQ8FcBJGgMtKNBJgFEIxti';
        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'];
 
 
 
 
 for(s=1;s<2000;s++){
 point[s]=new Array();    
 }
 
s=0;
                for (var i in rows) {
                    s = s + 1;
                    namex[s]= ""+rows[i][0];
                    for(sx=1;sx<20;sx++){
                    point[s][sx]=rows[i][sx+1]*1;
 
                }    
               }
 
 
                number = s;
 
v1=0;
for(s=1;s<number+1;s++){
v1=v1+point[s][1];
}
 
for(s=1;s<number+1;s++){
rate[s]=point[s][1]/v1;
}
 
v1=0;
for(s=1;s<number+1;s++){
v1=v1+point[s][10];
}
 
for(s=1;s<number+1;s++){
rate2[s]=point[s][10]/v1;
}
 
ranking(10);
 
var sub=new svgpaint();
 
str="<svg width=\"500\" height=\"500\">";
for(s=1;s<101;s++){
y1=5*500*rate[s];
y2=5*500*rate[s+1];   
str=str+sub.line(5*s,500-y1,5*s+5,500-y2,2,"blue");
sx=rank[s];
y1=5*500*rate2[sx];
sx=rank[s+1];
y2=5*500*rate2[sx];   
str=str+sub.line(5*s,500-y1,5*s+5,500-y2,2,"red");
}
 
 
str=str+sub.line(0,0,0,500,2,"black");
str=str+sub.line(0,500,500,500,2,"black");
str=str+"</svg>";
$("#memo").html(str);
 
 
 
       }
        });
 
}
 
 
 
 
function ranking(delta){ 
 
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][delta] > maxu) h = h + 1;
            if (ch[s] < 50) h = h + 1;
            if (h == 2) maxu = point[s][delta];
            if (h == 2) sx = s;
        }
        rank[r] = sx;
        ch[sx] = 100;
    }
 
 
}