diff options
author | Nikias Bassen | 2019-01-21 02:09:44 +0100 |
---|---|---|
committer | Nikias Bassen | 2019-01-21 02:22:28 +0100 |
commit | 84d6af8f82b30b6519bb401d467febe4ea981dad (patch) | |
tree | cfd1f1f34e60cfb87696a8cb480e5af00b8c89a3 /src/plist.c | |
parent | 5f8ca6e30334b81bd39a67f87a011cee8f282c3c (diff) | |
download | libplist-84d6af8f82b30b6519bb401d467febe4ea981dad.tar.gz libplist-84d6af8f82b30b6519bb401d467febe4ea981dad.tar.bz2 |
plist: Add iterator for #PLIST_ARRAY nodes
Similar to #PLIST_DICT, an iterator can now be used for #PLIST_ARRAY
nodes. Get an iterator with plist_array_new_iter() and use
plist_array_next_item() to iterate over the elements.
Diffstat (limited to 'src/plist.c')
-rw-r--r-- | src/plist.c | 38 |
1 files changed, 34 insertions, 4 deletions
diff --git a/src/plist.c b/src/plist.c index 6b604d6..1b33ec3 100644 --- a/src/plist.c +++ b/src/plist.c @@ -2,9 +2,9 @@ * plist.c * Builds plist XML structures * - * Copyright (c) 2009-2016 Nikias Bassen All Rights Reserved. - * Copyright (c) 2010-2015 Martin Szulecki All Rights Reserved. - * Copyright (c) 2008 Zach C. All Rights Reserved. + * Copyright (c) 2009-2019 Nikias Bassen, All Rights Reserved. + * Copyright (c) 2010-2015 Martin Szulecki, All Rights Reserved. + * Copyright (c) 2008 Zach C., All Rights Reserved. * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public @@ -457,6 +457,36 @@ PLIST_API void plist_array_remove_item(plist_t node, uint32_t n) return; } +PLIST_API void plist_array_new_iter(plist_t node, plist_array_iter *iter) +{ + if (iter) + { + *iter = malloc(sizeof(node_t*)); + *((node_t**)(*iter)) = node_first_child(node); + } + return; +} + +PLIST_API void plist_array_next_item(plist_t node, plist_array_iter iter, plist_t *item) +{ + node_t** iter_node = (node_t**)iter; + + if (item) + { + *item = NULL; + } + + if (node && PLIST_ARRAY == plist_get_node_type(node) && *iter_node) + { + if (item) + { + *item = (plist_t)(*iter_node); + } + *iter_node = node_next_sibling(*iter_node); + } + return; +} + PLIST_API uint32_t plist_dict_get_size(plist_t node) { uint32_t ret = 0; @@ -469,7 +499,7 @@ PLIST_API uint32_t plist_dict_get_size(plist_t node) PLIST_API void plist_dict_new_iter(plist_t node, plist_dict_iter *iter) { - if (iter && *iter == NULL) + if (iter) { *iter = malloc(sizeof(node_t*)); *((node_t**)(*iter)) = node_first_child(node); |