sampling.cpp 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570
  1. #include "sampling.h"
  2. #include "common.h"
  3. #include <cmath>
  4. #include <unordered_map>
  5. #include <algorithm>
  6. // the ring buffer works similarly to std::deque, but with a fixed capacity
  7. // TODO: deduplicate with llama-impl.h
  8. template<typename T>
  9. struct ring_buffer {
  10. ring_buffer(size_t cap) : capacity(cap), data(cap) {}
  11. T & front() {
  12. if (sz == 0) {
  13. throw std::runtime_error("ring buffer is empty");
  14. }
  15. return data[first];
  16. }
  17. const T & front() const {
  18. if (sz == 0) {
  19. throw std::runtime_error("ring buffer is empty");
  20. }
  21. return data[first];
  22. }
  23. T & back() {
  24. if (sz == 0) {
  25. throw std::runtime_error("ring buffer is empty");
  26. }
  27. return data[pos];
  28. }
  29. const T & back() const {
  30. if (sz == 0) {
  31. throw std::runtime_error("ring buffer is empty");
  32. }
  33. return data[pos];
  34. }
  35. void push_back(const T & value) {
  36. if (sz == capacity) {
  37. // advance the start when buffer is full
  38. first = (first + 1) % capacity;
  39. } else {
  40. sz++;
  41. }
  42. data[pos] = value;
  43. pos = (pos + 1) % capacity;
  44. }
  45. T pop_front() {
  46. if (sz == 0) {
  47. throw std::runtime_error("ring buffer is empty");
  48. }
  49. T value = data[first];
  50. first = (first + 1) % capacity;
  51. sz--;
  52. return value;
  53. }
  54. const T & rat(size_t i) const {
  55. if (i >= sz) {
  56. throw std::runtime_error("ring buffer: index out of bounds");
  57. }
  58. return data[(first + sz - i - 1) % capacity];
  59. }
  60. std::vector<T> to_vector() const {
  61. std::vector<T> result;
  62. result.reserve(sz);
  63. for (size_t i = 0; i < sz; i++) {
  64. result.push_back(data[(first + i) % capacity]);
  65. }
  66. return result;
  67. }
  68. void clear() {
  69. // here only reset the status of the buffer
  70. sz = 0;
  71. first = 0;
  72. pos = 0;
  73. }
  74. bool empty() const {
  75. return sz == 0;
  76. }
  77. size_t size() const {
  78. return sz;
  79. }
  80. size_t capacity = 0;
  81. size_t sz = 0;
  82. size_t first = 0;
  83. size_t pos = 0;
  84. std::vector<T> data;
  85. };
  86. struct common_sampler {
  87. common_params_sampling params;
  88. struct llama_sampler * grmr;
  89. struct llama_sampler * chain;
  90. ring_buffer<llama_token> prev;
  91. std::vector<llama_token_data> cur;
  92. llama_token_data_array cur_p;
  93. void set_logits(struct llama_context * ctx, int idx) {
  94. const auto * logits = llama_get_logits_ith(ctx, idx);
  95. const llama_model * model = llama_get_model(ctx);
  96. const llama_vocab * vocab = llama_model_get_vocab(model);
  97. const int n_vocab = llama_vocab_n_tokens(vocab);
  98. cur.resize(n_vocab);
  99. for (llama_token token_id = 0; token_id < n_vocab; token_id++) {
  100. cur[token_id] = llama_token_data{token_id, logits[token_id], 0.0f};
  101. }
  102. cur_p = { cur.data(), cur.size(), -1, false };
  103. }
  104. };
  105. std::string common_params_sampling::print() const {
  106. char result[1024];
  107. snprintf(result, sizeof(result),
  108. "\trepeat_last_n = %d, repeat_penalty = %.3f, frequency_penalty = %.3f, presence_penalty = %.3f\n"
  109. "\tdry_multiplier = %.3f, dry_base = %.3f, dry_allowed_length = %d, dry_penalty_last_n = %d\n"
  110. "\ttop_k = %d, top_p = %.3f, min_p = %.3f, xtc_probability = %.3f, xtc_threshold = %.3f, typical_p = %.3f, top_n_sigma = %.3f, temp = %.3f\n"
  111. "\tmirostat = %d, mirostat_lr = %.3f, mirostat_ent = %.3f",
  112. penalty_last_n, penalty_repeat, penalty_freq, penalty_present,
  113. dry_multiplier, dry_base, dry_allowed_length, dry_penalty_last_n,
  114. top_k, top_p, min_p, xtc_probability, xtc_threshold, typ_p, top_n_sigma, temp,
  115. mirostat, mirostat_eta, mirostat_tau);
  116. return std::string(result);
  117. }
  118. struct common_sampler * common_sampler_init(const struct llama_model * model, const struct common_params_sampling & params) {
  119. const llama_vocab * vocab = llama_model_get_vocab(model);
  120. llama_sampler_chain_params lparams = llama_sampler_chain_default_params();
  121. lparams.no_perf = params.no_perf;
  122. struct llama_sampler * grmr;
  123. if (params.grammar.compare(0, 11, "%llguidance") == 0) {
  124. #ifdef LLAMA_USE_LLGUIDANCE
  125. grmr = llama_sampler_init_llg(vocab, "lark", params.grammar.c_str());
  126. #else
  127. GGML_ABORT("llguidance (cmake -DLLAMA_LLGUIDANCE=ON) is not enabled");
  128. #endif // LLAMA_USE_LLGUIDANCE
  129. } else {
  130. std::vector<std::string> patterns_at_start;
  131. std::vector<std::string> patterns_anywhere;
  132. std::vector<llama_token> trigger_tokens;
  133. for (const auto & trigger : params.grammar_triggers) {
  134. switch (trigger.type) {
  135. case COMMON_GRAMMAR_TRIGGER_TYPE_WORD:
  136. {
  137. const auto & word = trigger.value;
  138. patterns_anywhere.push_back(regex_escape(word));
  139. break;
  140. }
  141. case COMMON_GRAMMAR_TRIGGER_TYPE_PATTERN:
  142. case COMMON_GRAMMAR_TRIGGER_TYPE_PATTERN_START:
  143. {
  144. const auto & pattern = trigger.value;
  145. (trigger.type == COMMON_GRAMMAR_TRIGGER_TYPE_PATTERN_START ? patterns_at_start : patterns_anywhere).push_back(pattern);
  146. break;
  147. }
  148. case COMMON_GRAMMAR_TRIGGER_TYPE_TOKEN:
  149. {
  150. const auto token = trigger.token;
  151. trigger_tokens.push_back(token);
  152. break;
  153. }
  154. default:
  155. GGML_ASSERT(false && "unknown trigger type");
  156. }
  157. }
  158. std::vector<std::string> trigger_patterns;
  159. if (!patterns_at_start.empty()) {
  160. trigger_patterns.push_back("^(" + string_join(patterns_at_start, "|") + ")[\\s\\S]*");
  161. }
  162. if (!patterns_anywhere.empty()) {
  163. trigger_patterns.push_back("^[\\s\\S]*?(" + string_join(patterns_anywhere, "|") + ")[\\s\\S]*");
  164. }
  165. std::vector<const char *> trigger_patterns_c;
  166. trigger_patterns_c.reserve(trigger_patterns.size());
  167. for (const auto & regex : trigger_patterns) {
  168. trigger_patterns_c.push_back(regex.c_str());
  169. }
  170. grmr = params.grammar_lazy
  171. ? llama_sampler_init_grammar_lazy_patterns(vocab, params.grammar.c_str(), "root",
  172. trigger_patterns_c.data(), trigger_patterns_c.size(),
  173. trigger_tokens.data(), trigger_tokens.size())
  174. : llama_sampler_init_grammar(vocab, params.grammar.c_str(), "root");
  175. }
  176. auto * result = new common_sampler {
  177. /* .params = */ params,
  178. /* .grmr = */ grmr,
  179. /* .chain = */ llama_sampler_chain_init(lparams),
  180. /* .prev = */ ring_buffer<llama_token>(std::max(32, params.n_prev)),
  181. /* .cur = */ {},
  182. /* .cur_p = */ {},
  183. };
  184. llama_sampler_chain_add(result->chain,
  185. llama_sampler_init_logit_bias(
  186. llama_vocab_n_tokens(vocab),
  187. params.logit_bias.size(),
  188. params.logit_bias.data()));
  189. if (params.mirostat == 0) {
  190. if (params.top_n_sigma >= 0) {
  191. llama_sampler_chain_add(result->chain, llama_sampler_init_top_k (params.top_k));
  192. llama_sampler_chain_add(result->chain, llama_sampler_init_temp (params.temp));
  193. llama_sampler_chain_add(result->chain, llama_sampler_init_top_n_sigma (params.top_n_sigma));
  194. } else {
  195. for (const auto & cnstr : params.samplers) {
  196. switch (cnstr) {
  197. case COMMON_SAMPLER_TYPE_DRY:
  198. {
  199. std::vector<const char *> c_breakers;
  200. c_breakers.reserve(params.dry_sequence_breakers.size());
  201. for (const auto & str : params.dry_sequence_breakers) {
  202. c_breakers.push_back(str.c_str());
  203. }
  204. llama_sampler_chain_add(result->chain, llama_sampler_init_dry (vocab, llama_model_n_ctx_train(model), params.dry_multiplier, params.dry_base, params.dry_allowed_length, params.dry_penalty_last_n, c_breakers.data(), c_breakers.size()));
  205. }
  206. break;
  207. case COMMON_SAMPLER_TYPE_TOP_K:
  208. llama_sampler_chain_add(result->chain, llama_sampler_init_top_k (params.top_k));
  209. break;
  210. case COMMON_SAMPLER_TYPE_TOP_P:
  211. llama_sampler_chain_add(result->chain, llama_sampler_init_top_p (params.top_p, params.min_keep));
  212. break;
  213. case COMMON_SAMPLER_TYPE_MIN_P:
  214. llama_sampler_chain_add(result->chain, llama_sampler_init_min_p (params.min_p, params.min_keep));
  215. break;
  216. case COMMON_SAMPLER_TYPE_XTC:
  217. llama_sampler_chain_add(result->chain, llama_sampler_init_xtc (params.xtc_probability, params.xtc_threshold, params.min_keep, params.seed));
  218. break;
  219. case COMMON_SAMPLER_TYPE_TYPICAL_P:
  220. llama_sampler_chain_add(result->chain, llama_sampler_init_typical (params.typ_p, params.min_keep));
  221. break;
  222. case COMMON_SAMPLER_TYPE_TEMPERATURE:
  223. llama_sampler_chain_add(result->chain, llama_sampler_init_temp_ext (params.temp, params.dynatemp_range, params.dynatemp_exponent));
  224. break;
  225. case COMMON_SAMPLER_TYPE_INFILL:
  226. llama_sampler_chain_add(result->chain, llama_sampler_init_infill (vocab));
  227. break;
  228. case COMMON_SAMPLER_TYPE_PENALTIES:
  229. llama_sampler_chain_add(result->chain, llama_sampler_init_penalties(params.penalty_last_n, params.penalty_repeat, params.penalty_freq, params.penalty_present));
  230. break;
  231. default:
  232. GGML_ASSERT(false && "unknown sampler type");
  233. }
  234. }
  235. }
  236. llama_sampler_chain_add(result->chain, llama_sampler_init_dist(params.seed));
  237. } else if (params.mirostat == 1) {
  238. llama_sampler_chain_add(result->chain, llama_sampler_init_temp(params.temp));
  239. llama_sampler_chain_add(result->chain, llama_sampler_init_mirostat(llama_vocab_n_tokens(vocab), params.seed, params.mirostat_tau, params.mirostat_eta, 100));
  240. } else if (params.mirostat == 2) {
  241. llama_sampler_chain_add(result->chain, llama_sampler_init_temp(params.temp));
  242. llama_sampler_chain_add(result->chain, llama_sampler_init_mirostat_v2(params.seed, params.mirostat_tau, params.mirostat_eta));
  243. } else {
  244. GGML_ASSERT(false && "unknown mirostat version");
  245. }
  246. return result;
  247. }
  248. void common_sampler_free(struct common_sampler * gsmpl) {
  249. if (gsmpl) {
  250. llama_sampler_free(gsmpl->grmr);
  251. llama_sampler_free(gsmpl->chain);
  252. delete gsmpl;
  253. }
  254. }
  255. void common_sampler_accept(struct common_sampler * gsmpl, llama_token token, bool accept_grammar) {
  256. if (accept_grammar) {
  257. llama_sampler_accept(gsmpl->grmr, token);
  258. }
  259. llama_sampler_accept(gsmpl->chain, token);
  260. gsmpl->prev.push_back(token);
  261. }
  262. void common_sampler_reset(struct common_sampler * gsmpl) {
  263. llama_sampler_reset(gsmpl->grmr);
  264. llama_sampler_reset(gsmpl->chain);
  265. }
  266. struct common_sampler * common_sampler_clone(common_sampler * gsmpl) {
  267. return new common_sampler {
  268. /* .params = */ gsmpl->params,
  269. /* .grmr = */ llama_sampler_clone(gsmpl->grmr),
  270. /* .chain = */ llama_sampler_clone(gsmpl->chain),
  271. /* .prev = */ gsmpl->prev,
  272. /* .cur = */ gsmpl->cur,
  273. /* .cur_p = */ gsmpl->cur_p,
  274. };
  275. }
  276. void common_perf_print(const struct llama_context * ctx, const struct common_sampler * gsmpl) {
  277. // TODO: measure grammar performance
  278. if (gsmpl) {
  279. llama_perf_sampler_print(gsmpl->chain);
  280. }
  281. if (ctx) {
  282. llama_perf_context_print(ctx);
  283. }
  284. }
  285. llama_token common_sampler_sample(struct common_sampler * gsmpl, struct llama_context * ctx, int idx, bool grammar_first) {
  286. gsmpl->set_logits(ctx, idx);
  287. auto & grmr = gsmpl->grmr;
  288. auto & chain = gsmpl->chain;
  289. auto & cur_p = gsmpl->cur_p; // initialized by set_logits
  290. if (grammar_first) {
  291. llama_sampler_apply(grmr, &cur_p);
  292. }
  293. llama_sampler_apply(chain, &cur_p);
  294. GGML_ASSERT(cur_p.selected != -1 && "no selected token during sampling - check your sampling configuration");
  295. const llama_token id = cur_p.data[cur_p.selected].id;
  296. if (grammar_first) {
  297. return id;
  298. }
  299. // check if it the sampled token fits the grammar
  300. {
  301. llama_token_data single_token_data = { id, 1.0f, 0.0f };
  302. llama_token_data_array single_token_data_array = { &single_token_data, 1, -1, false };
  303. llama_sampler_apply(grmr, &single_token_data_array);
  304. const bool is_valid = single_token_data_array.data[0].logit != -INFINITY;
  305. if (is_valid) {
  306. return id;
  307. }
  308. }
  309. // resampling:
  310. // if the token is not valid, sample again, but first apply the grammar sampler and then the sampling chain
  311. gsmpl->set_logits(ctx, idx);
  312. llama_sampler_apply(grmr, &cur_p);
  313. llama_sampler_apply(chain, &cur_p);
  314. GGML_ASSERT(cur_p.selected != -1 && "no selected token during re-sampling - check your sampling configuration");
  315. return cur_p.data[cur_p.selected].id;
  316. }
  317. std::vector<llama_token> common_sampler_sample_and_accept_n(struct common_sampler * gsmpl, struct llama_context * ctx, const std::vector<int> & idxs, const llama_tokens & draft, bool grammar_first) {
  318. GGML_ASSERT(idxs.size() == draft.size() + 1 && "idxs.size() must be draft.size() + 1");
  319. std::vector<llama_token> result;
  320. result.reserve(idxs.size());
  321. size_t i = 0;
  322. for (; i < draft.size(); i++) {
  323. const llama_token id = common_sampler_sample(gsmpl, ctx, idxs[i], grammar_first);
  324. common_sampler_accept(gsmpl, id, true);
  325. result.push_back(id);
  326. if (draft[i] != id) {
  327. break;
  328. }
  329. }
  330. if (i == draft.size()) {
  331. const llama_token id = common_sampler_sample(gsmpl, ctx, idxs[i], grammar_first);
  332. common_sampler_accept(gsmpl, id, true);
  333. result.push_back(id);
  334. }
  335. return result;
  336. }
  337. std::vector<llama_token> common_sampler_sample_and_accept_n(struct common_sampler * gsmpl, struct llama_context * ctx, const llama_tokens & draft, bool grammar_first) {
  338. std::vector<int> idxs(draft.size() + 1);
  339. for (size_t i = 0; i < idxs.size(); ++i) {
  340. idxs[i] = i;
  341. }
  342. return common_sampler_sample_and_accept_n(gsmpl, ctx, idxs, draft, grammar_first);
  343. }
  344. uint32_t common_sampler_get_seed(const struct common_sampler * gsmpl) {
  345. return llama_sampler_get_seed(gsmpl->chain);
  346. }
  347. // helpers
  348. llama_token_data_array * common_sampler_get_candidates(struct common_sampler * gsmpl) {
  349. return &gsmpl->cur_p;
  350. }
  351. llama_token common_sampler_last(const struct common_sampler * gsmpl) {
  352. return gsmpl->prev.rat(0);
  353. }
  354. std::string common_sampler_print(const struct common_sampler * gsmpl) {
  355. std::string result = "logits ";
  356. for (int i = 0; i < llama_sampler_chain_n(gsmpl->chain); i++) {
  357. const auto * smpl = llama_sampler_chain_get(gsmpl->chain, i);
  358. result += std::string("-> ") + llama_sampler_name(smpl) + " ";
  359. }
  360. return result;
  361. }
  362. std::string common_sampler_prev_str(common_sampler * gsmpl, llama_context * ctx_main, int n) {
  363. n = std::min(n, (int) gsmpl->prev.size());
  364. if (n <= 0) {
  365. return "";
  366. }
  367. std::string result;
  368. result.reserve(8*n); // 8 is the average length of a token [citation needed], TODO: compute this from the vocab
  369. for (int i = n - 1; i >= 0; i--) {
  370. const llama_token id = gsmpl->prev.rat(i);
  371. GGML_ASSERT(id != LLAMA_TOKEN_NULL && "null token in the sampling history - should not happen");
  372. result += common_token_to_piece(ctx_main, id);
  373. }
  374. return result;
  375. }
  376. char common_sampler_type_to_chr(enum common_sampler_type cnstr) {
  377. switch (cnstr) {
  378. case COMMON_SAMPLER_TYPE_DRY: return 'd';
  379. case COMMON_SAMPLER_TYPE_TOP_K: return 'k';
  380. case COMMON_SAMPLER_TYPE_TYPICAL_P: return 'y';
  381. case COMMON_SAMPLER_TYPE_TOP_P: return 'p';
  382. case COMMON_SAMPLER_TYPE_MIN_P: return 'm';
  383. case COMMON_SAMPLER_TYPE_TEMPERATURE: return 't';
  384. case COMMON_SAMPLER_TYPE_XTC: return 'x';
  385. case COMMON_SAMPLER_TYPE_INFILL: return 'i';
  386. case COMMON_SAMPLER_TYPE_PENALTIES: return 'e';
  387. default : return '?';
  388. }
  389. }
  390. std::string common_sampler_type_to_str(enum common_sampler_type cnstr) {
  391. switch (cnstr) {
  392. case COMMON_SAMPLER_TYPE_DRY: return "dry";
  393. case COMMON_SAMPLER_TYPE_TOP_K: return "top_k";
  394. case COMMON_SAMPLER_TYPE_TYPICAL_P: return "typ_p";
  395. case COMMON_SAMPLER_TYPE_TOP_P: return "top_p";
  396. case COMMON_SAMPLER_TYPE_MIN_P: return "min_p";
  397. case COMMON_SAMPLER_TYPE_TEMPERATURE: return "temperature";
  398. case COMMON_SAMPLER_TYPE_XTC: return "xtc";
  399. case COMMON_SAMPLER_TYPE_INFILL: return "infill";
  400. case COMMON_SAMPLER_TYPE_PENALTIES: return "penalties";
  401. default : return "";
  402. }
  403. }
  404. std::vector<common_sampler_type> common_sampler_types_from_names(const std::vector<std::string> & names, bool allow_alt_names) {
  405. std::unordered_map<std::string, common_sampler_type> sampler_canonical_name_map {
  406. { "dry", COMMON_SAMPLER_TYPE_DRY },
  407. { "top_k", COMMON_SAMPLER_TYPE_TOP_K },
  408. { "top_p", COMMON_SAMPLER_TYPE_TOP_P },
  409. { "typ_p", COMMON_SAMPLER_TYPE_TYPICAL_P },
  410. { "min_p", COMMON_SAMPLER_TYPE_MIN_P },
  411. { "temperature", COMMON_SAMPLER_TYPE_TEMPERATURE },
  412. { "xtc", COMMON_SAMPLER_TYPE_XTC },
  413. { "infill", COMMON_SAMPLER_TYPE_INFILL },
  414. { "penalties", COMMON_SAMPLER_TYPE_PENALTIES },
  415. };
  416. // since samplers names are written multiple ways
  417. // make it ready for both system names and input names
  418. std::unordered_map<std::string, common_sampler_type> sampler_alt_name_map {
  419. { "top-k", COMMON_SAMPLER_TYPE_TOP_K },
  420. { "top-p", COMMON_SAMPLER_TYPE_TOP_P },
  421. { "nucleus", COMMON_SAMPLER_TYPE_TOP_P },
  422. { "typical-p", COMMON_SAMPLER_TYPE_TYPICAL_P },
  423. { "typical", COMMON_SAMPLER_TYPE_TYPICAL_P },
  424. { "typ-p", COMMON_SAMPLER_TYPE_TYPICAL_P },
  425. { "typ", COMMON_SAMPLER_TYPE_TYPICAL_P },
  426. { "min-p", COMMON_SAMPLER_TYPE_MIN_P },
  427. { "temp", COMMON_SAMPLER_TYPE_TEMPERATURE },
  428. };
  429. std::vector<common_sampler_type> samplers;
  430. samplers.reserve(names.size());
  431. for (const auto & name : names) {
  432. auto sampler = sampler_canonical_name_map.find(name);
  433. if (sampler != sampler_canonical_name_map.end()) {
  434. samplers.push_back(sampler->second);
  435. } else {
  436. if (allow_alt_names) {
  437. sampler = sampler_alt_name_map.find(name);
  438. if (sampler != sampler_alt_name_map.end()) {
  439. samplers.push_back(sampler->second);
  440. }
  441. }
  442. }
  443. }
  444. return samplers;
  445. }
  446. std::vector<common_sampler_type> common_sampler_types_from_chars(const std::string & chars) {
  447. std::unordered_map<char, common_sampler_type> sampler_name_map = {
  448. { common_sampler_type_to_chr(COMMON_SAMPLER_TYPE_DRY), COMMON_SAMPLER_TYPE_DRY },
  449. { common_sampler_type_to_chr(COMMON_SAMPLER_TYPE_TOP_K), COMMON_SAMPLER_TYPE_TOP_K },
  450. { common_sampler_type_to_chr(COMMON_SAMPLER_TYPE_TYPICAL_P), COMMON_SAMPLER_TYPE_TYPICAL_P },
  451. { common_sampler_type_to_chr(COMMON_SAMPLER_TYPE_TOP_P), COMMON_SAMPLER_TYPE_TOP_P },
  452. { common_sampler_type_to_chr(COMMON_SAMPLER_TYPE_MIN_P), COMMON_SAMPLER_TYPE_MIN_P },
  453. { common_sampler_type_to_chr(COMMON_SAMPLER_TYPE_TEMPERATURE), COMMON_SAMPLER_TYPE_TEMPERATURE },
  454. { common_sampler_type_to_chr(COMMON_SAMPLER_TYPE_XTC), COMMON_SAMPLER_TYPE_XTC },
  455. { common_sampler_type_to_chr(COMMON_SAMPLER_TYPE_INFILL), COMMON_SAMPLER_TYPE_INFILL },
  456. { common_sampler_type_to_chr(COMMON_SAMPLER_TYPE_PENALTIES), COMMON_SAMPLER_TYPE_PENALTIES },
  457. };
  458. std::vector<common_sampler_type> samplers;
  459. samplers.reserve(chars.size());
  460. for (const auto & c : chars) {
  461. const auto sampler = sampler_name_map.find(c);
  462. if (sampler != sampler_name_map.end()) {
  463. samplers.push_back(sampler->second);
  464. }
  465. }
  466. return samplers;
  467. }