blob: 3c3ba293a77c7ad31cf59b52d3090ab577e0cbc8 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
|
// Copyright 2016 PDFium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com
#include "xfa/fxfa/parser/cxfa_arraynodelist.h"
#include <vector>
CXFA_ArrayNodeList::CXFA_ArrayNodeList(CXFA_Document* pDocument)
: CXFA_TreeList(pDocument) {}
CXFA_ArrayNodeList::~CXFA_ArrayNodeList() {}
void CXFA_ArrayNodeList::SetArrayNodeList(
const std::vector<CXFA_Node*>& srcArray) {
if (!srcArray.empty())
m_array = srcArray;
}
size_t CXFA_ArrayNodeList::GetLength() {
return m_array.size();
}
void CXFA_ArrayNodeList::Append(CXFA_Node* pNode) {
m_array.push_back(pNode);
}
void CXFA_ArrayNodeList::Insert(CXFA_Node* pNewNode, CXFA_Node* pBeforeNode) {
if (!pBeforeNode) {
m_array.push_back(pNewNode);
} else {
auto it = std::find(m_array.begin(), m_array.end(), pBeforeNode);
if (it != m_array.end())
m_array.insert(it, pNewNode);
}
}
void CXFA_ArrayNodeList::Remove(CXFA_Node* pNode) {
auto it = std::find(m_array.begin(), m_array.end(), pNode);
if (it != m_array.end())
m_array.erase(it);
}
CXFA_Node* CXFA_ArrayNodeList::Item(size_t index) {
return index < m_array.size() ? m_array[index] : nullptr;
}
|