blob: 489cbe8ebc05020c51c076fa4cd01abbffd63900 (
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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4; fill-column: 100 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*/
#include <mathml/iterator.hxx>
#include <stdlib.h>
/** The purpose of this iterator is to be able to iterate threw an infinite element tree
* infinite -> as much as your memory can hold
* No call-backs that will end up in out of stack
*/
namespace mathml
{
static inline void deleteElement(SmMlElement* aSmMlElement, void*) { delete aSmMlElement; }
static inline void cloneElement(SmMlElement* aSmMlElement, void* aData)
{
// Prepare data
SmMlElement* aNewSmMlElement = new SmMlElement(*aSmMlElement);
SmMlElement* aCopyTree = *static_cast<SmMlElement**>(aData);
// Append data
aCopyTree->setSubElement(aCopyTree->getSubElementsCount(), aNewSmMlElement);
// Prepare for following
// If it has sub elements, then it will be the next
if (aSmMlElement->getSubElementsCount() != 0)
aCopyTree = aNewSmMlElement;
else // Otherwise remounts up to where it should be
{
while (aSmMlElement->getParentElement() != nullptr)
{
// get parent
SmMlElement* pParent = aSmMlElement->getParentElement();
aCopyTree = aCopyTree->getParentElement();
// was this the last branch ?
if (aSmMlElement->getSubElementId() + 1 != pParent->getSubElementsCount())
break; // no -> stop going up
// Prepare for next round
aSmMlElement = pParent;
}
}
// Closing extras
*static_cast<SmMlElement**>(aData) = aCopyTree;
}
void SmMlIteratorFree(SmMlElement* pMlElementTree)
{
if (pMlElementTree == nullptr)
return;
for (size_t i = 0; i < pMlElementTree->getSubElementsCount(); ++i)
{
SmMlIteratorFree(pMlElementTree->getSubElement(i));
}
deleteElement(pMlElementTree, nullptr);
}
SmMlElement* SmMlIteratorCopy(SmMlElement* pMlElementTree)
{
if (pMlElementTree == nullptr)
return nullptr;
SmMlElement* aDummyElement = new SmMlElement();
SmMlIteratorTopToBottom(pMlElementTree, cloneElement, &aDummyElement);
SmMlElement* aResultElement = aDummyElement->getSubElement(0);
delete aDummyElement;
return aResultElement;
}
} // end namespace mathml
/* vim:set shiftwidth=4 softtabstop=4 expandtab cinoptions=b1,g0,N-s cinkeys+=0=break: */
|
