![]() |
Tesseract 0.28.4
|
Common Tesseract Types. More...
Classes | |
| struct | std::hash< tesseract::common::LinkNamesPair > |
Typedefs | |
| using | tesseract::common::LinkNamesPair = std::pair< std::string, std::string > |
Functions | |
| LinkNamesPair | tesseract::common::makeOrderedLinkPair (const std::string &link_name1, const std::string &link_name2) |
| Create a pair of strings, where the pair.first is always <= pair.second. | |
| void | tesseract::common::makeOrderedLinkPair (LinkNamesPair &pair, const std::string &link_name1, const std::string &link_name2) |
| Populate a pair of strings, where the pair.first is always <= pair.second. | |
Common Tesseract Types.
| LinkNamesPair tesseract::common::makeOrderedLinkPair | ( | const std::string & | link_name1, |
| const std::string & | link_name2 | ||
| ) |
Create a pair of strings, where the pair.first is always <= pair.second.
This is commonly used as the key to an unordered_map<LinkNamesPair, Type>
| link_name1 | First link name |
| link_name2 | Second link name |
| void tesseract::common::makeOrderedLinkPair | ( | LinkNamesPair & | pair, |
| const std::string & | link_name1, | ||
| const std::string & | link_name2 | ||
| ) |
Populate a pair of strings, where the pair.first is always <= pair.second.
This is used to avoid multiple memory application throughout the code base
This is commonly used as the key to an unordered_map<LinkNamesPair, Type>
| pair | The link name pair to load a lexicographically sorted pair of strings |
| link_name1 | First link name |
| link_name2 | Second link nam |