Lines Matching defs:dim
48 int dim; // Dimension of each vector
78 for (j = 0; j < dim; j++)
96 for (j = 0; j < dim; j++)
98 dprintf("%5d ",vals[i * dim + j]);
115 dim = DEF_DIM;
122 dim = atoi(optarg);
139 if (dim <= 0 || num_means <= 0 || num_points <= 0 || grid_size <= 0) {
144 printf("Dimension = %d\n", dim);
159 for (j=0; j<dim; j++)
161 pts[i * dim + j] = rand() % grid_size;
177 for (j=0; j<dim; j++)
193 for (i = 0; i < dim; i++)
209 for (i = 0; i < dim; i++)
236 min_dist = get_sq_dist(&points[i * dim], (int *)(means[0].val));
240 cur_dist = get_sq_dist(&points[i * dim], (int *)(means[j].val));
254 emit_intermediate(means[min_idx].key, (void *)(&points[i * dim]), sizeof(means[min_idx].key));
280 out_data->points = (void *)(&(kmeans_data->points[kmeans_data->next_point * dim]));
336 sum = (int *)calloc(dim, sizeof(int));
337 mean = (int *)malloc(dim * sizeof(int));
347 for (i = 0; i < dim; i++)
375 kmeans_data.points = (int *)malloc(sizeof(int) * num_points * dim);
380 means = malloc(sizeof(int) * dim * num_means);
382 kmeans_data.means[i].val = &means[i * dim];
388 kmeans_data.unit_size = sizeof(int) * dim;
408 map_reduce_args.data_size = (num_points + num_means) * dim * sizeof(int);