/** * as_node_insert_localized: * @parent: a parent #AsNode. * @name: the tag name, e.g. "id". * @localized: the hash table of data, with the locale as the key. * @insert_flags: any %AsNodeInsertFlags. * * Inserts a localized key into the DOM. * * Since: 0.1.0 **/ void as_node_insert_localized (AsNode *parent, const gchar *name, GHashTable *localized, AsNodeInsertFlags insert_flags) { AsNodeData *data; GList *l; const gchar *key; const gchar *value; const gchar *value_c; g_autoptr(GList) list = NULL; g_return_if_fail (name != NULL); /* add the untranslated value first */ value_c = g_hash_table_lookup (localized, "C"); if (value_c == NULL) return; data = g_slice_new0 (AsNodeData); as_node_data_set_name (data, name, insert_flags); if (insert_flags & AS_NODE_INSERT_FLAG_NO_MARKUP) { data->cdata = as_markup_convert_simple (value_c, NULL); data->cdata_escaped = FALSE; } else { data->cdata = g_strdup (value_c); data->cdata_escaped = insert_flags & AS_NODE_INSERT_FLAG_PRE_ESCAPED; } g_node_insert_data (parent, -1, data); /* add the other localized values */ list = g_hash_table_get_keys (localized); list = g_list_sort (list, as_node_list_sort_cb); for (l = list; l != NULL; l = l->next) { key = l->data; if (g_strcmp0 (key, "C") == 0) continue; if (g_strcmp0 (key, "x-test") == 0) continue; value = g_hash_table_lookup (localized, key); if ((insert_flags & AS_NODE_INSERT_FLAG_DEDUPE_LANG) > 0 && g_strcmp0 (value_c, value) == 0) continue; data = g_slice_new0 (AsNodeData); as_node_attr_insert (data, "xml:lang", key); as_node_data_set_name (data, name, insert_flags); if (insert_flags & AS_NODE_INSERT_FLAG_NO_MARKUP) { data->cdata = as_markup_convert_simple (value, NULL); data->cdata_escaped = FALSE; } else { data->cdata = g_strdup (value); data->cdata_escaped = insert_flags & AS_NODE_INSERT_FLAG_PRE_ESCAPED; } g_node_insert_data (parent, -1, data); } }
/** * as_node_insert: (skip) * @parent: a parent #AsNode. * @name: the tag name, e.g. "id". * @cdata: the tag data, or %NULL, e.g. "org.gnome.Software.desktop". * @insert_flags: any %AsNodeInsertFlags. * @...: any attributes to add to the node, terminated by %NULL * * Inserts a node into the DOM. * * Returns: (transfer none): A populated #AsNode * * Since: 0.1.0 **/ AsNode * as_node_insert (AsNode *parent, const gchar *name, const gchar *cdata, AsNodeInsertFlags insert_flags, ...) { const gchar *key; const gchar *value; AsNodeData *data; guint i; va_list args; g_return_val_if_fail (name != NULL, NULL); data = g_slice_new0 (AsNodeData); as_node_data_set_name (data, name, insert_flags); if (cdata != NULL) { if (insert_flags & AS_NODE_INSERT_FLAG_BASE64_ENCODED) data->cdata = as_node_insert_line_breaks (cdata, 76); else data->cdata = g_strdup (cdata); } data->cdata_escaped = insert_flags & AS_NODE_INSERT_FLAG_PRE_ESCAPED; /* process the attrs valist */ va_start (args, insert_flags); for (i = 0;; i++) { key = va_arg (args, const gchar *); if (key == NULL) break; value = va_arg (args, const gchar *); if (value == NULL) break; as_node_attr_insert (data, key, value); } va_end (args); return g_node_insert_data (parent, -1, data); }
/** * as_node_insert_hash: * @parent: a parent #AsNode. * @name: the tag name, e.g. "id". * @attr_key: the key to use as the attribute in the XML, e.g. "key". * @hash: the hash table with the key as the key to use in the XML. * @insert_flags: any %AsNodeInsertFlags. * * Inserts a hash table of data into the DOM. * * Since: 0.1.0 **/ void as_node_insert_hash (AsNode *parent, const gchar *name, const gchar *attr_key, GHashTable *hash, AsNodeInsertFlags insert_flags) { AsNodeData *data; GList *l; GList *list; const gchar *key; const gchar *value; gboolean swapped = (insert_flags & AS_NODE_INSERT_FLAG_SWAPPED) > 0; g_return_if_fail (name != NULL); list = g_hash_table_get_keys (hash); list = g_list_sort (list, as_node_list_sort_cb); for (l = list; l != NULL; l = l->next) { key = l->data; value = g_hash_table_lookup (hash, key); data = g_slice_new0 (AsNodeData); as_node_data_set_name (data, name, insert_flags); data->cdata = g_strdup (!swapped ? value : key); data->cdata_escaped = insert_flags & AS_NODE_INSERT_FLAG_PRE_ESCAPED; if (!swapped) { if (key != NULL && key[0] != '\0') as_node_attr_insert (data, attr_key, key); } else { if (value != NULL && value[0] != '\0') as_node_attr_insert (data, attr_key, value); } g_node_insert_data (parent, -1, data); } g_list_free (list); }
static void g_node_test (void) { GNode *root; GNode *node; GNode *node_B; GNode *node_D; GNode *node_F; GNode *node_G; GNode *node_J; guint i; gchar *tstring; failed = FALSE; root = g_node_new (C2P ('A')); TEST (NULL, g_node_depth (root) == 1 && g_node_max_height (root) == 1); node_B = g_node_new (C2P ('B')); g_node_append (root, node_B); TEST (NULL, root->children == node_B); g_node_append_data (node_B, C2P ('E')); g_node_prepend_data (node_B, C2P ('C')); node_D = g_node_new (C2P ('D')); g_node_insert (node_B, 1, node_D); node_F = g_node_new (C2P ('F')); g_node_append (root, node_F); TEST (NULL, root->children->next == node_F); node_G = g_node_new (C2P ('G')); g_node_append (node_F, node_G); node_J = g_node_new (C2P ('J')); g_node_prepend (node_G, node_J); g_node_insert (node_G, 42, g_node_new (C2P ('K'))); g_node_insert_data (node_G, 0, C2P ('H')); g_node_insert (node_G, 1, g_node_new (C2P ('I'))); TEST (NULL, g_node_depth (root) == 1); TEST (NULL, g_node_max_height (root) == 4); TEST (NULL, g_node_depth (node_G->children->next) == 4); TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_LEAFS) == 7); TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_NON_LEAFS) == 4); TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_ALL) == 11); TEST (NULL, g_node_max_height (node_F) == 3); TEST (NULL, g_node_n_children (node_G) == 4); TEST (NULL, g_node_find_child (root, G_TRAVERSE_ALL, C2P ('F')) == node_F); TEST (NULL, g_node_find (root, G_LEVEL_ORDER, G_TRAVERSE_NON_LEAFS, C2P ('I')) == NULL); TEST (NULL, g_node_find (root, G_IN_ORDER, G_TRAVERSE_LEAFS, C2P ('J')) == node_J); for (i = 0; i < g_node_n_children (node_B); i++) { node = g_node_nth_child (node_B, i); TEST (NULL, P2C (node->data) == ('C' + i)); } for (i = 0; i < g_node_n_children (node_G); i++) TEST (NULL, g_node_child_position (node_G, g_node_nth_child (node_G, i)) == i); /* we have built: A * / \ * B F * / | \ \ * C D E G * / /\ \ * H I J K * * for in-order traversal, 'G' is considered to be the "left" * child of 'F', which will cause 'F' to be the last node visited. */ tstring = NULL; g_node_traverse (root, G_PRE_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring); TEST (tstring, strcmp (tstring, "ABCDEFGHIJK") == 0); g_free (tstring); tstring = NULL; g_node_traverse (root, G_POST_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring); TEST (tstring, strcmp (tstring, "CDEBHIJKGFA") == 0); g_free (tstring); tstring = NULL; g_node_traverse (root, G_IN_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring); TEST (tstring, strcmp (tstring, "CBDEAHGIJKF") == 0); g_free (tstring); tstring = NULL; g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring); TEST (tstring, strcmp (tstring, "ABFCDEGHIJK") == 0); g_free (tstring); tstring = NULL; g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_LEAFS, -1, node_build_string, &tstring); TEST (tstring, strcmp (tstring, "CDEHIJK") == 0); g_free (tstring); tstring = NULL; g_node_traverse (root, G_PRE_ORDER, G_TRAVERSE_NON_LEAFS, -1, node_build_string, &tstring); TEST (tstring, strcmp (tstring, "ABFG") == 0); g_free (tstring); tstring = NULL; g_node_reverse_children (node_B); g_node_reverse_children (node_G); g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring); TEST (tstring, strcmp (tstring, "ABFEDCGKJIH") == 0); g_free (tstring); tstring = NULL; g_node_append (node_D, g_node_new (C2P ('L'))); g_node_append (node_D, g_node_new (C2P ('M'))); g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring); TEST (tstring, strcmp (tstring, "ABFEDCGLMKJIH") == 0); g_free (tstring); tstring = NULL; g_node_destroy (root); /* allocation tests */ root = g_node_new (NULL); node = root; for (i = 0; i < 2048; i++) { g_node_append (node, g_node_new (NULL)); if ((i%5) == 4) node = node->children->next; } TEST (NULL, g_node_max_height (root) > 100); TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_ALL) == 1 + 2048); g_node_destroy (root); if (failed) exit(1); }