🛠️🐜 Antkeeper superbuild with dependencies included 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.

25 lines
2.0 KiB

  1. * long term feature: templated generic vm
  2. * long term feature: shared_ptr less locator
  3. * long term feature: shared_ptr less resource cache
  4. * custom allocators and EnTT allocator-aware in general (long term feature, I don't actually need it at the moment) - see #22
  5. * debugging tools (#60): the issue online already contains interesting tips on this, look at it
  6. * runner proposal: https://en.wikipedia.org/wiki/Fork%E2%80%93join_model https://slide-rs.github.io/specs/03_dispatcher.html
  7. * work stealing job system (see #100)
  8. * meta: sort of meta view based on meta stuff to iterate entities, void * and meta info objects
  9. * allow for built-in parallel each if possible
  10. * allow to replace std:: with custom implementations
  11. * remove runtime views, welcome reflection and what about snapshot?
  12. * empty components model allows for shared components and prefabs unity-like
  13. - each with entity return the shared component multiple times, one per entity that refers to it
  14. - each components only return actual component, so shared components are returned only once
  15. * types defined at runtime that refer to the same compile-time type (but to different pools) are possible, the library is almost there
  16. * add take functionality, eg registry.take(entity, other); where it takes the entity and all its components from registry and move them to other
  17. * add opaque input iterators to views and groups that return tuples <entity, T &...> (proxy), multi-pass guaranteed
  18. * add fast lane for raw iterations, extend mt doc to describe allowed add/remove with pre-allocations on fast lanes
  19. * review 64 bit id: user defined area + dedicated member on the registry to set it
  20. * early out in views using bitmasks with bloom filter like access based on modulus
  21. - standard each, use bitmask to speed up the whole thing and avoid accessing the pools to test for the page
  22. - iterator based each with a couple of iterators passed from outside (use bitmask + has)
  23. * stable component handle that isn't affected by reallocations
  24. * multi component registry::remove and some others?
  25. * reactive systems