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
|
/******************************************************************************
*
*
*
* 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 <qlist.h>
#include "memberdef.h"
#include "sortdict.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 char *name) : m_name(name) {}
const char *memberName() const { return m_name; }
iterator begin() { return m_members.begin(); }
iterator end() { 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(); }
int 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. */
struct MemberInfo
{
MemberInfo(MemberDef *md,Protection p,Specifier v,bool inh) :
memberDef(md), prot(p), virt(v), inherited(inh), ambigClass(0) {}
~MemberInfo() {}
MemberDef *memberDef;
Protection prot;
Specifier virt;
bool inherited;
QCString scopePath;
QCString ambiguityResolutionScope;
ClassDef *ambigClass;
};
/** Class representing all MemberInfo objects with the same name */
class MemberNameInfo : public QList<MemberInfo>
{
public:
MemberNameInfo(const char *name);
~MemberNameInfo() {}
const char *memberName() const { return name; }
private:
int compareValues(const MemberInfo *item1,const MemberInfo *item2) const;
QCString name;
};
/** Iterator for MemberInfo objects in a MemberNameInfo list. */
class MemberNameInfoIterator : public QListIterator<MemberInfo>
{
public:
MemberNameInfoIterator(const MemberNameInfo &mnii)
: QListIterator<MemberInfo>(mnii) {}
};
/** Sorted dictionary of MemberNameInfo objects. */
class MemberNameInfoSDict : public SDict<MemberNameInfo>
{
public:
MemberNameInfoSDict(uint size) : SDict<MemberNameInfo>(size) {}
~MemberNameInfoSDict() {}
private:
int compareValues(const MemberNameInfo *item1,const MemberNameInfo *item2) const
{
return qstricmp(item1->memberName(), item2->memberName());
}
};
#endif
|
