- Timestamp:
- Dec 2, 2015, 11:22:03 PM (9 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
code/branches/cpp11_v2/src/libraries/core/command/CommandEvaluation.cc
r10821 r10916 306 306 // the user typed 1-2 arguments, check what he tried to type and print a suitable error 307 307 std::string groupLC = getLowercase(this->getToken(0)); 308 for (const auto & elem: ConsoleCommandManager::getInstance().getCommandsLC())309 if ( elem.first == groupLC)308 for (const auto& mapEntry : ConsoleCommandManager::getInstance().getCommandsLC()) 309 if (mapEntry.first == groupLC) 310 310 return std::string("Error: There is no command in group \"") + this->getToken(0) + "\" starting with \"" + this->getToken(1) + "\"."; 311 311 … … 328 328 329 329 // iterate through all groups and their commands and calculate the distance to the current command. keep the best. 330 for (const auto & elem: ConsoleCommandManager::getInstance().getCommandsLC())331 { 332 if ( elem.first != "")333 { 334 for (std::map<std::string, ConsoleCommand*>::const_iterator it_name = elem.second.begin(); it_name != elem.second.end(); ++it_name)335 { 336 std::string command = elem.first + " " + it_name->first;330 for (const auto& mapEntry : ConsoleCommandManager::getInstance().getCommandsLC()) 331 { 332 if (mapEntry.first != "") 333 { 334 for (std::map<std::string, ConsoleCommand*>::const_iterator it_name = mapEntry.second.begin(); it_name != mapEntry.second.end(); ++it_name) 335 { 336 std::string command = mapEntry.first + " " + it_name->first; 337 337 unsigned int distance = getLevenshteinDistance(command, token0_LC + " " + token1_LC); 338 338 if (distance < nearestDistance) … … 349 349 if (it_group != ConsoleCommandManager::getInstance().getCommandsLC().end()) 350 350 { 351 for (const auto & elem: it_group->second)352 { 353 std::string command = elem.first;351 for (const auto& mapEntry : it_group->second) 352 { 353 std::string command = mapEntry.first; 354 354 unsigned int distance = getLevenshteinDistance(command, token0_LC); 355 355 if (distance < nearestDistance) … … 429 429 { 430 430 size_t count = 0; 431 for (const auto & elem: list)432 if (elem .getComparable() != "")431 for (const ArgumentCompletionListElement& element : list) 432 if (element.getComparable() != "") 433 433 ++count; 434 434 return count; … … 495 495 { 496 496 // only one (non-empty) value in the list - search it and return it 497 for (const auto & elem: list)498 { 499 if (elem .getComparable() != "")497 for (const ArgumentCompletionListElement& element : list) 498 { 499 if (element.getComparable() != "") 500 500 { 501 501 // arguments that have a separate string to be displayed need a little more care - just return them without modification. add a space character to the others. 502 if (elem .hasDisplay())503 return (elem .getString());502 if (element.hasDisplay()) 503 return (element.getString()); 504 504 else 505 return (elem .getString() + ' ');505 return (element.getString() + ' '); 506 506 } 507 507 } … … 517 517 char tempComparable = '\0'; 518 518 char temp = '\0'; 519 for (const auto & elem: list)520 { 521 const std::string& argumentComparable = elem .getComparable();522 const std::string& argument = elem .getString();519 for (const ArgumentCompletionListElement& element : list) 520 { 521 const std::string& argumentComparable = element.getComparable(); 522 const std::string& argument = element.getString(); 523 523 524 524 // ignore empty arguments … … 560 560 { 561 561 std::string output; 562 for (const auto & elem: list)563 { 564 output += elem .getDisplay();562 for (const ArgumentCompletionListElement& element : list) 563 { 564 output += element.getDisplay(); 565 565 566 566 // add a space character between two elements for all non-empty arguments 567 if (elem .getComparable() != "")567 if (element.getComparable() != "") 568 568 output += ' '; 569 569 }
Note: See TracChangeset
for help on using the changeset viewer.