Lines Matching defs:OptionsMap
99 StringMap<Option *> OptionsMap;
113 if (!OptionsMap.insert(std::make_pair(Name, &Opt)).second) {
125 if (!OptionsMap.insert(std::make_pair(O->ArgStr, O)).second) {
159 OptionsMap.erase(Name);
181 return (!OptionsMap.empty() || !PositionalOpts.empty() ||
186 if (!OptionsMap.insert(std::make_pair(NewName, O)).second) {
191 OptionsMap.erase(O->ArgStr);
260 StringMap<Option *>::const_iterator I = OptionsMap.find(Arg);
261 return I != OptionsMap.end() ? I->second : nullptr;
267 OptionsMap.find(Arg.substr(0, EqualPos));
268 if (I == OptionsMap.end())
281 const StringMap<Option *> &OptionsMap,
295 for (StringMap<Option *>::const_iterator it = OptionsMap.begin(),
296 ie = OptionsMap.end();
436 const StringMap<Option *> &OptionsMap) {
438 StringMap<Option *>::const_iterator OMI = OptionsMap.find(Name);
443 while (OMI == OptionsMap.end() && Name.size() > 1) {
445 OMI = OptionsMap.find(Name);
448 if (OMI != OptionsMap.end() && Pred(OMI->second)) {
462 const StringMap<Option *> &OptionsMap) {
468 Option *PGOpt = getOptionPred(Arg, Length, isPrefixedOrGrouping, OptionsMap);
478 assert(OptionsMap.count(Arg) && OptionsMap.find(Arg)->second == PGOpt);
500 PGOpt = getOptionPred(Arg, Length, isGrouping, OptionsMap);
955 OptionsMap);
961 LookupNearestOption(ArgName, OptionsMap, NearestHandlerString);
1074 for (const auto &Opt : OptionsMap) {
1502 sortOpts(GlobalParser->OptionsMap, Opts, ShowHidden);
1723 sortOpts(OptionsMap, Opts, /*ShowHidden*/ true);
1832 return GlobalParser->OptionsMap;
1836 for (auto &I : GlobalParser->OptionsMap) {
1846 for (auto &I : GlobalParser->OptionsMap) {
