Commit 32e476d5 authored by Jean-Paul Saman's avatar Jean-Paul Saman

Backport rev [17063]. Correctly count childern of a node. The previous code...

Backport rev [17063]. Correctly count childern of a node. The previous code counted the endpoints too, which gave a too high children count.
parent 14066a4d
...@@ -569,17 +569,17 @@ int playlist_NodeChildrenCount( playlist_t *p_playlist, playlist_item_t*p_node) ...@@ -569,17 +569,17 @@ int playlist_NodeChildrenCount( playlist_t *p_playlist, playlist_item_t*p_node)
{ {
int i; int i;
int i_nb = 0; int i_nb = 0;
if( p_node->i_children == -1 ) if( p_node->i_children == -1 )
{ {
return 0; return 0;
} }
i_nb += p_node->i_children;
for( i=0 ; i< p_node->i_children;i++ ) for( i=0 ; i< p_node->i_children;i++ )
{ {
if( p_node->pp_children[i]->i_children == -1 ) if( p_node->pp_children[i]->i_children == -1 )
{ break;
i_nb++;
}
else else
{ {
i_nb += playlist_NodeChildrenCount( p_playlist, i_nb += playlist_NodeChildrenCount( p_playlist,
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment