| _clear(bool release=true) | bitpit::PiercedKernel< long > | protected |
| _postSetDynamicKernel() override | bitpit::PiercedStorage< value_t, long > | protectedvirtual |
| _postSetDynamicKernel() override | bitpit::PiercedStorage< value_t, long > | protectedvirtual |
| _postSetStaticKernel() override | bitpit::PiercedStorage< value_t, long > | protectedvirtual |
| _postSetStaticKernel() override | bitpit::PiercedStorage< value_t, long > | protectedvirtual |
| _postUnsetKernel(bool release=true) override | bitpit::PiercedStorage< value_t, long > | protectedvirtual |
| _postUnsetKernel(bool release=true) override | bitpit::PiercedStorage< value_t, long > | protectedvirtual |
| _reserve(std::size_t n) | bitpit::PiercedKernel< long > | protected |
| _resize(std::size_t n) | bitpit::PiercedKernel< long > | protected |
| _shrinkToFit() | bitpit::PiercedKernel< long > | protected |
| _sort(std::size_t begin, std::size_t end) | bitpit::PiercedKernel< long > | protected |
| _squeeze() | bitpit::PiercedKernel< long > | protected |
| at(long id) | bitpit::PiercedVectorStorage< value_t, long > | |
| at(long id) const | bitpit::PiercedVectorStorage< value_t, long > | |
| bitpit::PiercedStorage< value_t, long >::at(long id, std::size_t k=0) | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedStorage< value_t, long >::at(long id, std::size_t k=0) const | bitpit::PiercedStorage< value_t, long > | |
| bitpit::back() const | bitpit::PiercedKernel< long > | |
| bitpit::PiercedVectorStorage< value_t, long >::back() | bitpit::PiercedVectorStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::back() const | bitpit::PiercedVectorStorage< value_t, long > | |
| bitpit::PiercedStorage< value_t, long >::back(std::size_t k=0) | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedStorage< value_t, long >::back(std::size_t k=0) const | bitpit::PiercedStorage< value_t, long > | |
| BasePiercedKernel()=default (defined in bitpit::BasePiercedKernel) | bitpit::BasePiercedKernel | protected |
| BasePiercedStorage()=default (defined in bitpit::BasePiercedStorage) | bitpit::BasePiercedStorage | protected |
| BasePiercedVector() | bitpit::BasePiercedVector | protected |
| BasePiercedVectorKernel() | bitpit::BasePiercedVectorKernel | protected |
| BasePiercedVectorStorage()=default (defined in bitpit::BasePiercedVectorStorage) | bitpit::BasePiercedVectorStorage | protected |
| bitpit::begin() const noexcept | bitpit::PiercedKernel< long > | |
| bitpit::PiercedVectorStorage< value_t, long >::begin() noexcept | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::begin() const noexcept | bitpit::PiercedStorage< value_t, long > | |
| capacity() const | bitpit::PiercedKernel< long > | |
| bitpit::cbegin() const noexcept | bitpit::PiercedKernel< long > | |
| bitpit::PiercedVectorStorage< value_t, long >::cbegin() const noexcept | bitpit::PiercedStorage< value_t, long > | |
| bitpit::cend() const noexcept | bitpit::PiercedKernel< long > | |
| bitpit::PiercedVectorStorage< value_t, long >::cend() const noexcept | bitpit::PiercedStorage< value_t, long > | |
| checkIntegrity() const | bitpit::PiercedKernel< long > | |
| clear(bool release=true) | bitpit::PiercedVector< value_t, id_t > | |
| commitSyncAction(const PiercedSyncAction &action) override | bitpit::PiercedStorage< value_t, long > | protectedvirtual |
| const_iterator typedef | bitpit::PiercedVector< value_t, id_t > | |
| const_pointer typedef | bitpit::PiercedStorage< value_t, long > | |
| const_range typedef | bitpit::PiercedVector< value_t, id_t > | |
| const_reference typedef | bitpit::PiercedStorage< value_t, long > | |
| container_t typedef | bitpit::PiercedStorage< value_t, long > | |
| contains(long id) const | bitpit::PiercedKernel< long > | |
| contiguous() const | bitpit::PiercedKernel< long > | |
| copy(long id, value_t *values) const | bitpit::PiercedStorage< value_t, long > | |
| copy(long id, std::size_t nFields, std::size_t offset, value_t *values) const | bitpit::PiercedStorage< value_t, long > | |
| copy(long id, value_t *values) const | bitpit::PiercedStorage< value_t, long > | |
| copy(long id, std::size_t nFields, std::size_t offset, value_t *values) const | bitpit::PiercedStorage< value_t, long > | |
| count(long id) const | bitpit::PiercedKernel< long > | |
| data() | bitpit::PiercedStorage< value_t, long > | |
| data() const | bitpit::PiercedStorage< value_t, long > | |
| data(long id, std::size_t offset=0) | bitpit::PiercedStorage< value_t, long > | |
| data(long id, std::size_t offset=0) const | bitpit::PiercedStorage< value_t, long > | |
| data() | bitpit::PiercedStorage< value_t, long > | |
| data() const | bitpit::PiercedStorage< value_t, long > | |
| data(long id, std::size_t offset=0) | bitpit::PiercedStorage< value_t, long > | |
| data(long id, std::size_t offset=0) const | bitpit::PiercedStorage< value_t, long > | |
| detachKernel() | bitpit::PiercedStorageSyncSlave< long > | protected |
| dump() const | bitpit::PiercedVector< value_t, id_t > | |
| dump(std::ostream &stream) const | bitpit::PiercedVector< value_t, id_t > | |
| dumpKernel(std::ostream &stream) const | bitpit::PiercedVector< value_t, id_t > | |
| emplace(id_t id, Args &&... args) | bitpit::PiercedVector< value_t, id_t > | |
| emplaceAfter(const id_t &referenceId, id_t id, Args &&... args) | bitpit::PiercedVector< value_t, id_t > | |
| emplaceBack(id_t id, Args &&... args) | bitpit::PiercedVector< value_t, id_t > | |
| emplaceBefore(const id_t &referenceId, id_t id, Args &&... args) | bitpit::PiercedVector< value_t, id_t > | |
| empty() const | bitpit::PiercedKernel< long > | |
| emreclaim(id_t id, Args &&... args) | bitpit::PiercedVector< value_t, id_t > | |
| emreclaimAfter(const id_t &referenceId, id_t id, Args &&... args) | bitpit::PiercedVector< value_t, id_t > | |
| emreclaimBack(id_t id, Args &&... args) | bitpit::PiercedVector< value_t, id_t > | |
| emreclaimBefore(const id_t &referenceId, id_t id, Args &&... args) | bitpit::PiercedVector< value_t, id_t > | |
| emreplace(id_t id, Args &&... args) | bitpit::PiercedVector< value_t, id_t > | |
| EnableIfHasInitialize typedef | bitpit::PiercedStorage< value_t, long > | |
| bitpit::end() const noexcept | bitpit::PiercedKernel< long > | |
| bitpit::PiercedVectorStorage< value_t, long >::end() noexcept | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::end() const noexcept | bitpit::PiercedStorage< value_t, long > | |
| erase(id_t id, bool delayed=false) | bitpit::PiercedVector< value_t, id_t > | |
| evalFlatIndex(long id) const | bitpit::PiercedKernel< long > | |
| exists(long id) const | bitpit::PiercedVectorKernel< long > | |
| fill(const value_t &value) | bitpit::PiercedStorage< value_t, long > | |
| fill(const value_t &value) | bitpit::PiercedStorage< value_t, long > | |
| fillAfter(long referenceId, long id) | bitpit::PiercedKernel< long > | |
| fillAppend(long id) | bitpit::PiercedKernel< long > | |
| fillBefore(long referenceId, long id) | bitpit::PiercedKernel< long > | |
| fillHead(long id) | bitpit::PiercedKernel< long > | |
| fillHole(std::size_t hole, long id) | bitpit::PiercedKernel< long > | |
| fillInsert(std::size_t pos, long id) | bitpit::PiercedKernel< long > | |
| fillTail(long id) | bitpit::PiercedKernel< long > | |
| bitpit::find(const long &id) const noexcept | bitpit::PiercedKernel< long > | |
| bitpit::PiercedVectorStorage< value_t, long >::find(const long &id) noexcept | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::find(const long &id) const noexcept | bitpit::PiercedStorage< value_t, long > | |
| findNextUsedPos(std::size_t pos) const | bitpit::PiercedKernel< long > | protected |
| findPrevUsedPos(std::size_t pos) const | bitpit::PiercedKernel< long > | protected |
| flush() | bitpit::PiercedKernel< long > | |
| bitpit::front() const | bitpit::PiercedKernel< long > | |
| bitpit::PiercedVectorStorage< value_t, long >::front() | bitpit::PiercedVectorStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::front() const | bitpit::PiercedVectorStorage< value_t, long > | |
| bitpit::PiercedStorage< value_t, long >::front(std::size_t k=0) | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedStorage< value_t, long >::front(std::size_t k=0) const | bitpit::PiercedStorage< value_t, long > | |
| getFieldCount() const | bitpit::PiercedStorage< value_t, long > | |
| getFieldCount() const | bitpit::PiercedStorage< value_t, long > | |
| getFirstUsedPos() const | bitpit::PiercedKernel< long > | protected |
| getIds(bool ordered=true) const | bitpit::PiercedKernel< long > | |
| getKernel() const | bitpit::PiercedVector< value_t, id_t > | |
| getKernelType() const | bitpit::PiercedStorageSyncSlave< long > | |
| getLastUsedPos() const | bitpit::PiercedKernel< long > | protected |
| getPos(long id) const | bitpit::PiercedKernel< long > | protected |
| getRawIndex(long id) const | bitpit::PiercedKernel< long > | |
| getSizeMarker(std::size_t targetSize, const long &fallback=-1) | bitpit::PiercedKernel< long > | |
| getSlaveSyncMode(const PiercedSyncSlave *slave) const | bitpit::PiercedSyncMaster | protected |
| getStorage() const | bitpit::PiercedVector< value_t, id_t > | |
| getStorages() | bitpit::PiercedKernel< long > | protected |
| getStorages() const | bitpit::PiercedKernel< long > | protected |
| getSyncMode() const | bitpit::PiercedStorageSyncSlave< long > | |
| has_dump() | bitpit::PiercedStorage< value_t, long > | inlinestatic |
| has_dump() | bitpit::PiercedStorage< value_t, long > | inlinestatic |
| has_initialize() | bitpit::PiercedStorage< value_t, long > | inlinestatic |
| has_initialize() | bitpit::PiercedStorage< value_t, long > | inlinestatic |
| has_restore() | bitpit::PiercedStorage< value_t, long > | inlinestatic |
| has_restore() | bitpit::PiercedStorage< value_t, long > | inlinestatic |
| holes_const_iterator typedef | bitpit::PiercedKernel< long > | protected |
| holes_container typedef | bitpit::PiercedKernel< long > | protected |
| holes_iterator typedef | bitpit::PiercedKernel< long > | protected |
| id_type typedef | bitpit::PiercedVector< value_t, id_t > | |
| insert(id_t id, const value_t &value) | bitpit::PiercedVector< value_t, id_t > | |
| insertAfter(const id_t &referenceId, id_t id, const value_t &value) | bitpit::PiercedVector< value_t, id_t > | |
| insertBefore(const id_t &referenceId, id_t id, const value_t &value) | bitpit::PiercedVector< value_t, id_t > | |
| isIteratorSlow() | bitpit::PiercedKernel< long > | |
| isPosEmpty(std::size_t pos) const | bitpit::PiercedKernel< long > | protected |
| isSlaveRegistered(const PiercedSyncSlave *slave) const | bitpit::PiercedSyncMaster | protected |
| isSlaveSynced(const PiercedSyncSlave *slave) const | bitpit::PiercedSyncMaster | protected |
| isSynced() const | bitpit::PiercedKernel< long > | |
| isSynced() const | bitpit::PiercedKernel< long > | |
| isSyncEnabled() const | bitpit::PiercedSyncMaster | protected |
| iterator typedef | bitpit::PiercedVector< value_t, id_t > | |
| Kernel typedef | bitpit::PiercedStorage< value_t, long > | |
| kernel_t typedef | bitpit::PiercedStorage< value_t, long > | |
| kernel_type typedef | bitpit::PiercedVector< value_t, id_t > | |
| KernelType typedef | bitpit::PiercedStorage< value_t, long > | |
| m_slaves | bitpit::PiercedSyncMaster | mutableprotected |
| maxSize() const | bitpit::PiercedKernel< long > | |
| moveAfter(const id_t &referenceId, id_t id, bool delayed=false) | bitpit::PiercedVector< value_t, id_t > | |
| bitpit::PiercedVectorKernel< long >::moveAfter(long referenceId, long id, bool flush=false) | bitpit::PiercedKernel< long > | |
| moveBefore(const id_t &referenceId, id_t id, bool delayed=false) | bitpit::PiercedVector< value_t, id_t > | |
| bitpit::PiercedVectorKernel< long >::moveBefore(long referenceId, long id, bool flush=false) | bitpit::PiercedKernel< long > | |
| operator=(const PiercedVector< value_t, id_t > &other) | bitpit::PiercedVector< value_t, id_t > | |
| operator=(PiercedVector< value_t, id_t > &&other) | bitpit::PiercedVector< value_t, id_t > | |
| bitpit::PiercedVectorStorage< value_t, long >::operator=(const PiercedStorage &other) | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::operator=(PiercedStorage &&other) | bitpit::PiercedStorage< value_t, long > | |
| operator[](long id) const | bitpit::PiercedVectorStorage< value_t, long > | |
| operator[](long id) | bitpit::PiercedVectorStorage< value_t, long > | |
| bitpit::PiercedStorage< value_t, long >::operator[](long id) | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedStorage< value_t, long >::operator[](long id) const | bitpit::PiercedStorage< value_t, long > | |
| PiercedKernel() | bitpit::PiercedKernel< long > | |
| PiercedKernel(std::size_t n) | bitpit::PiercedKernel< long > | |
| PiercedStorage() | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorage(std::size_t nFields) | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorage(std::size_t nFields, const PiercedKernel< long > *kernel) | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorage(std::size_t nFields, const PiercedKernel< long > *kernel, PiercedSyncMaster::SyncMode syncMode) | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorage(const PiercedStorage< value_t, long > &other) | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorage(const PiercedStorage< value_t, long > &other, const PiercedKernel< long > *kernel) | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorage(const PiercedStorage< value_t, long > &other, const PiercedKernel< long > *kernel, PiercedSyncMaster::SyncMode syncMode) | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorage(PiercedStorage< value_t, long > &&other) | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorage(PiercedStorage< value_t, long > &&other, const PiercedKernel< long > *kernel) | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorage(PiercedStorage< value_t, long > &&other, const PiercedKernel< long > *kernel, PiercedSyncMaster::SyncMode syncMode) | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorage(const PiercedStorage< value_t, long > &other) | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorage(const PiercedStorage< value_t, long > &other, const PiercedKernel< long > *kernel) | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorage(const PiercedStorage< value_t, long > &other, const PiercedKernel< long > *kernel, PiercedSyncMaster::SyncMode syncMode) | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorage(PiercedStorage< value_t, long > &&other) | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorage(PiercedStorage< value_t, long > &&other, const PiercedKernel< long > *kernel) | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorage(PiercedStorage< value_t, long > &&other, const PiercedKernel< long > *kernel, PiercedSyncMaster::SyncMode syncMode) | bitpit::PiercedStorage< value_t, long > | |
| PiercedStorageSyncSlave() | bitpit::PiercedStorageSyncSlave< long > | protected |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorageSyncSlave(const PiercedKernel< long > *kernel) | bitpit::PiercedStorageSyncSlave< long > | protected |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorageSyncSlave(const PiercedKernel< long > *kernel, PiercedSyncMaster::SyncMode syncMode) | bitpit::PiercedStorageSyncSlave< long > | protected |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorageSyncSlave(const PiercedStorageSyncSlave< long > &other) | bitpit::PiercedStorageSyncSlave< long > | protected |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorageSyncSlave(const PiercedStorageSyncSlave< long > &other, const PiercedKernel< long > *kernel) | bitpit::PiercedStorageSyncSlave< long > | protected |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorageSyncSlave(const PiercedStorageSyncSlave< long > &other, const PiercedKernel< long > *kernel, PiercedSyncMaster::SyncMode syncMode) | bitpit::PiercedStorageSyncSlave< long > | protected |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorageSyncSlave(PiercedStorageSyncSlave< long > &&other) | bitpit::PiercedStorageSyncSlave< long > | protected |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorageSyncSlave(PiercedStorageSyncSlave< long > &&other, const PiercedKernel< long > *kernel) | bitpit::PiercedStorageSyncSlave< long > | protected |
| bitpit::PiercedVectorStorage< value_t, long >::PiercedStorageSyncSlave(PiercedStorageSyncSlave< long > &&other, const PiercedKernel< long > *kernel, PiercedSyncMaster::SyncMode syncMode) | bitpit::PiercedStorageSyncSlave< long > | protected |
| PiercedSyncMaster() | bitpit::PiercedSyncMaster | protected |
| PiercedSyncSlave() | bitpit::PiercedSyncSlave | protected |
| PiercedVector() | bitpit::PiercedVector< value_t, id_t > | |
| PiercedVector(std::size_t n) | bitpit::PiercedVector< value_t, id_t > | |
| PiercedVector(const PiercedVector< value_t, id_t > &other) | bitpit::PiercedVector< value_t, id_t > | |
| PiercedVector(PiercedVector< value_t, id_t > &&other) | bitpit::PiercedVector< value_t, id_t > | |
| pointer typedef | bitpit::PiercedStorage< value_t, long > | |
| popBack() | bitpit::PiercedVector< value_t, id_t > | |
| processSyncAction(const PiercedSyncAction &action) | bitpit::PiercedSyncMaster | protected |
| pushBack(id_t id, const value_t &value) | bitpit::PiercedVector< value_t, id_t > | |
| range typedef | bitpit::PiercedVector< value_t, id_t > | |
| raw_const_iterator typedef | bitpit::PiercedVector< value_t, id_t > | |
| raw_iterator typedef | bitpit::PiercedVector< value_t, id_t > | |
| rawAt(std::size_t pos) | bitpit::PiercedVectorStorage< value_t, long > | |
| rawAt(std::size_t pos) const | bitpit::PiercedVectorStorage< value_t, long > | |
| bitpit::PiercedStorage< value_t, long >::rawAt(std::size_t pos, std::size_t offset=0) | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedStorage< value_t, long >::rawAt(std::size_t pos, std::size_t offset=0) const | bitpit::PiercedStorage< value_t, long > | |
| rawBegin() noexcept | bitpit::PiercedStorage< value_t, long > | |
| rawBegin() const noexcept | bitpit::PiercedStorage< value_t, long > | |
| rawBegin() noexcept | bitpit::PiercedStorage< value_t, long > | |
| rawBegin() const noexcept | bitpit::PiercedStorage< value_t, long > | |
| rawCbegin() const noexcept | bitpit::PiercedStorage< value_t, long > | |
| rawCbegin() const noexcept | bitpit::PiercedStorage< value_t, long > | |
| rawCend() const noexcept | bitpit::PiercedStorage< value_t, long > | |
| rawCend() const noexcept | bitpit::PiercedStorage< value_t, long > | |
| rawClear(bool release) | bitpit::PiercedStorage< value_t, long > | protected |
| rawClear(bool release) | bitpit::PiercedStorage< value_t, long > | protected |
| rawCopy(std::size_t pos, value_t *values) const | bitpit::PiercedStorage< value_t, long > | |
| rawCopy(std::size_t pos, std::size_t nFields, std::size_t offset, value_t *values) const | bitpit::PiercedStorage< value_t, long > | |
| rawCopy(std::size_t pos, value_t *values) const | bitpit::PiercedStorage< value_t, long > | |
| rawCopy(std::size_t pos, std::size_t nFields, std::size_t offset, value_t *values) const | bitpit::PiercedStorage< value_t, long > | |
| rawData(std::size_t pos, std::size_t offset=0) | bitpit::PiercedStorage< value_t, long > | |
| rawData(std::size_t pos, std::size_t offset=0) const | bitpit::PiercedStorage< value_t, long > | |
| rawData(std::size_t pos, std::size_t offset=0) | bitpit::PiercedStorage< value_t, long > | |
| rawData(std::size_t pos, std::size_t offset=0) const | bitpit::PiercedStorage< value_t, long > | |
| rawEmplace(std::size_t pos, Args &&... args) | bitpit::PiercedStorage< value_t, long > | protected |
| rawEmplace(std::size_t pos, bool value=false) | bitpit::PiercedStorage< value_t, long > | protected |
| rawEmplace(std::size_t pos, Args &&... args) | bitpit::PiercedStorage< value_t, long > | protected |
| rawEmplace(std::size_t pos, bool value=false) | bitpit::PiercedStorage< value_t, long > | protected |
| rawEmplaceBack(Args &&... args) | bitpit::PiercedStorage< value_t, long > | protected |
| rawEmplaceBack(bool value=false) | bitpit::PiercedStorage< value_t, long > | protected |
| rawEmplaceBack(Args &&... args) | bitpit::PiercedStorage< value_t, long > | protected |
| rawEmplaceBack(bool value=false) | bitpit::PiercedStorage< value_t, long > | protected |
| rawEmreplace(std::size_t pos, Args &&... args) | bitpit::PiercedStorage< value_t, long > | protected |
| rawEmreplace(std::size_t pos, Args &&... args) | bitpit::PiercedStorage< value_t, long > | protected |
| rawEnd() noexcept | bitpit::PiercedStorage< value_t, long > | |
| rawEnd() const noexcept | bitpit::PiercedStorage< value_t, long > | |
| rawEnd() noexcept | bitpit::PiercedStorage< value_t, long > | |
| rawEnd() const noexcept | bitpit::PiercedStorage< value_t, long > | |
| rawErase(std::size_t pos, std::size_t n) | bitpit::PiercedStorage< value_t, long > | protected |
| rawErase(std::size_t pos, std::size_t n) | bitpit::PiercedStorage< value_t, long > | protected |
| bitpit::rawFind(std::size_t pos) const noexcept | bitpit::PiercedKernel< long > | |
| bitpit::PiercedVectorStorage< value_t, long >::rawFind(std::size_t pos) noexcept | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedVectorStorage< value_t, long >::rawFind(std::size_t pos) const noexcept | bitpit::PiercedStorage< value_t, long > | |
| rawIndex(long id) const | bitpit::PiercedVectorKernel< long > | |
| rawInitialize(std::size_t pos, Args &&... args) | bitpit::PiercedStorage< value_t, long > | protected |
| rawInitialize(std::size_t pos, std::size_t k, Args &&... args) | bitpit::PiercedStorage< value_t, long > | protected |
| rawInitialize(std::size_t pos, Args &&... args) | bitpit::PiercedStorage< value_t, long > | protected |
| rawInitialize(std::size_t pos, std::size_t k, Args &&... args) | bitpit::PiercedStorage< value_t, long > | protected |
| rawInsert(std::size_t pos, std::size_t n, const value_t &value) | bitpit::PiercedStorage< value_t, long > | protected |
| rawInsert(std::size_t pos, std::size_t n, const value_t &value) | bitpit::PiercedStorage< value_t, long > | protected |
| rawPushBack(const value_t &value) | bitpit::PiercedStorage< value_t, long > | protected |
| rawPushBack(const value_t &value) | bitpit::PiercedStorage< value_t, long > | protected |
| rawReorder(const std::vector< std::size_t > &permutations) | bitpit::PiercedStorage< value_t, long > | protected |
| rawReorder(const std::vector< std::size_t > &permutations) | bitpit::PiercedStorage< value_t, long > | protected |
| rawReserve(std::size_t n) | bitpit::PiercedStorage< value_t, long > | protected |
| rawReserve(std::size_t n) | bitpit::PiercedStorage< value_t, long > | protected |
| rawResize(std::size_t n, const value_t &value=value_t()) | bitpit::PiercedStorage< value_t, long > | protected |
| rawResize(std::size_t n, const value_t &value=value_t()) | bitpit::PiercedStorage< value_t, long > | protected |
| rawSet(std::size_t pos, const value_t &value) | bitpit::PiercedStorage< value_t, long > | |
| rawSet(std::size_t pos, std::size_t k, const value_t &value) | bitpit::PiercedStorage< value_t, long > | |
| rawSet(std::size_t pos, const value_t *values) | bitpit::PiercedStorage< value_t, long > | |
| rawSet(std::size_t pos, std::size_t nFields, std::size_t offset, const value_t *values) | bitpit::PiercedStorage< value_t, long > | |
| rawSet(std::size_t pos, const value_t &value) | bitpit::PiercedStorage< value_t, long > | |
| rawSet(std::size_t pos, std::size_t k, const value_t &value) | bitpit::PiercedStorage< value_t, long > | |
| rawSet(std::size_t pos, const value_t *values) | bitpit::PiercedStorage< value_t, long > | |
| rawSet(std::size_t pos, std::size_t nFields, std::size_t offset, const value_t *values) | bitpit::PiercedStorage< value_t, long > | |
| rawShrinkToFit() | bitpit::PiercedStorage< value_t, long > | protected |
| rawShrinkToFit() | bitpit::PiercedStorage< value_t, long > | protected |
| bitpit::rawSize() const | bitpit::PiercedKernel< long > | protected |
| bitpit::PiercedVectorStorage< value_t, long >::rawSize() const | bitpit::PiercedStorage< value_t, long > | protected |
| rawSwap(std::size_t pos_first, std::size_t pos_second) | bitpit::PiercedStorage< value_t, long > | protected |
| rawSwap(std::size_t pos_first, std::size_t pos_second) | bitpit::PiercedStorage< value_t, long > | protected |
| reclaim(id_t id) | bitpit::PiercedVector< value_t, id_t > | |
| reclaimAfter(const id_t &referenceId, id_t id) | bitpit::PiercedVector< value_t, id_t > | |
| reclaimBack(id_t id) | bitpit::PiercedVector< value_t, id_t > | |
| reclaimBefore(const id_t &referenceId, id_t id) | bitpit::PiercedVector< value_t, id_t > | |
| reference typedef | bitpit::PiercedStorage< value_t, long > | |
| registerSlave(PiercedSyncSlave *slave, PiercedSyncMaster::SyncMode syncMode) const | bitpit::PiercedSyncMaster | protected |
| replace(id_t id, value_t &&value) | bitpit::PiercedVector< value_t, id_t > | |
| reserve(std::size_t n) | bitpit::PiercedVector< value_t, id_t > | |
| resize(std::size_t n) | bitpit::PiercedVector< value_t, id_t > | |
| restore(std::istream &stream) | bitpit::PiercedVector< value_t, id_t > | |
| restoreKernel(std::istream &stream) | bitpit::PiercedVector< value_t, id_t > | |
| set(long id, const value_t &value) | bitpit::PiercedStorage< value_t, long > | |
| set(long id, std::size_t k, const value_t &value) | bitpit::PiercedStorage< value_t, long > | |
| set(long id, const value_t *values) | bitpit::PiercedStorage< value_t, long > | |
| set(long id, std::size_t nFields, std::size_t offset, const value_t *values) | bitpit::PiercedStorage< value_t, long > | |
| set(long id, const value_t &value) | bitpit::PiercedStorage< value_t, long > | |
| set(long id, std::size_t k, const value_t &value) | bitpit::PiercedStorage< value_t, long > | |
| set(long id, const value_t *values) | bitpit::PiercedStorage< value_t, long > | |
| set(long id, std::size_t nFields, std::size_t offset, const value_t *values) | bitpit::PiercedStorage< value_t, long > | |
| setDynamicKernel(const PiercedVectorKernel< long > *kernel, PiercedSyncMaster::SyncMode syncMode) | bitpit::PiercedVectorStorage< value_t, long > | |
| bitpit::PiercedStorage< value_t, long >::setDynamicKernel(const PiercedKernel< long > *kernel, PiercedSyncMaster::SyncMode syncMode) | bitpit::PiercedStorageSyncSlave< long > | |
| setStaticKernel(const PiercedVectorKernel< long > *kernel) | bitpit::PiercedVectorStorage< value_t, long > | |
| bitpit::PiercedStorage< value_t, long >::setStaticKernel(const PiercedKernel< long > *kernel) | bitpit::PiercedStorageSyncSlave< long > | |
| setSyncEnabled(bool enabled) const | bitpit::PiercedSyncMaster | protected |
| shrinkToFit() | bitpit::PiercedVector< value_t, id_t > | |
| size() const | bitpit::PiercedKernel< long > | |
| sort() | bitpit::PiercedVector< value_t, id_t > | |
| sortAfter(id_t referenceId, bool inclusive) | bitpit::PiercedVector< value_t, id_t > | |
| sortBefore(id_t referenceId, bool inclusive) | bitpit::PiercedVector< value_t, id_t > | |
| squeeze() | bitpit::PiercedVector< value_t, id_t > | |
| swap(id_t id_first, id_t id_second) | bitpit::PiercedVector< value_t, id_t > | |
| swap(PiercedVector &other) noexcept | bitpit::PiercedVector< value_t, id_t > | |
| bitpit::PiercedVectorKernel< long >::swap(PiercedKernel &other) noexcept | bitpit::PiercedKernel< long > | |
| bitpit::BasePiercedKernel::swap(PiercedSyncMaster &other) noexcept | bitpit::PiercedSyncMaster | protected |
| bitpit::PiercedVectorStorage< value_t, long >::swap(PiercedStorage &other) noexcept | bitpit::PiercedStorage< value_t, long > | |
| bitpit::PiercedStorageSyncSlave< long >::swap(PiercedStorageSyncSlave< long > &other) noexcept | bitpit::PiercedStorageSyncSlave< long > | |
| bitpit::PiercedSyncSlave::swap(PiercedSyncSlave &other) noexcept | bitpit::PiercedSyncSlave | protected |
| sync() | bitpit::PiercedKernel< long > | |
| sync() | bitpit::PiercedKernel< long > | |
| 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< long > | |
| SyncMode enum name | bitpit::PiercedKernel< long > | |
| unregisterSlave(const PiercedSyncSlave *slave) const | bitpit::PiercedSyncMaster | protected |
| unsetKernel(bool release=true) | bitpit::PiercedStorageSyncSlave< long > | |
| updateId(const long ¤tId, const long &updatedId) | bitpit::PiercedKernel< long > | |
| value_type typedef | bitpit::PiercedVector< value_t, id_t > | |
| ~BasePiercedKernel()=default (defined in bitpit::BasePiercedKernel) | bitpit::BasePiercedKernel | virtual |
| ~BasePiercedStorage()=default (defined in bitpit::BasePiercedStorage) | bitpit::BasePiercedStorage | virtual |
| ~BasePiercedVector()=default (defined in bitpit::BasePiercedVector) | bitpit::BasePiercedVector | virtual |
| ~BasePiercedVectorKernel()=default (defined in bitpit::BasePiercedVectorKernel) | bitpit::BasePiercedVectorKernel | virtual |
| ~BasePiercedVectorStorage()=default (defined in bitpit::BasePiercedVectorStorage) | bitpit::BasePiercedVectorStorage | virtual |
| ~PiercedKernel() override | bitpit::PiercedKernel< long > | |
| ~PiercedStorageSyncSlave() | bitpit::PiercedStorageSyncSlave< long > | virtual |
| ~PiercedSyncSlave()=default (defined in bitpit::PiercedSyncSlave) | bitpit::PiercedSyncSlave | virtual |
1.13.2