| 377 | |
| 378 | template<class T, class Conversion, class StaticRepository, bool doReferenceCounting, class StaticAccessLocker> |
| 379 | size_t qHash(const StorableSet<T, Conversion, StaticRepository, doReferenceCounting, StaticAccessLocker>& set) |
| 380 | { |
| 381 | return set.setIndex(); |
| 382 | } |
| 383 | /** This is a helper-class that helps inserting a bunch of items into a set without caring about grouping them together. |
| 384 | * |
| 385 | * It creates a much better tree-structure if many items are inserted at one time, and this class helps doing that in |