1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
|
/*
Copyright (C) 2016 Alexander Borisov
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Author: lex.borisov@gmail.com (Alexander Borisov)
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <myhtml/api.h>
#include "example.h"
mystatus_t serialization_callback(const char* data, size_t len, void* ctx)
{
printf("%.*s", (int)len, data);
return MyCORE_STATUS_OK;
}
int main(int argc, const char * argv[])
{
// basic init
myhtml_t* myhtml = myhtml_create();
myhtml_init(myhtml, MyHTML_OPTIONS_DEFAULT, 1, 0);
printf("Init tree\n");
// init tree
myhtml_tree_t* tree = myhtml_tree_create();
myhtml_tree_init(tree, myhtml);
myhtml_encoding_set(tree, MyENCODING_UTF_8);
// create nodes
printf("Create DIV element\n");
myhtml_tree_node_t* base_node = myhtml_node_create(tree, MyHTML_TAG_DIV, MyHTML_NAMESPACE_HTML);
myhtml_node_insert_to_appropriate_place(myhtml_tree_get_document(tree), base_node);
printf("Create and append to DIV element 100 000 P elements\n");
char tmp_buf_key[128];
char tmp_buf_value[128];
char tmp_buf_text[128];
for (size_t i = 1; i < 100001; i++) {
myhtml_tree_node_t* new_p_node = myhtml_node_create(tree, MyHTML_TAG_P, MyHTML_NAMESPACE_HTML);
myhtml_node_append_child(base_node, new_p_node);
myhtml_tree_node_t* new_text_node = myhtml_node_create(tree, MyHTML_TAG__TEXT, MyHTML_NAMESPACE_HTML);
myhtml_node_append_child(new_p_node, new_text_node);
sprintf(tmp_buf_key, "best_key_for_" MyCORE_FMT_Z, i);
sprintf(tmp_buf_value, "for best value " MyCORE_FMT_Z, i);
sprintf(tmp_buf_text, "Text! Entity &#" MyCORE_FMT_Z " = &#" MyCORE_FMT_Z, i, i);
myhtml_node_text_set_with_charef(new_text_node, tmp_buf_text, strlen(tmp_buf_text), MyENCODING_UTF_8);
myhtml_attribute_add(new_p_node, tmp_buf_key, strlen(tmp_buf_key),
tmp_buf_value, strlen(tmp_buf_value), MyENCODING_UTF_8);
}
// print
printf("Print result:\n");
myhtml_serialization_tree_callback(myhtml_tree_get_document(tree), serialization_callback, NULL);
// release resources
myhtml_tree_destroy(tree);
myhtml_destroy(myhtml);
return 0;
}
|
