pub unsafe fn chash_next(mut hash: *mut chash, mut iter: *mut chashiter) -> *mut chashiter {
    let mut indx: libc::c_uint = 0;
    if iter.is_null() {
        return 0 as *mut chashiter;
    }
    indx = (*iter).func.wrapping_rem((*hash).size);
    iter = (*iter).next;
    while iter.is_null() {
        indx = indx.wrapping_add(1);
        if indx >= (*hash).size {
            return 0 as *mut chashiter;
        }
        iter = *(*hash).cells.offset(indx as isize)
    }
    return iter;
}
/* Returns the next non-empty entry of the hash table */
Returns the next non-empty entry of the hash table
Returns the next non - empty entry of the hash table
pub unsafe fn chash_next(mut hash: *mut chash, mut iter: *mut chashiter) -> *mut chashiter {
    let mut indx: libc::c_uint = 0;
    if iter.is_null() {
        return 0 as *mut chashiter;
    }
    indx = (*iter).func.wrapping_rem((*hash).size);
    iter = (*iter).next;
    while iter.is_null() {
        indx = indx.wrapping_add(1);
        if indx >= (*hash).size {
            return 0 as *mut chashiter;
        }
        iter = *(*hash).cells.offset(indx as isize)
    }
    return iter;
}
pub unsafe fn chash_next ( mut hash : * mut chash , mut iter : * mut chashiter ) -> * mut chashiter { let mut indx : libc :: c_uint = 0 ; if iter . is_null ( ) { return 0 as * mut chashiter ; } indx = ( * iter ) . func . wrapping_rem ( ( * hash ) . size ) ; iter = ( * iter ) . next ; while iter . is_null ( ) { indx = indx . wrapping_add ( 1 ) ; if indx >= ( * hash ) . size { return 0 as * mut chashiter ; } iter = * ( * hash ) . cells . offset ( indx as isize ) } return iter ; }
Returns the next non-empty entry of the hash table
Returns the next non - empty entry of the hash table
hash
*mut chash
iter
*mut chashiter
hash
*mut chash
iter
*mut chashiter