blob: c996cfd97630c342c2714a97e24270b6b0979585 (
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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
|
// SPDX-License-Identifier: GPL-2.0-or-later
/** @file
* TODO: insert short description here
*//*
* Authors: see git history
*
* Copyright (C) 2018 Authors
* Released under GNU GPL v2+, read the file 'COPYING' for more information.
*/
#ifdef HAVE_CONFIG_H
#endif
#include <map>
#include <cstring>
#include <string>
#include <glib.h> // g_assert()
#include "xml/node-iterators.h"
#include "util/find-if-before.h"
#include "node-fns.h"
namespace Inkscape {
namespace XML {
/* the id_permitted stuff is a temporary-ish hack */
namespace {
bool id_permitted_internal(GQuark qname) {
char const *qname_s=g_quark_to_string(qname);
return !strncmp("svg:", qname_s, 4) || !strncmp("sodipodi:", qname_s, 9) ||
!strncmp("inkscape:", qname_s, 9);
}
bool id_permitted_internal_memoized(GQuark qname) {
typedef std::map<GQuark, bool> IdPermittedMap;
static IdPermittedMap id_permitted_names;
IdPermittedMap::iterator found;
found = id_permitted_names.find(qname);
if ( found != id_permitted_names.end() ) {
return found->second;
} else {
bool permitted=id_permitted_internal(qname);
id_permitted_names[qname] = permitted;
return permitted;
}
}
}
bool id_permitted(Node const *node) {
g_return_val_if_fail(node != nullptr, false);
if ( node->type() != ELEMENT_NODE ) {
return false;
}
return id_permitted_internal_memoized((GQuark)node->code());
}
struct node_matches {
node_matches(Node const &n) : node(n) {}
bool operator()(Node const &other) { return &other == &node; }
Node const &node;
};
// documentation moved to header
Node *previous_node(Node *node) {
return node->prev();
using Inkscape::Algorithms::find_if_before;
if ( !node || !node->parent() ) {
return nullptr;
}
Node *previous=find_if_before<NodeSiblingIterator>(
node->parent()->firstChild(), nullptr, node_matches(*node)
);
g_assert(previous == nullptr
? node->parent()->firstChild() == node
: previous->next() == node);
return previous;
}
}
}
/*
Local Variables:
mode:c++
c-file-style:"stroustrup"
c-file-offsets:((innamespace . 0)(inline-open . 0)(case-label . +))
indent-tabs-mode:nil
fill-column:99
End:
*/
// vim: filetype=cpp:expandtab:shiftwidth=4:tabstop=8:softtabstop=4:fileencoding=utf-8:textwidth=99 :
|
