33 std::unique_ptr<RefItem> item = std::make_unique<RefItem>(
m_id,
this);
43 return it!=
m_lookup.end() ? it->second :
nullptr;
60 [](
const std::unique_ptr<RefItem> &left,
const std::unique_ptr<RefItem> &right)
61 { return qstricmp_sort(left->title(),right->title()) < 0; });
65 doc +=
"<dl class=\"reflist\">";
68 for (
const std::unique_ptr<RefItem> &item :
m_entries)
70 if (item->name().isEmpty())
continue;
72 bool startNewGroup = item->group()!=lastGroup;
83 if (item->scope()->name() !=
"<globalScope>")
85 doc +=
"\\_setscope ";
86 doc += item->scope()->name();
90 doc += item->prefix();
91 doc +=
" \\_internalref ";
95 doc +=
" \""+escapedTitle+
"\" ";
97 if (!item->args().isEmpty())
110 doc += item->anchor();
113 lastGroup = item->group();
This is an alternative implementation of QCString.
This struct represents an item in the list of references.
std::unordered_map< int, RefItem * > m_lookup
std::vector< std::unique_ptr< RefItem > > m_entries
RefList(const QCString &listName, const QCString &pageTitle, const QCString &secTitle)
QCString pageTitle() const
QCString listName() const
RefItem * find(int itemId)
#define Config_getBool(name)
static void addRelatedPage(Entry *root)
QCString substitute(const QCString &s, const QCString &src, const QCString &dst)
substitute all occurrences of src in s by dst
std::vector< RefItem * > RefItemVector
QCString convertNameToFile(const QCString &name, bool allowDots, bool allowUnderscore)
A bunch of utility functions.