_clear(bool release=true) | bitpit::PiercedKernel< id_t > | protected |
_postSetDynamicKernel() override | bitpit::PiercedStorage< value_t, id_t > | protectedvirtual |
_postSetStaticKernel() override | bitpit::PiercedStorage< value_t, id_t > | protectedvirtual |
_postUnsetKernel(bool release=true) override | bitpit::PiercedStorage< value_t, id_t > | protectedvirtual |
_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 |
at(id_t id) | bitpit::PiercedVectorStorage< value_t, id_t > | |
at(id_t id) const | bitpit::PiercedVectorStorage< value_t, id_t > | |
bitpit::PiercedStorage::at(id_t id, std::size_t k=0) | bitpit::PiercedStorage< value_t, id_t > | |
bitpit::PiercedStorage::at(id_t id, std::size_t k=0) const | bitpit::PiercedStorage< value_t, id_t > | |
bitpit::back() const | bitpit::PiercedKernel< id_t > | |
bitpit::PiercedVectorStorage::back() | bitpit::PiercedVectorStorage< value_t, id_t > | |
bitpit::PiercedVectorStorage::back() const | bitpit::PiercedVectorStorage< value_t, id_t > | |
bitpit::PiercedStorage::back(std::size_t k=0) | bitpit::PiercedStorage< value_t, id_t > | |
bitpit::PiercedStorage::back(std::size_t k=0) const | bitpit::PiercedStorage< value_t, id_t > | |
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< id_t > | |
bitpit::PiercedVectorStorage::begin() noexcept | bitpit::PiercedStorage< value_t, id_t > | |
bitpit::PiercedVectorStorage::begin() const noexcept | bitpit::PiercedStorage< value_t, id_t > | |
capacity() const | bitpit::PiercedKernel< id_t > | |
bitpit::cbegin() const noexcept | bitpit::PiercedKernel< id_t > | |
bitpit::PiercedVectorStorage::cbegin() const noexcept | bitpit::PiercedStorage< value_t, id_t > | |
bitpit::cend() const noexcept | bitpit::PiercedKernel< id_t > | |
bitpit::PiercedVectorStorage::cend() const noexcept | bitpit::PiercedStorage< value_t, id_t > | |
checkIntegrity() const | bitpit::PiercedKernel< id_t > | |
clear(bool release=true) | bitpit::PiercedVector< value_t, id_t > | |
commitSyncAction(const PiercedSyncAction &action) override | bitpit::PiercedStorage< value_t, id_t > | protectedvirtual |
const_iterator typedef | bitpit::PiercedVector< value_t, id_t > | |
const_pointer typedef | bitpit::PiercedStorage< value_t, id_t > | |
const_range typedef | bitpit::PiercedVector< value_t, id_t > | |
const_reference typedef | bitpit::PiercedStorage< value_t, id_t > | |
container_t typedef | bitpit::PiercedStorage< value_t, id_t > | |
contains(id_t id) const | bitpit::PiercedKernel< id_t > | |
contiguous() const | bitpit::PiercedKernel< id_t > | |
copy(id_t id, value_t *values) const | bitpit::PiercedStorage< value_t, id_t > | |
copy(id_t id, std::size_t nFields, std::size_t offset, value_t *values) const | bitpit::PiercedStorage< value_t, id_t > | |
count(id_t id) const | bitpit::PiercedKernel< id_t > | |
data() | bitpit::PiercedStorage< value_t, id_t > | |
data() const | bitpit::PiercedStorage< value_t, id_t > | |
data(id_t id, std::size_t offset=0) | bitpit::PiercedStorage< value_t, id_t > | |
data(id_t id, std::size_t offset=0) const | bitpit::PiercedStorage< value_t, id_t > | |
detachKernel() | bitpit::PiercedStorageSyncSlave< id_t > | 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< id_t > | |
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, id_t > | |
bitpit::end() const noexcept | bitpit::PiercedKernel< id_t > | |
bitpit::PiercedVectorStorage::end() noexcept | bitpit::PiercedStorage< value_t, id_t > | |
bitpit::PiercedVectorStorage::end() const noexcept | bitpit::PiercedStorage< value_t, id_t > | |
erase(id_t id, bool delayed=false) | bitpit::PiercedVector< value_t, id_t > | |
evalFlatIndex(id_t id) const | bitpit::PiercedKernel< id_t > | |
exists(id_t id) const | bitpit::PiercedVectorKernel< id_t > | |
fill(const value_t &value) | bitpit::PiercedStorage< value_t, 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 > | |
bitpit::find(const id_t &id) const noexcept | bitpit::PiercedKernel< id_t > | |
bitpit::PiercedVectorStorage::find(const id_t &id) noexcept | bitpit::PiercedStorage< value_t, id_t > | |
bitpit::PiercedVectorStorage::find(const id_t &id) const noexcept | bitpit::PiercedStorage< value_t, 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 > | |
bitpit::front() const | bitpit::PiercedKernel< id_t > | |
bitpit::PiercedVectorStorage::front() | bitpit::PiercedVectorStorage< value_t, id_t > | |
bitpit::PiercedVectorStorage::front() const | bitpit::PiercedVectorStorage< value_t, id_t > | |
bitpit::PiercedStorage::front(std::size_t k=0) | bitpit::PiercedStorage< value_t, id_t > | |
bitpit::PiercedStorage::front(std::size_t k=0) const | bitpit::PiercedStorage< value_t, id_t > | |
getFieldCount() const | bitpit::PiercedStorage< value_t, id_t > | |
getFirstUsedPos() const | bitpit::PiercedKernel< id_t > | protected |
getIds(bool ordered=true) const | bitpit::PiercedKernel< id_t > | |
getKernel() const | bitpit::PiercedVector< value_t, id_t > | |
getKernelType() const | bitpit::PiercedStorageSyncSlave< 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 |
getStorage() const | bitpit::PiercedVector< value_t, id_t > | |
getStorages() | bitpit::PiercedKernel< id_t > | protected |
getStorages() const | bitpit::PiercedKernel< id_t > | protected |
getSyncMode() const | bitpit::PiercedStorageSyncSlave< id_t > | |
has_dump() | bitpit::PiercedStorage< value_t, id_t > | inlinestatic |
has_initialize() | bitpit::PiercedStorage< value_t, id_t > | inlinestatic |
has_restore() | bitpit::PiercedStorage< value_t, id_t > | inlinestatic |
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::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< 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 |
iterator typedef | bitpit::PiercedVector< value_t, id_t > | |
Kernel typedef | bitpit::PiercedStorage< value_t, id_t > | |
KERNEL_DYNAMIC enum value (defined in bitpit::PiercedStorageSyncSlave< id_t >) | bitpit::PiercedStorageSyncSlave< id_t > | |
KERNEL_NONE enum value (defined in bitpit::PiercedStorageSyncSlave< id_t >) | bitpit::PiercedStorageSyncSlave< id_t > | |
KERNEL_STATIC enum value (defined in bitpit::PiercedStorageSyncSlave< id_t >) | bitpit::PiercedStorageSyncSlave< id_t > | |
kernel_t typedef | bitpit::PiercedStorage< value_t, id_t > | |
kernel_type typedef | bitpit::PiercedVector< value_t, id_t > | |
KernelType typedef | bitpit::PiercedStorage< value_t, id_t > | |
m_kernel (defined in bitpit::PiercedStorageSyncSlave< id_t >) | bitpit::PiercedStorageSyncSlave< id_t > | protected |
m_kernelType (defined in bitpit::PiercedStorageSyncSlave< id_t >) | bitpit::PiercedStorageSyncSlave< id_t > | protected |
m_slaves | bitpit::PiercedSyncMaster | mutableprotected |
maxSize() const | bitpit::PiercedKernel< id_t > | |
moveAfter(const id_t &referenceId, id_t id, bool delayed=false) | bitpit::PiercedVector< value_t, id_t > | |
bitpit::PiercedVectorKernel::moveAfter(id_t referenceId, id_t id, bool flush=false) | bitpit::PiercedKernel< id_t > | |
moveBefore(const id_t &referenceId, id_t id, bool delayed=false) | bitpit::PiercedVector< value_t, id_t > | |
bitpit::PiercedVectorKernel::moveBefore(id_t referenceId, id_t id, bool flush=false) | bitpit::PiercedKernel< id_t > | |
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::operator=(const PiercedStorage &other) | bitpit::PiercedStorage< value_t, id_t > | |
bitpit::PiercedVectorStorage::operator=(PiercedStorage &&other) | bitpit::PiercedStorage< value_t, id_t > | |
operator[](id_t id) const | bitpit::PiercedVectorStorage< value_t, id_t > | |
operator[](id_t id) | bitpit::PiercedVectorStorage< value_t, 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 > | |
PiercedStorage() | bitpit::PiercedStorage< value_t, id_t > | |
bitpit::PiercedVectorStorage::PiercedStorage(std::size_t nFields) | bitpit::PiercedStorage< value_t, id_t > | |
bitpit::PiercedVectorStorage::PiercedStorage(std::size_t nFields, const PiercedKernel< id_t > *kernel) | bitpit::PiercedStorage< value_t, id_t > | |
bitpit::PiercedVectorStorage::PiercedStorage(std::size_t nFields, const PiercedKernel< id_t > *kernel, PiercedSyncMaster::SyncMode syncMode) | bitpit::PiercedStorage< value_t, id_t > | |
bitpit::PiercedVectorStorage::PiercedStorage(const PiercedStorage< value_t, id_t > &other) | bitpit::PiercedStorage< value_t, id_t > | |
bitpit::PiercedVectorStorage::PiercedStorage(const PiercedStorage< value_t, id_t > &other, const PiercedKernel< id_t > *kernel) | bitpit::PiercedStorage< value_t, id_t > | |
bitpit::PiercedVectorStorage::PiercedStorage(const PiercedStorage< value_t, id_t > &other, const PiercedKernel< id_t > *kernel, PiercedSyncMaster::SyncMode syncMode) | bitpit::PiercedStorage< value_t, id_t > | |
bitpit::PiercedVectorStorage::PiercedStorage(PiercedStorage< value_t, id_t > &&other) | bitpit::PiercedStorage< value_t, id_t > | |
bitpit::PiercedVectorStorage::PiercedStorage(PiercedStorage< value_t, id_t > &&other, const PiercedKernel< id_t > *kernel) | bitpit::PiercedStorage< value_t, id_t > | |
bitpit::PiercedVectorStorage::PiercedStorage(PiercedStorage< value_t, id_t > &&other, const PiercedKernel< id_t > *kernel, PiercedSyncMaster::SyncMode syncMode) | bitpit::PiercedStorage< value_t, id_t > | |
PiercedStorageSyncSlave() | bitpit::PiercedStorageSyncSlave< id_t > | protected |
bitpit::PiercedVectorStorage::PiercedStorageSyncSlave(const PiercedKernel< id_t > *kernel) | bitpit::PiercedStorageSyncSlave< id_t > | protected |
bitpit::PiercedVectorStorage::PiercedStorageSyncSlave(const PiercedKernel< id_t > *kernel, PiercedSyncMaster::SyncMode syncMode) | bitpit::PiercedStorageSyncSlave< id_t > | protected |
bitpit::PiercedVectorStorage::PiercedStorageSyncSlave(const PiercedStorageSyncSlave< id_t > &other) | bitpit::PiercedStorageSyncSlave< id_t > | protected |
bitpit::PiercedVectorStorage::PiercedStorageSyncSlave(const PiercedStorageSyncSlave< id_t > &other, const PiercedKernel< id_t > *kernel) | bitpit::PiercedStorageSyncSlave< id_t > | protected |
bitpit::PiercedVectorStorage::PiercedStorageSyncSlave(const PiercedStorageSyncSlave< id_t > &other, const PiercedKernel< id_t > *kernel, PiercedSyncMaster::SyncMode syncMode) | bitpit::PiercedStorageSyncSlave< id_t > | protected |
bitpit::PiercedVectorStorage::PiercedStorageSyncSlave(PiercedStorageSyncSlave< id_t > &&other) | bitpit::PiercedStorageSyncSlave< id_t > | protected |
bitpit::PiercedVectorStorage::PiercedStorageSyncSlave(PiercedStorageSyncSlave< id_t > &&other, const PiercedKernel< id_t > *kernel) | bitpit::PiercedStorageSyncSlave< id_t > | protected |
bitpit::PiercedVectorStorage::PiercedStorageSyncSlave(PiercedStorageSyncSlave< id_t > &&other, const PiercedKernel< id_t > *kernel, PiercedSyncMaster::SyncMode syncMode) | bitpit::PiercedStorageSyncSlave< id_t > | 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, id_t > | |
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, id_t > | |
rawAt(std::size_t pos) const | bitpit::PiercedVectorStorage< value_t, id_t > | |
bitpit::PiercedStorage::rawAt(std::size_t pos, std::size_t offset=0) | bitpit::PiercedStorage< value_t, id_t > | |
bitpit::PiercedStorage::rawAt(std::size_t pos, std::size_t offset=0) const | bitpit::PiercedStorage< value_t, id_t > | |
rawBegin() noexcept | bitpit::PiercedStorage< value_t, id_t > | |
rawBegin() const noexcept | bitpit::PiercedStorage< value_t, id_t > | |
rawCbegin() const noexcept | bitpit::PiercedStorage< value_t, id_t > | |
rawCend() const noexcept | bitpit::PiercedStorage< value_t, id_t > | |
rawClear(bool release) | bitpit::PiercedStorage< value_t, id_t > | protected |
rawCopy(std::size_t pos, value_t *values) const | bitpit::PiercedStorage< value_t, id_t > | |
rawCopy(std::size_t pos, std::size_t nFields, std::size_t offset, value_t *values) const | bitpit::PiercedStorage< value_t, id_t > | |
rawData(std::size_t pos, std::size_t offset=0) | bitpit::PiercedStorage< value_t, id_t > | |
rawData(std::size_t pos, std::size_t offset=0) const | bitpit::PiercedStorage< value_t, id_t > | |
rawEmplace(std::size_t pos, Args &&... args) | bitpit::PiercedStorage< value_t, id_t > | protected |
rawEmplace(std::size_t pos, bool value=false) | bitpit::PiercedStorage< value_t, id_t > | protected |
rawEmplaceBack(Args &&... args) | bitpit::PiercedStorage< value_t, id_t > | protected |
rawEmplaceBack(bool value=false) | bitpit::PiercedStorage< value_t, id_t > | protected |
rawEmreplace(std::size_t pos, Args &&... args) | bitpit::PiercedStorage< value_t, id_t > | protected |
rawEnd() noexcept | bitpit::PiercedStorage< value_t, id_t > | |
rawEnd() const noexcept | bitpit::PiercedStorage< value_t, id_t > | |
rawErase(std::size_t pos, std::size_t n) | bitpit::PiercedStorage< value_t, id_t > | protected |
bitpit::rawFind(std::size_t pos) const noexcept | bitpit::PiercedKernel< id_t > | |
bitpit::PiercedVectorStorage::rawFind(std::size_t pos) noexcept | bitpit::PiercedStorage< value_t, id_t > | |
bitpit::PiercedVectorStorage::rawFind(std::size_t pos) const noexcept | bitpit::PiercedStorage< value_t, id_t > | |
rawIndex(id_t id) const | bitpit::PiercedVectorKernel< id_t > | |
rawInitialize(std::size_t pos, Args &&... args) | bitpit::PiercedStorage< value_t, id_t > | protected |
rawInitialize(std::size_t pos, std::size_t k, Args &&... args) | bitpit::PiercedStorage< value_t, id_t > | protected |
rawInsert(std::size_t pos, std::size_t n, const value_t &value) | bitpit::PiercedStorage< value_t, id_t > | protected |
rawPushBack(const value_t &value) | bitpit::PiercedStorage< value_t, id_t > | protected |
rawReorder(const std::vector< std::size_t > &permutations) | bitpit::PiercedStorage< value_t, id_t > | protected |
rawReserve(std::size_t n) | bitpit::PiercedStorage< value_t, id_t > | protected |
rawResize(std::size_t n, const value_t &value=value_t()) | bitpit::PiercedStorage< value_t, id_t > | protected |
rawSet(std::size_t pos, const value_t &value) | bitpit::PiercedStorage< value_t, id_t > | |
rawSet(std::size_t pos, std::size_t k, const value_t &value) | bitpit::PiercedStorage< value_t, id_t > | |
rawSet(std::size_t pos, const value_t *values) | bitpit::PiercedStorage< value_t, id_t > | |
rawSet(std::size_t pos, std::size_t nFields, std::size_t offset, const value_t *values) | bitpit::PiercedStorage< value_t, id_t > | |
rawShrinkToFit() | bitpit::PiercedStorage< value_t, id_t > | protected |
bitpit::rawSize() const | bitpit::PiercedKernel< id_t > | protected |
bitpit::PiercedVectorStorage::rawSize() const | bitpit::PiercedStorage< value_t, id_t > | protected |
rawSwap(std::size_t pos_first, std::size_t pos_second) | bitpit::PiercedStorage< value_t, id_t > | protected |
rawSwap(std::size_t pos_first, std::size_t pos_second) (defined in bitpit::PiercedStorage< value_t, id_t >) | bitpit::PiercedStorage< value_t, id_t > | 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, id_t > | |
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(id_t id, const value_t &value) | bitpit::PiercedStorage< value_t, id_t > | |
set(id_t id, std::size_t k, const value_t &value) | bitpit::PiercedStorage< value_t, id_t > | |
set(id_t id, const value_t *values) | bitpit::PiercedStorage< value_t, id_t > | |
set(id_t id, std::size_t nFields, std::size_t offset, const value_t *values) | bitpit::PiercedStorage< value_t, id_t > | |
setDynamicKernel(const PiercedVectorKernel< id_t > *kernel, PiercedSyncMaster::SyncMode syncMode) | bitpit::PiercedVectorStorage< value_t, id_t > | |
bitpit::PiercedStorage::setDynamicKernel(const PiercedKernel< id_t > *kernel, PiercedSyncMaster::SyncMode syncMode) | bitpit::PiercedStorageSyncSlave< id_t > | |
setStaticKernel(const PiercedVectorKernel< id_t > *kernel) | bitpit::PiercedVectorStorage< value_t, id_t > | |
bitpit::PiercedStorage::setStaticKernel(const PiercedKernel< id_t > *kernel) | bitpit::PiercedStorageSyncSlave< id_t > | |
setSyncEnabled(bool enabled) const | bitpit::PiercedSyncMaster | protected |
shrinkToFit() | bitpit::PiercedVector< value_t, id_t > | |
size() const | bitpit::PiercedKernel< id_t > | |
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::swap(PiercedKernel &other) noexcept | bitpit::PiercedKernel< id_t > | |
bitpit::BasePiercedKernel::swap(PiercedSyncMaster &other) noexcept | bitpit::PiercedSyncMaster | protected |
bitpit::PiercedVectorStorage::swap(PiercedStorage &other) noexcept | bitpit::PiercedStorage< value_t, id_t > | |
bitpit::PiercedStorageSyncSlave::swap(PiercedStorageSyncSlave< id_t > &other) noexcept | bitpit::PiercedStorageSyncSlave< id_t > | |
bitpit::PiercedSyncSlave::swap(PiercedSyncSlave &other) noexcept | bitpit::PiercedSyncSlave | 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 |
unsetKernel(bool release=true) | bitpit::PiercedStorageSyncSlave< id_t > | |
updateId(const id_t ¤tId, const id_t &updatedId) | bitpit::PiercedKernel< id_t > | |
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< id_t > | |
~PiercedStorageSyncSlave() | bitpit::PiercedStorageSyncSlave< id_t > | virtual |
~PiercedSyncSlave()=default (defined in bitpit::PiercedSyncSlave) | bitpit::PiercedSyncSlave | virtual |