2
1
mirror of https://github.com/qpdf/qpdf.git synced 2024-11-16 01:27:07 +00:00
qpdf/libqpdf/QPDFNumberTreeObjectHelper.cc

258 lines
5.7 KiB
C++
Raw Normal View History

2018-12-18 18:08:55 +00:00
#include <qpdf/QPDFNumberTreeObjectHelper.hh>
#include <qpdf/NNTree.hh>
#include <qpdf/QIntC.hh>
2018-12-18 18:08:55 +00:00
class NumberTreeDetails: public NNTreeDetails
2018-12-18 18:08:55 +00:00
{
public:
virtual std::string const& itemsKey() const override
2018-12-18 18:08:55 +00:00
{
static std::string k("/Nums");
return k;
2018-12-18 18:08:55 +00:00
}
virtual bool keyValid(QPDFObjectHandle oh) const override
2018-12-18 18:08:55 +00:00
{
return oh.isInteger();
2018-12-18 18:08:55 +00:00
}
virtual int compareKeys(
QPDFObjectHandle a, QPDFObjectHandle b) const override
2018-12-18 18:08:55 +00:00
{
if (! (keyValid(a) && keyValid(b)))
2018-12-18 18:08:55 +00:00
{
// We don't call this without calling keyValid first
throw std::logic_error("comparing invalid keys");
2018-12-18 18:08:55 +00:00
}
auto as = a.getIntValue();
auto bs = b.getIntValue();
return ((as < bs) ? -1 : (as > bs) ? 1 : 0);
2018-12-18 18:08:55 +00:00
}
};
static NumberTreeDetails number_tree_details;
QPDFNumberTreeObjectHelper::Members::~Members()
{
}
QPDFNumberTreeObjectHelper::Members::Members(
QPDFObjectHandle& oh, QPDF* q, bool auto_repair) :
impl(std::make_shared<NNTreeImpl>(number_tree_details, q, oh, auto_repair))
{
}
QPDFNumberTreeObjectHelper::QPDFNumberTreeObjectHelper(
QPDFObjectHandle oh, QPDF& q, bool auto_repair) :
QPDFObjectHelper(oh),
m(new Members(oh, &q, auto_repair))
{
2018-12-18 18:08:55 +00:00
}
QPDFNumberTreeObjectHelper::QPDFNumberTreeObjectHelper(QPDFObjectHandle oh) :
QPDFObjectHelper(oh),
m(new Members(oh, nullptr, false))
{
}
2018-12-18 18:08:55 +00:00
QPDFNumberTreeObjectHelper
QPDFNumberTreeObjectHelper::newEmpty(QPDF& qpdf, bool auto_repair)
{
return QPDFNumberTreeObjectHelper(
qpdf.makeIndirectObject(
QPDFObjectHandle::parse("<< /Nums [] >>")), qpdf, auto_repair);
}
QPDFNumberTreeObjectHelper::iterator::iterator(
std::shared_ptr<NNTreeIterator> const& i) :
impl(i)
{
}
bool
QPDFNumberTreeObjectHelper::iterator::valid() const
{
return impl->valid();
}
QPDFNumberTreeObjectHelper::iterator&
QPDFNumberTreeObjectHelper::iterator::operator++()
{
++(*impl);
updateIValue();
return *this;
}
QPDFNumberTreeObjectHelper::iterator&
QPDFNumberTreeObjectHelper::iterator::operator--()
{
--(*impl);
updateIValue();
return *this;
}
void
QPDFNumberTreeObjectHelper::iterator::updateIValue()
{
if (impl->valid())
{
auto p = *impl;
this->ivalue.first = p->first.getIntValue();
this->ivalue.second = p->second;
}
else
{
this->ivalue.first = 0;
this->ivalue.second = QPDFObjectHandle();
}
}
QPDFNumberTreeObjectHelper::iterator::reference
QPDFNumberTreeObjectHelper::iterator::operator*()
{
updateIValue();
return this->ivalue;
}
QPDFNumberTreeObjectHelper::iterator::pointer
QPDFNumberTreeObjectHelper::iterator::operator->()
{
updateIValue();
return &this->ivalue;
}
bool
QPDFNumberTreeObjectHelper::iterator::operator==(iterator const& other) const
{
return *(impl) == *(other.impl);
}
2021-01-24 09:16:48 +00:00
void
QPDFNumberTreeObjectHelper::iterator::insertAfter(
numtree_number key, QPDFObjectHandle value)
{
impl->insertAfter(QPDFObjectHandle::newInteger(key), value);
updateIValue();
2021-01-24 09:16:48 +00:00
}
2021-01-24 16:48:46 +00:00
void
QPDFNumberTreeObjectHelper::iterator::remove()
{
impl->remove();
updateIValue();
2021-01-24 16:48:46 +00:00
}
QPDFNumberTreeObjectHelper::iterator
QPDFNumberTreeObjectHelper::begin() const
{
return iterator(std::make_shared<NNTreeIterator>(this->m->impl->begin()));
}
QPDFNumberTreeObjectHelper::iterator
QPDFNumberTreeObjectHelper::end() const
{
return iterator(std::make_shared<NNTreeIterator>(this->m->impl->end()));
}
QPDFNumberTreeObjectHelper::iterator
QPDFNumberTreeObjectHelper::last() const
{
return iterator(std::make_shared<NNTreeIterator>(this->m->impl->last()));
}
QPDFNumberTreeObjectHelper::iterator
QPDFNumberTreeObjectHelper::find(numtree_number key,
bool return_prev_if_not_found)
{
auto i = this->m->impl->find(QPDFObjectHandle::newInteger(key),
return_prev_if_not_found);
return iterator(std::make_shared<NNTreeIterator>(i));
}
QPDFNumberTreeObjectHelper::iterator
QPDFNumberTreeObjectHelper::insert(numtree_number key, QPDFObjectHandle value)
{
auto i = this->m->impl->insert(
QPDFObjectHandle::newInteger(key), value);
return iterator(std::make_shared<NNTreeIterator>(i));
}
2021-01-24 16:48:46 +00:00
bool
QPDFNumberTreeObjectHelper::remove(numtree_number key,
QPDFObjectHandle* value)
{
return this->m->impl->remove(
QPDFObjectHandle::newInteger(key), value);
}
2018-12-18 18:08:55 +00:00
QPDFNumberTreeObjectHelper::numtree_number
QPDFNumberTreeObjectHelper::getMin()
{
auto i = begin();
if (i == end())
2018-12-18 18:08:55 +00:00
{
return 0;
}
return i->first;
2018-12-18 18:08:55 +00:00
}
QPDFNumberTreeObjectHelper::numtree_number
QPDFNumberTreeObjectHelper::getMax()
{
auto i = last();
if (i == end())
2018-12-18 18:08:55 +00:00
{
return 0;
}
return i->first;
2018-12-18 18:08:55 +00:00
}
bool
QPDFNumberTreeObjectHelper::hasIndex(numtree_number idx)
{
auto i = find(idx);
return (i != this->end());
2018-12-18 18:08:55 +00:00
}
bool
QPDFNumberTreeObjectHelper::findObject(
numtree_number idx, QPDFObjectHandle& oh)
{
auto i = find(idx);
if (i == end())
2018-12-18 18:08:55 +00:00
{
return false;
}
oh = i->second;
2018-12-18 18:08:55 +00:00
return true;
}
bool
QPDFNumberTreeObjectHelper::findObjectAtOrBelow(
numtree_number idx, QPDFObjectHandle& oh,
numtree_number& offset)
{
auto i = find(idx, true);
if (i == end())
2018-12-18 18:08:55 +00:00
{
return false;
}
oh = i->second;
QIntC::range_check_substract(idx, i->first);
offset = idx - i->first;
2018-12-18 18:08:55 +00:00
return true;
}
void
QPDFNumberTreeObjectHelper::setSplitThreshold(int t)
{
this->m->impl->setSplitThreshold(t);
}
2018-12-18 18:08:55 +00:00
std::map<QPDFNumberTreeObjectHelper::numtree_number, QPDFObjectHandle>
QPDFNumberTreeObjectHelper::getAsMap() const
{
std::map<numtree_number, QPDFObjectHandle> result;
result.insert(begin(), end());
2018-12-18 18:08:55 +00:00
return result;
}