本文整理汇总了C++中xmlListPtr类的典型用法代码示例。如果您正苦于以下问题：C++ xmlListPtr类的具体用法？C++ xmlListPtr怎么用？C++ xmlListPtr使用的例子？那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
在下文中一共展示了xmlListPtr类的5个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: xmlListLowerSearch
/**
* xmlListLowerSearch:
* @l: a list
* @data: a data
*
* Search data in the ordered list walking from the beginning
*
* Returns the link containing the data or NULL
*/
static xmlLinkPtr
xmlListLowerSearch(xmlListPtr l, void *data)
{
xmlLinkPtr lk;
for(lk = l->sentinel->next;lk != l->sentinel && l->linkCompare(lk->data, data) <0 ;lk = lk->next);
return lk;
}示例2: xmlListHigherSearch
/**
* xmlListHigherSearch:
* @l: a list
* @data: a data
*
* Search data in the ordered list walking backward from the end
*
* Returns the link containing the data or NULL
*/
static xmlLinkPtr
xmlListHigherSearch(xmlListPtr l, void *data)
{
xmlLinkPtr lk;
for(lk = l->sentinel->prev;lk != l->sentinel && l->linkCompare(lk->data, data) >0 ;lk = lk->prev);
return lk;
}示例3: xmlLinkDeallocator
/**
* xmlLinkDeallocator:
* @l: a list
* @lk: a link
*
* Unlink and deallocate @lk from list @l
*/
static void
xmlLinkDeallocator(xmlListPtr l, xmlLinkPtr lk)
{
(lk->prev)->next = lk->next;
(lk->next)->prev = lk->prev;
if (l->linkDeallocator)
l->linkDeallocator(lk);
xmlFree(lk);
}示例4: xmlListLinkReverseSearch
/**
* xmlListLinkReverseSearch:
* @param l a list
* @param data a data
*
* Search data in the list processing backward
*
* Returns the link containing the data or NULL
*/
static xmlLinkPtr
xmlListLinkReverseSearch(xmlListPtr list, void *data)
{
xmlLinkPtr lk;
lk = xmlListHigherSearch(list, data);
if (lk == list->sentinel)
return NULL;
else {
if (list->linkCompare(lk->data, data) ==0)
return lk;
return NULL;
}
}示例5: xmlListLinkSearch
/**
* xmlListSearch:
* @l: a list
* @data: a data
*
* Search data in the list
*
* Returns the link containing the data or NULL
*/
static xmlLinkPtr
xmlListLinkSearch(xmlListPtr l, void *data)
{
xmlLinkPtr lk;
lk = xmlListLowerSearch(l, data);
if (lk == l->sentinel)
return NULL;
else {
if (l->linkCompare(lk->data, data) ==0)
return lk;
return NULL;
}
}