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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135 | /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* 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 <sal/config.h>
#include <map>
#include <utility>
#include <vector>
#include "sourcefileprovider.hxx"
#include "sourceprovider-scanner.hxx"
namespace unoidl::detail {
namespace {
class Cursor: public MapCursor {
public:
explicit Cursor(std::map< OUString, rtl::Reference<Entity> > const & map):
map_(map), iterator_(map_.begin())
{}
private:
virtual ~Cursor() throw () override {}
virtual rtl::Reference< Entity > getNext(OUString * name) override;
std::map< OUString, rtl::Reference<Entity> > const & map_; //TODO: extent
std::map< OUString, rtl::Reference<Entity> >::const_iterator iterator_;
};
rtl::Reference< Entity > Cursor::getNext(OUString * name) {
assert(name != nullptr);
rtl::Reference< Entity > ent;
if (iterator_ != map_.end()) {
*name = iterator_->first;
ent = iterator_->second;
++iterator_;
}
return ent;
}
class Module: public ModuleEntity {
public:
Module() {}
std::map< OUString, rtl::Reference<Entity> > map;
private:
virtual ~Module() throw () override {}
virtual std::vector<OUString> getMemberNames() const override;
virtual rtl::Reference<MapCursor> createCursor() const override
{ return new Cursor(map); }
};
std::vector<OUString> Module::getMemberNames() const {
std::vector<OUString> names;
for (auto & i: map) {
names.push_back(i.first);<--- Consider using std::transform algorithm instead of a raw loop.
}
return names;
}
}
SourceFileProvider::SourceFileProvider(
rtl::Reference<Manager> const & manager, OUString const & uri)
{
SourceProviderScannerData data(manager);
if (!parse(uri, &data)) {
throw NoSuchFileException(uri);
}
for (auto & i: data.entities) {
if (i.second.kind == SourceProviderEntity::KIND_LOCAL) {
assert(i.second.entity.is());
assert(i.second.entity->getSort() != Entity::SORT_MODULE);
std::map< OUString, rtl::Reference<Entity> > * map = &rootMap_;
for (sal_Int32 j = 0;;) {
OUString id(i.first.getToken(0, '.', j));
if (j == -1) {
map->insert(std::make_pair(id, i.second.entity));
break;
}
std::map< OUString, rtl::Reference<Entity> >::const_iterator k(
map->find(id));
if (k == map->end()) {
k = map->insert(std::make_pair(id, new Module)).first;
}
Module& mod = dynamic_cast<Module&>(*k->second);
map = &mod.map;
}
}
}
}
rtl::Reference<MapCursor> SourceFileProvider::createRootCursor() const {
return new Cursor(rootMap_);
}
rtl::Reference<Entity> SourceFileProvider::findEntity(OUString const & name)
const
{
std::map< OUString, rtl::Reference<Entity> > const * map = &rootMap_;
for (sal_Int32 i = 0;;) {
OUString id(name.getToken(0, '.', i));
std::map< OUString, rtl::Reference<Entity> >::const_iterator j(
map->find(id));
if (j == map->end()) {
return rtl::Reference<Entity>();
}
if (i == -1) {
return j->second;
}
if (j->second->getSort() != Entity::SORT_MODULE) {
return rtl::Reference<Entity>();
}
Module * mod = dynamic_cast< Module * >(j->second.get());
assert(mod != nullptr);
map = &mod->map;
}
}
SourceFileProvider::~SourceFileProvider() throw () {}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|