2012-06-21 13:18:49 +00:00
|
|
|
#include <qpdf/QPDF.hh>
|
|
|
|
|
|
|
|
#include <assert.h>
|
|
|
|
|
2022-04-02 21:14:10 +00:00
|
|
|
#include <qpdf/QPDFExc.hh>
|
2012-06-21 13:18:49 +00:00
|
|
|
#include <qpdf/QTC.hh>
|
|
|
|
#include <qpdf/QUtil.hh>
|
|
|
|
|
2012-06-21 14:42:18 +00:00
|
|
|
// In support of page manipulation APIs, these methods internally
|
|
|
|
// maintain state about pages in a pair of data structures: all_pages,
|
|
|
|
// which is a vector of page objects, and pageobj_to_pages_pos, which
|
|
|
|
// maps a page object to its position in the all_pages array.
|
|
|
|
// Unfortunately, the getAllPages() method returns a const reference
|
|
|
|
// to all_pages and has been in the public API long before the
|
|
|
|
// introduction of mutation APIs, so we're pretty much stuck with it.
|
|
|
|
// Anyway, there are lots of calls to it in the library, so the
|
2021-04-05 14:45:18 +00:00
|
|
|
// efficiency of having it cached is probably worth keeping it. At one
|
|
|
|
// point, I had partially implemented a helper class specifically for
|
|
|
|
// the pages tree, but once you work in all the logic that handles
|
|
|
|
// repairing the /Type keys of page tree nodes (both /Pages and /Page)
|
|
|
|
// and deal with duplicate pages, it's just as complex and less
|
|
|
|
// efficient than what's here. So, in spite of the fact that a const
|
|
|
|
// reference is returned, the current code is fine and does not need
|
|
|
|
// to be replaced. A partial implementation of QPDFPagesTree is in
|
|
|
|
// github in attic in case there is ever a reason to resurrect it.
|
2012-06-21 14:42:18 +00:00
|
|
|
|
|
|
|
// The goal of this code is to ensure that the all_pages vector, which
|
|
|
|
// users may have a reference to, and the pageobj_to_pages_pos map,
|
|
|
|
// which users will not have access to, remain consistent outside of
|
|
|
|
// any call to the library. As long as users only touch the /Pages
|
|
|
|
// structure through page-specific API calls, they never have to worry
|
|
|
|
// about anything, and this will also stay consistent. If a user
|
|
|
|
// touches anything about the /Pages structure outside of these calls
|
|
|
|
// (such as by directly looking up and manipulating the underlying
|
|
|
|
// objects), they can call updatePagesCache() to bring things back in
|
|
|
|
// sync.
|
|
|
|
|
|
|
|
// If the user doesn't ever use the page manipulation APIs, then qpdf
|
|
|
|
// leaves the /Pages structure alone. If the user does use the APIs,
|
|
|
|
// then we push all inheritable objects down and flatten the /Pages
|
|
|
|
// tree. This makes it easier for us to keep /Pages, all_pages, and
|
|
|
|
// pageobj_to_pages_pos internally consistent at all times.
|
|
|
|
|
|
|
|
// Responsibility for keeping all_pages, pageobj_to_pages_pos, and the
|
|
|
|
// Pages structure consistent should remain in as few places as
|
|
|
|
// possible. As of initial writing, only flattenPagesTree,
|
|
|
|
// insertPage, and removePage, along with methods they call, are
|
|
|
|
// concerned with it. Everything else goes through one of those
|
|
|
|
// methods.
|
|
|
|
|
2012-06-21 13:18:49 +00:00
|
|
|
std::vector<QPDFObjectHandle> const&
|
|
|
|
QPDF::getAllPages()
|
|
|
|
{
|
2012-06-22 16:11:25 +00:00
|
|
|
// Note that pushInheritedAttributesToPage may also be used to
|
2017-08-22 01:33:44 +00:00
|
|
|
// initialize this->m->all_pages.
|
2022-04-02 21:14:10 +00:00
|
|
|
if (this->m->all_pages.empty()) {
|
2019-01-30 03:04:52 +00:00
|
|
|
std::set<QPDFObjGen> visited;
|
|
|
|
std::set<QPDFObjGen> seen;
|
2020-02-22 16:00:38 +00:00
|
|
|
QPDFObjectHandle pages = getRoot().getKey("/Pages");
|
|
|
|
bool warned = false;
|
|
|
|
bool changed_pages = false;
|
2022-04-02 21:14:10 +00:00
|
|
|
while (pages.isDictionary() && pages.hasKey("/Parent")) {
|
|
|
|
if (seen.count(pages.getObjGen())) {
|
2020-02-22 16:00:38 +00:00
|
|
|
// loop -- will be detected again and reported later
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
// Files have been found in the wild where /Pages in the
|
|
|
|
// catalog points to the first page. Try to work around
|
|
|
|
// this and similar cases with this heuristic.
|
2022-04-02 21:14:10 +00:00
|
|
|
if (!warned) {
|
2020-02-22 16:00:38 +00:00
|
|
|
getRoot().warnIfPossible(
|
|
|
|
"document page tree root (root -> /Pages) doesn't point"
|
|
|
|
" to the root of the page tree; attempting to correct");
|
|
|
|
warned = true;
|
|
|
|
}
|
|
|
|
seen.insert(pages.getObjGen());
|
|
|
|
changed_pages = true;
|
|
|
|
pages = pages.getKey("/Parent");
|
|
|
|
}
|
2022-04-02 21:14:10 +00:00
|
|
|
if (changed_pages) {
|
2020-02-22 16:00:38 +00:00
|
|
|
getRoot().replaceKey("/Pages", pages);
|
|
|
|
}
|
|
|
|
seen.clear();
|
2022-02-08 14:18:08 +00:00
|
|
|
getAllPagesInternal(pages, this->m->all_pages, visited, seen);
|
2012-06-21 13:18:49 +00:00
|
|
|
}
|
2017-08-22 01:33:44 +00:00
|
|
|
return this->m->all_pages;
|
2012-06-21 13:18:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2022-04-02 21:14:10 +00:00
|
|
|
QPDF::getAllPagesInternal(
|
|
|
|
QPDFObjectHandle cur_node,
|
|
|
|
std::vector<QPDFObjectHandle>& result,
|
|
|
|
std::set<QPDFObjGen>& visited,
|
|
|
|
std::set<QPDFObjGen>& seen)
|
2015-02-21 23:22:32 +00:00
|
|
|
{
|
2019-08-18 22:54:08 +00:00
|
|
|
QPDFObjGen this_og = cur_node.getObjGen();
|
2022-04-02 21:14:10 +00:00
|
|
|
if (visited.count(this_og) > 0) {
|
2015-02-21 23:22:32 +00:00
|
|
|
throw QPDFExc(
|
2022-04-02 21:14:10 +00:00
|
|
|
qpdf_e_pages,
|
|
|
|
this->m->file->getName(),
|
|
|
|
this->m->last_object_description,
|
|
|
|
0,
|
2015-02-21 23:22:32 +00:00
|
|
|
"Loop detected in /Pages structure (getAllPages)");
|
|
|
|
}
|
|
|
|
visited.insert(this_og);
|
2019-08-18 22:54:08 +00:00
|
|
|
std::string wanted_type;
|
2022-04-02 21:14:10 +00:00
|
|
|
if (cur_node.hasKey("/Kids")) {
|
2019-08-18 22:54:08 +00:00
|
|
|
wanted_type = "/Pages";
|
2022-02-08 14:18:08 +00:00
|
|
|
QPDFObjectHandle kids = cur_node.getKey("/Kids");
|
|
|
|
int n = kids.getArrayNItems();
|
2022-04-02 21:14:10 +00:00
|
|
|
for (int i = 0; i < n; ++i) {
|
2019-01-29 01:13:10 +00:00
|
|
|
QPDFObjectHandle kid = kids.getArrayItem(i);
|
2022-04-02 21:14:10 +00:00
|
|
|
if (!kid.isIndirect()) {
|
2019-01-29 22:01:36 +00:00
|
|
|
QTC::TC("qpdf", "QPDF handle direct page object");
|
|
|
|
kid = makeIndirectObject(kid);
|
|
|
|
kids.setArrayItem(i, kid);
|
2022-04-02 21:14:10 +00:00
|
|
|
} else if (seen.count(kid.getObjGen())) {
|
2019-01-29 01:13:10 +00:00
|
|
|
// Make a copy of the page. This does the same as
|
|
|
|
// shallowCopyPage in QPDFPageObjectHelper.
|
|
|
|
QTC::TC("qpdf", "QPDF resolve duplicated page object");
|
|
|
|
kid = makeIndirectObject(QPDFObjectHandle(kid).shallowCopy());
|
|
|
|
kids.setArrayItem(i, kid);
|
|
|
|
}
|
2022-02-08 14:18:08 +00:00
|
|
|
getAllPagesInternal(kid, result, visited, seen);
|
|
|
|
}
|
2022-04-02 21:14:10 +00:00
|
|
|
} else {
|
2019-08-18 22:54:08 +00:00
|
|
|
wanted_type = "/Page";
|
2019-01-29 01:13:10 +00:00
|
|
|
seen.insert(this_og);
|
2022-02-08 14:18:08 +00:00
|
|
|
result.push_back(cur_node);
|
2012-06-21 13:18:49 +00:00
|
|
|
}
|
2019-08-18 22:54:08 +00:00
|
|
|
|
2022-04-02 21:14:10 +00:00
|
|
|
if (!cur_node.isDictionaryOfType(wanted_type)) {
|
|
|
|
warn(QPDFExc(
|
|
|
|
qpdf_e_damaged_pdf,
|
|
|
|
this->m->file->getName(),
|
|
|
|
"page tree node",
|
|
|
|
this->m->file->getLastOffset(),
|
|
|
|
"/Type key should be " + wanted_type + " but is not; overriding"));
|
2019-08-18 22:54:08 +00:00
|
|
|
cur_node.replaceKey("/Type", QPDFObjectHandle::newName(wanted_type));
|
2012-06-21 13:18:49 +00:00
|
|
|
}
|
2015-02-21 23:22:32 +00:00
|
|
|
visited.erase(this_og);
|
2012-06-21 13:18:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2012-06-21 14:42:18 +00:00
|
|
|
QPDF::updateAllPagesCache()
|
2012-06-21 13:18:49 +00:00
|
|
|
{
|
2012-06-21 14:42:18 +00:00
|
|
|
// Force regeneration of the pages cache. We force immediate
|
|
|
|
// recalculation of all_pages since users may have references to
|
|
|
|
// it that they got from calls to getAllPages(). We can defer
|
|
|
|
// recalculation of pageobj_to_pages_pos until needed.
|
|
|
|
QTC::TC("qpdf", "QPDF updateAllPagesCache");
|
2017-08-22 01:33:44 +00:00
|
|
|
this->m->all_pages.clear();
|
|
|
|
this->m->pageobj_to_pages_pos.clear();
|
|
|
|
this->m->pushed_inherited_attributes_to_pages = false;
|
2012-06-21 14:42:18 +00:00
|
|
|
getAllPages();
|
2012-06-21 13:18:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
QPDF::flattenPagesTree()
|
|
|
|
{
|
2012-06-21 14:42:18 +00:00
|
|
|
// If not already done, flatten the /Pages structure and
|
|
|
|
// initialize pageobj_to_pages_pos.
|
2012-06-21 13:18:49 +00:00
|
|
|
|
2022-04-02 21:14:10 +00:00
|
|
|
if (!this->m->pageobj_to_pages_pos.empty()) {
|
2012-06-21 14:42:18 +00:00
|
|
|
return;
|
|
|
|
}
|
2012-06-21 13:18:49 +00:00
|
|
|
|
2012-06-22 16:11:25 +00:00
|
|
|
// Push inherited objects down to the /Page level. As a side
|
2017-08-22 01:33:44 +00:00
|
|
|
// effect this->m->all_pages will also be generated.
|
2012-06-22 16:52:13 +00:00
|
|
|
pushInheritedAttributesToPage(true, true);
|
2012-06-21 13:18:49 +00:00
|
|
|
|
2012-06-21 20:05:02 +00:00
|
|
|
QPDFObjectHandle pages = getRoot().getKey("/Pages");
|
2012-06-21 13:18:49 +00:00
|
|
|
|
2019-06-21 03:35:23 +00:00
|
|
|
size_t const len = this->m->all_pages.size();
|
2022-04-02 21:14:10 +00:00
|
|
|
for (size_t pos = 0; pos < len; ++pos) {
|
2021-04-05 14:45:18 +00:00
|
|
|
// Populate pageobj_to_pages_pos and fix parent pointer. There
|
|
|
|
// should be no duplicates at this point because
|
|
|
|
// pushInheritedAttributesToPage calls getAllPages which
|
|
|
|
// resolves duplicates.
|
2019-06-21 03:35:23 +00:00
|
|
|
insertPageobjToPage(this->m->all_pages.at(pos), toI(pos), true);
|
2017-08-22 01:33:44 +00:00
|
|
|
this->m->all_pages.at(pos).replaceKey("/Parent", pages);
|
2012-06-21 13:18:49 +00:00
|
|
|
}
|
|
|
|
|
2017-08-22 01:33:44 +00:00
|
|
|
pages.replaceKey("/Kids", QPDFObjectHandle::newArray(this->m->all_pages));
|
2012-06-21 13:18:49 +00:00
|
|
|
// /Count has not changed
|
2022-04-02 21:14:10 +00:00
|
|
|
if (pages.getKey("/Count").getUIntValue() != len) {
|
2019-06-25 16:30:01 +00:00
|
|
|
throw std::runtime_error("/Count is wrong after flattening pages tree");
|
2013-10-05 20:37:27 +00:00
|
|
|
}
|
2012-06-21 13:18:49 +00:00
|
|
|
}
|
|
|
|
|
2012-06-21 14:42:18 +00:00
|
|
|
void
|
2022-04-02 21:14:10 +00:00
|
|
|
QPDF::insertPageobjToPage(
|
|
|
|
QPDFObjectHandle const& obj, int pos, bool check_duplicate)
|
2012-06-21 13:18:49 +00:00
|
|
|
{
|
2013-06-14 15:58:37 +00:00
|
|
|
QPDFObjGen og(obj.getObjGen());
|
2022-04-02 21:14:10 +00:00
|
|
|
if (check_duplicate) {
|
|
|
|
if (!this->m->pageobj_to_pages_pos.insert(std::make_pair(og, pos))
|
|
|
|
.second) {
|
2021-04-05 14:45:18 +00:00
|
|
|
// The library never calls insertPageobjToPage in a way
|
|
|
|
// that causes this to happen.
|
2022-04-02 21:14:10 +00:00
|
|
|
setLastObjectDescription(
|
|
|
|
"page " + QUtil::int_to_string(pos) + " (numbered from zero)",
|
|
|
|
og.getObj(),
|
|
|
|
og.getGen());
|
|
|
|
throw QPDFExc(
|
|
|
|
qpdf_e_pages,
|
|
|
|
this->m->file->getName(),
|
|
|
|
this->m->last_object_description,
|
|
|
|
0,
|
|
|
|
"duplicate page reference found;"
|
|
|
|
" this would cause loss of data");
|
2012-06-21 16:21:34 +00:00
|
|
|
}
|
2022-04-02 21:14:10 +00:00
|
|
|
} else {
|
2017-08-22 01:33:44 +00:00
|
|
|
this->m->pageobj_to_pages_pos[og] = pos;
|
2012-06-21 13:18:49 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2012-06-21 14:42:18 +00:00
|
|
|
QPDF::insertPage(QPDFObjectHandle newpage, int pos)
|
2012-06-21 13:18:49 +00:00
|
|
|
{
|
2012-07-29 18:32:54 +00:00
|
|
|
// pos is numbered from 0, so pos = 0 inserts at the beginning and
|
2012-06-21 14:42:18 +00:00
|
|
|
// pos = npages adds to the end.
|
2012-06-21 13:18:49 +00:00
|
|
|
|
2012-06-21 14:42:18 +00:00
|
|
|
flattenPagesTree();
|
|
|
|
|
2022-04-02 21:14:10 +00:00
|
|
|
if (!newpage.isIndirect()) {
|
2012-06-21 16:21:34 +00:00
|
|
|
QTC::TC("qpdf", "QPDF insert non-indirect page");
|
2017-08-22 01:33:44 +00:00
|
|
|
newpage = makeIndirectObject(newpage);
|
2022-04-02 21:14:10 +00:00
|
|
|
} else if (newpage.getOwningQPDF() != this) {
|
2012-07-11 19:29:41 +00:00
|
|
|
QTC::TC("qpdf", "QPDF insert foreign page");
|
|
|
|
newpage.getOwningQPDF()->pushInheritedAttributesToPage();
|
2019-01-29 02:53:55 +00:00
|
|
|
newpage = copyForeignObject(newpage);
|
2022-04-02 21:14:10 +00:00
|
|
|
} else {
|
2012-06-21 16:21:34 +00:00
|
|
|
QTC::TC("qpdf", "QPDF insert indirect page");
|
|
|
|
}
|
|
|
|
|
2022-04-02 21:14:10 +00:00
|
|
|
QTC::TC(
|
|
|
|
"qpdf",
|
|
|
|
"QPDF insert page",
|
|
|
|
(pos == 0) ? 0 : // insert at beginning
|
|
|
|
(pos == QIntC::to_int(this->m->all_pages.size())) ? 1
|
|
|
|
: // at end
|
|
|
|
2); // insert in middle
|
2012-06-21 13:18:49 +00:00
|
|
|
|
2021-04-05 14:45:18 +00:00
|
|
|
auto og = newpage.getObjGen();
|
2022-04-02 21:14:10 +00:00
|
|
|
if (this->m->pageobj_to_pages_pos.count(og)) {
|
2021-04-05 14:45:18 +00:00
|
|
|
QTC::TC("qpdf", "QPDF resolve duplicated page in insert");
|
|
|
|
newpage = makeIndirectObject(QPDFObjectHandle(newpage).shallowCopy());
|
|
|
|
}
|
|
|
|
|
2012-06-21 20:05:02 +00:00
|
|
|
QPDFObjectHandle pages = getRoot().getKey("/Pages");
|
2012-06-21 13:18:49 +00:00
|
|
|
QPDFObjectHandle kids = pages.getKey("/Kids");
|
2022-04-02 21:14:10 +00:00
|
|
|
assert((pos >= 0) && (QIntC::to_size(pos) <= this->m->all_pages.size()));
|
2012-06-21 13:18:49 +00:00
|
|
|
|
|
|
|
newpage.replaceKey("/Parent", pages);
|
2012-06-21 14:42:18 +00:00
|
|
|
kids.insertItem(pos, newpage);
|
|
|
|
int npages = kids.getArrayNItems();
|
|
|
|
pages.replaceKey("/Count", QPDFObjectHandle::newInteger(npages));
|
2017-08-22 01:33:44 +00:00
|
|
|
this->m->all_pages.insert(this->m->all_pages.begin() + pos, newpage);
|
2022-04-02 21:14:10 +00:00
|
|
|
for (int i = pos + 1; i < npages; ++i) {
|
2019-06-21 03:35:23 +00:00
|
|
|
insertPageobjToPage(this->m->all_pages.at(toS(i)), i, false);
|
2012-06-21 13:18:49 +00:00
|
|
|
}
|
2012-06-21 14:42:18 +00:00
|
|
|
insertPageobjToPage(newpage, pos, true);
|
2012-06-21 13:18:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2012-06-21 14:42:18 +00:00
|
|
|
QPDF::removePage(QPDFObjectHandle page)
|
2012-06-21 13:18:49 +00:00
|
|
|
{
|
2012-06-21 14:42:18 +00:00
|
|
|
int pos = findPage(page); // also ensures flat /Pages
|
2022-04-02 21:14:10 +00:00
|
|
|
QTC::TC(
|
|
|
|
"qpdf",
|
|
|
|
"QPDF remove page",
|
|
|
|
(pos == 0) ? 0 : // remove at beginning
|
|
|
|
(pos == QIntC::to_int(this->m->all_pages.size() - 1)) ? 1
|
|
|
|
: // end
|
|
|
|
2); // remove in middle
|
2012-06-21 13:18:49 +00:00
|
|
|
|
2012-06-21 20:05:02 +00:00
|
|
|
QPDFObjectHandle pages = getRoot().getKey("/Pages");
|
2012-06-21 13:18:49 +00:00
|
|
|
QPDFObjectHandle kids = pages.getKey("/Kids");
|
|
|
|
|
2012-06-21 14:42:18 +00:00
|
|
|
kids.eraseItem(pos);
|
|
|
|
int npages = kids.getArrayNItems();
|
|
|
|
pages.replaceKey("/Count", QPDFObjectHandle::newInteger(npages));
|
2017-08-22 01:33:44 +00:00
|
|
|
this->m->all_pages.erase(this->m->all_pages.begin() + pos);
|
|
|
|
this->m->pageobj_to_pages_pos.erase(page.getObjGen());
|
2022-04-02 21:14:10 +00:00
|
|
|
for (int i = pos; i < npages; ++i) {
|
2019-06-21 03:35:23 +00:00
|
|
|
insertPageobjToPage(this->m->all_pages.at(toS(i)), i, false);
|
2012-06-21 14:42:18 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2022-04-02 21:14:10 +00:00
|
|
|
QPDF::addPageAt(QPDFObjectHandle newpage, bool before, QPDFObjectHandle refpage)
|
2012-06-21 14:42:18 +00:00
|
|
|
{
|
|
|
|
int refpos = findPage(refpage);
|
2022-04-02 21:14:10 +00:00
|
|
|
if (!before) {
|
2012-06-21 13:18:49 +00:00
|
|
|
++refpos;
|
|
|
|
}
|
2012-06-21 14:42:18 +00:00
|
|
|
insertPage(newpage, refpos);
|
2012-06-21 13:18:49 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2012-06-21 14:42:18 +00:00
|
|
|
QPDF::addPage(QPDFObjectHandle newpage, bool first)
|
2012-06-21 13:18:49 +00:00
|
|
|
{
|
2022-04-02 21:14:10 +00:00
|
|
|
if (first) {
|
2012-06-21 14:42:18 +00:00
|
|
|
insertPage(newpage, 0);
|
2022-04-02 21:14:10 +00:00
|
|
|
} else {
|
2019-06-21 03:35:23 +00:00
|
|
|
insertPage(
|
|
|
|
newpage,
|
|
|
|
getRoot().getKey("/Pages").getKey("/Count").getIntValueAsInt());
|
2012-06-21 14:42:18 +00:00
|
|
|
}
|
|
|
|
}
|
2012-06-21 13:18:49 +00:00
|
|
|
|
2012-06-21 14:42:18 +00:00
|
|
|
int
|
|
|
|
QPDF::findPage(QPDFObjectHandle& page)
|
|
|
|
{
|
2013-06-14 15:58:37 +00:00
|
|
|
return findPage(page.getObjGen());
|
2012-06-21 14:42:18 +00:00
|
|
|
}
|
2012-06-21 13:18:49 +00:00
|
|
|
|
2012-06-21 14:42:18 +00:00
|
|
|
int
|
2013-06-14 15:58:37 +00:00
|
|
|
QPDF::findPage(QPDFObjGen const& og)
|
2012-06-21 14:42:18 +00:00
|
|
|
{
|
|
|
|
flattenPagesTree();
|
2013-06-14 15:22:04 +00:00
|
|
|
std::map<QPDFObjGen, int>::iterator it =
|
2017-08-22 01:33:44 +00:00
|
|
|
this->m->pageobj_to_pages_pos.find(og);
|
2022-04-02 21:14:10 +00:00
|
|
|
if (it == this->m->pageobj_to_pages_pos.end()) {
|
2021-11-02 22:12:39 +00:00
|
|
|
QTC::TC("qpdf", "QPDF_pages findPage not found");
|
2013-06-14 15:58:37 +00:00
|
|
|
setLastObjectDescription("page object", og.getObj(), og.getGen());
|
2022-04-02 21:14:10 +00:00
|
|
|
throw QPDFExc(
|
|
|
|
qpdf_e_pages,
|
|
|
|
this->m->file->getName(),
|
|
|
|
this->m->last_object_description,
|
|
|
|
0,
|
|
|
|
"page object not referenced in /Pages tree");
|
2012-06-21 14:42:18 +00:00
|
|
|
}
|
|
|
|
return (*it).second;
|
2012-06-21 13:18:49 +00:00
|
|
|
}
|