38     for (int i = 0; i < (int)s.w.size(); ++i) {  in operator <<()  local
39         out << s.w[i];  in operator <<()
40         if (i < (int)s.w.size() - 1) {  in operator <<()
50     for (int i = 0; i < (int)s.w.size(); ++i) {  in remark_SOM_element()  local
51         printf("%g", s.w[i]);  in remark_SOM_element()
52         if (i < (int)s.w.size() - 1) {  in remark_SOM_element()
83     for (int i = 1; i < (int)teaching.size(); ++i) {  in find_data_ranges()  local
84         max_range.elementwise_max(teaching[i]);  in find_data_ranges()
85         min_range.elementwise_min(teaching[i]);  in find_data_ranges()
90     for (int i = 0; i < (int)from.size(); ++i) {  in add_fraction_of_difference()  local
91         to[i] += frac * (from[i] - to[i]);  in add_fraction_of_difference()
97     for (int i = 0; i < (int)x.size(); ++i) {  in distance_squared()  local
98         double diff = x[i] - y[i];  in distance_squared()
107             for (int i = 0; i < (int)max_range.size(); ++i) {  in initialize()  local
109                     my_map[x][y][i] = (randval(min_range[i], max_range[i]));  in initialize()
112                     my_map[x][y][i] =  in initialize()
113                         ((double)(x + y) / (xMax + yMax) * (max_range[i] - min_range[i]) +  in initialize()
114                          min_range[i]);  in initialize()
180     for (int i = 0; i < nPasses; ++i) {  in teach()  local
190         double radius = max_radius * exp(-(double)i * radius_decay_rate);  in teach()
192         double learning_rate = max_learning_rate * exp(-(double)i * learning_decay_rate);  in teach()
193         epoch_update(in[j], i, min_x, min_y, radius, learning_rate);  in teach()
199     for (int i = 0; i < (int)(this->my_map.size()); ++i) {  in debug_output()  local
200         for (int j = 0; j < (int)(this->my_map[i].size()); ++j) {  in debug_output()
201             printf("map[%d, %d] == ", i, j);  in debug_output()
202             remark_SOM_element(this->my_map[i][j]);  in debug_output()