Lines Matching refs:size
138 xsize = ((int)map1.size() + xranges - 1) / xranges; in build_BMU_graph()
139 ysize = ((int)map1[0].size() + yranges - 1) / yranges; in build_BMU_graph()
155 for (int i = 0; i < (int)map1.size(); i += xsize) { in build_BMU_graph()
159 if (s_array[scnt]->size() != xindex + 1) { in build_BMU_graph()
162 (int)(s_array[scnt]->size()), in build_BMU_graph()
169 for (int j = 0; j < (int)map1[0].size(); j += ysize) { in build_BMU_graph()
171 int xmax = (i + xsize) > (int)map1.size() ? (int)map1.size() : i + xsize; in build_BMU_graph()
172 int ymax = (j + ysize) > (int)map1[0].size() ? (int)map1[0].size() : j + ysize; in build_BMU_graph()
199 for (int i = 0; i < (int)(*s_array[scnt]).size(); ++i) { in destroy_BMU_graph()
200 for (int j = 0; j < (int)(*s_array[scnt])[i].size(); ++j) { in destroy_BMU_graph()
392 next_j = (epoch + 1) % in.size(); in graph_teach()
536 single_dist.reserve(my_teaching.size()); in main()
538 single_xval.reserve(my_teaching.size()); in main()
540 single_yval.reserve(my_teaching.size()); in main()
581 for (int i = 0; i < cancel_count.size(); ++i) { in main()
586 for (int j = 0; j < cancel_count.size(); ++j) { in main()
600 for (int i = 0; i < extra_count.size(); ++i) { in main()
604 for (int j = 0; j < extra_count.size(); ++j) { in main()
621 for (int i = 0; i < missing_count.size(); ++i) { in main()
635 for (int i = 0; i < my_teaching.size(); ++i) { in main()