blob: f600c8b8b9ba3882d486bc56ab1551f668ba9bc9 (
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
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
|
/******************************************************************************
*
*
*
* Copyright (C) 1997-2015 by Dimitri van Heesch.
*
* Permission to use, copy, modify, and distribute this software and its
* documentation under the terms of the GNU General Public License is hereby
* granted. No representations are made about the suitability of this software
* for any purpose. It is provided "as is" without express or implied warranty.
* See the GNU General Public License for more details.
*
* Documents produced by Doxygen are derivative works derived from the
* input used in their production; they are not affected by this license.
*
*/
#ifndef MEMBERNAME_H
#define MEMBERNAME_H
#include "memberdef.h"
#include "linkedmap.h"
class MemberName
{
public:
using Ptr = std::unique_ptr<MemberDef>;
using Vec = std::vector<Ptr>;
using iterator = typename Vec::iterator;
using const_iterator = typename Vec::const_iterator;
using reverse_iterator = typename Vec::reverse_iterator;
using const_reverse_iterator = typename Vec::const_reverse_iterator;
MemberName(const QCString &name) : m_name(name) {}
QCString memberName() const { return m_name; }
iterator begin() { return m_members.begin(); }
iterator end() { return m_members.end(); }
const_iterator begin() const { return m_members.begin(); }
const_iterator end() const { return m_members.end(); }
const_iterator cbegin() const { return m_members.cbegin(); }
const_iterator cend() const { return m_members.cend(); }
reverse_iterator rbegin() { return m_members.rbegin(); }
reverse_iterator rend() { return m_members.rend(); }
const_reverse_iterator crbegin() const { return m_members.crbegin(); }
const_reverse_iterator crend() const { return m_members.crend(); }
bool empty() const { return m_members.empty(); }
size_t size() const { return m_members.size(); }
Ptr &back() { return m_members.back(); }
const Ptr &back() const { return m_members.back(); }
Ptr &front() { return m_members.front(); }
const Ptr &front() const { return m_members.front(); }
void push_back(Ptr &&p) { m_members.push_back(std::move(p)); }
private:
QCString m_name;
Vec m_members;
};
/** Ordered dictionary of MemberName objects. */
class MemberNameLinkedMap : public LinkedMap<MemberName>
{
};
/** Data associated with a MemberDef in an inheritance relation. */
class MemberInfo
{
public:
MemberInfo(const MemberDef *md,Protection p,Specifier v,bool inh) :
m_memberDef(md), m_prot(p), m_virt(v), m_inherited(inh) {}
~MemberInfo() {}
// getters
const MemberDef *memberDef() { return m_memberDef; }
const MemberDef *memberDef() const { return m_memberDef; }
Protection prot() const { return m_prot; }
Specifier virt() const { return m_virt; }
bool inherited() const { return m_inherited; }
QCString scopePath() const { return m_scopePath; }
QCString ambiguityResolutionScope() const { return m_ambiguityResolutionScope; }
const ClassDef *ambigClass() const { return m_ambigClass; }
// setters
void setAmbiguityResolutionScope(const QCString &s) { m_ambiguityResolutionScope = s; }
void setScopePath(const QCString &s) { m_scopePath = s; }
void setAmbigClass(const ClassDef *cd) { m_ambigClass = cd; }
private:
const MemberDef *m_memberDef;
Protection m_prot;
Specifier m_virt;
bool m_inherited;
QCString m_scopePath;
QCString m_ambiguityResolutionScope;
const ClassDef *m_ambigClass = 0;
};
class MemberNameInfo
{
public:
using Ptr = std::unique_ptr<MemberInfo>;
using Vec = std::vector<Ptr>;
using iterator = typename Vec::iterator;
using const_iterator = typename Vec::const_iterator;
MemberNameInfo(const QCString &name) : m_name(name) {}
QCString memberName() const { return m_name; }
iterator begin() { return m_members.begin(); }
iterator end() { return m_members.end(); }
const_iterator begin() const { return m_members.begin(); }
const_iterator end() const { return m_members.end(); }
bool empty() const { return m_members.empty(); }
size_t size() const { return m_members.size(); }
Ptr &back() { return m_members.back(); }
const Ptr &back() const { return m_members.back(); }
Ptr &front() { return m_members.front(); }
const Ptr &front() const { return m_members.front(); }
void push_back(Ptr &&p) { m_members.push_back(std::move(p)); }
private:
QCString m_name;
Vec m_members;
};
class MemberNameInfoLinkedMap : public LinkedMap<MemberNameInfo>
{
};
#endif
|
