You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

71 lines
1.8 KiB

  1. // This file is part of Jiffy released under the MIT license.
  2. // See the LICENSE file for more information.
  3. #include <set>
  4. #include <string>
  5. #include <assert.h>
  6. #include "erl_nif.h"
  7. #define MAP_TYPE_PRESENT \
  8. ((ERL_NIF_MAJOR_VERSION == 2 && ERL_NIF_MINOR_VERSION >= 6) \
  9. || (ERL_NIF_MAJOR_VERSION > 2))
  10. #define BEGIN_C extern "C" {
  11. #define END_C }
  12. BEGIN_C
  13. int
  14. make_object(ErlNifEnv* env, ERL_NIF_TERM pairs, ERL_NIF_TERM* out,
  15. int ret_map, int dedupe_keys)
  16. {
  17. ERL_NIF_TERM ret;
  18. ERL_NIF_TERM key;
  19. ERL_NIF_TERM val;
  20. #if MAP_TYPE_PRESENT
  21. if(ret_map) {
  22. ret = enif_make_new_map(env);
  23. while(enif_get_list_cell(env, pairs, &val, &pairs)) {
  24. if(!enif_get_list_cell(env, pairs, &key, &pairs)) {
  25. assert(0 == 1 && "Unbalanced object pairs.");
  26. }
  27. if(!enif_make_map_put(env, ret, key, val, &ret)) {
  28. return 0;
  29. }
  30. }
  31. *out = ret;
  32. return 1;
  33. }
  34. #endif
  35. std::set<std::string> seen;
  36. ret = enif_make_list(env, 0);
  37. while(enif_get_list_cell(env, pairs, &val, &pairs)) {
  38. if(!enif_get_list_cell(env, pairs, &key, &pairs)) {
  39. assert(0 == 1 && "Unbalanced object pairs.");
  40. }
  41. if(dedupe_keys) {
  42. ErlNifBinary bin;
  43. if(!enif_inspect_binary(env, key, &bin)) {
  44. return 0;
  45. }
  46. std::string skey((char*) bin.data, bin.size);
  47. if(seen.count(skey) == 0) {
  48. seen.insert(skey);
  49. val = enif_make_tuple2(env, key, val);
  50. ret = enif_make_list_cell(env, val, ret);
  51. }
  52. } else {
  53. val = enif_make_tuple2(env, key, val);
  54. ret = enif_make_list_cell(env, val, ret);
  55. }
  56. }
  57. *out = enif_make_tuple1(env, ret);
  58. return 1;
  59. }
  60. END_C