Searched refs:m_keys (Results 1 – 3 of 3) sorted by relevance
45 Vector m_keys; // vector of NodeSortKeys field in NodeSorter77 m_keys = keys; in sort()132 NodeSortKey k = (NodeSortKey) m_keys.elementAt(kIndex); in compare()172 if ((n1Num == n2Num) && ((kIndex + 1) < m_keys.size())) in compare()258 if ((kIndex + 1) < m_keys.size()) in compare()495 if (!m_keys.isEmpty()) in NodeCompareElem()497 NodeSortKey k1 = (NodeSortKey) m_keys.elementAt(0); in NodeCompareElem()529 if (m_keys.size() > 1) in NodeCompareElem()531 NodeSortKey k2 = (NodeSortKey) m_keys.elementAt(1); in NodeCompareElem()
1237 : m_keys(std::move(keys)) in ParseResult()1250 auto iter = m_keys.find(o); in count()1251 if (iter == m_keys.end()) in count()1269 auto iter = m_keys.find(option); in operator []()1271 if (iter == m_keys.end()) in operator []()1299 NameHashMap m_keys{}; member in cxxopts::ParseResult1382 NameHashMap m_keys{}; member in cxxopts::OptionParser2043 …ParseResult parsed(std::move(m_keys), std::move(m_parsed), std::move(m_sequential), std::move(unma… in parse()2055 m_keys[detail.short_name()] = hash; in finalise_aliases()2056 m_keys[detail.long_name()] = hash; in finalise_aliases()
1685 m_keys = keys; in LOOKUPSWITCH()1688 int maxlength () { return 12 + (m_keys.length << 3); } in maxlength()1704 final int npairs = m_keys.length; in emit()1713 final int key = m_keys [t - 1]; in emit()1724 final int [] m_keys; field in InstrVisitor.LOOKUPSWITCH