var point = new Array();
var x = new Array();
var bus = new Array();
var pref = new Array();
var v = new Array();
var rank = new Array();
var namex=new Array();
var time;
function sample() {
namex[1]="農林水産業";
namex[2]="鉱業";
namex[3]="製造業";
namex[4]="建設業";
namex[5]="電気・ガス・水道業";
namex[6]="卸売・小売業";
namex[7]="金融・保険業";
namex[8]="不動産業";
namex[9]="運輸・通信業";
namex[10]="サービス業(民間)";
namex[11]="サービス業(政府)";
namex[12]="対家計民間非営利サービス生産者";
for(s=1;s<13;s++){
$('#sel').append($('<option>').html(namex[s]).val(s));
}
$("select").change(function () {
var v = $("#sel").val();
v="b"+v;
play(v);
});
}
function play(bun) {
var query = "SELECT * FROM " +
'15KvNauWb1oGXO0FJ6Bua3vfEU9Tm4-jdKeHANWAN';
var query =query + " WHERE bus='"+bun+"'";
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(sx=1;sx<48;sx++){
point[sx]=new Array();
}
sx = 0;
for (var i in rows) {
sx=sx+1;
for(tx=1;tx<48;tx++){
point[tx][sx]=rows[i][tx+1]/1;
}
}
number = sx;
var timer;
var delay = 3000;
time=0;
var loop = function () {
time=time+1;
if(time>16)time=1;
for(s=1;s<48;s++){
v[s]=point[s][time];
}
ranking();
p1=0;
for(s=1;s<48;s++){
p1=p1+v[s];
}
var sub=new svgpaint();
str="<svg width=\"500\" height=\"500\">";
for(s=1;s<47;s++){
sx=rank[s];
y1=1000*v[sx]/p1;
sx=rank[s+1];
y2=1000*v[sx]/p1;
str=str+sub.line(s*10,500-y1,10*s+10,500-y2,2,"red");
}
str=str+sub.line(0,0,0,500,2,"black");
str=str+sub.line(500,500,0,500,2,"black");
str=str+"</svg>";
$("#memo").html(str);
str=(time+1974)+"年";
$("#m3").html(str);
clearTimeout(timer);
timer = setTimeout(loop, delay);
}
loop();
}
});
}
function ranking(){
var r,s,sx,h;
var ch=new Array();
for(s=1;s<48;s++){
ch[s]=0;
}
for (r = 1; r < 48; r++) {
sx = 0;
maxu = 0;
for (s = 1; s < 48; s++) {
h = 0;
if (v[s] > maxu) h = h + 1;
if (ch[s] < 50) h = h + 1;
if (h == 2) maxu = v[s];
if (h == 2) sx = s;
}
rank[r] = sx;
ch[sx] = 100;
}
}
最終更新:2017年03月21日 00:07