gvsafronov/futriix
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

New expire datastructure and algorithm. Allows us to expire in sublinear time

Browse Source 
Former-commit-id: ea3bd614b8b88b8de0b114f917fbd0de93557c72
This commit is contained in:
John Sully 2019-07-05 23:49:09 -04:00
parent a3dbe03a66
commit 82a3e942bf
2 changed files with 21 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
src/compactvector.h
View File

@ -12,10 +12,17 @@
* *
*************************************************/ *************************************************/
<<<<<<< HEAD
template<typename T, bool MEMMOVE_SAFE=false> template<typename T, bool MEMMOVE_SAFE=false>
class compactvector class compactvector
{ {
static_assert(MEMMOVE_SAFE || std::is_trivially_copyable<T>::value, "compactvector requires trivially copyable types"); static_assert(MEMMOVE_SAFE || std::is_trivially_copyable<T>::value, "compactvector requires trivially copyable types");
=======
template<typename T>
class compactvector
{
static_assert(std::is_trivially_copyable<T>::value, "compactvector requires trivially copyable types");
>>>>>>> New expire datastructure and algorithm. Allows us to expire in sublinear time
T *m_data = nullptr; T *m_data = nullptr;
unsigned m_celem = 0; unsigned m_celem = 0;
unsigned m_max = 0; unsigned m_max = 0;
@ -26,7 +33,10 @@ public:
compactvector() noexcept = default; compactvector() noexcept = default;
~compactvector() noexcept ~compactvector() noexcept
{ {
<<<<<<< HEAD
clear(); // call dtors clear(); // call dtors
=======
>>>>>>> New expire datastructure and algorithm. Allows us to expire in sublinear time
zfree(m_data); zfree(m_data);
} }
@ -78,7 +88,11 @@ public:
assert(idx < m_max); assert(idx < m_max);
where = m_data + idx; where = m_data + idx;
memmove(m_data + idx + 1, m_data + idx, (m_celem - idx)*sizeof(T)); memmove(m_data + idx + 1, m_data + idx, (m_celem - idx)*sizeof(T));
<<<<<<< HEAD
new(m_data + idx) T(std::move(val)); new(m_data + idx) T(std::move(val));
=======
m_data[idx] = val;
>>>>>>> New expire datastructure and algorithm. Allows us to expire in sublinear time
++m_celem; ++m_celem;
return where; return where;
} }
@ -102,7 +116,10 @@ public:
assert(where >= m_data); assert(where >= m_data);
size_t idx = where - m_data; size_t idx = where - m_data;
assert(idx < m_celem); assert(idx < m_celem);
<<<<<<< HEAD
where->~T(); where->~T();
=======
>>>>>>> New expire datastructure and algorithm. Allows us to expire in sublinear time
memmove(where, where+1, ((m_celem - idx - 1)*sizeof(T))); memmove(where, where+1, ((m_celem - idx - 1)*sizeof(T)));
--m_celem; --m_celem;
@ -129,8 +146,11 @@ public:
void clear() void clear()
{ {
<<<<<<< HEAD
for (size_t idx = 0; idx < m_celem; ++idx) for (size_t idx = 0; idx < m_celem; ++idx)
m_data[idx].~T(); m_data[idx].~T();
=======
>>>>>>> New expire datastructure and algorithm. Allows us to expire in sublinear time
zfree(m_data); zfree(m_data);
m_data = nullptr; m_data = nullptr;
m_celem = 0; m_celem = 0;