Lines Matching refs:data
243 return q->cursor->data; in Q_Head()
268 return q->cursor->data; in Q_Tail()
310 q->head->data = d; in Q_PushHead()
362 q->tail->data = d; in Q_PushTail()
398 d = q->head->data; in Q_PopHead()
441 d = q->tail->data; in Q_PopTail()
487 return q->cursor->data ; in Q_Next()
517 return q->cursor->data; in Q_Previous()
540 d = ((node*)iter)->data; in Q_Iter_Del()
639 return q->cursor->data; in Q_Get()
658 int Q_Put(queue *q, void *data) in Q_Put() argument
660 if(q && data) { in Q_Put()
664 q->cursor->data = data; in Q_Put()
690 int Q_Find(queue *q, void *data, in Q_Find() argument
701 if(Comp(d, data) == 0) in Q_Find()
706 if(Comp(d, data) == 0) in Q_Find()
793 index = malloc(q->size * sizeof(q->cursor->data)); in Q_Sort()
821 dn->data = index[i++]; in Q_Sort()
897 void *Q_Seek(queue *q, void *data, int (*Comp)(const void *, const void *)) in Q_Seek() argument
910 idx = Q_BSearch(q, data, Comp); in Q_Seek()
941 int Q_Insert(queue *q, void *data, int (*Comp)(const void *, const void *)) in Q_Insert() argument
947 Q_PushHead(q, data); in Q_Insert()
973 return qi ? ((node*)qi)->data : NULL; in Q_Iter_Get()
976 int Q_Iter_Put(q_iter qi, void* data) { in Q_Iter_Put() argument
978 ((node*)qi)->data = data; in Q_Iter_Put()