* Similar to an array, but saves memory by not allocating data if there are large gaps in the stored indices. i.e. while a regular array would * require you to allocate an array of size 100 000 to store an entry at index 99 999, sparse set will only allocate a single page of data. * * Internally the set works by allocating two arrays: * - Sparse: Stores lookup from the user-provided index
source not stored for this graph (policy: none)
nothing calls this directly
no test coverage detected