Lines Matching full:data
35 void *data;
70 * @data0: first data
71 * @data1: second data
73 * Compares two arbitrary data
91 * @data: a data
93 * Search data in the ordered list walking from the beginning
95 * Returns the link containing the data or NULL
98 xmlListLowerSearch(xmlListPtr l, void *data)
104 for(lk = l->sentinel->next;lk != l->sentinel && l->linkCompare(lk->data, data) <0 ;lk = lk->next);
111 * @data: a data
113 * Search data in the ordered list walking backward from the end
115 * Returns the link containing the data or NULL
118 xmlListHigherSearch(xmlListPtr l, void *data)
124 for(lk = l->sentinel->prev;lk != l->sentinel && l->linkCompare(lk->data, data) >0 ;lk = lk->prev);
131 * @data: a data
133 * Search data in the list
135 * Returns the link containing the data or NULL
138 xmlListLinkSearch(xmlListPtr l, void *data)
143 lk = xmlListLowerSearch(l, data);
147 if (l->linkCompare(lk->data, data) ==0)
156 * @data: a data
158 * Search data in the list processing backward
160 * Returns the link containing the data or NULL
163 xmlListLinkReverseSearch(xmlListPtr l, void *data)
168 lk = xmlListHigherSearch(l, data);
172 if (l->linkCompare(lk->data, data) ==0)
208 l->sentinel->data = NULL;
224 * @data: a search value
226 * Search the list for an existing value of @data
228 * Returns the value associated to @data or NULL in case of error
231 xmlListSearch(xmlListPtr l, void *data)
236 lk = xmlListLinkSearch(l, data);
238 return (lk->data);
245 * @data: a search value
247 * Search the list in reverse order for an existing value of @data
249 * Returns the value associated to @data or NULL in case of error
252 xmlListReverseSearch(xmlListPtr l, void *data)
257 lk = xmlListLinkReverseSearch(l, data);
259 return (lk->data);
266 * @data: the data
268 * Insert data in the ordered list at the beginning for this value
273 xmlListInsert(xmlListPtr l, void *data)
279 lkPlace = xmlListLowerSearch(l, data);
287 lkNew->data = data;
299 * @data: the data
301 * Insert data in the ordered list at the end for this value
305 int xmlListAppend(xmlListPtr l, void *data)
311 lkPlace = xmlListHigherSearch(l, data);
319 lkNew->data = data;
331 * Deletes the list and its associated data
346 * @data: list data
348 * Remove the first instance associated to data in the list
353 xmlListRemoveFirst(xmlListPtr l, void *data)
359 /*Find the first instance of this data */
360 lk = xmlListLinkSearch(l, data);
371 * @data: list data
373 * Remove the last instance associated to data in the list
378 xmlListRemoveLast(xmlListPtr l, void *data)
384 /*Find the last instance of this data */
385 lk = xmlListLinkReverseSearch(l, data);
396 * @data: list data
398 * Remove the all instance associated to data in the list
403 xmlListRemoveAll(xmlListPtr l, void *data)
410 while(xmlListRemoveFirst(l, data))
419 * Remove the all data in the list
535 * @data: new data
537 * add the new data at the beginning of the list
542 xmlListPushFront(xmlListPtr l, void *data)
556 lkNew->data = data;
567 * @data: new data
569 * add the new data at the end of the list
574 xmlListPushBack(xmlListPtr l, void *data)
587 lkNew->data = data;
601 * Returns a pointer to the data referenced from this link
608 return lk->data;
682 if((walker(lk->data, user)) == 0)
703 if((walker(lk->data, user)) == 0)
763 /* Walk the old tree and insert the data into the new one */
769 if (0 !=xmlListInsert(cur, lk->data)) {
