| _clear(bool release=true) | bitpit::PiercedKernel< id_t > | protected |
| _reserve(std::size_t n) | bitpit::PiercedKernel< id_t > | protected |
| _resize(std::size_t n) | bitpit::PiercedKernel< id_t > | protected |
| _shrinkToFit() | bitpit::PiercedKernel< id_t > | protected |
| _sort(std::size_t begin, std::size_t end) | bitpit::PiercedKernel< id_t > | protected |
| _squeeze() | bitpit::PiercedKernel< id_t > | protected |
| back() const | bitpit::PiercedKernel< id_t > | |
| BasePiercedKernel()=default (defined in bitpit::BasePiercedKernel) | bitpit::BasePiercedKernel | protected |
| begin() const noexcept | bitpit::PiercedKernel< id_t > | |
| capacity() const | bitpit::PiercedKernel< id_t > | |
| cbegin() const noexcept | bitpit::PiercedKernel< id_t > | |
| cend() const noexcept | bitpit::PiercedKernel< id_t > | |
| checkIntegrity() const | bitpit::PiercedKernel< id_t > | |
| clear(bool release=true) | bitpit::PiercedKernel< id_t > | |
| const_iterator typedef | bitpit::PiercedKernel< id_t > | |
| const_range typedef | bitpit::PiercedKernel< id_t > | |
| contains(id_t id) const | bitpit::PiercedKernel< id_t > | |
| contiguous() const | bitpit::PiercedKernel< id_t > | |
| count(id_t id) const | bitpit::PiercedKernel< id_t > | |
| dump() const | bitpit::PiercedKernel< id_t > | |
| dump(std::ostream &stream) const | bitpit::PiercedKernel< id_t > | |
| empty() const | bitpit::PiercedKernel< id_t > | |
| end() const noexcept | bitpit::PiercedKernel< id_t > | |
| erase(id_t id, bool flush=false) | bitpit::PiercedKernel< id_t > | |
| evalFlatIndex(id_t id) const | bitpit::PiercedKernel< id_t > | |
| fillAfter(id_t referenceId, id_t id) | bitpit::PiercedKernel< id_t > | |
| fillAppend(id_t id) | bitpit::PiercedKernel< id_t > | |
| fillBefore(id_t referenceId, id_t id) | bitpit::PiercedKernel< id_t > | |
| fillHead(id_t id) | bitpit::PiercedKernel< id_t > | |
| fillHole(std::size_t hole, id_t id) | bitpit::PiercedKernel< id_t > | |
| fillInsert(std::size_t pos, id_t id) | bitpit::PiercedKernel< id_t > | |
| fillTail(id_t id) | bitpit::PiercedKernel< id_t > | |
| find(const id_t &id) const noexcept | bitpit::PiercedKernel< id_t > | |
| findNextUsedPos(std::size_t pos) const | bitpit::PiercedKernel< id_t > | protected |
| findPrevUsedPos(std::size_t pos) const | bitpit::PiercedKernel< id_t > | protected |
| flush() | bitpit::PiercedKernel< id_t > | |
| front() const | bitpit::PiercedKernel< id_t > | |
| getFirstUsedPos() const | bitpit::PiercedKernel< id_t > | protected |
| getIds(bool ordered=true) const | bitpit::PiercedKernel< id_t > | |
| getLastUsedPos() const | bitpit::PiercedKernel< id_t > | protected |
| getPos(id_t id) const | bitpit::PiercedKernel< id_t > | protected |
| getRawIndex(id_t id) const | bitpit::PiercedKernel< id_t > | |
| getSizeMarker(std::size_t targetSize, const id_t &fallback=-1) | bitpit::PiercedKernel< id_t > | |
| getSlaveSyncMode(const PiercedSyncSlave *slave) const | bitpit::PiercedSyncMaster | protected |
| getStorages() | bitpit::PiercedKernel< id_t > | protected |
| getStorages() const | bitpit::PiercedKernel< id_t > | protected |
| holes_const_iterator typedef | bitpit::PiercedKernel< id_t > | protected |
| holes_container typedef | bitpit::PiercedKernel< id_t > | protected |
| holes_iterator typedef | bitpit::PiercedKernel< id_t > | protected |
| id_type typedef | bitpit::PiercedKernel< id_t > | |
| isIteratorSlow() | bitpit::PiercedKernel< id_t > | |
| isPosEmpty(std::size_t pos) const | bitpit::PiercedKernel< id_t > | protected |
| isSlaveRegistered(const PiercedSyncSlave *slave) const | bitpit::PiercedSyncMaster | protected |
| isSlaveSynced(const PiercedSyncSlave *slave) const | bitpit::PiercedSyncMaster | protected |
| isSynced() const | bitpit::PiercedKernel< id_t > | |
| isSyncEnabled() const | bitpit::PiercedSyncMaster | protected |
| m_slaves | bitpit::PiercedSyncMaster | mutableprotected |
| maxSize() const | bitpit::PiercedKernel< id_t > | |
| moveAfter(id_t referenceId, id_t id, bool flush=false) | bitpit::PiercedKernel< id_t > | |
| moveBefore(id_t referenceId, id_t id, bool flush=false) | bitpit::PiercedKernel< id_t > | |
| PiercedKernel() | bitpit::PiercedKernel< id_t > | |
| PiercedKernel(std::size_t n) | bitpit::PiercedKernel< id_t > | |
| PiercedKernel(const PiercedKernel &other)=default (defined in bitpit::PiercedKernel< id_t >) | bitpit::PiercedKernel< id_t > | |
| PiercedKernel(PiercedKernel &&other)=default (defined in bitpit::PiercedKernel< id_t >) | bitpit::PiercedKernel< id_t > | |
| PiercedKernelIterator (defined in bitpit::PiercedKernel< id_t >) | bitpit::PiercedKernel< id_t > | friend |
| PiercedKernelRange (defined in bitpit::PiercedKernel< id_t >) | bitpit::PiercedKernel< id_t > | friend |
| PiercedStorage (defined in bitpit::PiercedKernel< id_t >) | bitpit::PiercedKernel< id_t > | friend |
| PiercedStorageIterator (defined in bitpit::PiercedKernel< id_t >) | bitpit::PiercedKernel< id_t > | friend |
| PiercedStorageSyncSlave (defined in bitpit::PiercedKernel< id_t >) | bitpit::PiercedKernel< id_t > | friend |
| PiercedSyncMaster() | bitpit::PiercedSyncMaster | protected |
| popBack() | bitpit::PiercedKernel< id_t > | |
| processSyncAction(const PiercedSyncAction &action) | bitpit::PiercedSyncMaster | protected |
| raw_const_iterator typedef | bitpit::PiercedKernel< id_t > | |
| rawFind(std::size_t pos) const noexcept | bitpit::PiercedKernel< id_t > | |
| rawSize() const | bitpit::PiercedKernel< id_t > | protected |
| registerSlave(PiercedSyncSlave *slave, PiercedSyncMaster::SyncMode syncMode) const | bitpit::PiercedSyncMaster | protected |
| reserve(std::size_t n) | bitpit::PiercedKernel< id_t > | |
| resize(std::size_t n) | bitpit::PiercedKernel< id_t > | |
| restore(std::istream &stream) | bitpit::PiercedKernel< id_t > | |
| setSyncEnabled(bool enabled) const | bitpit::PiercedSyncMaster | protected |
| shrinkToFit() | bitpit::PiercedKernel< id_t > | |
| size() const | bitpit::PiercedKernel< id_t > | |
| sort() | bitpit::PiercedKernel< id_t > | |
| sortAfter(id_t referenceId, bool inclusive) | bitpit::PiercedKernel< id_t > | |
| sortBefore(id_t referenceId, bool inclusive) | bitpit::PiercedKernel< id_t > | |
| squeeze() | bitpit::PiercedKernel< id_t > | |
| swap(PiercedKernel &other) noexcept | bitpit::PiercedKernel< id_t > | |
| swap(id_t id_first, id_t id_second) | bitpit::PiercedKernel< id_t > | |
| bitpit::BasePiercedKernel::swap(PiercedSyncMaster &other) noexcept | bitpit::PiercedSyncMaster | protected |
| sync() | bitpit::PiercedKernel< id_t > | |
| SYNC_MODE_CONCURRENT enum value (defined in bitpit::PiercedSyncMaster) | bitpit::PiercedSyncMaster | |
| SYNC_MODE_DISABLED enum value (defined in bitpit::PiercedSyncMaster) | bitpit::PiercedSyncMaster | |
| SYNC_MODE_ITR_BEGIN enum value (defined in bitpit::PiercedSyncMaster) | bitpit::PiercedSyncMaster | |
| SYNC_MODE_ITR_COUNT enum value (defined in bitpit::PiercedSyncMaster) | bitpit::PiercedSyncMaster | |
| SYNC_MODE_ITR_END enum value (defined in bitpit::PiercedSyncMaster) | bitpit::PiercedSyncMaster | |
| SYNC_MODE_JOURNALED enum value (defined in bitpit::PiercedSyncMaster) | bitpit::PiercedSyncMaster | |
| SyncGroup typedef | bitpit::PiercedSyncMaster | |
| SyncMode enum name | bitpit::PiercedKernel< id_t > | |
| unregisterSlave(const PiercedSyncSlave *slave) const | bitpit::PiercedSyncMaster | protected |
| updateId(const id_t ¤tId, const id_t &updatedId) | bitpit::PiercedKernel< id_t > | |
| ~BasePiercedKernel()=default (defined in bitpit::BasePiercedKernel) | bitpit::BasePiercedKernel | virtual |
| ~PiercedKernel() override | bitpit::PiercedKernel< id_t > | |