src/parser/Parse_Table.cc
bool Parse_Table::Keyword_Compare_::operator()(Keyword const &k1, Keyword const &k2) const {
  Require(k1.moniker != nullptr);
  Require(k2.moniker != nullptr);

  return kk_comparison(k1.moniker, k2.moniker) < 0;
}
//------------------------------------------------------------------------------------------------//
/*!
 * \brief Comparison function for sorting keyword tables.
 *
 * This function is used by a Parse_Table to sort its keyword list using
 * std::sort.
 *
 * If no option flags are set, monikers will test equal if they are identical.
 *
 * If the CASE_INSENSITIVE option is set, monikers will test equal if they are
 * identical when converted to uppercase.
 *
 * Note that PARTIAL_IDENTIFIER_MATCH is ignored when comparing monikers from
 * two keywords. It is relevant only when comparing monikers with input tokens.
 *
 * A valid Parse_Table may not contain any keywords that test equal.
 *
 * \param k1 The first Keyword to be compared.
 *
 * \param k2 The second Keyword to be compared.
 *
 * \return <CODE>kk_comparison(k1.moniker, k2.moniker)<0 </CODE>
 */
\brief Comparison function for sorting keyword tables.
This function is used by a Parse_Table to sort its keyword list using
std::sort.

If no option flags are set, monikers will test equal if they are identical.

If the CASE_INSENSITIVE option is set, monikers will test equal if they are
identical when converted to uppercase.

Note that PARTIAL_IDENTIFIER_MATCH is ignored when comparing monikers from
two keywords. It is relevant only when comparing monikers with input tokens.

A valid Parse_Table may not contain any keywords that test equal.

\param k1 The first Keyword to be compared.

\param k2 The second Keyword to be compared.


\ brief Comparison function for sorting keyword tables . This function is used by a Parse_Table to sort its keyword list using std :: sort . If no option flags are set monikers will test equal if they are identical . If the CASE_INSENSITIVE option is set monikers will test equal if they are identical when converted to uppercase . Note that PARTIAL_IDENTIFIER_MATCH is ignored when comparing monikers from two keywords . It is relevant only when comparing monikers with input tokens . A valid Parse_Table may not contain any keywords that test equal . \ param k1 The first Keyword to be compared . \ param k2 The second Keyword to be compared .
bool Parse_Table::Keyword_Compare_::operator()(Keyword const &k1, Keyword const &k2) const {
  Require(k1.moniker != nullptr);
  Require(k2.moniker != nullptr);
  return kk_comparison(k1.moniker, k2.moniker) < 0;
}
bool Parse_Table :: Keyword_Compare_ :: operator () ( Keyword const & k1 , Keyword const & k2 ) const { Require ( k1 . moniker != nullptr ) ; Require ( k2 . moniker != nullptr ) ; return kk_comparison ( k1 . moniker , k2 . moniker ) < 0 ; }
\brief Comparison function for sorting keyword tables.
\ brief Comparison function for sorting keyword tables .