/** * Test the first queue is less than the second queue. */ bool_t queue_less(const queue_t* cpque_first, const queue_t* cpque_second) { assert(cpque_first != NULL); assert(cpque_second != NULL); #ifdef CSTL_QUEUE_LIST_SEQUENCE return list_less(&cpque_first->_t_sequence, &cpque_second->_t_sequence); #else return deque_less(&cpque_first->_t_sequence, &cpque_second->_t_sequence); #endif }
/** * Test the first stack is less than the second stack. */ bool_t stack_less(const cstl_stack_t* cpsk_first, const cstl_stack_t* cpsk_second) { assert(cpsk_first != NULL); assert(cpsk_second != NULL); #if defined (CSTL_STACK_VECTOR_SEQUENCE) return vector_less(&cpsk_first->_t_sequence, &cpsk_second->_t_sequence); #elif defined (CSTL_STACK_LIST_SEQUENCE) return list_less(&cpsk_first->_t_sequence, &cpsk_second->_t_sequence); #else return deque_less(&cpsk_first->_t_sequence, &cpsk_second->_t_sequence); #endif }
void _type_less_list(const void* cpv_first, const void* cpv_second, void* pv_output) { assert(cpv_first != NULL && cpv_second != NULL && pv_output != NULL); *(bool_t*)pv_output = list_less((list_t*)cpv_first, (list_t*)cpv_second); }
char list_greater_equal(array x, array y) { return !list_less(y,x); }
char list_greater(array x, array y) { return list_less(y,x); }