Searched refs:pred (Results 1 - 4 of 4) sorted by relevance

/haiku/src/libs/stdc++/legacy/
H A Dinsque.c15 void insque (struct qelem *elem, struct qelem *pred)
33 insque (elem, pred)
35 struct qelem *pred;
37 elem -> q_forw = pred -> q_forw;
38 pred -> q_forw -> q_back = elem;
39 elem -> q_back = pred;
40 pred -> q_forw = elem;
/haiku/src/system/libroot/posix/musl/search/
H A Dinsque.c8 void insque(void *element, void *pred) argument
11 struct node *p = pred;
/haiku/src/apps/glteapot/
H A Dutil.h103 LispNode<contents>** pred = &first; local
104 while(*pred)
105 pred = &(*pred)->cdr;
106 *pred = new_element;
130 LispNode< contents >** pred = &first; local
131 while (*pred)
132 pred = &(*pred)->cdr;
134 *pred
[all...]
/haiku/headers/os/support/
H A DObjectList.h910 BObjectList<T>::FindBinaryInsertionIndex(const UnaryPredicate<T>& pred, argument
913 int32 index = _PointerList_::BinarySearchIndexByPredicate(&pred,
928 BObjectList<T>::BinaryInsert(T* item, const UnaryPredicate<T>& pred) argument
930 return AddItem(item, FindBinaryInsertionIndex(pred));
936 BObjectList<T>::BinaryInsertUnique(T* item, const UnaryPredicate<T>& pred) argument
939 int32 index = FindBinaryInsertionIndex(pred, &alreadyInList);

Completed in 50 milliseconds