2
1
mirror of https://github.com/qpdf/qpdf.git synced 2024-06-04 03:10:52 +00:00
qpdf/libqpdf/QPDF_Array.cc

270 lines
6.5 KiB
C++
Raw Normal View History

#include <qpdf/QPDF_Array.hh>
#include <qpdf/QIntC.hh>
#include <qpdf/QPDFObject_private.hh>
#include <qpdf/QUtil.hh>
#include <stdexcept>
2023-03-25 16:59:49 +00:00
static const QPDFObjectHandle null_oh = QPDFObjectHandle::newNull();
QPDF_Array::QPDF_Array(std::vector<QPDFObjectHandle> const& v) :
QPDFValue(::ot_array, "array")
{
setFromVector(v);
}
QPDF_Array::QPDF_Array(
std::vector<std::shared_ptr<QPDFObject>>&& v, bool sparse) :
QPDFValue(::ot_array, "array"),
sparse(sparse)
{
setFromVector(std::move(v));
}
2019-08-18 02:13:37 +00:00
QPDF_Array::QPDF_Array(SparseOHArray const& items) :
QPDFValue(::ot_array, "array"),
sparse(true),
sp_elements(items)
{
}
2023-03-25 18:23:39 +00:00
QPDF_Array::QPDF_Array(std::vector<std::shared_ptr<QPDFObject>> const& items) :
QPDFValue(::ot_array, "array"),
sparse(false),
2019-08-18 02:13:37 +00:00
elements(items)
{
}
std::shared_ptr<QPDFObject>
QPDF_Array::create(std::vector<QPDFObjectHandle> const& items)
{
return do_create(new QPDF_Array(items));
}
std::shared_ptr<QPDFObject>
QPDF_Array::create(
std::vector<std::shared_ptr<QPDFObject>>&& items, bool sparse)
{
return do_create(new QPDF_Array(std::move(items), sparse));
}
std::shared_ptr<QPDFObject>
QPDF_Array::create(SparseOHArray const& items)
{
return do_create(new QPDF_Array(items));
}
std::shared_ptr<QPDFObject>
2023-03-25 18:23:39 +00:00
QPDF_Array::create(std::vector<std::shared_ptr<QPDFObject>> const& items)
{
return do_create(new QPDF_Array(items));
}
std::shared_ptr<QPDFObject>
QPDF_Array::copy(bool shallow)
{
if (sparse) {
return create(shallow ? sp_elements : sp_elements.copy());
} else {
if (shallow) {
return create(elements);
} else {
2023-03-25 18:23:39 +00:00
std::vector<std::shared_ptr<QPDFObject>> result;
result.reserve(elements.size());
for (auto const& element: elements) {
result.push_back(
element
? (element->getObjGen().isIndirect() ? element
: element->copy())
: element);
}
return create(result);
}
}
}
void
QPDF_Array::disconnect()
{
if (sparse) {
sp_elements.disconnect();
} else {
2023-03-25 18:23:39 +00:00
for (auto const& iter: elements) {
if (iter) {
QPDFObjectHandle::DisconnectAccess::disconnect(iter);
}
}
}
}
std::string
QPDF_Array::unparse()
{
if (sparse) {
std::string result = "[ ";
int size = sp_elements.size();
for (int i = 0; i < size; ++i) {
result += at(i).unparse();
result += " ";
}
result += "]";
return result;
} else {
std::string result = "[ ";
2023-03-25 18:23:39 +00:00
auto size = elements.size();
2023-03-25 16:59:49 +00:00
for (int i = 0; i < int(size); ++i) {
result += at(i).unparse();
result += " ";
}
result += "]";
return result;
}
}
2018-12-17 22:40:29 +00:00
JSON
QPDF_Array::getJSON(int json_version)
2018-12-17 22:40:29 +00:00
{
if (sparse) {
JSON j = JSON::makeArray();
int size = sp_elements.size();
for (int i = 0; i < size; ++i) {
j.addArrayElement(at(i).getJSON(json_version));
}
return j;
} else {
JSON j = JSON::makeArray();
2023-03-25 18:23:39 +00:00
size_t size = elements.size();
2023-03-25 16:59:49 +00:00
for (int i = 0; i < int(size); ++i) {
j.addArrayElement(at(i).getJSON(json_version));
}
return j;
2018-12-17 22:40:29 +00:00
}
}
QPDFObjectHandle
QPDF_Array::at(int n) const noexcept
{
if (n < 0 || n >= size()) {
return {};
} else if (sparse) {
auto const& iter = sp_elements.elements.find(n);
return iter == sp_elements.elements.end() ? null_oh : (*iter).second;
} else {
return elements[size_t(n)];
}
}
void
QPDF_Array::getAsVector(std::vector<QPDFObjectHandle>& v) const
{
if (sparse) {
int size = sp_elements.size();
for (int i = 0; i < size; ++i) {
v.push_back(at(i));
}
} else {
2023-03-25 18:23:39 +00:00
v = std::vector<QPDFObjectHandle>(elements.cbegin(), elements.cend());
}
}
void
QPDF_Array::setItem(int n, QPDFObjectHandle const& oh)
{
if (sparse) {
sp_elements.setAt(n, oh);
} else {
size_t idx = size_t(n);
2023-03-25 18:23:39 +00:00
if (n < 0 || idx >= elements.size()) {
throw std::logic_error("bounds error setting item in QPDF_Array");
}
2023-03-25 18:23:39 +00:00
elements[idx] = oh.getObj();
}
}
void
QPDF_Array::setFromVector(std::vector<QPDFObjectHandle> const& v)
{
if (sparse) {
sp_elements = SparseOHArray();
for (auto const& iter: v) {
sp_elements.append(iter);
}
} else {
2023-03-25 18:23:39 +00:00
elements.resize(0);
for (auto const& iter: v) {
2023-03-25 18:23:39 +00:00
elements.push_back(iter.getObj());
}
}
}
void
QPDF_Array::setFromVector(std::vector<std::shared_ptr<QPDFObject>>&& v)
{
if (sparse) {
sp_elements = SparseOHArray();
for (auto&& item: v) {
if (item->getTypeCode() != ::ot_null ||
item->getObjGen().isIndirect()) {
sp_elements.append(std::move(item));
} else {
++sp_elements.n_elements;
}
}
} else {
2023-03-25 18:23:39 +00:00
elements = std::move(v);
}
}
void
QPDF_Array::insertItem(int at, QPDFObjectHandle const& item)
{
if (sparse) {
// As special case, also allow insert beyond the end
if ((at < 0) || (at > sp_elements.size())) {
throw std::logic_error(
"INTERNAL ERROR: bounds error accessing QPDF_Array element");
}
sp_elements.insert(at, item);
} else {
// As special case, also allow insert beyond the end
size_t idx = QIntC::to_size(at);
2023-03-25 18:23:39 +00:00
if ((at < 0) || (at > QIntC::to_int(elements.size()))) {
throw std::logic_error(
"INTERNAL ERROR: bounds error accessing QPDF_Array element");
}
2023-03-25 18:23:39 +00:00
if (idx == elements.size()) {
// Allow inserting to the last position
2023-03-25 18:23:39 +00:00
elements.push_back(item.getObj());
} else {
int n = int(idx);
2023-03-25 18:23:39 +00:00
elements.insert(elements.cbegin() + n, item.getObj());
}
}
}
void
QPDF_Array::appendItem(QPDFObjectHandle const& item)
{
if (sparse) {
sp_elements.append(item);
} else {
2023-03-25 18:23:39 +00:00
elements.push_back(item.getObj());
}
}
void
QPDF_Array::eraseItem(int at)
{
if (sparse) {
sp_elements.erase(at);
} else {
size_t idx = QIntC::to_size(at);
2023-03-25 18:23:39 +00:00
if (idx >= elements.size()) {
throw std::logic_error("bounds error erasing item from OHArray");
}
int n = int(idx);
2023-03-25 18:23:39 +00:00
elements.erase(elements.cbegin() + n);
}
}