ucif/antlr3/src/antlr3collections.c
static int
antlr3EnumNext  (pANTLR3_HASH_ENUM en, pANTLR3_HASH_KEY * key, void ** data)
{
    /* If the current entry is valid, then use it
     */
    if  (en->bucket >= en->table->modulo)
    {
        /* Already exhausted the table
         */
        return  ANTLR3_FAIL;
    }

    /* Pointers are already set to the current entry to return, or
     * we would not be at this point in the logic flow.
     */
    *key        = &(en->entry->keybase);
    *data       = en->entry->data;

    /* Return pointers are set up, so now we move the element
     * pointer to the next in the table (if any).
     */
    antlr3EnumNextEntry(en);

    return      ANTLR3_SUCCESS;
}
/** \brief Return the next entry in the hashtable being traversed by the supplied
 *         enumeration.
 *
 * \param[in] en Pointer to the enumeration tracking structure
 * \param key    Pointer to void pointer, where the key pointer is returned.
 * \param data   Pointer to void pointer where the data pointer is returned.
 * \return
 *      - ANTLR3_SUCCESS if there was a next key
 *      - ANTLR3_FAIL    if there were no more keys
 *
 * \remark
 *  No checking of input structure is performed!
 */
\brief Return the next entry in the hashtable being traversed by the supplied
enumeration.

\param[in] en Pointer to the enumeration tracking structure
\param key    Pointer to void pointer, where the key pointer is returned.
\param data   Pointer to void pointer where the data pointer is returned.
\return
- ANTLR3_SUCCESS if there was a next key
- ANTLR3_FAIL    if there were no more keys

\remark
No checking of input structure is performed!
\ brief Return the next entry in the hashtable being traversed by the supplied enumeration . \ param [ in ] en Pointer to the enumeration tracking structure \ param key Pointer to void pointer where the key pointer is returned . \ param data Pointer to void pointer where the data pointer is returned . \ return - ANTLR3_SUCCESS if there was a next key - ANTLR3_FAIL if there were no more keys \ remark No checking of input structure is performed!
static int
antlr3EnumNext  (pANTLR3_HASH_ENUM en, pANTLR3_HASH_KEY * key, void ** data)
{
    if  (en->bucket >= en->table->modulo)
    {
        return  ANTLR3_FAIL;
    }
    *key        = &(en->entry->keybase);
    *data       = en->entry->data;
    antlr3EnumNextEntry(en);
    return      ANTLR3_SUCCESS;
}
static int antlr3EnumNext ( pANTLR3_HASH_ENUM en , pANTLR3_HASH_KEY * key , void * * data ) { if ( en -> bucket >= en -> table -> modulo ) { return ANTLR3_FAIL ; } * key = & ( en -> entry -> keybase ) ; * data = en -> entry -> data ; antlr3EnumNextEntry ( en ) ; return ANTLR3_SUCCESS ; }
\brief Return the next entry in the hashtable being traversed by the supplied
         enumeration.
\ brief Return the next entry in the hashtable being traversed by the supplied enumeration .
/* If the current entry is valid, then use it
     */ /* Already exhausted the table
         */ /* Pointers are already set to the current entry to return, or
     * we would not be at this point in the logic flow.
     */ /* Return pointers are set up, so now we move the element
     * pointer to the next in the table (if any).
     */