dataset.cpp 54.5 KB
Newer Older
1
2
3
4
/*!
 * Copyright (c) 2016 Microsoft Corporation. All rights reserved.
 * Licensed under the MIT License. See LICENSE file in the project root for license information.
 */
Guolin Ke's avatar
Guolin Ke committed
5
#include <LightGBM/dataset.h>
6

Guolin Ke's avatar
Guolin Ke committed
7
#include <LightGBM/feature_group.h>
8
#include <LightGBM/utils/array_args.h>
9
#include <LightGBM/utils/openmp_wrapper.h>
Guolin Ke's avatar
Guolin Ke committed
10
#include <LightGBM/utils/threading.h>
Guolin Ke's avatar
Guolin Ke committed
11

12
#include <limits>
zhangyafeikimi's avatar
zhangyafeikimi committed
13
#include <chrono>
Guolin Ke's avatar
Guolin Ke committed
14
#include <cstdio>
Guolin Ke's avatar
Guolin Ke committed
15
#include <sstream>
16
#include <unordered_map>
Guolin Ke's avatar
Guolin Ke committed
17

18

Guolin Ke's avatar
Guolin Ke committed
19
20
namespace LightGBM {

21
const char* Dataset::binary_file_token = "______LightGBM_Binary_File_Token______\n";
Guolin Ke's avatar
Guolin Ke committed
22

Guolin Ke's avatar
Guolin Ke committed
23
Dataset::Dataset() {
24
  data_filename_ = "noname";
Guolin Ke's avatar
Guolin Ke committed
25
  num_data_ = 0;
Guolin Ke's avatar
Guolin Ke committed
26
  is_finish_load_ = false;
Guolin Ke's avatar
Guolin Ke committed
27
28
}

29
Dataset::Dataset(data_size_t num_data) {
Guolin Ke's avatar
Guolin Ke committed
30
  CHECK(num_data > 0);
Guolin Ke's avatar
Guolin Ke committed
31
  data_filename_ = "noname";
Guolin Ke's avatar
Guolin Ke committed
32
  num_data_ = num_data;
Guolin Ke's avatar
Guolin Ke committed
33
  metadata_.Init(num_data_, NO_SPECIFIC, NO_SPECIFIC);
Guolin Ke's avatar
Guolin Ke committed
34
  is_finish_load_ = false;
Guolin Ke's avatar
Guolin Ke committed
35
  group_bin_boundaries_.push_back(0);
Guolin Ke's avatar
Guolin Ke committed
36
37
}

Guolin Ke's avatar
Guolin Ke committed
38
Dataset::~Dataset() {
39

Guolin Ke's avatar
Guolin Ke committed
40
}
Guolin Ke's avatar
Guolin Ke committed
41

Guolin Ke's avatar
Guolin Ke committed
42
43
44
45
46
47
48
49
50
51
std::vector<std::vector<int>> NoGroup(
  const std::vector<int>& used_features) {
  std::vector<std::vector<int>> features_in_group;
  features_in_group.resize(used_features.size());
  for (size_t i = 0; i < used_features.size(); ++i) {
    features_in_group[i].emplace_back(used_features[i]);
  }
  return features_in_group;
}

52
int GetConfilctCount(const std::vector<bool>& mark, const int* indices, int num_indices, data_size_t max_cnt) {
Guolin Ke's avatar
Guolin Ke committed
53
54
55
56
  int ret = 0;
  for (int i = 0; i < num_indices; ++i) {
    if (mark[indices[i]]) {
      ++ret;
57
58
59
    }
    if (ret > max_cnt) {
      return -1;
Guolin Ke's avatar
Guolin Ke committed
60
61
62
63
    }
  }
  return ret;
}
64
65

void MarkUsed(std::vector<bool>* mark, const int* indices, data_size_t num_indices) {
Guolin Ke's avatar
Guolin Ke committed
66
  auto& ref_mark = *mark;
Guolin Ke's avatar
Guolin Ke committed
67
  for (int i = 0; i < num_indices; ++i) {
Guolin Ke's avatar
Guolin Ke committed
68
    ref_mark[indices[i]] = true;
Guolin Ke's avatar
Guolin Ke committed
69
70
71
  }
}

Guolin Ke's avatar
Guolin Ke committed
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
std::vector<int> FixSampleIndices(const BinMapper* bin_mapper, int num_total_samples, int num_indices, const int* sample_indices, const double* sample_values) {
  std::vector<int> ret;
  if (bin_mapper->GetDefaultBin() == bin_mapper->GetMostFreqBin()) {
    return ret;
  }
  int i = 0, j = 0;
  while (i < num_total_samples) {
    if (j < num_indices && sample_indices[j] < i) {
      ++j;
    } else if (j < num_indices && sample_indices[j] == i) {
      if (bin_mapper->ValueToBin(sample_values[j]) != bin_mapper->GetMostFreqBin()) {
        ret.push_back(i);
      }
      ++i;
    } else {
      ret.push_back(i++);
    }
  }
  return ret;
}

Guolin Ke's avatar
Guolin Ke committed
93
94
95
96
std::vector<std::vector<int>> FindGroups(const std::vector<std::unique_ptr<BinMapper>>& bin_mappers,
                                         const std::vector<int>& find_order,
                                         int** sample_indices,
                                         const int* num_per_col,
97
                                         int num_sample_col,
98
                                         data_size_t total_sample_cnt,
Guolin Ke's avatar
Guolin Ke committed
99
                                         data_size_t num_data,
100
101
                                         bool is_use_gpu,
                                         std::vector<int8_t>* multi_val_group) {
Guolin Ke's avatar
Guolin Ke committed
102
  const int max_search_group = 100;
103
104
105
106
  const int max_bin_per_group = 256;
  const data_size_t single_val_max_conflict_cnt = static_cast<data_size_t>(total_sample_cnt / 10000);
  multi_val_group->clear();

Guolin Ke's avatar
Guolin Ke committed
107
108
109
  Random rand(num_data);
  std::vector<std::vector<int>> features_in_group;
  std::vector<std::vector<bool>> conflict_marks;
110
111
  std::vector<data_size_t> group_used_row_cnt;
  std::vector<data_size_t> group_total_data_cnt;
Guolin Ke's avatar
Guolin Ke committed
112
113
  std::vector<int> group_num_bin;

114
  // first round: fill the single val group
Guolin Ke's avatar
Guolin Ke committed
115
  for (auto fidx : find_order) {
116
    bool is_filtered_feature = fidx >= num_sample_col;
117
    const data_size_t cur_non_zero_cnt = is_filtered_feature ? 0 : num_per_col[fidx];
Guolin Ke's avatar
Guolin Ke committed
118
119
    std::vector<int> available_groups;
    for (int gid = 0; gid < static_cast<int>(features_in_group.size()); ++gid) {
120
121
122
      auto cur_num_bin = group_num_bin[gid] + bin_mappers[fidx]->num_bin() + (bin_mappers[fidx]->GetDefaultBin() == 0 ? -1 : 0);
      if (group_total_data_cnt[gid] + cur_non_zero_cnt <= total_sample_cnt + single_val_max_conflict_cnt) {
        if (!is_use_gpu || cur_num_bin <= max_bin_per_group) {
Guolin Ke's avatar
Guolin Ke committed
123
124
          available_groups.push_back(gid);
        }
Guolin Ke's avatar
Guolin Ke committed
125
126
127
128
129
130
      }
    }
    std::vector<int> search_groups;
    if (!available_groups.empty()) {
      int last = static_cast<int>(available_groups.size()) - 1;
      auto indices = rand.Sample(last, std::min(last, max_search_group - 1));
131
      // always push the last group
Guolin Ke's avatar
Guolin Ke committed
132
133
134
135
136
      search_groups.push_back(available_groups.back());
      for (auto idx : indices) {
        search_groups.push_back(available_groups[idx]);
      }
    }
137
138
    int best_gid = -1;
    int best_conflict_cnt = -1;
Guolin Ke's avatar
Guolin Ke committed
139
    for (auto gid : search_groups) {
140
141
142
143
144
      const data_size_t rest_max_cnt = single_val_max_conflict_cnt - group_total_data_cnt[gid] + group_used_row_cnt[gid];
      const data_size_t cnt = is_filtered_feature ? 0 : GetConfilctCount(conflict_marks[gid], sample_indices[fidx], num_per_col[fidx], rest_max_cnt);
      if (cnt >= 0 && cnt <= rest_max_cnt && cnt <= cur_non_zero_cnt / 2) {
        best_gid = gid;
        best_conflict_cnt = cnt;
Guolin Ke's avatar
Guolin Ke committed
145
146
147
        break;
      }
    }
148
149
150
151
152
153
154
155
156
    if (best_gid >= 0) {
      features_in_group[best_gid].push_back(fidx);
      group_total_data_cnt[best_gid] += cur_non_zero_cnt;
      group_used_row_cnt[best_gid] += cur_non_zero_cnt - best_conflict_cnt;
      if (!is_filtered_feature) {
        MarkUsed(&conflict_marks[best_gid], sample_indices[fidx], num_per_col[fidx]);
      }
      group_num_bin[best_gid] += bin_mappers[fidx]->num_bin() + (bin_mappers[fidx]->GetDefaultBin() == 0 ? -1 : 0);
    } else {
Guolin Ke's avatar
Guolin Ke committed
157
158
159
      features_in_group.emplace_back();
      features_in_group.back().push_back(fidx);
      conflict_marks.emplace_back(total_sample_cnt, false);
160
161
162
      if (!is_filtered_feature) {
        MarkUsed(&(conflict_marks.back()), sample_indices[fidx], num_per_col[fidx]);
      }
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
      group_total_data_cnt.emplace_back(cur_non_zero_cnt);
      group_used_row_cnt.emplace_back(cur_non_zero_cnt);
      group_num_bin.push_back(1 + bin_mappers[fidx]->num_bin() + (bin_mappers[fidx]->GetDefaultBin() == 0 ? -1 : 0));
    }
  }
  std::vector<int> second_round_features;
  std::vector<std::vector<int>> features_in_group2;
  std::vector<std::vector<bool>> conflict_marks2;

  const double dense_threshold = 0.4;
  for (int gid = 0; gid < static_cast<int>(features_in_group.size()); ++gid) {
    const double dense_rate = static_cast<double>(group_used_row_cnt[gid]) / total_sample_cnt;
    if (dense_rate >= dense_threshold) {
      features_in_group2.push_back(std::move(features_in_group[gid]));
      conflict_marks2.push_back(std::move(conflict_marks[gid]));
    } else {
      for (auto fidx : features_in_group[gid]) {
        second_round_features.push_back(fidx);
      }
    }
  }

  features_in_group = features_in_group2;
  conflict_marks = conflict_marks2;
  multi_val_group->resize(features_in_group.size(), false);
  if (!second_round_features.empty()) {
    features_in_group.emplace_back();
    conflict_marks.emplace_back(total_sample_cnt, false);
    bool is_multi_val = is_use_gpu ? true : false;
    int conflict_cnt = 0;
    for (auto fidx : second_round_features) {
      features_in_group.back().push_back(fidx);
      if (!is_multi_val) {
        const int rest_max_cnt = single_val_max_conflict_cnt - conflict_cnt;
        const auto cnt = GetConfilctCount(conflict_marks.back(), sample_indices[fidx], num_per_col[fidx], rest_max_cnt);
        conflict_cnt += cnt;
        if (cnt < 0 || conflict_cnt > single_val_max_conflict_cnt) {
          is_multi_val = true;
          continue;
        }
        MarkUsed(&(conflict_marks.back()), sample_indices[fidx], num_per_col[fidx]);
Guolin Ke's avatar
Guolin Ke committed
204
      }
Guolin Ke's avatar
Guolin Ke committed
205
    }
206
    multi_val_group->push_back(is_multi_val);
Guolin Ke's avatar
Guolin Ke committed
207
208
209
210
  }
  return features_in_group;
}

Guolin Ke's avatar
Guolin Ke committed
211
std::vector<std::vector<int>> FastFeatureBundling(const std::vector<std::unique_ptr<BinMapper>>& bin_mappers,
Guolin Ke's avatar
Guolin Ke committed
212
                                                  int** sample_indices,
Guolin Ke's avatar
Guolin Ke committed
213
                                                  double** sample_values,
Guolin Ke's avatar
Guolin Ke committed
214
                                                  const int* num_per_col,
215
                                                  int num_sample_col,
216
                                                  data_size_t total_sample_cnt,
Guolin Ke's avatar
Guolin Ke committed
217
218
                                                  const std::vector<int>& used_features,
                                                  data_size_t num_data,
219
220
221
                                                  bool is_use_gpu,
                                                  std::vector<int8_t>* multi_val_group) {
  Common::FunctionTimer fun_timer("Dataset::FastFeatureBundling", global_timer);
Guolin Ke's avatar
Guolin Ke committed
222
  std::vector<size_t> feature_non_zero_cnt;
223
  feature_non_zero_cnt.reserve(used_features.size());
Guolin Ke's avatar
Guolin Ke committed
224
225
  // put dense feature first
  for (auto fidx : used_features) {
226
227
228
229
230
    if (fidx < num_sample_col) {
      feature_non_zero_cnt.emplace_back(num_per_col[fidx]);
    } else {
      feature_non_zero_cnt.emplace_back(0);
    }
Guolin Ke's avatar
Guolin Ke committed
231
232
233
  }
  // sort by non zero cnt
  std::vector<int> sorted_idx;
234
  sorted_idx.reserve(used_features.size());
235
  for (int i = 0; i < static_cast<int>(used_features.size()); ++i) {
Guolin Ke's avatar
Guolin Ke committed
236
237
238
    sorted_idx.emplace_back(i);
  }
  // sort by non zero cnt, bigger first
239
240
  std::stable_sort(sorted_idx.begin(), sorted_idx.end(),
                   [&feature_non_zero_cnt](int a, int b) {
Guolin Ke's avatar
Guolin Ke committed
241
242
243
244
    return feature_non_zero_cnt[a] > feature_non_zero_cnt[b];
  });

  std::vector<int> feature_order_by_cnt;
245
  feature_order_by_cnt.reserve(sorted_idx.size());
Guolin Ke's avatar
Guolin Ke committed
246
247
248
  for (auto sidx : sorted_idx) {
    feature_order_by_cnt.push_back(used_features[sidx]);
  }
249

Guolin Ke's avatar
Guolin Ke committed
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
  std::vector<std::vector<int>> tmp_indices;
  std::vector<int> tmp_num_per_col(num_sample_col, 0);
  for (auto fidx : used_features) {
    if (fidx >= num_sample_col) {
      continue;
    }
    auto ret = FixSampleIndices(bin_mappers[fidx].get(), static_cast<int>(total_sample_cnt), num_per_col[fidx], sample_indices[fidx], sample_values[fidx]);
    if (!ret.empty()) {
      tmp_indices.push_back(ret);
      tmp_num_per_col[fidx] = static_cast<int>(ret.size());
      sample_indices[fidx] = tmp_indices.back().data();
    } else {
      tmp_num_per_col[fidx] = num_per_col[fidx];
    }
  }
265
266
267
268
  std::vector<int8_t> group_is_multi_val, group_is_multi_val2;
  auto features_in_group = FindGroups(bin_mappers, used_features, sample_indices, tmp_num_per_col.data(), num_sample_col, total_sample_cnt, num_data, is_use_gpu, &group_is_multi_val);
  auto group2 = FindGroups(bin_mappers, feature_order_by_cnt, sample_indices, tmp_num_per_col.data(), num_sample_col, total_sample_cnt, num_data, is_use_gpu, &group_is_multi_val2);

Guolin Ke's avatar
Guolin Ke committed
269
270
  if (features_in_group.size() > group2.size()) {
    features_in_group = group2;
271
    group_is_multi_val = group_is_multi_val2;
Guolin Ke's avatar
Guolin Ke committed
272
273
  }
  // shuffle groups
274
275
  int num_group = static_cast<int>(features_in_group.size());
  Random tmp_rand(num_data);
Guolin Ke's avatar
Guolin Ke committed
276
277
  for (int i = 0; i < num_group - 1; ++i) {
    int j = tmp_rand.NextShort(i + 1, num_group);
278
279
280
    std::swap(features_in_group[i], features_in_group[j]);
    // Use std::swap for vector<bool> will cause the wrong result..
    std::swap(group_is_multi_val[i], group_is_multi_val[j]);
Guolin Ke's avatar
Guolin Ke committed
281
  }
282
283
  *multi_val_group = group_is_multi_val;
  return features_in_group;
Guolin Ke's avatar
Guolin Ke committed
284
285
}

Guolin Ke's avatar
Guolin Ke committed
286
void Dataset::Construct(
Guolin Ke's avatar
Guolin Ke committed
287
  std::vector<std::unique_ptr<BinMapper>>* bin_mappers,
288
  int num_total_features,
289
  const std::vector<std::vector<double>>& forced_bins,
Guolin Ke's avatar
Guolin Ke committed
290
  int** sample_non_zero_indices,
Guolin Ke's avatar
Guolin Ke committed
291
  double** sample_values,
Guolin Ke's avatar
Guolin Ke committed
292
  const int* num_per_col,
293
  int num_sample_col,
Guolin Ke's avatar
Guolin Ke committed
294
  size_t total_sample_cnt,
Guolin Ke's avatar
Guolin Ke committed
295
  const Config& io_config) {
296
297
  num_total_features_ = num_total_features;
  CHECK(num_total_features_ == static_cast<int>(bin_mappers->size()));
Guolin Ke's avatar
Guolin Ke committed
298
299
  // get num_features
  std::vector<int> used_features;
Guolin Ke's avatar
Guolin Ke committed
300
  auto& ref_bin_mappers = *bin_mappers;
Guolin Ke's avatar
Guolin Ke committed
301
  for (int i = 0; i < static_cast<int>(bin_mappers->size()); ++i) {
Guolin Ke's avatar
Guolin Ke committed
302
    if (ref_bin_mappers[i] != nullptr && !ref_bin_mappers[i]->is_trivial()) {
Guolin Ke's avatar
Guolin Ke committed
303
      used_features.emplace_back(i);
Guolin Ke's avatar
Guolin Ke committed
304
    }
Guolin Ke's avatar
Guolin Ke committed
305
  }
Guolin Ke's avatar
Guolin Ke committed
306
  if (used_features.empty()) {
307
    Log::Warning("There are no meaningful features, as all feature values are constant.");
Guolin Ke's avatar
Guolin Ke committed
308
  }
Guolin Ke's avatar
Guolin Ke committed
309
  auto features_in_group = NoGroup(used_features);
310
  std::vector<int8_t> group_is_multi_val(used_features.size(), 0);
311
  if (io_config.enable_bundle && !used_features.empty()) {
Guolin Ke's avatar
Guolin Ke committed
312
    features_in_group = FastFeatureBundling(*bin_mappers,
313
314
                                            sample_non_zero_indices, sample_values, num_per_col, num_sample_col, static_cast<data_size_t>(total_sample_cnt),
                                            used_features, num_data_, io_config.device_type == std::string("gpu"), &group_is_multi_val);
Guolin Ke's avatar
Guolin Ke committed
315
316
  }

Guolin Ke's avatar
Guolin Ke committed
317
318
319
320
321
322
323
324
325
326
  num_features_ = 0;
  for (const auto& fs : features_in_group) {
    num_features_ += static_cast<int>(fs.size());
  }
  int cur_fidx = 0;
  used_feature_map_ = std::vector<int>(num_total_features_, -1);
  num_groups_ = static_cast<int>(features_in_group.size());
  real_feature_idx_.resize(num_features_);
  feature2group_.resize(num_features_);
  feature2subfeature_.resize(num_features_);
327
  int num_multi_val_group = 0;
Guolin Ke's avatar
Guolin Ke committed
328
  feature_need_push_zeros_.clear();
Guolin Ke's avatar
Guolin Ke committed
329
330
331
  for (int i = 0; i < num_groups_; ++i) {
    auto cur_features = features_in_group[i];
    int cur_cnt_features = static_cast<int>(cur_features.size());
332
333
334
    if (group_is_multi_val[i]) {
      ++num_multi_val_group;
    }
Guolin Ke's avatar
Guolin Ke committed
335
336
337
338
339
340
341
342
    // get bin_mappers
    std::vector<std::unique_ptr<BinMapper>> cur_bin_mappers;
    for (int j = 0; j < cur_cnt_features; ++j) {
      int real_fidx = cur_features[j];
      used_feature_map_[real_fidx] = cur_fidx;
      real_feature_idx_[cur_fidx] = real_fidx;
      feature2group_[cur_fidx] = i;
      feature2subfeature_[cur_fidx] = j;
Guolin Ke's avatar
Guolin Ke committed
343
      cur_bin_mappers.emplace_back(ref_bin_mappers[real_fidx].release());
Guolin Ke's avatar
Guolin Ke committed
344
345
346
      if (cur_bin_mappers.back()->GetDefaultBin() != cur_bin_mappers.back()->GetMostFreqBin()) {
        feature_need_push_zeros_.push_back(cur_fidx);
      }
Guolin Ke's avatar
Guolin Ke committed
347
348
349
      ++cur_fidx;
    }
    feature_groups_.emplace_back(std::unique_ptr<FeatureGroup>(
350
      new FeatureGroup(cur_cnt_features, group_is_multi_val[i], &cur_bin_mappers, num_data_)));
Guolin Ke's avatar
Guolin Ke committed
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
  }
  feature_groups_.shrink_to_fit();
  group_bin_boundaries_.clear();
  uint64_t num_total_bin = 0;
  group_bin_boundaries_.push_back(num_total_bin);
  for (int i = 0; i < num_groups_; ++i) {
    num_total_bin += feature_groups_[i]->num_total_bin_;
    group_bin_boundaries_.push_back(num_total_bin);
  }
  int last_group = 0;
  group_feature_start_.reserve(num_groups_);
  group_feature_cnt_.reserve(num_groups_);
  group_feature_start_.push_back(0);
  group_feature_cnt_.push_back(1);
  for (int i = 1; i < num_features_; ++i) {
    const int group = feature2group_[i];
    if (group == last_group) {
      group_feature_cnt_.back() = group_feature_cnt_.back() + 1;
    } else {
      group_feature_start_.push_back(i);
      group_feature_cnt_.push_back(1);
      last_group = group;
    }
  }
Guolin Ke's avatar
Guolin Ke committed
375
376
377
378
379
380
381
382
383
384
385
386
387
388

  if (!io_config.monotone_constraints.empty()) {
    CHECK(static_cast<size_t>(num_total_features_) == io_config.monotone_constraints.size());
    monotone_types_.resize(num_features_);
    for (int i = 0; i < num_total_features_; ++i) {
      int inner_fidx = InnerFeatureIndex(i);
      if (inner_fidx >= 0) {
        monotone_types_[inner_fidx] = io_config.monotone_constraints[i];
      }
    }
    if (ArrayArgs<int8_t>::CheckAllZero(monotone_types_)) {
      monotone_types_.clear();
    }
  }
Guolin Ke's avatar
Guolin Ke committed
389
390
391
392
393
394
395
396
397
398
399
400
401
  if (!io_config.feature_contri.empty()) {
    CHECK(static_cast<size_t>(num_total_features_) == io_config.feature_contri.size());
    feature_penalty_.resize(num_features_);
    for (int i = 0; i < num_total_features_; ++i) {
      int inner_fidx = InnerFeatureIndex(i);
      if (inner_fidx >= 0) {
        feature_penalty_[inner_fidx] = std::max(0.0, io_config.feature_contri[i]);
      }
    }
    if (ArrayArgs<double>::CheckAll(feature_penalty_, 1.0)) {
      feature_penalty_.clear();
    }
  }
Belinda Trotta's avatar
Belinda Trotta committed
402
403
404
405
406
407
  if (!io_config.max_bin_by_feature.empty()) {
    CHECK(static_cast<size_t>(num_total_features_) == io_config.max_bin_by_feature.size());
    CHECK(*(std::min_element(io_config.max_bin_by_feature.begin(), io_config.max_bin_by_feature.end())) > 1);
    max_bin_by_feature_.resize(num_total_features_);
    max_bin_by_feature_.assign(io_config.max_bin_by_feature.begin(), io_config.max_bin_by_feature.end());
  }
408
  forced_bin_bounds_ = forced_bins;
409
410
411
412
413
414
415
416
417
418
419
420
421
422
  max_bin_ = io_config.max_bin;
  min_data_in_bin_ = io_config.min_data_in_bin;
  bin_construct_sample_cnt_ = io_config.bin_construct_sample_cnt;
  use_missing_ = io_config.use_missing;
  zero_as_missing_ = io_config.zero_as_missing;
}

void Dataset::ResetConfig(const char* parameters) {
  auto param = Config::Str2Map(parameters);
  Config io_config;
  io_config.Set(param);
  if (param.count("max_bin") && io_config.max_bin != max_bin_) {
    Log::Warning("Cannot change max_bin after constructed Dataset handle.");
  }
Belinda Trotta's avatar
Belinda Trotta committed
423
424
425
  if (param.count("max_bin_by_feature") && io_config.max_bin_by_feature != max_bin_by_feature_) {
    Log::Warning("Cannot change max_bin_by_feature after constructed Dataset handle.");
  }
426
427
428
429
430
431
432
433
434
435
436
437
  if (param.count("bin_construct_sample_cnt") && io_config.bin_construct_sample_cnt != bin_construct_sample_cnt_) {
    Log::Warning("Cannot change bin_construct_sample_cnt after constructed Dataset handle.");
  }
  if (param.count("min_data_in_bin") && io_config.min_data_in_bin != min_data_in_bin_) {
    Log::Warning("Cannot change min_data_in_bin after constructed Dataset handle.");
  }
  if (param.count("use_missing") && io_config.use_missing != use_missing_) {
    Log::Warning("Cannot change use_missing after constructed Dataset handle.");
  }
  if (param.count("zero_as_missing") && io_config.zero_as_missing != zero_as_missing_) {
    Log::Warning("Cannot change zero_as_missing after constructed Dataset handle.");
  }
438
439
440
  if (param.count("forcedbins_filename")) {
    Log::Warning("Cannot change forced bins after constructed Dataset handle.");
  }
Guolin Ke's avatar
Guolin Ke committed
441

442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
  if (!io_config.monotone_constraints.empty()) {
    CHECK(static_cast<size_t>(num_total_features_) == io_config.monotone_constraints.size());
    monotone_types_.resize(num_features_);
    for (int i = 0; i < num_total_features_; ++i) {
      int inner_fidx = InnerFeatureIndex(i);
      if (inner_fidx >= 0) {
        monotone_types_[inner_fidx] = io_config.monotone_constraints[i];
      }
    }
    if (ArrayArgs<int8_t>::CheckAllZero(monotone_types_)) {
      monotone_types_.clear();
    }
  }
  if (!io_config.feature_contri.empty()) {
    CHECK(static_cast<size_t>(num_total_features_) == io_config.feature_contri.size());
    feature_penalty_.resize(num_features_);
    for (int i = 0; i < num_total_features_; ++i) {
      int inner_fidx = InnerFeatureIndex(i);
      if (inner_fidx >= 0) {
        feature_penalty_[inner_fidx] = std::max(0.0, io_config.feature_contri[i]);
      }
    }
    if (ArrayArgs<double>::CheckAll(feature_penalty_, 1.0)) {
      feature_penalty_.clear();
    }
  }
Guolin Ke's avatar
Guolin Ke committed
468
469
}

Guolin Ke's avatar
Guolin Ke committed
470
void Dataset::FinishLoad() {
Guolin Ke's avatar
Guolin Ke committed
471
  if (is_finish_load_) { return; }
472
473
  if (num_groups_ > 0) {
    for (int i = 0; i < num_groups_; ++i) {
474
      feature_groups_[i]->FinishLoad();
475
    }
Guolin Ke's avatar
Guolin Ke committed
476
  }
Guolin Ke's avatar
Guolin Ke committed
477
  is_finish_load_ = true;
Guolin Ke's avatar
Guolin Ke committed
478
}
Guolin Ke's avatar
Guolin Ke committed
479

480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
void PushDataToMultiValBin(int num_threads, data_size_t num_data, const std::vector<uint32_t> most_freq_bins,
  const std::vector<uint32_t> offsets, std::vector<std::vector<std::unique_ptr<BinIterator>>>& iters, MultiValBin* ret) {
  Common::FunctionTimer fun_time("Dataset::PushDataToMultiValBin", global_timer);
  const data_size_t min_block_size = 4096;
  const int n_block = std::min(num_threads, (num_data + min_block_size - 1) / min_block_size);
  const data_size_t block_size = (num_data + n_block - 1) / n_block;
  if (ret->IsSparse()) {
    #pragma omp parallel for schedule(static)
    for (int tid = 0; tid < n_block; ++tid) {
      std::vector<uint32_t> cur_data;
      data_size_t start = tid * block_size;
      data_size_t end = std::min(num_data, start + block_size);
      for (size_t j = 0; j < most_freq_bins.size(); ++j) {
        iters[tid][j]->Reset(start);
      }
      for (data_size_t i = start; i < end; ++i) {
        cur_data.clear();
        for (size_t j = 0; j < most_freq_bins.size(); ++j) {
          auto cur_bin = iters[tid][j]->Get(i);
          if (cur_bin == most_freq_bins[j]) {
            continue;
          }
          cur_bin += offsets[j];
          if (most_freq_bins[j] == 0) {
            cur_bin -= 1;
          }
          cur_data.push_back(cur_bin);
        }
        ret->PushOneRow(tid, i, cur_data);
      }
    }
  } else {
    #pragma omp parallel for schedule(static)
    for (int tid = 0; tid < n_block; ++tid) {
      std::vector<uint32_t> cur_data;
      data_size_t start = tid * block_size;
      data_size_t end = std::min(num_data, start + block_size);
      for (size_t j = 0; j < most_freq_bins.size(); ++j) {
        iters[tid][j]->Reset(start);
      }
      for (data_size_t i = start; i < end; ++i) {
        cur_data.clear();
        for (size_t j = 0; j < most_freq_bins.size(); ++j) {
          auto cur_bin = iters[tid][j]->Get(i);
          if (cur_bin == most_freq_bins[j]) {
            cur_bin = 0;
          } else {
            cur_bin += offsets[j];
            if (most_freq_bins[j] == 0) {
              cur_bin -= 1;
            }
          }
          cur_data.push_back(cur_bin);
        }
        ret->PushOneRow(tid, i, cur_data);
      }
    }
  }
}

MultiValBin* Dataset::GetMultiBinFromSparseFeatures() const {
  Common::FunctionTimer fun_time("Dataset::GetMultiBinFromSparseFeatures", global_timer);
  int multi_group_id = -1;
  for (int i = 0; i < num_groups_; ++i) {
    if (feature_groups_[i]->is_multi_val_) {
      if (multi_group_id < 0) {
        multi_group_id = i;
      } else {
        Log::Fatal("Bug. There should be only one multi-val group.");
      }
    }
  }
  if (multi_group_id < 0) {
    return nullptr;
  }
  const auto& offsets = feature_groups_[multi_group_id]->bin_offsets_;
  const int num_feature = feature_groups_[multi_group_id]->num_feature_;
  int num_threads = 1;
  #pragma omp parallel
  #pragma omp master
  {
    num_threads = omp_get_num_threads();
  }

  std::vector<std::vector<std::unique_ptr<BinIterator>>> iters(num_threads);
  std::vector<uint32_t> most_freq_bins;
  double sum_sparse_rate = 0;
  for (int i = 0; i < num_feature; ++i) {
    for (int tid = 0; tid < num_threads; ++tid) {
      iters[tid].emplace_back(feature_groups_[multi_group_id]->SubFeatureIterator(i));
    }
    most_freq_bins.push_back(feature_groups_[multi_group_id]->bin_mappers_[i]->GetMostFreqBin());
    sum_sparse_rate += feature_groups_[multi_group_id]->bin_mappers_[i]->sparse_rate();
  }
  sum_sparse_rate /= num_feature;
  Log::Debug("GetMultiBinFromSparseFeatures:: sparse rate %f", sum_sparse_rate);
  std::unique_ptr<MultiValBin> ret;
  ret.reset(MultiValBin::CreateMultiValBin(num_data_, offsets.back(), num_feature, sum_sparse_rate));
  PushDataToMultiValBin(num_threads, num_data_, most_freq_bins, offsets, iters, ret.get());
  ret->FinishLoad();
  return ret.release();
}

MultiValBin* Dataset::GetMultiBinFromAllFeatures() const {
  Common::FunctionTimer fun_time("Dataset::GetMultiBinFromAllFeatures", global_timer);
  int num_threads = 1;
  #pragma omp parallel
  #pragma omp master
  {
    num_threads = omp_get_num_threads();
  }
  double sum_dense_ratio = 0;

  std::unique_ptr<MultiValBin> ret;
  std::vector<std::vector<std::unique_ptr<BinIterator>>> iters(num_threads);
  std::vector<uint32_t> most_freq_bins;
  std::vector<uint32_t> offsets;
  int num_total_bin = 1;
  offsets.push_back(num_total_bin);
  for (int gid = 0; gid < num_groups_; ++gid) {
    if (feature_groups_[gid]->is_multi_val_) {
      for (int fid = 0; fid < feature_groups_[gid]->num_feature_; ++fid) {
        const auto& bin_mapper = feature_groups_[gid]->bin_mappers_[fid];
        sum_dense_ratio += 1.0f - bin_mapper->sparse_rate();
        most_freq_bins.push_back(bin_mapper->GetMostFreqBin());
        num_total_bin += bin_mapper->num_bin();
        if (most_freq_bins.back() == 0) {
          num_total_bin -= 1;
        }
        offsets.push_back(num_total_bin);
        for (int tid = 0; tid < num_threads; ++tid) {
          iters[tid].emplace_back(feature_groups_[gid]->SubFeatureIterator(fid));
        }
      }
    } else {
      most_freq_bins.push_back(0);
      num_total_bin += feature_groups_[gid]->bin_offsets_.back() - 1;
      for (int tid = 0; tid < num_threads; ++tid) {
        iters[tid].emplace_back(feature_groups_[gid]->FeatureGroupIterator());
      }
      offsets.push_back(num_total_bin);
      for (int fid = 0; fid < feature_groups_[gid]->num_feature_; ++fid) {
        const auto& bin_mapper = feature_groups_[gid]->bin_mappers_[fid];
        sum_dense_ratio += 1.0f - bin_mapper->sparse_rate();
      }
    }
  }
  sum_dense_ratio /= static_cast<double>(most_freq_bins.size());
  Log::Debug("GetMultiBinFromAllFeatures:: sparse rate %f", 1.0 - sum_dense_ratio);
  ret.reset(MultiValBin::CreateMultiValBin(num_data_, num_total_bin, static_cast<int>(most_freq_bins.size()), 1.0 - sum_dense_ratio));
  PushDataToMultiValBin(num_threads, num_data_, most_freq_bins, offsets, iters, ret.get());
  ret->FinishLoad();
  return ret.release();
}

MultiValBin* Dataset::TestMultiThreadingMethod(score_t* gradients, score_t* hessians, const std::vector<int8_t>& is_feature_used, bool is_constant_hessian,
  bool force_colwise, bool force_rowwise, bool* is_hist_col_wise) const {
  int num_threads = 1;
#pragma omp parallel
#pragma omp master
  { num_threads = omp_get_num_threads(); }
  Common::FunctionTimer fun_timer("Dataset::TestMultiThreadingMethod", global_timer);
  if (force_colwise && force_rowwise) {
    Log::Fatal("cannot set both `force_col_wise` and `force_row_wise` to `true`.");
  }
  if (num_groups_ <= 0) {
    return nullptr;
  }
  if (force_colwise) {
    *is_hist_col_wise = true;
    return GetMultiBinFromSparseFeatures();
  } else if (force_rowwise) {
    *is_hist_col_wise = false;
    auto ret = GetMultiBinFromAllFeatures();
    const int num_bin_aligned =
        (ret->num_bin() + kAlignedSize - 1) / kAlignedSize * kAlignedSize;
    hist_buf_.resize(static_cast<size_t>(num_bin_aligned) * 2 * num_threads);
    return ret;
  } else {
    std::unique_ptr<MultiValBin> sparse_bin;
    std::unique_ptr<MultiValBin> all_bin;
    sparse_bin.reset(GetMultiBinFromSparseFeatures());
    all_bin.reset(GetMultiBinFromAllFeatures());
    std::vector<hist_t, Common::AlignmentAllocator<hist_t, kAlignedSize>> hist_data(NumTotalBin() * 2);
    const int num_bin_aligned =
        (all_bin->num_bin() + kAlignedSize - 1) / kAlignedSize * kAlignedSize;
    hist_buf_.resize(static_cast<size_t>(num_bin_aligned) * 2 * num_threads);
    std::chrono::duration<double, std::milli> col_wise_time, row_wise_time;
    auto start_time = std::chrono::steady_clock::now();
    ConstructHistograms(is_feature_used, nullptr, num_data_, gradients, hessians, gradients, hessians, is_constant_hessian, sparse_bin.get(), true, hist_data.data());
    col_wise_time = std::chrono::steady_clock::now() - start_time;
    start_time = std::chrono::steady_clock::now();
    ConstructHistogramsMultiVal(all_bin.get(), nullptr, num_data_, gradients, hessians, is_constant_hessian, hist_data.data());
    row_wise_time = std::chrono::steady_clock::now() - start_time;
    Log::Debug("colwise cost %f seconds, rowwise cost %f seconds", col_wise_time * 1e-3, row_wise_time * 1e-3);
    if (col_wise_time < row_wise_time) {
      *is_hist_col_wise = true;
      hist_buf_.clear();
      return sparse_bin.release();
    } else {
      *is_hist_col_wise = false;
      Log::Info("Use row-wise multi-threading, may increase memory usage. If memory is not enough, you can set `force_col_wise=true`.");
      if (all_bin->IsSparse()) {
        Log::Debug("Use Sparse Multi-Val Bin");
      } else {
        Log::Debug("Use Dense Multi-Val Bin");
      }
      return all_bin.release();
    }
  }
}

692
void Dataset::CopyFeatureMapperFrom(const Dataset* dataset) {
Guolin Ke's avatar
Guolin Ke committed
693
  feature_groups_.clear();
Guolin Ke's avatar
Guolin Ke committed
694
  num_features_ = dataset->num_features_;
Guolin Ke's avatar
Guolin Ke committed
695
  num_groups_ = dataset->num_groups_;
Guolin Ke's avatar
Guolin Ke committed
696
  // copy feature bin mapper data
Guolin Ke's avatar
Guolin Ke committed
697
698
699
700
701
702
703
  for (int i = 0; i < num_groups_; ++i) {
    std::vector<std::unique_ptr<BinMapper>> bin_mappers;
    for (int j = 0; j < dataset->feature_groups_[i]->num_feature_; ++j) {
      bin_mappers.emplace_back(new BinMapper(*(dataset->feature_groups_[i]->bin_mappers_[j])));
    }
    feature_groups_.emplace_back(new FeatureGroup(
      dataset->feature_groups_[i]->num_feature_,
704
      dataset->feature_groups_[i]->is_multi_val_,
Guolin Ke's avatar
Guolin Ke committed
705
      &bin_mappers,
706
      num_data_));
Guolin Ke's avatar
Guolin Ke committed
707
  }
Guolin Ke's avatar
Guolin Ke committed
708
  feature_groups_.shrink_to_fit();
Guolin Ke's avatar
Guolin Ke committed
709
710
711
  used_feature_map_ = dataset->used_feature_map_;
  num_total_features_ = dataset->num_total_features_;
  feature_names_ = dataset->feature_names_;
Guolin Ke's avatar
Guolin Ke committed
712
  label_idx_ = dataset->label_idx_;
Guolin Ke's avatar
Guolin Ke committed
713
714
715
716
717
718
  real_feature_idx_ = dataset->real_feature_idx_;
  feature2group_ = dataset->feature2group_;
  feature2subfeature_ = dataset->feature2subfeature_;
  group_bin_boundaries_ = dataset->group_bin_boundaries_;
  group_feature_start_ = dataset->group_feature_start_;
  group_feature_cnt_ = dataset->group_feature_cnt_;
Guolin Ke's avatar
Guolin Ke committed
719
  monotone_types_ = dataset->monotone_types_;
Guolin Ke's avatar
Guolin Ke committed
720
  feature_penalty_ = dataset->feature_penalty_;
721
  forced_bin_bounds_ = dataset->forced_bin_bounds_;
Guolin Ke's avatar
Guolin Ke committed
722
  feature_need_push_zeros_ = dataset->feature_need_push_zeros_;
Guolin Ke's avatar
Guolin Ke committed
723
724
725
726
727
728
729
730
731
}

void Dataset::CreateValid(const Dataset* dataset) {
  feature_groups_.clear();
  num_features_ = dataset->num_features_;
  num_groups_ = num_features_;
  feature2group_.clear();
  feature2subfeature_.clear();
  // copy feature bin mapper data
Guolin Ke's avatar
Guolin Ke committed
732
  feature_need_push_zeros_.clear();
Guolin Ke's avatar
Guolin Ke committed
733
734
735
  for (int i = 0; i < num_features_; ++i) {
    std::vector<std::unique_ptr<BinMapper>> bin_mappers;
    bin_mappers.emplace_back(new BinMapper(*(dataset->FeatureBinMapper(i))));
Guolin Ke's avatar
Guolin Ke committed
736
737
738
    if (bin_mappers.back()->GetDefaultBin() != bin_mappers.back()->GetMostFreqBin()) {
      feature_need_push_zeros_.push_back(i);
    }
739
740
    feature_groups_.emplace_back(new FeatureGroup(&bin_mappers,
                                                  num_data_));
Guolin Ke's avatar
Guolin Ke committed
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
    feature2group_.push_back(i);
    feature2subfeature_.push_back(0);
  }

  feature_groups_.shrink_to_fit();
  used_feature_map_ = dataset->used_feature_map_;
  num_total_features_ = dataset->num_total_features_;
  feature_names_ = dataset->feature_names_;
  label_idx_ = dataset->label_idx_;
  real_feature_idx_ = dataset->real_feature_idx_;
  group_bin_boundaries_.clear();
  uint64_t num_total_bin = 0;
  group_bin_boundaries_.push_back(num_total_bin);
  for (int i = 0; i < num_groups_; ++i) {
    num_total_bin += feature_groups_[i]->num_total_bin_;
    group_bin_boundaries_.push_back(num_total_bin);
  }
  int last_group = 0;
  group_feature_start_.reserve(num_groups_);
  group_feature_cnt_.reserve(num_groups_);
  group_feature_start_.push_back(0);
  group_feature_cnt_.push_back(1);
  for (int i = 1; i < num_features_; ++i) {
    const int group = feature2group_[i];
    if (group == last_group) {
      group_feature_cnt_.back() = group_feature_cnt_.back() + 1;
    } else {
      group_feature_start_.push_back(i);
      group_feature_cnt_.push_back(1);
      last_group = group;
    }
  }
Guolin Ke's avatar
Guolin Ke committed
773
  monotone_types_ = dataset->monotone_types_;
Guolin Ke's avatar
Guolin Ke committed
774
  feature_penalty_ = dataset->feature_penalty_;
775
  forced_bin_bounds_ = dataset->forced_bin_bounds_;
Guolin Ke's avatar
Guolin Ke committed
776
777
}

Guolin Ke's avatar
Guolin Ke committed
778
779
780
void Dataset::ReSize(data_size_t num_data) {
  if (num_data_ != num_data) {
    num_data_ = num_data;
781
    OMP_INIT_EX();
Guolin Ke's avatar
Guolin Ke committed
782
    #pragma omp parallel for schedule(static)
Guolin Ke's avatar
Guolin Ke committed
783
    for (int group = 0; group < num_groups_; ++group) {
784
      OMP_LOOP_EX_BEGIN();
Guolin Ke's avatar
Guolin Ke committed
785
      feature_groups_[group]->bin_data_->ReSize(num_data_);
786
      OMP_LOOP_EX_END();
Guolin Ke's avatar
Guolin Ke committed
787
    }
788
    OMP_THROW_EX();
Guolin Ke's avatar
Guolin Ke committed
789
790
791
792
793
  }
}

void Dataset::CopySubset(const Dataset* fullset, const data_size_t* used_indices, data_size_t num_used_indices, bool need_meta_data) {
  CHECK(num_used_indices == num_data_);
794
  OMP_INIT_EX();
Guolin Ke's avatar
Guolin Ke committed
795
  #pragma omp parallel for schedule(static)
Guolin Ke's avatar
Guolin Ke committed
796
  for (int group = 0; group < num_groups_; ++group) {
797
    OMP_LOOP_EX_BEGIN();
Guolin Ke's avatar
Guolin Ke committed
798
    feature_groups_[group]->CopySubset(fullset->feature_groups_[group].get(), used_indices, num_used_indices);
799
    OMP_LOOP_EX_END();
Guolin Ke's avatar
Guolin Ke committed
800
  }
801
  OMP_THROW_EX();
Guolin Ke's avatar
Guolin Ke committed
802
  if (need_meta_data) {
Guolin Ke's avatar
Guolin Ke committed
803
    metadata_.Init(fullset->metadata_, used_indices, num_used_indices);
Guolin Ke's avatar
Guolin Ke committed
804
  }
Guolin Ke's avatar
Guolin Ke committed
805
  is_finish_load_ = true;
Guolin Ke's avatar
Guolin Ke committed
806
807
}

808
bool Dataset::SetFloatField(const char* field_name, const float* field_data, data_size_t num_element) {
Guolin Ke's avatar
Guolin Ke committed
809
810
811
  std::string name(field_name);
  name = Common::Trim(name);
  if (name == std::string("label") || name == std::string("target")) {
812
    #ifdef LABEL_T_USE_DOUBLE
813
    Log::Fatal("Don't support LABEL_T_USE_DOUBLE");
814
    #else
815
    metadata_.SetLabel(field_data, num_element);
816
    #endif
Guolin Ke's avatar
Guolin Ke committed
817
  } else if (name == std::string("weight") || name == std::string("weights")) {
818
    #ifdef LABEL_T_USE_DOUBLE
819
    Log::Fatal("Don't support LABEL_T_USE_DOUBLE");
820
    #else
821
    metadata_.SetWeights(field_data, num_element);
822
    #endif
Guolin Ke's avatar
Guolin Ke committed
823
824
825
826
827
828
829
830
831
832
  } else {
    return false;
  }
  return true;
}

bool Dataset::SetDoubleField(const char* field_name, const double* field_data, data_size_t num_element) {
  std::string name(field_name);
  name = Common::Trim(name);
  if (name == std::string("init_score")) {
833
    metadata_.SetInitScore(field_data, num_element);
Guolin Ke's avatar
Guolin Ke committed
834
  } else {
835
    return false;
Guolin Ke's avatar
Guolin Ke committed
836
  }
837
  return true;
Guolin Ke's avatar
Guolin Ke committed
838
839
}

840
841
842
843
bool Dataset::SetIntField(const char* field_name, const int* field_data, data_size_t num_element) {
  std::string name(field_name);
  name = Common::Trim(name);
  if (name == std::string("query") || name == std::string("group")) {
Guolin Ke's avatar
Guolin Ke committed
844
    metadata_.SetQuery(field_data, num_element);
845
846
847
848
849
850
  } else {
    return false;
  }
  return true;
}

Guolin Ke's avatar
Guolin Ke committed
851
bool Dataset::GetFloatField(const char* field_name, data_size_t* out_len, const float** out_ptr) {
852
853
854
  std::string name(field_name);
  name = Common::Trim(name);
  if (name == std::string("label") || name == std::string("target")) {
855
    #ifdef LABEL_T_USE_DOUBLE
856
    Log::Fatal("Don't support LABEL_T_USE_DOUBLE");
857
    #else
858
859
    *out_ptr = metadata_.label();
    *out_len = num_data_;
860
    #endif
861
  } else if (name == std::string("weight") || name == std::string("weights")) {
862
    #ifdef LABEL_T_USE_DOUBLE
863
    Log::Fatal("Don't support LABEL_T_USE_DOUBLE");
864
    #else
865
866
    *out_ptr = metadata_.weights();
    *out_len = num_data_;
867
    #endif
Guolin Ke's avatar
Guolin Ke committed
868
869
870
871
872
873
874
875
876
877
  } else {
    return false;
  }
  return true;
}

bool Dataset::GetDoubleField(const char* field_name, data_size_t* out_len, const double** out_ptr) {
  std::string name(field_name);
  name = Common::Trim(name);
  if (name == std::string("init_score")) {
878
    *out_ptr = metadata_.init_score();
Guolin Ke's avatar
Guolin Ke committed
879
    *out_len = static_cast<data_size_t>(metadata_.num_init_score());
880
  } else if (name == std::string("feature_penalty")) {
881
    *out_ptr = feature_penalty_.data();
Guolin Ke's avatar
Guolin Ke committed
882
    *out_len = static_cast<data_size_t>(feature_penalty_.size());
883
  } else {
884
885
    return false;
  }
886
  return true;
887
888
}

Guolin Ke's avatar
Guolin Ke committed
889
bool Dataset::GetIntField(const char* field_name, data_size_t* out_len, const int** out_ptr) {
890
891
892
  std::string name(field_name);
  name = Common::Trim(name);
  if (name == std::string("query") || name == std::string("group")) {
893
    *out_ptr = metadata_.query_boundaries();
Guolin Ke's avatar
Guolin Ke committed
894
    *out_len = metadata_.num_queries() + 1;
Guolin Ke's avatar
Guolin Ke committed
895
896
897
  } else {
    return false;
  }
898
  return true;
899
900
}

901
902
903
904
905
bool Dataset::GetInt8Field(const char* field_name, data_size_t* out_len, const int8_t** out_ptr) {
  std::string name(field_name);
  name = Common::Trim(name);
  if (name == std::string("monotone_constraints")) {
    *out_ptr = monotone_types_.data();
Guolin Ke's avatar
Guolin Ke committed
906
    *out_len = static_cast<data_size_t>(monotone_types_.size());
907
908
909
910
911
912
  } else {
    return false;
  }
  return true;
}

Guolin Ke's avatar
Guolin Ke committed
913
void Dataset::SaveBinaryFile(const char* bin_filename) {
Guolin Ke's avatar
Guolin Ke committed
914
  if (bin_filename != nullptr
Guolin Ke's avatar
Guolin Ke committed
915
      && std::string(bin_filename) == data_filename_) {
916
    Log::Warning("Bianry file %s already exists", bin_filename);
Guolin Ke's avatar
Guolin Ke committed
917
918
    return;
  }
Guolin Ke's avatar
Guolin Ke committed
919
  // if not pass a filename, just append ".bin" of original file
Guolin Ke's avatar
Guolin Ke committed
920
  std::string bin_filename_str(data_filename_);
Guolin Ke's avatar
Guolin Ke committed
921
922
923
924
  if (bin_filename == nullptr || bin_filename[0] == '\0') {
    bin_filename_str.append(".bin");
    bin_filename = bin_filename_str.c_str();
  }
Guolin Ke's avatar
Guolin Ke committed
925
  bool is_file_existed = false;
926
927

  if (VirtualFileWriter::Exists(bin_filename)) {
Guolin Ke's avatar
Guolin Ke committed
928
    is_file_existed = true;
929
    Log::Warning("File %s exists, cannot save binary to it", bin_filename);
Guolin Ke's avatar
Guolin Ke committed
930
  }
Guolin Ke's avatar
Guolin Ke committed
931

Guolin Ke's avatar
Guolin Ke committed
932
  if (!is_file_existed) {
933
934
    auto writer = VirtualFileWriter::Make(bin_filename);
    if (!writer->Init()) {
Guolin Ke's avatar
Guolin Ke committed
935
      Log::Fatal("Cannot write binary data to %s ", bin_filename);
Guolin Ke's avatar
Guolin Ke committed
936
    }
937
    Log::Info("Saving data to binary file %s", bin_filename);
938
    size_t size_of_token = std::strlen(binary_file_token);
939
    writer->Write(binary_file_token, size_of_token);
Guolin Ke's avatar
Guolin Ke committed
940
    // get size of header
Guolin Ke's avatar
Guolin Ke committed
941
    size_t size_of_header = sizeof(num_data_) + sizeof(num_features_) + sizeof(num_total_features_)
942
      + sizeof(int) * num_total_features_ + sizeof(label_idx_) + sizeof(num_groups_) 
Guolin Ke's avatar
Guolin Ke committed
943
      + 3 * sizeof(int) * num_features_ + sizeof(uint64_t) * (num_groups_ + 1) + 2 * sizeof(int) * num_groups_ + sizeof(int8_t) * num_features_
Belinda Trotta's avatar
Belinda Trotta committed
944
      + sizeof(double) * num_features_ + sizeof(int32_t) * num_total_features_ + sizeof(int) * 3 + sizeof(bool) * 2;
945
946
947
948
    // size of feature names
    for (int i = 0; i < num_total_features_; ++i) {
      size_of_header += feature_names_[i].size() + sizeof(int);
    }
949
950
951
952
    // size of forced bins
    for (int i = 0; i < num_total_features_; ++i) {
      size_of_header += forced_bin_bounds_[i].size() * sizeof(double) + sizeof(int);
    }
953
    writer->Write(&size_of_header, sizeof(size_of_header));
Guolin Ke's avatar
Guolin Ke committed
954
    // write header
955
956
957
958
    writer->Write(&num_data_, sizeof(num_data_));
    writer->Write(&num_features_, sizeof(num_features_));
    writer->Write(&num_total_features_, sizeof(num_total_features_));
    writer->Write(&label_idx_, sizeof(label_idx_));
959
960
961
962
963
    writer->Write(&max_bin_, sizeof(max_bin_));
    writer->Write(&bin_construct_sample_cnt_, sizeof(bin_construct_sample_cnt_));
    writer->Write(&min_data_in_bin_, sizeof(min_data_in_bin_));
    writer->Write(&use_missing_, sizeof(use_missing_));
    writer->Write(&zero_as_missing_, sizeof(zero_as_missing_));
964
965
966
967
968
969
970
971
    writer->Write(used_feature_map_.data(), sizeof(int) * num_total_features_);
    writer->Write(&num_groups_, sizeof(num_groups_));
    writer->Write(real_feature_idx_.data(), sizeof(int) * num_features_);
    writer->Write(feature2group_.data(), sizeof(int) * num_features_);
    writer->Write(feature2subfeature_.data(), sizeof(int) * num_features_);
    writer->Write(group_bin_boundaries_.data(), sizeof(uint64_t) * (num_groups_ + 1));
    writer->Write(group_feature_start_.data(), sizeof(int) * num_groups_);
    writer->Write(group_feature_cnt_.data(), sizeof(int) * num_groups_);
Guolin Ke's avatar
Guolin Ke committed
972
973
974
975
976
977
978
    if (monotone_types_.empty()) {
      ArrayArgs<int8_t>::Assign(&monotone_types_, 0, num_features_);
    }
    writer->Write(monotone_types_.data(), sizeof(int8_t) * num_features_);
    if (ArrayArgs<int8_t>::CheckAllZero(monotone_types_)) {
      monotone_types_.clear();
    }
Guolin Ke's avatar
Guolin Ke committed
979
980
981
982
983
984
985
    if (feature_penalty_.empty()) {
      ArrayArgs<double>::Assign(&feature_penalty_, 1.0, num_features_);
    }
    writer->Write(feature_penalty_.data(), sizeof(double) * num_features_);
    if (ArrayArgs<double>::CheckAll(feature_penalty_, 1.0)) {
      feature_penalty_.clear();
    }
Belinda Trotta's avatar
Belinda Trotta committed
986
987
988
989
990
991
992
    if (max_bin_by_feature_.empty()) {
      ArrayArgs<int32_t>::Assign(&max_bin_by_feature_, -1, num_total_features_);
    }
    writer->Write(max_bin_by_feature_.data(), sizeof(int32_t) * num_total_features_);
    if (ArrayArgs<int32_t>::CheckAll(max_bin_by_feature_, -1)) {
      max_bin_by_feature_.clear();
    }
993
994
995
    // write feature names
    for (int i = 0; i < num_total_features_; ++i) {
      int str_len = static_cast<int>(feature_names_[i].size());
996
      writer->Write(&str_len, sizeof(int));
997
      const char* c_str = feature_names_[i].c_str();
998
      writer->Write(c_str, sizeof(char) * str_len);
999
    }
1000
1001
1002
1003
    // write forced bins
    for (int i = 0; i < num_total_features_; ++i) {
      int num_bounds = static_cast<int>(forced_bin_bounds_[i].size());
      writer->Write(&num_bounds, sizeof(int));
1004

1005
1006
1007
1008
      for (size_t j = 0; j < forced_bin_bounds_[i].size(); ++j) {
        writer->Write(&forced_bin_bounds_[i][j], sizeof(double));
      }
    }
1009

Guolin Ke's avatar
Guolin Ke committed
1010
1011
    // get size of meta data
    size_t size_of_metadata = metadata_.SizesInByte();
1012
    writer->Write(&size_of_metadata, sizeof(size_of_metadata));
Guolin Ke's avatar
Guolin Ke committed
1013
    // write meta data
1014
    metadata_.SaveBinaryToFile(writer.get());
Guolin Ke's avatar
Guolin Ke committed
1015
1016

    // write feature data
Guolin Ke's avatar
Guolin Ke committed
1017
    for (int i = 0; i < num_groups_; ++i) {
Guolin Ke's avatar
Guolin Ke committed
1018
      // get size of feature
Guolin Ke's avatar
Guolin Ke committed
1019
      size_t size_of_feature = feature_groups_[i]->SizesInByte();
1020
      writer->Write(&size_of_feature, sizeof(size_of_feature));
Guolin Ke's avatar
Guolin Ke committed
1021
      // write feature
1022
      feature_groups_[i]->SaveBinaryToFile(writer.get());
Guolin Ke's avatar
Guolin Ke committed
1023
1024
1025
1026
    }
  }
}

1027
void Dataset::DumpTextFile(const char* text_filename) {
Guolin Ke's avatar
Guolin Ke committed
1028
1029
1030
1031
1032
1033
  FILE* file = NULL;
#if _MSC_VER
  fopen_s(&file, text_filename, "wt");
#else
  file = fopen(text_filename, "wt");
#endif
1034
1035
1036
1037
1038
  fprintf(file, "num_features: %d\n", num_features_);
  fprintf(file, "num_total_features: %d\n", num_total_features_);
  fprintf(file, "num_groups: %d\n", num_groups_);
  fprintf(file, "num_data: %d\n", num_data_);
  fprintf(file, "feature_names: ");
1039
  for (auto n : feature_names_) {
1040
1041
1042
    fprintf(file, "%s, ", n.c_str());
  }
  fprintf(file, "\nmonotone_constraints: ");
1043
  for (auto i : monotone_types_) {
1044
1045
1046
    fprintf(file, "%d, ", i);
  }
  fprintf(file, "\nfeature_penalty: ");
1047
  for (auto i : feature_penalty_) {
1048
1049
    fprintf(file, "%lf, ", i);
  }
Belinda Trotta's avatar
Belinda Trotta committed
1050
1051
1052
1053
  fprintf(file, "\nmax_bin_by_feature: ");
  for (auto i : max_bin_by_feature_) {
    fprintf(file, "%d, ", i);
  }
1054
  fprintf(file, "\n");
1055
  for (auto n : feature_names_) {
1056
1057
    fprintf(file, "%s, ", n.c_str());
  }
1058
1059
1060
1061
1062
1063
1064
  fprintf(file, "\nforced_bins: ");
  for (int i = 0; i < num_total_features_; ++i) {
    fprintf(file, "\nfeature %d: ", i);
    for (size_t j = 0; j < forced_bin_bounds_[i].size(); ++j) {
      fprintf(file, "%lf, ", forced_bin_bounds_[i][j]);
    }
  }
1065
1066
  std::vector<std::unique_ptr<BinIterator>> iterators;
  iterators.reserve(num_features_);
1067
  for (int j = 0; j < num_features_; ++j) {
1068
1069
1070
1071
    auto group_idx = feature2group_[j];
    auto sub_idx = feature2subfeature_[j];
    iterators.emplace_back(feature_groups_[group_idx]->SubFeatureIterator(sub_idx));
  }
1072
  for (data_size_t i = 0; i < num_data_; ++i) {
1073
    fprintf(file, "\n");
1074
    for (int j = 0; j < num_total_features_; ++j) {
1075
      auto inner_feature_idx = used_feature_map_[j];
1076
1077
      if (inner_feature_idx < 0) {
        fprintf(file, "NA, ");
1078
      } else {
Guolin Ke's avatar
Guolin Ke committed
1079
        fprintf(file, "%d, ", iterators[inner_feature_idx]->Get(i));
1080
1081
1082
1083
1084
1085
      }
    }
  }
  fclose(file);
}

1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
void Dataset::ConstructHistogramsMultiVal(const MultiValBin* multi_val_bin, const data_size_t* data_indices, data_size_t num_data,
                                          const score_t* gradients, const score_t* hessians,
                                          bool is_constant_hessian,
                                          hist_t* hist_data) const {
  Common::FunctionTimer fun_time("Dataset::ConstructHistogramsMultiVal", global_timer);
  if (multi_val_bin == nullptr) { return; }
  int num_threads = 1;
  #pragma omp parallel
  #pragma omp master
  {
    num_threads = omp_get_num_threads();
  }

  global_timer.Start("Dataset::sparse_bin_histogram");
  const int num_bin = multi_val_bin->num_bin();
  const int num_bin_aligned = (num_bin + kAlignedSize - 1) / kAlignedSize * kAlignedSize;
  const int min_data_block_size = 1024;
  const int n_data_block = std::min(num_threads, (num_data + min_data_block_size - 1) / min_data_block_size);
  const int data_block_size = (num_data + n_data_block - 1) / n_data_block;

  const size_t buf_size = static_cast<size_t>(n_data_block - 1)* num_bin_aligned * 2;
  if (hist_buf_.size() < buf_size) {
    hist_buf_.resize(buf_size);
  }

  #pragma omp parallel for schedule(static)
  for (int tid = 0; tid < n_data_block; ++tid) {
    data_size_t start = tid * data_block_size;
    data_size_t end = std::min(start + data_block_size, num_data);
    auto data_ptr = hist_data;
    if (tid > 0) {
      data_ptr = hist_buf_.data() + static_cast<size_t>(num_bin_aligned) * 2 * (tid - 1);
    }
    std::memset(reinterpret_cast<void*>(data_ptr), 0, num_bin* KHistEntrySize);
    if (data_indices != nullptr && num_data < num_data_) {
      if (!is_constant_hessian) {
        multi_val_bin->ConstructHistogram(data_indices, start, end, gradients, hessians, data_ptr);
      } else {
        multi_val_bin->ConstructHistogram(data_indices, start, end, gradients, data_ptr);
      }
    } else {
      if (!is_constant_hessian) {
        multi_val_bin->ConstructHistogram(start, end, gradients, hessians, data_ptr);
      } else {
        multi_val_bin->ConstructHistogram(start, end, gradients, data_ptr);
      }
    }
  }
  global_timer.Stop("Dataset::sparse_bin_histogram");

  global_timer.Start("Dataset::sparse_bin_histogram_merge");

  const int min_bin_block_size = 512;
  const int n_bin_block = std::min(num_threads, (num_bin + min_bin_block_size - 1) / min_bin_block_size);
  const int bin_block_size = (num_bin + n_bin_block - 1) / n_bin_block;
  if (!is_constant_hessian) {
    #pragma omp parallel for schedule(static)
    for (int t = 0; t < n_bin_block; ++t) {
      const int start = t * bin_block_size;
      const int end = std::min(start + bin_block_size, num_bin);
      for (int tid = 1; tid < n_data_block; ++tid) {
        auto src_ptr = hist_buf_.data() + static_cast<size_t>(num_bin_aligned) * 2 * (tid - 1);
        for (int i = start * 2; i < end * 2; ++i) {
          hist_data[i] += src_ptr[i];
        }
      }
    }
  } else {
    #pragma omp parallel for schedule(static)
    for (int t = 0; t < n_bin_block; ++t) {
      const int start = t * bin_block_size;
      const int end = std::min(start + bin_block_size, num_bin);
      for (int tid = 1; tid < n_data_block; ++tid) {
        auto src_ptr = hist_buf_.data() + static_cast<size_t>(num_bin_aligned) * 2 * (tid - 1);
        for (int i = start * 2; i < end * 2; ++i) {
          hist_data[i] += src_ptr[i];
        }
      }
      for (int i = start; i < end; i++) {
        GET_HESS(hist_data, i) = GET_HESS(hist_data, i) * hessians[0];
      }
    }
  }
  global_timer.Stop("Dataset::sparse_bin_histogram_merge");
}

1172
1173
void Dataset::ConstructHistograms(const std::vector<int8_t>& is_feature_used,
                                  const data_size_t* data_indices, data_size_t num_data,
1174
1175
                                  const score_t* gradients, const score_t* hessians,
                                  score_t* ordered_gradients, score_t* ordered_hessians,
1176
                                  bool is_constant_hessian,
1177
1178
1179
1180
                                  const MultiValBin* multi_val_bin, bool is_colwise,
                                  hist_t* hist_data) const {
  Common::FunctionTimer fun_timer("Dataset::ConstructHistograms", global_timer);
  if (num_data < 0 || hist_data == nullptr) {
Guolin Ke's avatar
Guolin Ke committed
1181
1182
    return;
  }
1183
1184
1185
1186
1187
1188
1189
  if (!is_colwise) {
    return ConstructHistogramsMultiVal(multi_val_bin, data_indices, num_data, gradients, hessians, is_constant_hessian, hist_data);
  }
  global_timer.Start("Dataset::Get used group");
  std::vector<int> used_dense_group;
  int multi_val_groud_id = -1;
  used_dense_group.reserve(num_groups_);
Guolin Ke's avatar
Guolin Ke committed
1190
1191
  for (int group = 0; group < num_groups_; ++group) {
    const int f_cnt = group_feature_cnt_[group];
1192
    bool is_group_used = false;
Guolin Ke's avatar
Guolin Ke committed
1193
1194
1195
    for (int j = 0; j < f_cnt; ++j) {
      const int fidx = group_feature_start_[group] + j;
      if (is_feature_used[fidx]) {
1196
        is_group_used = true;
Guolin Ke's avatar
Guolin Ke committed
1197
1198
1199
        break;
      }
    }
1200
    if (is_group_used) {
1201
1202
1203
1204
      if (feature_groups_[group]->is_multi_val_) {
        multi_val_groud_id = group;
      } else {
        used_dense_group.push_back(group);
1205
      }
Guolin Ke's avatar
Guolin Ke committed
1206
    }
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
  }
  int num_used_dense_group = static_cast<int>(used_dense_group.size());
  global_timer.Stop("Dataset::Get used group");
  global_timer.Start("Dataset::dense_bin_histogram");
  if (num_used_dense_group > 0) {
    auto ptr_ordered_grad = gradients;
    auto ptr_ordered_hess = hessians;
    if (data_indices != nullptr && num_data < num_data_) {
      if (!is_constant_hessian) {
#pragma omp parallel for schedule(static)
        for (data_size_t i = 0; i < num_data; ++i) {
          ordered_gradients[i] = gradients[data_indices[i]];
          ordered_hessians[i] = hessians[data_indices[i]];
        }
      } else {
#pragma omp parallel for schedule(static)
        for (data_size_t i = 0; i < num_data; ++i) {
          ordered_gradients[i] = gradients[data_indices[i]];
1225
1226
        }
      }
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
      ptr_ordered_grad = ordered_gradients;
      ptr_ordered_hess = ordered_hessians;
      if (!is_constant_hessian) {
        OMP_INIT_EX();
#pragma omp parallel for schedule(static)
        for (int gi = 0; gi < num_used_dense_group; ++gi) {
          OMP_LOOP_EX_BEGIN();
          int group = used_dense_group[gi];
          // feature is not used
          auto data_ptr = hist_data + group_bin_boundaries_[group] * 2;
          const int num_bin = feature_groups_[group]->num_total_bin_;
          std::memset(reinterpret_cast<void*>(data_ptr), 0,
                      num_bin * KHistEntrySize);
          // construct histograms for smaller leaf
1241
          feature_groups_[group]->bin_data_->ConstructHistogram(
1242
1243
1244
              data_indices, 0, num_data, ptr_ordered_grad, ptr_ordered_hess,
              data_ptr);
          OMP_LOOP_EX_END();
1245
        }
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
        OMP_THROW_EX();

      } else {
        OMP_INIT_EX();
#pragma omp parallel for schedule(static)
        for (int gi = 0; gi < num_used_dense_group; ++gi) {
          OMP_LOOP_EX_BEGIN();
          int group = used_dense_group[gi];
          // feature is not used
          auto data_ptr = hist_data + group_bin_boundaries_[group] * 2;
          const int num_bin = feature_groups_[group]->num_total_bin_;
          std::memset(reinterpret_cast<void*>(data_ptr), 0,
                      num_bin * KHistEntrySize);
          // construct histograms for smaller leaf
1260
          feature_groups_[group]->bin_data_->ConstructHistogram(
1261
1262
1263
1264
1265
1266
              data_indices, 0, num_data, ptr_ordered_grad, data_ptr);
          // fixed hessian.
          for (int i = 0; i < num_bin; ++i) {
            GET_HESS(data_ptr, i) = GET_HESS(data_ptr, i) * hessians[0];
          }
          OMP_LOOP_EX_END();
1267
        }
1268
        OMP_THROW_EX();
1269
      }
1270
    } else {
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
      if (!is_constant_hessian) {
        OMP_INIT_EX();
#pragma omp parallel for schedule(static)
        for (int gi = 0; gi < num_used_dense_group; ++gi) {
          OMP_LOOP_EX_BEGIN();
          int group = used_dense_group[gi];
          // feature is not used
          auto data_ptr = hist_data + group_bin_boundaries_[group] * 2;
          const int num_bin = feature_groups_[group]->num_total_bin_;
          std::memset(reinterpret_cast<void*>(data_ptr), 0,
                      num_bin * KHistEntrySize);
          // construct histograms for smaller leaf
1283
          feature_groups_[group]->bin_data_->ConstructHistogram(
1284
1285
              0, num_data, ptr_ordered_grad, ptr_ordered_hess, data_ptr);
          OMP_LOOP_EX_END();
1286
        }
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
        OMP_THROW_EX();
      } else {
        OMP_INIT_EX();
#pragma omp parallel for schedule(static)
        for (int gi = 0; gi < num_used_dense_group; ++gi) {
          OMP_LOOP_EX_BEGIN();
          int group = used_dense_group[gi];
          // feature is not used
          auto data_ptr = hist_data + group_bin_boundaries_[group] * 2;
          const int num_bin = feature_groups_[group]->num_total_bin_;
          std::memset(reinterpret_cast<void*>(data_ptr), 0,
                      num_bin * KHistEntrySize);
          // construct histograms for smaller leaf
          feature_groups_[group]->bin_data_->ConstructHistogram(
              0, num_data, ptr_ordered_grad, data_ptr);
          // fixed hessian.
          for (int i = 0; i < num_bin; ++i) {
            GET_HESS(data_ptr, i) = GET_HESS(data_ptr, i) * hessians[0];
          }
          OMP_LOOP_EX_END();
1307
        }
1308
        OMP_THROW_EX();
1309
      }
Guolin Ke's avatar
Guolin Ke committed
1310
1311
    }
  }
1312
1313
1314
1315
1316
  global_timer.Stop("Dataset::dense_bin_histogram");
  if (multi_val_groud_id >= 0) {
    ConstructHistogramsMultiVal(multi_val_bin, data_indices, num_data, gradients, hessians, is_constant_hessian,
                                hist_data + group_bin_boundaries_[multi_val_groud_id] * 2);
  }
Guolin Ke's avatar
Guolin Ke committed
1317
1318
}

1319
void Dataset::FixHistogram(int feature_idx, double sum_gradient, double sum_hessian, hist_t* data) const {
Guolin Ke's avatar
Guolin Ke committed
1320
1321
1322
  const int group = feature2group_[feature_idx];
  const int sub_feature = feature2subfeature_[feature_idx];
  const BinMapper* bin_mapper = feature_groups_[group]->bin_mappers_[sub_feature].get();
Guolin Ke's avatar
Guolin Ke committed
1323
1324
  const int most_freq_bin = bin_mapper->GetMostFreqBin();
  if (most_freq_bin > 0) {
Guolin Ke's avatar
Guolin Ke committed
1325
    const int num_bin = bin_mapper->num_bin();
1326
1327
    GET_GRAD(data, most_freq_bin) = sum_gradient;
    GET_HESS(data, most_freq_bin) = sum_hessian;
Guolin Ke's avatar
Guolin Ke committed
1328
    for (int i = 0; i < num_bin; ++i) {
Guolin Ke's avatar
Guolin Ke committed
1329
      if (i != most_freq_bin) {
1330
1331
        GET_GRAD(data, most_freq_bin) -= GET_GRAD(data, i);
        GET_HESS(data, most_freq_bin) -= GET_HESS(data, i);
Guolin Ke's avatar
Guolin Ke committed
1332
1333
1334
1335
1336
      }
    }
  }
}

1337
template<typename T>
Guolin Ke's avatar
Guolin Ke committed
1338
1339
void PushVector(std::vector<T>* dest, const std::vector<T>& src) {
  dest->reserve(dest->size() + src.size());
1340
  for (auto i : src) {
Guolin Ke's avatar
Guolin Ke committed
1341
    dest->push_back(i);
1342
1343
1344
1345
  }
}

template<typename T>
Guolin Ke's avatar
Guolin Ke committed
1346
1347
void PushOffset(std::vector<T>* dest, const std::vector<T>& src, const T& offset) {
  dest->reserve(dest->size() + src.size());
1348
  for (auto i : src) {
Guolin Ke's avatar
Guolin Ke committed
1349
    dest->push_back(i + offset);
1350
1351
1352
1353
  }
}

template<typename T>
Guolin Ke's avatar
Guolin Ke committed
1354
1355
void PushClearIfEmpty(std::vector<T>* dest, const size_t dest_len, const std::vector<T>& src, const size_t src_len, const T& deflt) {
  if (!dest->empty() && !src.empty()) {
1356
    PushVector(dest, src);
Guolin Ke's avatar
Guolin Ke committed
1357
  } else if (!dest->empty() && src.empty()) {
1358
    for (size_t i = 0; i < src_len; ++i) {
Guolin Ke's avatar
Guolin Ke committed
1359
      dest->push_back(deflt);
1360
    }
Guolin Ke's avatar
Guolin Ke committed
1361
  } else if (dest->empty() && !src.empty()) {
1362
    for (size_t i = 0; i < dest_len; ++i) {
Guolin Ke's avatar
Guolin Ke committed
1363
      dest->push_back(deflt);
1364
1365
1366
1367
1368
    }
    PushVector(dest, src);
  }
}

1369
void Dataset::AddFeaturesFrom(Dataset* other) {
1370
  if (other->num_data_ != num_data_) {
1371
1372
    throw std::runtime_error("Cannot add features from other Dataset with a different number of rows");
  }
Guolin Ke's avatar
Guolin Ke committed
1373
1374
1375
  PushVector(&feature_names_, other->feature_names_);
  PushVector(&feature2subfeature_, other->feature2subfeature_);
  PushVector(&group_feature_cnt_, other->group_feature_cnt_);
1376
  PushVector(&forced_bin_bounds_, other->forced_bin_bounds_);
1377
  feature_groups_.reserve(other->feature_groups_.size());
1378
  for (auto& fg : other->feature_groups_) {
1379
1380
    feature_groups_.emplace_back(new FeatureGroup(*fg));
  }
1381
1382
  for (auto feature_idx : other->used_feature_map_) {
    if (feature_idx >= 0) {
1383
1384
1385
1386
1387
      used_feature_map_.push_back(feature_idx + num_features_);
    } else {
      used_feature_map_.push_back(-1);  // Unused feature.
    }
  }
Guolin Ke's avatar
Guolin Ke committed
1388
1389
  PushOffset(&real_feature_idx_, other->real_feature_idx_, num_total_features_);
  PushOffset(&feature2group_, other->feature2group_, num_groups_);
1390
1391
  auto bin_offset = group_bin_boundaries_.back();
  // Skip the leading 0 when copying group_bin_boundaries.
1392
  for (auto i = other->group_bin_boundaries_.begin()+1; i < other->group_bin_boundaries_.end(); ++i) {
1393
1394
    group_bin_boundaries_.push_back(*i + bin_offset);
  }
Guolin Ke's avatar
Guolin Ke committed
1395
  PushOffset(&group_feature_start_, other->group_feature_start_, num_features_);
1396

Guolin Ke's avatar
Guolin Ke committed
1397
1398
  PushClearIfEmpty(&monotone_types_, num_total_features_, other->monotone_types_, other->num_total_features_, (int8_t)0);
  PushClearIfEmpty(&feature_penalty_, num_total_features_, other->feature_penalty_, other->num_total_features_, 1.0);
1399
  PushClearIfEmpty(&max_bin_by_feature_, num_total_features_, other->max_bin_by_feature_, other->num_total_features_, -1);
1400

1401
1402
1403
1404
1405
  num_features_ += other->num_features_;
  num_total_features_ += other->num_total_features_;
  num_groups_ += other->num_groups_;
}

Guolin Ke's avatar
Guolin Ke committed
1406
}  // namespace LightGBM