2
1
mirror of https://github.com/qpdf/qpdf.git synced 2024-12-23 11:28:56 +00:00
qpdf/libqpdf/SparseOHArray.cc
Jay Berkenbilt bfda941519 Use an unordered map for SparseOHArray for efficiency
This was added in C++11.
2020-04-03 12:16:24 -04:00

152 lines
3.0 KiB
C++

#include <qpdf/SparseOHArray.hh>
#include <stdexcept>
SparseOHArray::SparseOHArray() :
n_elements(0)
{
}
size_t
SparseOHArray::size() const
{
return this->n_elements;
}
void
SparseOHArray::append(QPDFObjectHandle oh)
{
if (! oh.isDirectNull())
{
this->elements[this->n_elements] = oh;
}
++this->n_elements;
}
QPDFObjectHandle
SparseOHArray::at(size_t idx) const
{
if (idx >= this->n_elements)
{
throw std::logic_error(
"INTERNAL ERROR: bounds error accessing SparseOHArray element");
}
auto iter = this->elements.find(idx);
if (iter == this->elements.end())
{
return QPDFObjectHandle::newNull();
}
else
{
return (*iter).second;
}
}
void
SparseOHArray::remove_last()
{
if (this->n_elements == 0)
{
throw std::logic_error(
"INTERNAL ERROR: attempt to remove"
" last item from empty SparseOHArray");
}
--this->n_elements;
this->elements.erase(this->n_elements);
}
void
SparseOHArray::releaseResolved()
{
for (auto iter = this->elements.begin();
iter != this->elements.end(); ++iter)
{
QPDFObjectHandle::ReleaseResolver::releaseResolved((*iter).second);
}
}
void
SparseOHArray::setAt(size_t idx, QPDFObjectHandle oh)
{
if (idx >= this->n_elements)
{
throw std::logic_error("bounds error setting item in SparseOHArray");
}
if (oh.isDirectNull())
{
this->elements.erase(idx);
}
else
{
this->elements[idx] = oh;
}
}
void
SparseOHArray::erase(size_t idx)
{
if (idx >= this->n_elements)
{
throw std::logic_error("bounds error erasing item from SparseOHArray");
}
decltype(this->elements) dest;
for (auto iter = this->elements.begin();
iter != this->elements.end(); ++iter)
{
if ((*iter).first < idx)
{
dest.insert(*iter);
}
else if ((*iter).first > idx)
{
dest[(*iter).first - 1] = (*iter).second;
}
}
this->elements = dest;
--this->n_elements;
}
void
SparseOHArray::insert(size_t idx, QPDFObjectHandle oh)
{
if (idx > this->n_elements)
{
throw std::logic_error("bounds error inserting item to SparseOHArray");
}
else if (idx == this->n_elements)
{
// Allow inserting to the last position
append(oh);
}
else
{
decltype(this->elements) dest;
for (auto iter = this->elements.begin();
iter != this->elements.end(); ++iter)
{
if ((*iter).first < idx)
{
dest.insert(*iter);
}
else
{
dest[(*iter).first + 1] = (*iter).second;
}
}
this->elements = dest;
this->elements[idx] = oh;
++this->n_elements;
}
}
SparseOHArray::const_iterator
SparseOHArray::begin() const
{
return this->elements.begin();
}
SparseOHArray::const_iterator
SparseOHArray::end() const
{
return this->elements.end();
}