Searched refs:table (Results 1 - 25 of 1260) sorted by relevance

1234567891011>>

/macosx-10.10/postfix-255/postfix/src/util/
H A Dnvtable.h24 #define nvtable_locate(table, key) htable_locate((table), (key))
25 #define nvtable_walk(table, action, ptr) htable_walk((table), (action), (ptr))
26 #define nvtable_list(table) htable_list(table)
27 #define nvtable_find(table, key) htable_find((table), (key))
28 #define nvtable_delete(table, key) htable_delete((table), (ke
[all...]
H A Dhtable.c5 /* hash table manager
20 /* HTABLE_INFO *htable_enter(table, key, value)
21 /* HTABLE *table;
25 /* char *htable_find(table, key)
26 /* HTABLE *table;
29 /* HTABLE_INFO *htable_locate(table, key)
30 /* HTABLE *table;
33 /* void htable_delete(table, key, free_fn)
34 /* HTABLE *table;
38 /* void htable_free(table, free_f
163 htable_size(HTABLE *table, unsigned size) argument
181 HTABLE *table; local
191 htable_grow(HTABLE *table) argument
212 htable_enter(HTABLE *table, const char *key, char *value) argument
227 htable_find(HTABLE *table, const char *key) argument
242 htable_locate(HTABLE *table, const char *key) argument
257 htable_delete(HTABLE *table, const char *key, void (*free_fn) (char *)) argument
287 htable_free(HTABLE *table, void (*free_fn) (char *)) argument
315 htable_walk(HTABLE *table, void (*action) (HTABLE_INFO *, char *), char *ptr) argument
330 htable_list(HTABLE *table) argument
351 htable_sequence(HTABLE *table, int how) argument
[all...]
H A Dbinhash.c5 /* hash table manager
21 /* BINHASH_INFO *binhash_enter(table, key, key_len, value)
22 /* BINHASH *table;
27 /* char *binhash_find(table, key, key_len)
28 /* BINHASH *table;
32 /* BINHASH_INFO *binhash_locate(table, key, key_len)
33 /* BINHASH *table;
37 /* void binhash_delete(table, key, key_len, free_fn)
38 /* BINHASH *table;
43 /* void binhash_free(table, free_f
159 binhash_size(BINHASH *table, unsigned size) argument
177 BINHASH *table; local
186 binhash_grow(BINHASH *table) argument
207 binhash_enter(BINHASH *table, const char *key, int key_len, char *value) argument
223 binhash_find(BINHASH *table, const char *key, int key_len) argument
238 binhash_locate(BINHASH *table, const char *key, int key_len) argument
253 binhash_delete(BINHASH *table, const char *key, int key_len, void (*free_fn) (char *)) argument
283 binhash_free(BINHASH *table, void (*free_fn) (char *)) argument
308 binhash_walk(BINHASH *table, void (*action) (BINHASH_INFO *, char *), char *ptr) argument
[all...]
/macosx-10.10/CPANInternal-159.1/Class-DBI-v3.0.17/t/testlib/
H A DMyBase.pm11 my @table;
13 END { $dbh->do("DROP TABLE $_") foreach @table }
19 $class->table($class->create_test_table);
24 my $table = $self->next_available_table;
25 my $create = sprintf "CREATE TABLE $table ( %s )", $self->create_sql;
26 push @table, $table;
28 return $table;
40 my $table = $tables[-1] || "aaa";
41 return "z$table";
[all...]
/macosx-10.10/tcl-105/tcl_ext/tktable/tktable/demos/
H A Dmaxsize.tcl7 ## This demo uses a really big table. The big startup time is in
8 ## filling the table's Tcl array var.
14 array set table {
17 table .t
35 fill $table(array) $table(rows) $table(cols)
36 table $table(table) \
[all...]
H A Dbasic.tcl7 ## This demo shows the basic use of the table widget
13 array set table {
16 table .t
33 fill $table(array) $table(rows) $table(cols)
34 table $table(table) -rows $table(row
[all...]
H A Ddebug.tcl7 ## This demo uses most features of the table widget
13 array set table {
16 table .t
32 fill $table(array) $table(rows) $table(cols)
33 table $table(table) \
34 -rows $table(row
[all...]
H A Dcommand.tcl7 ## This demo shows the use of the table widget's -command options
13 array set table {
16 table .table
51 bind .active <Return> "$table(table) curvalue \[%W get\]"
53 fill $table(array) $table(rows) $table(cols)
54 set t $table(tabl
[all...]
/macosx-10.10/tcl-105/tcl_ext/tclxml/tclxml/expat/xmlparse/
H A Dhashtable.c61 NAMED *lookup(HASH_TABLE *table, KEY name, size_t createSize) argument
64 if (table->size == 0) {
67 table->v = calloc(INIT_SIZE, sizeof(NAMED *));
68 if (!table->v)
70 table->size = INIT_SIZE;
71 table->usedLim = INIT_SIZE / 2;
72 i = hash(name) & (table->size - 1);
76 for (i = h & (table->size - 1);
77 table->v[i];
78 i == 0 ? i = table
117 hashTableDestroy(HASH_TABLE *table) argument
136 hashTableIterInit(HASH_TABLE_ITER *iter, const HASH_TABLE *table) argument
[all...]
/macosx-10.10/tcl-105/tcl_ext/xotcl/xotcl/library/xml/TclExpat-1.1/
H A Dhashtable.c44 NAMED *lookup(HASH_TABLE *table, KEY name, size_t createSize) argument
47 if (table->size == 0) {
50 table->v = calloc(INIT_SIZE, sizeof(NAMED *));
51 if (!table->v)
53 table->size = INIT_SIZE;
54 table->usedLim = INIT_SIZE / 2;
55 i = hash(name) & (table->size - 1);
59 for (i = h & (table->size - 1);
60 table->v[i];
61 i == 0 ? i = table
100 hashTableDestroy(HASH_TABLE *table) argument
119 hashTableIterInit(HASH_TABLE_ITER *iter, const HASH_TABLE *table) argument
[all...]
/macosx-10.10/postfix-255/postfix/src/global/
H A Dmail_conf_raw.c21 /* void get_mail_conf_raw_table(table)
22 /* const CONFIG_RAW_TABLE *table;
24 /* void get_mail_conf_raw_fn_table(table)
25 /* const CONFIG_RAW_TABLE *table;
42 /* lists of variables, as directed by their table arguments. A table
121 /* get_mail_conf_raw_table - look up table of strings */
123 void get_mail_conf_raw_table(const CONFIG_RAW_TABLE *table) argument
125 while (table->name) {
126 if (table
136 get_mail_conf_raw_fn_table(const CONFIG_RAW_FN_TABLE *table) argument
[all...]
H A Dmail_conf_str.c25 /* void get_mail_conf_str_table(table)
26 /* const CONFIG_STR_TABLE *table;
28 /* void get_mail_conf_str_fn_table(table)
29 /* const CONFIG_STR_TABLE *table;
57 /* lists of variables, as directed by their table arguments. A table
166 /* get_mail_conf_str_table - look up table of strings */
168 void get_mail_conf_str_table(const CONFIG_STR_TABLE *table) argument
170 while (table->name) {
171 if (table
181 get_mail_conf_str_fn_table(const CONFIG_STR_FN_TABLE *table) argument
[all...]
/macosx-10.10/emacs-93/emacs/oldXMenu/
H A DXDestAssoc.c13 XDestroyAssocTable(table)
14 register XAssocTable *table;
21 for (i = 0; i < table->size; i++) {
22 bucket = &table->buckets[i];
34 free((char *)table->buckets);
36 /* Free the table. */
37 free((char *)table);
/macosx-10.10/ICU-531.30/icuSources/layout/
H A DNonContextualGlyphSubst.h23 LookupTable table; member in struct:NonContextualGlyphSubstitutionHeader
28 LookupTable table; member in struct:NonContextualGlyphSubstitutionHeader2
/macosx-10.10/ruby-106/ruby/test/csv/
H A Dtest_table.rb20 @table = CSV::Table.new(@rows)
28 assert_not_nil(@table)
29 assert_instance_of(CSV::Table, @table)
33 assert_equal(:col_or_row, @table.mode)
36 cols = @table.by_col
37 assert_equal(:col_or_row, @table.mode)
39 assert_equal(@table, cols)
41 rows = @table.by_row
42 assert_equal(:col_or_row, @table.mode)
44 assert_equal(@table, row
[all...]
/macosx-10.10/cxxfilt-11/cxxfilt/bfd/
H A Dhash.c1 /* hash.c -- hash table routines for BFD
33 BFD provides a simple set of hash table functions. Routines
34 are provided to initialize a hash table, to free a hash table,
35 to look up a string in a hash table and optionally create an
36 entry for it, and to traverse a hash table. There is
37 currently no routine to delete an string from a hash table.
39 The basic hash table does not permit any data to be stored
40 with a string. However, a hash table is designed to present a
44 rather than simply providing a data pointer in a hash table
359 bfd_hash_table_init_n(struct bfd_hash_table *table, struct bfd_hash_entry *(*newfunc) (struct bfd_hash_entry *, struct bfd_hash_table *, const char *), unsigned int entsize, unsigned int size) argument
394 bfd_hash_table_init(struct bfd_hash_table *table, struct bfd_hash_entry *(*newfunc) (struct bfd_hash_entry *, struct bfd_hash_table *, const char *), unsigned int entsize) argument
407 bfd_hash_table_free(struct bfd_hash_table *table) argument
416 bfd_hash_lookup(struct bfd_hash_table *table, const char *string, bfd_boolean create, bfd_boolean copy) argument
519 bfd_hash_replace(struct bfd_hash_table *table, struct bfd_hash_entry *old, struct bfd_hash_entry *nw) argument
544 bfd_hash_allocate(struct bfd_hash_table *table, unsigned int size) argument
558 bfd_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string ATTRIBUTE_UNUSED) argument
570 bfd_hash_traverse(struct bfd_hash_table *table, bfd_boolean (*func) (struct bfd_hash_entry *, void *), void * info) argument
634 struct bfd_hash_table table; member in struct:bfd_strtab_hash
649 strtab_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument
687 struct bfd_strtab_hash *table; local
727 _bfd_stringtab_free(struct bfd_strtab_hash *table) argument
[all...]
/macosx-10.10/gnutar-453/gnutar/lib/
H A Dhash.c1 /* hash - hashing table processing.
22 /* A generic hash table package. */
54 are not empty, there are N_ENTRIES active entries in the table. */
84 /* A hash table contains many internal entries, each holding a pointer to
89 and the current table size. At each slot position in the hash table,
95 entries divided by the table size. Finding the slot for a data is usually
98 larger hash table size (that is, a larger number of buckets) is prone to
101 Long buckets slow down the lookup algorithm. One might use big hash table
103 become inordinate, as unused slots in the hash table tak
148 hash_get_n_buckets(const Hash_table *table) argument
156 hash_get_n_buckets_used(const Hash_table *table) argument
164 hash_get_n_entries(const Hash_table *table) argument
172 hash_get_max_bucket_length(const Hash_table *table) argument
199 hash_table_ok(const Hash_table *table) argument
228 hash_print_statistics(const Hash_table *table, FILE *stream) argument
248 hash_lookup(const Hash_table *table, const void *entry) argument
277 hash_get_first(const Hash_table *table) argument
296 hash_get_next(const Hash_table *table, const void *entry) argument
324 hash_get_entries(const Hash_table *table, void **buffer, size_t buffer_size) argument
356 hash_do_for_each(const Hash_table *table, Hash_processor processor, void *processor_data) argument
482 check_tuning(Hash_table *table) argument
542 Hash_table *table; local
603 hash_clear(Hash_table *table) argument
646 hash_free(Hash_table *table) argument
703 allocate_entry(Hash_table *table) argument
728 free_entry(Hash_table *table, struct hash_entry *entry) argument
742 hash_find_entry(Hash_table *table, const void *entry, struct hash_entry **bucket_head, bool delete) argument
817 hash_rehash(Hash_table *table, size_t candidate) argument
906 hash_insert(Hash_table *table, const void *entry) argument
981 hash_delete(Hash_table *table, const void *entry) argument
1027 hash_print(const Hash_table *table) argument
[all...]
/macosx-10.10/WebCore-7600.1.25/accessibility/atk/
H A DWebKitAccessibleInterfaceTable.cpp50 static AccessibilityObject* core(AtkTable* table) argument
52 if (!WEBKIT_IS_ACCESSIBLE(table))
55 return webkitAccessibleGetAccessibilityObject(WEBKIT_ACCESSIBLE(table));
58 static AccessibilityTableCell* cell(AtkTable* table, guint row, guint column) argument
60 AccessibilityObject* accTable = core(table);
68 // Calculate the cell's index as if we had a traditional Gtk+ table in
69 // which cells are all direct children of the table, arranged row-first.
79 static AccessibilityTableCell* cellAtIndex(AtkTable* table, gint index) argument
81 AccessibilityObject* accTable = core(table);
93 static AtkObject* webkitAccessibleTableRefAt(AtkTable* table, gin argument
111 webkitAccessibleTableGetIndexAt(AtkTable* table, gint row, gint column) argument
121 webkitAccessibleTableGetColumnAtIndex(AtkTable* table, gint index) argument
135 webkitAccessibleTableGetRowAtIndex(AtkTable* table, gint index) argument
149 webkitAccessibleTableGetNColumns(AtkTable* table) argument
160 webkitAccessibleTableGetNRows(AtkTable* table) argument
171 webkitAccessibleTableGetColumnExtentAt(AtkTable* table, gint row, gint column) argument
185 webkitAccessibleTableGetRowExtentAt(AtkTable* table, gint row, gint column) argument
199 webkitAccessibleTableGetColumnHeader(AtkTable* table, gint column) argument
219 webkitAccessibleTableGetRowHeader(AtkTable* table, gint row) argument
239 webkitAccessibleTableGetCaption(AtkTable* table) argument
256 webkitAccessibleTableGetColumnDescription(AtkTable* table, gint column) argument
268 webkitAccessibleTableGetRowDescription(AtkTable* table, gint row) argument
[all...]
/macosx-10.10/ruby-106/ruby/ext/tk/sample/tkextlib/tktable/
H A Ddebug.rb5 ## This demo uses most features of the table widget
12 # create the table
17 # fill table variable
26 table = Tk::TkTable.new(:rows=>rows, :cols=>cols, :variable=>ary,
38 sx = table.xscrollbar(TkScrollbar.new)
39 sy = table.yscrollbar(TkScrollbar.new)
44 Tk.grid(table, sy, :sticky=>:news)
51 table.tag_configure('OddCol', :bg=>'brown', :fg=>'pink')
52 table.tag_configure('title', :bg=>'red', :fg=>'green', :relief=>:sunken)
53 table
[all...]
/macosx-10.10/ICU-531.30/icuSources/samples/layout/
H A DFontTableCache.cpp18 const void *table; member in struct:FontTableCacheEntry
33 fTableCache[i].table = NULL;
40 freeFontTable(fTableCache[i].table);
43 fTableCache[i].table = NULL;
52 void FontTableCache::freeFontTable(const void *table) const
54 LE_DELETE_ARRAY(table);
61 return fTableCache[i].table;
65 const void *table = readFontTable(tableTag); local
67 ((FontTableCache *) this)->add(tableTag, table);
69 return table;
72 add(LETag tableTag, const void *table) argument
[all...]
/macosx-10.10/bash-94.1.2/bash-3.2/
H A Dhashlib.c43 /* Make a new hash table with BUCKETS number of buckets. Initialize
44 each slot in the table to NULL. */
68 hash_size (table)
69 HASH_TABLE *table;
71 return (HASH_ENTRIES(table));
109 hash_copy (table, cpdata)
110 HASH_TABLE *table;
116 if (table == 0)
119 new_table = hash_create (table->nbuckets);
121 for (i = 0; i < table
382 HASH_TABLE *table, *ntable; variable
[all...]
/macosx-10.10/Heimdal-398.1.2/lib/roken/
H A Drtbl.c69 rtbl_set_flags (rtbl_t table, unsigned int flags) argument
71 table->flags = flags;
75 rtbl_get_flags (rtbl_t table) argument
77 return table->flags;
81 rtbl_get_column_by_id (rtbl_t table, unsigned int id) argument
84 for(i = 0; i < table->num_columns; i++)
85 if(table->columns[i]->column_id == id)
86 return table->columns[i];
91 rtbl_get_column (rtbl_t table, const char *column) argument
94 for(i = 0; i < table
101 rtbl_destroy(rtbl_t table) argument
123 rtbl_add_column_by_id(rtbl_t table, unsigned int id, const char *header, unsigned int flags) argument
152 rtbl_add_column(rtbl_t table, const char *header, unsigned int flags) argument
158 rtbl_new_row(rtbl_t table) argument
184 column_compute_width(rtbl_t table, struct column_data *column) argument
198 rtbl_set_prefix(rtbl_t table, const char *prefix) argument
209 rtbl_set_separator(rtbl_t table, const char *separator) argument
220 rtbl_set_column_prefix(rtbl_t table, const char *column, const char *prefix) argument
236 rtbl_set_column_affix_by_id(rtbl_t table, unsigned int id, const char *prefix, const char *suffix) argument
267 get_column_prefix(rtbl_t table, struct column_data *c) argument
279 get_column_suffix(rtbl_t table, struct column_data *c) argument
305 rtbl_add_column_entry_by_id(rtbl_t table, unsigned int id, const char *data) argument
316 rtbl_add_column_entryv_by_id(rtbl_t table, unsigned int id, const char *fmt, ...) argument
334 rtbl_add_column_entry(rtbl_t table, const char *column, const char *data) argument
345 rtbl_add_column_entryv(rtbl_t table, const char *column, const char *fmt, ...) argument
363 rtbl_format(rtbl_t table, FILE * f) argument
374 rtbl_format_pretty(rtbl_t table) argument
445 rtbl_format_json(rtbl_t table) argument
491 rtbl_format_str(rtbl_t table) argument
503 rtbl_t table; local
[all...]
/macosx-10.10/libxml2-26/libxml2/
H A Dhash.c51 * A single entry in the hash table
65 * The entire hash table
68 struct _xmlHashEntry *table; member in struct:_xmlHashTable
82 xmlHashComputeKey(xmlHashTablePtr table, const xmlChar *name, argument
88 value = table->random_seed;
108 return (value % table->size);
112 xmlHashComputeQKey(xmlHashTablePtr table, argument
120 value = table->random_seed;
162 return (value % table->size);
167 * @size: the size of the hash table
175 xmlHashTablePtr table; local
209 xmlHashTablePtr table; local
229 xmlHashGrow(xmlHashTablePtr table, int size) argument
320 xmlHashFree(xmlHashTablePtr table, xmlHashDeallocator f) argument
375 xmlHashAddEntry(xmlHashTablePtr table, const xmlChar *name, void *userdata) argument
392 xmlHashAddEntry2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, void *userdata) argument
411 xmlHashUpdateEntry(xmlHashTablePtr table, const xmlChar *name, void *userdata, xmlHashDeallocator f) argument
431 xmlHashUpdateEntry2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, void *userdata, xmlHashDeallocator f) argument
447 xmlHashLookup(xmlHashTablePtr table, const xmlChar *name) argument
462 xmlHashLookup2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2) argument
478 xmlHashQLookup(xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name) argument
496 xmlHashQLookup2(xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name, const xmlChar *prefix2, const xmlChar *name2) argument
517 xmlHashAddEntry3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, void *userdata) argument
633 xmlHashUpdateEntry3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, void *userdata, xmlHashDeallocator f) argument
755 xmlHashLookup3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3) argument
799 xmlHashQLookup3(xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name, const xmlChar *prefix2, const xmlChar *name2, const xmlChar *prefix3, const xmlChar *name3) argument
845 xmlHashScan(xmlHashTablePtr table, xmlHashScanner f, void *data) argument
861 xmlHashScanFull(xmlHashTablePtr table, xmlHashScannerFull f, void *data) argument
912 xmlHashScan3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashScanner f, void *data) argument
933 xmlHashScanFull3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashScannerFull f, void *data) argument
975 xmlHashCopy(xmlHashTablePtr table, xmlHashCopier f) argument
1014 xmlHashSize(xmlHashTablePtr table) argument
1032 xmlHashRemoveEntry(xmlHashTablePtr table, const xmlChar *name, xmlHashDeallocator f) argument
1051 xmlHashRemoveEntry2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, xmlHashDeallocator f) argument
1071 xmlHashRemoveEntry3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashDeallocator f) argument
[all...]
/macosx-10.10/ruby-106/ruby/lib/
H A Dostruct.rb88 @table = {}
92 @table[k] = v
101 @table = @table.dup
102 @table.each_key{|key| new_ostruct_member(key)}
115 @table.dup
129 @table.each_pair{|p| yield p}
136 @table
143 @table = x
144 @table
[all...]
/macosx-10.10/pyobjc-45/2.6/pyobjc/pyobjc-core/libxml2-src/
H A Dhash.c35 * A single entry in the hash table
49 * The entire hash table
52 struct _xmlHashEntry *table; member in struct:_xmlHashTable
63 xmlHashComputeKey(xmlHashTablePtr table, const xmlChar *name, argument
84 return (value % table->size);
88 xmlHashComputeQKey(xmlHashTablePtr table, argument
133 return (value % table->size);
138 * @size: the size of the hash table
146 xmlHashTablePtr table; local
151 table
177 xmlHashTablePtr table; local
197 xmlHashGrow(xmlHashTablePtr table, int size) argument
288 xmlHashFree(xmlHashTablePtr table, xmlHashDeallocator f) argument
343 xmlHashAddEntry(xmlHashTablePtr table, const xmlChar *name, void *userdata) argument
360 xmlHashAddEntry2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, void *userdata) argument
379 xmlHashUpdateEntry(xmlHashTablePtr table, const xmlChar *name, void *userdata, xmlHashDeallocator f) argument
399 xmlHashUpdateEntry2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, void *userdata, xmlHashDeallocator f) argument
415 xmlHashLookup(xmlHashTablePtr table, const xmlChar *name) argument
430 xmlHashLookup2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2) argument
446 xmlHashQLookup(xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name) argument
464 xmlHashQLookup2(xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name, const xmlChar *prefix2, const xmlChar *name2) argument
485 xmlHashAddEntry3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, void *userdata) argument
601 xmlHashUpdateEntry3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, void *userdata, xmlHashDeallocator f) argument
723 xmlHashLookup3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3) argument
767 xmlHashQLookup3(xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name, const xmlChar *prefix2, const xmlChar *name2, const xmlChar *prefix3, const xmlChar *name3) argument
813 xmlHashScan(xmlHashTablePtr table, xmlHashScanner f, void *data) argument
829 xmlHashScanFull(xmlHashTablePtr table, xmlHashScannerFull f, void *data) argument
880 xmlHashScan3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashScanner f, void *data) argument
901 xmlHashScanFull3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashScannerFull f, void *data) argument
943 xmlHashCopy(xmlHashTablePtr table, xmlHashCopier f) argument
982 xmlHashSize(xmlHashTablePtr table) argument
1000 xmlHashRemoveEntry(xmlHashTablePtr table, const xmlChar *name, xmlHashDeallocator f) argument
1019 xmlHashRemoveEntry2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, xmlHashDeallocator f) argument
1039 xmlHashRemoveEntry3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashDeallocator f) argument
[all...]

Completed in 196 milliseconds

1234567891011>>