💿🐜 Antkeeper source code https://antkeeper.com
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.

68 lines
1.4 KiB

  1. /*
  2. * Copyright (C) 2017-2019 Christopher J. Howard
  3. *
  4. * This file is part of Antkeeper Source Code.
  5. *
  6. * Antkeeper Source Code is free software: you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License as published by
  8. * the Free Software Foundation, either version 3 of the License, or
  9. * (at your option) any later version.
  10. *
  11. * Antkeeper Source Code is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License
  17. * along with Antkeeper Source Code. If not, see <http://www.gnu.org/licenses/>.
  18. */
  19. #include "entity-id-pool.hpp"
  20. EntityIDPool::EntityIDPool():
  21. nextID(0)
  22. {}
  23. EntityIDPool::~EntityIDPool()
  24. {}
  25. EntityID EntityIDPool::reserveNextID()
  26. {
  27. EntityID id;
  28. if (!availableIDs.empty())
  29. {
  30. id = *availableIDs.begin();
  31. availableIDs.erase(availableIDs.begin());
  32. reservedIDs.insert(id);
  33. }
  34. else
  35. {
  36. id = nextID;
  37. reservedIDs.insert(id);
  38. findNextID();
  39. }
  40. return id;
  41. }
  42. void EntityIDPool::reserveID(EntityID id)
  43. {
  44. availableIDs.erase(id);
  45. reservedIDs.insert(id);
  46. if (nextID == id)
  47. {
  48. findNextID();
  49. }
  50. }
  51. inline void EntityIDPool::findNextID()
  52. {
  53. do
  54. {
  55. ++nextID;
  56. }
  57. while (reservedIDs.find(nextID) != reservedIDs.end());
  58. }