test_oa_hash_map.cpp 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127
  1. /*************************************************************************/
  2. /* test_oa_hash_map.cpp */
  3. /*************************************************************************/
  4. /* This file is part of: */
  5. /* GODOT ENGINE */
  6. /* https://godotengine.org */
  7. /*************************************************************************/
  8. /* Copyright (c) 2007-2019 Juan Linietsky, Ariel Manzur. */
  9. /* Copyright (c) 2014-2019 Godot Engine contributors (cf. AUTHORS.md) */
  10. /* */
  11. /* Permission is hereby granted, free of charge, to any person obtaining */
  12. /* a copy of this software and associated documentation files (the */
  13. /* "Software"), to deal in the Software without restriction, including */
  14. /* without limitation the rights to use, copy, modify, merge, publish, */
  15. /* distribute, sublicense, and/or sell copies of the Software, and to */
  16. /* permit persons to whom the Software is furnished to do so, subject to */
  17. /* the following conditions: */
  18. /* */
  19. /* The above copyright notice and this permission notice shall be */
  20. /* included in all copies or substantial portions of the Software. */
  21. /* */
  22. /* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
  23. /* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
  24. /* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*/
  25. /* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
  26. /* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
  27. /* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
  28. /* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
  29. /*************************************************************************/
  30. #include "test_oa_hash_map.h"
  31. #include "core/os/os.h"
  32. #include "core/oa_hash_map.h"
  33. namespace TestOAHashMap {
  34. MainLoop *test() {
  35. OS::get_singleton()->print("\n\n\nHello from test\n");
  36. // test element tracking.
  37. {
  38. OAHashMap<int, int> map;
  39. map.set(42, 1337);
  40. map.set(1337, 21);
  41. map.set(42, 11880);
  42. int value = 0;
  43. map.lookup(42, value);
  44. OS::get_singleton()->print("capacity %d\n", map.get_capacity());
  45. OS::get_singleton()->print("elements %d\n", map.get_num_elements());
  46. OS::get_singleton()->print("map[42] = %d\n", value);
  47. }
  48. // rehashing and deletion
  49. {
  50. OAHashMap<int, int> map;
  51. for (int i = 0; i < 500; i++) {
  52. map.set(i, i * 2);
  53. }
  54. for (int i = 0; i < 500; i += 2) {
  55. map.remove(i);
  56. }
  57. uint32_t num_elems = 0;
  58. for (int i = 0; i < 500; i++) {
  59. int tmp;
  60. if (map.lookup(i, tmp) && tmp == i * 2)
  61. num_elems++;
  62. }
  63. OS::get_singleton()->print("elements %d == %d.\n", map.get_num_elements(), num_elems);
  64. }
  65. // iteration
  66. {
  67. OAHashMap<String, int> map;
  68. map.set("Hello", 1);
  69. map.set("World", 2);
  70. map.set("Godot rocks", 42);
  71. for (OAHashMap<String, int>::Iterator it = map.iter(); it.valid; it = map.next_iter(it)) {
  72. OS::get_singleton()->print("map[\"%s\"] = %d\n", it.key->utf8().get_data(), *it.value);
  73. }
  74. }
  75. // stress test / test for issue #22928
  76. {
  77. OAHashMap<int, int> map;
  78. int dummy = 0;
  79. const int N = 1000;
  80. uint32_t *keys = new uint32_t[N];
  81. Math::seed(0);
  82. // insert a couple of random keys (with a dummy value, which is ignored)
  83. for (int i = 0; i < N; i++) {
  84. keys[i] = Math::rand();
  85. map.set(keys[i], dummy);
  86. if (!map.lookup(keys[i], dummy))
  87. OS::get_singleton()->print("could not find 0x%X despite it was just inserted!\n", unsigned(keys[i]));
  88. }
  89. // check whether the keys are still present
  90. for (int i = 0; i < N; i++) {
  91. if (!map.lookup(keys[i], dummy)) {
  92. OS::get_singleton()->print("could not find 0x%X despite it has been inserted previously! (not checking the other keys, breaking...)\n", unsigned(keys[i]));
  93. break;
  94. }
  95. }
  96. delete[] keys;
  97. }
  98. return NULL;
  99. }
  100. } // namespace TestOAHashMap