static int
_collection_sort_order_canonical(struct collection_match_rule *rule, Eina_List **ls,
int count, int max,
- Eo *obj, long index, Eina_Bool flag,
+ Eo *obj, int index, Eina_Bool flag,
Eo *pobj, Eina_Bool recurse, Eina_Bool traverse)
{
int i = index;
Eina_List *children;
children = efl_access_object_access_children_get(obj);
- long acount = eina_list_count(children);
+ int acount = eina_list_count(children);
Eina_Bool prev = pobj ? EINA_TRUE : EINA_FALSE;
for (; i < acount && (max == 0 || count < max); i++)
int count, int max, Eo *obj, Eina_Bool flag, Eo *pobj)
{
Eo *nextobj, *parent;
- long indexinparent;
+ int indexinparent;
Eina_List *children;
/* This breaks us out of the recursion. */
static int
_collection_query(struct collection_match_rule *rule, AtspiCollectionSortOrder sortby,
- Eina_List **list, int count, int max, Eo *obj, long index,
+ Eina_List **list, int count, int max, Eo *obj, int index,
Eina_Bool flag, Eo *pobj, Eina_Bool recurse, Eina_Bool traverse)
{
switch (sortby)