jhg987643 - 経済統計練習帳

var a = new Array();
var b = new Array();
var x = new Array();
var y = new Array();
var number_dir = new Array();
var dir = new Array();
 
 
function sample() {
 
 
    for (s = 1; s < 10001; s++) {
        dir[s] = new Array();
    }
 
    var sub = new triangle();
    sub.faststep();
    x = sub.x;
    y = sub.y;
    number_dir = sub.number_dir;
    dir = sub.dir;
 
 
 
    for (s = 1; s < 101; s++) {
    a[s] = 1;
    b[s] = 5000;
    }
 
 
    var timer;
    var delay = 1000;
 
    var loop = function () {
 
        for (sp = 1; sp < 101; sp++) {
            move_a(sp);
        }
 
 
 
        for (sp = 1; sp < 101; sp++) {
            move_b(sp);
        }
 
        paint();
 
        clearTimeout(timer);
        timer = setTimeout(loop, delay);
    }
 
    loop();
 
 
 
 
}
 
function paint() {
 
    var sub = new svgpaint();
 
    str = "<svg width=\"500\" height=\"500\">";
 
 
    for (s = 1; s < 101; s++) {
        n1 = a[s];
        str = str + sub.rect(5 * x[n1] - 5, 5 * y[n1] - 5, 5, 5, "red");
    }
 
    for (s = 1; s < 101; s++) {
        n1 = b[s];
        str = str + sub.rect(5 * x[n1] - 5, 5 * y[n1] - 5, 5, 5, "blue");
    }
    str = str + "</svg>";
 
 
 
    $("#memo").html(str);
 
}
 
 
 
 
function move_a(sp) {
 
    var ch = new Array();
 
    for (s = 1; s < 10001; s++) {
       ch[s] =0;
    }
 
 
    for (s = 1; s < 101; s++) {
        sx = a[s];
        ch[sx] = 100;
    }
 
    for (s = 1; s < 101; s++) {
        sx = b[s];
        ch[sx] = 100;
    }
 
    s1 = a[sp];
    var n1 = number_dir[s1] * Math.random();
    var n2 = Math.floor(n1) + 1;
    s2 = dir[s1][n2];
 
 
    if (ch[s2] < 50) a[sp] = s2;
 
 
 
}
 
 
function move_b(sp) {
 
    var ch = new Array();
 
    for (s = 1; s < 10001; s++) {
        ch[s] = 0;
    }
 
 
    for (s = 1; s < 101; s++) {
        sx = a[s];
        ch[sx] = 100;
    }
 
    for (s = 1; s < 101; s++) {
        sx = b[s];
        ch[sx] = 100;
    }
 
    s1 = b[sp];
    var n1 = number_dir[s1] * Math.random();
    var n2 = Math.floor(n1) + 1;
    s2 = dir[s1][n2];
 
 
    if (ch[s2] < 50) b[sp] = s2;
 
 
 
}