Lines Matching +full:no +full:- +full:cmp

18  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
37  * Low-complexity tree container
40  * smallest which is larger than, all have O(log n) worst-case complexity.
59  * @param cmp compare function used to compare elements in the tree,
61  *            It is guaranteed that the first and only the first argument to cmp()
64  * @return An element with cmp(key, elem) == 0 or NULL if no such element
68                    int (*cmp)(const void *key, const void *b), void *next[2]);
74  * If *next is non-NULL, then the supplied element will be inserted, unless
93  *                               int (*cmp)(void *key, const void *b),
98  *                 return av_tree_insert(rootp, key, cmp, next);
101  *                               int (*cmp)(void *key, const void *b, AVTreeNode **next))
104  *                 return av_tree_insert(rootp, key, cmp, next);
107  * @param cmp compare function used to compare elements in the tree, API identical
109  * @return If no insertion happened, the found element; if an insertion or
112  *         should make no assumptions that it's one or the other in the code.
115                      int (*cmp)(const void *key, const void *b),
123  * @param cmp a comparison function that returns < 0 for an element below the
127  * @note The cmp function should use the same ordering used to construct the
131                        int (*cmp)(void *opaque, void *elem),