Gitiles
Code Review Sign In
gerrit-public.fairphone.software / platform / external / libxml2 / af43f63aaabf0dc4b4a070773875d0927da3d8a2 / . / doc / html / libxml-hash.html
blob: 03b9b68612c17dee482a9a2770da232eea54ea55 [file] [log] [blame]
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1<HTML
2><HEAD
3><TITLE
4>hash</TITLE
5><META
6NAME="GENERATOR"
7CONTENT="Modular DocBook HTML Stylesheet Version 1.64
8"><LINK
9REL="HOME"
10TITLE="Gnome XML Library Reference Manual"
11HREF="book1.html"><LINK
12REL="UP"
13TITLE="Libxml Library Reference"
14HREF="libxml-lib.html"><LINK
15REL="PREVIOUS"
16TITLE="encoding"
17HREF="libxml-encoding.html"><LINK
18REL="NEXT"
19TITLE="debugXML"
20HREF="libxml-debugxml.html"></HEAD
21><BODY
22CLASS="REFENTRY"
23BGCOLOR="#FFFFFF"
24TEXT="#000000"
25LINK="#0000FF"
26VLINK="#840084"
27ALINK="#0000FF"
28><DIV
29CLASS="NAVHEADER"
30><TABLE
31WIDTH="100%"
32BORDER="0"
33BGCOLOR="#000000"
34CELLPADDING="1"
35CELLSPACING="0"
36><TR
37><TH
38COLSPAN="4"
39ALIGN="center"
40><FONT
41COLOR="#FFFFFF"
42SIZE="5"
43>Gnome XML Library Reference Manual</FONT
44></TH
45></TR
46><TR
47><TD
48WIDTH="25%"
49BGCOLOR="#C00000"
50ALIGN="left"
51><A
52HREF="libxml-encoding.html"
53><FONT
54COLOR="#FFFFFF"
55SIZE="3"
56><B
57>&#60;&#60;&#60; Previous Page</B
58></FONT
59></A
60></TD
61><TD
62WIDTH="25%"
63BGCOLOR="#0000C0"
64ALIGN="center"
65><FONT
66COLOR="#FFFFFF"
67SIZE="3"
68><B
69><A
70HREF="book1.html"
71><FONT
72COLOR="#FFFFFF"
73SIZE="3"
74><B
75>Home</B
76></FONT
77></A
78></B
79></FONT
80></TD
81><TD
82WIDTH="25%"
83BGCOLOR="#00C000"
84ALIGN="center"
85><FONT
86COLOR="#FFFFFF"
87SIZE="3"
88><B
89><A
90HREF="libxml-lib.html"
91><FONT
92COLOR="#FFFFFF"
93SIZE="3"
94><B
95>Up</B
96></FONT
97></A
98></B
99></FONT
100></TD
101><TD
102WIDTH="25%"
103BGCOLOR="#C00000"
104ALIGN="right"
105><A
106HREF="libxml-debugxml.html"
107><FONT
108COLOR="#FFFFFF"
109SIZE="3"
110><B
111>Next Page &#62;&#62;&#62;</B
112></FONT
113></A
114></TD
115></TR
116></TABLE
117></DIV
118><H1
119><A
120NAME="LIBXML-HASH"
121>hash</A
122></H1
123><DIV
124CLASS="REFNAMEDIV"
125><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]126NAME="AEN24577"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]127></A
128><H2
129>Name</H2
130>hash&nbsp;--&nbsp;</DIV
131><DIV
132CLASS="REFSYNOPSISDIV"
133><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]134NAME="AEN24580"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]135></A
136><H2
137>Synopsis</H2
138><TABLE
139BORDER="0"
140BGCOLOR="#D6E8FF"
141WIDTH="100%"
142CELLPADDING="6"
143><TR
144><TD
145><PRE
146CLASS="SYNOPSIS"
147>&#13;
148
149struct <A
150HREF="libxml-hash.html#XMLHASHTABLE"
151>xmlHashTable</A
152>;
153typedef <A
154HREF="libxml-hash.html#XMLHASHTABLEPTR"
155>xmlHashTablePtr</A
156>;
157void (<A
158HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
159>*xmlHashDeallocator</A
160>) (void *payload,
161 <A
162HREF="libxml-tree.html#XMLCHAR"
163>xmlChar</A
164> *name);
165void* (<A
166HREF="libxml-hash.html#XMLHASHCOPIER"
167>*xmlHashCopier</A
168>) (void *payload,
169 <A
170HREF="libxml-tree.html#XMLCHAR"
171>xmlChar</A
172> *name);
Daniel Veillard5f4b5992002-02-20 10:22:49 +0000[diff] [blame]173void (<A
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]174HREF="libxml-hash.html#XMLHASHSCANNER"
175>*xmlHashScanner</A
176>) (void *payload,
177 void *data,
178 <A
179HREF="libxml-tree.html#XMLCHAR"
180>xmlChar</A
181> *name);
182void (<A
183HREF="libxml-hash.html#XMLHASHSCANNERFULL"
184>*xmlHashScannerFull</A
185>) (void *payload,
186 void *data,
187 const <A
188HREF="libxml-tree.html#XMLCHAR"
189>xmlChar</A
190> *name,
191 const <A
192HREF="libxml-tree.html#XMLCHAR"
193>xmlChar</A
194> *name2,
195 const <A
196HREF="libxml-tree.html#XMLCHAR"
197>xmlChar</A
198> *name3);
199<A
200HREF="libxml-hash.html#XMLHASHTABLEPTR"
201>xmlHashTablePtr</A
202> <A
203HREF="libxml-hash.html#XMLHASHCREATE"
204>xmlHashCreate</A
205> (int size);
206void <A
207HREF="libxml-hash.html#XMLHASHFREE"
208>xmlHashFree</A
209> (<A
210HREF="libxml-hash.html#XMLHASHTABLEPTR"
211>xmlHashTablePtr</A
212> table,
213 <A
214HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
215>xmlHashDeallocator</A
216> f);
217int <A
218HREF="libxml-hash.html#XMLHASHADDENTRY"
219>xmlHashAddEntry</A
220> (<A
221HREF="libxml-hash.html#XMLHASHTABLEPTR"
222>xmlHashTablePtr</A
223> table,
224 const <A
225HREF="libxml-tree.html#XMLCHAR"
226>xmlChar</A
227> *name,
228 void *userdata);
229int <A
230HREF="libxml-hash.html#XMLHASHUPDATEENTRY"
231>xmlHashUpdateEntry</A
232> (<A
233HREF="libxml-hash.html#XMLHASHTABLEPTR"
234>xmlHashTablePtr</A
235> table,
236 const <A
237HREF="libxml-tree.html#XMLCHAR"
238>xmlChar</A
239> *name,
240 void *userdata,
241 <A
242HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
243>xmlHashDeallocator</A
244> f);
245int <A
246HREF="libxml-hash.html#XMLHASHADDENTRY2"
247>xmlHashAddEntry2</A
248> (<A
249HREF="libxml-hash.html#XMLHASHTABLEPTR"
250>xmlHashTablePtr</A
251> table,
252 const <A
253HREF="libxml-tree.html#XMLCHAR"
254>xmlChar</A
255> *name,
256 const <A
257HREF="libxml-tree.html#XMLCHAR"
258>xmlChar</A
259> *name2,
260 void *userdata);
261int <A
262HREF="libxml-hash.html#XMLHASHUPDATEENTRY2"
263>xmlHashUpdateEntry2</A
264> (<A
265HREF="libxml-hash.html#XMLHASHTABLEPTR"
266>xmlHashTablePtr</A
267> table,
268 const <A
269HREF="libxml-tree.html#XMLCHAR"
270>xmlChar</A
271> *name,
272 const <A
273HREF="libxml-tree.html#XMLCHAR"
274>xmlChar</A
275> *name2,
276 void *userdata,
277 <A
278HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
279>xmlHashDeallocator</A
280> f);
281int <A
282HREF="libxml-hash.html#XMLHASHADDENTRY3"
283>xmlHashAddEntry3</A
284> (<A
285HREF="libxml-hash.html#XMLHASHTABLEPTR"
286>xmlHashTablePtr</A
287> table,
288 const <A
289HREF="libxml-tree.html#XMLCHAR"
290>xmlChar</A
291> *name,
292 const <A
293HREF="libxml-tree.html#XMLCHAR"
294>xmlChar</A
295> *name2,
296 const <A
297HREF="libxml-tree.html#XMLCHAR"
298>xmlChar</A
299> *name3,
300 void *userdata);
301int <A
302HREF="libxml-hash.html#XMLHASHUPDATEENTRY3"
303>xmlHashUpdateEntry3</A
304> (<A
305HREF="libxml-hash.html#XMLHASHTABLEPTR"
306>xmlHashTablePtr</A
307> table,
308 const <A
309HREF="libxml-tree.html#XMLCHAR"
310>xmlChar</A
311> *name,
312 const <A
313HREF="libxml-tree.html#XMLCHAR"
314>xmlChar</A
315> *name2,
316 const <A
317HREF="libxml-tree.html#XMLCHAR"
318>xmlChar</A
319> *name3,
320 void *userdata,
321 <A
322HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
323>xmlHashDeallocator</A
324> f);
325int <A
326HREF="libxml-hash.html#XMLHASHREMOVEENTRY"
327>xmlHashRemoveEntry</A
328> (<A
329HREF="libxml-hash.html#XMLHASHTABLEPTR"
330>xmlHashTablePtr</A
331> table,
332 const <A
333HREF="libxml-tree.html#XMLCHAR"
334>xmlChar</A
335> *name,
336 <A
337HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
338>xmlHashDeallocator</A
339> f);
340int <A
341HREF="libxml-hash.html#XMLHASHREMOVEENTRY2"
342>xmlHashRemoveEntry2</A
343> (<A
344HREF="libxml-hash.html#XMLHASHTABLEPTR"
345>xmlHashTablePtr</A
346> table,
347 const <A
348HREF="libxml-tree.html#XMLCHAR"
349>xmlChar</A
350> *name,
351 const <A
352HREF="libxml-tree.html#XMLCHAR"
353>xmlChar</A
354> *name2,
355 <A
356HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
357>xmlHashDeallocator</A
358> f);
359int <A
360HREF="libxml-hash.html#XMLHASHREMOVEENTRY3"
361>xmlHashRemoveEntry3</A
362> (<A
363HREF="libxml-hash.html#XMLHASHTABLEPTR"
364>xmlHashTablePtr</A
365> table,
366 const <A
367HREF="libxml-tree.html#XMLCHAR"
368>xmlChar</A
369> *name,
370 const <A
371HREF="libxml-tree.html#XMLCHAR"
372>xmlChar</A
373> *name2,
374 const <A
375HREF="libxml-tree.html#XMLCHAR"
376>xmlChar</A
377> *name3,
378 <A
379HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
380>xmlHashDeallocator</A
381> f);
382void* <A
383HREF="libxml-hash.html#XMLHASHLOOKUP"
384>xmlHashLookup</A
385> (<A
386HREF="libxml-hash.html#XMLHASHTABLEPTR"
387>xmlHashTablePtr</A
388> table,
389 const <A
390HREF="libxml-tree.html#XMLCHAR"
391>xmlChar</A
392> *name);
393void* <A
394HREF="libxml-hash.html#XMLHASHLOOKUP2"
395>xmlHashLookup2</A
396> (<A
397HREF="libxml-hash.html#XMLHASHTABLEPTR"
398>xmlHashTablePtr</A
399> table,
400 const <A
401HREF="libxml-tree.html#XMLCHAR"
402>xmlChar</A
403> *name,
404 const <A
405HREF="libxml-tree.html#XMLCHAR"
406>xmlChar</A
407> *name2);
408void* <A
409HREF="libxml-hash.html#XMLHASHLOOKUP3"
410>xmlHashLookup3</A
411> (<A
412HREF="libxml-hash.html#XMLHASHTABLEPTR"
413>xmlHashTablePtr</A
414> table,
415 const <A
416HREF="libxml-tree.html#XMLCHAR"
417>xmlChar</A
418> *name,
419 const <A
420HREF="libxml-tree.html#XMLCHAR"
421>xmlChar</A
422> *name2,
423 const <A
424HREF="libxml-tree.html#XMLCHAR"
425>xmlChar</A
426> *name3);
427<A
428HREF="libxml-hash.html#XMLHASHTABLEPTR"
429>xmlHashTablePtr</A
430> <A
431HREF="libxml-hash.html#XMLHASHCOPY"
432>xmlHashCopy</A
433> (<A
434HREF="libxml-hash.html#XMLHASHTABLEPTR"
435>xmlHashTablePtr</A
436> table,
437 <A
438HREF="libxml-hash.html#XMLHASHCOPIER"
439>xmlHashCopier</A
440> f);
441int <A
442HREF="libxml-hash.html#XMLHASHSIZE"
443>xmlHashSize</A
444> (<A
445HREF="libxml-hash.html#XMLHASHTABLEPTR"
446>xmlHashTablePtr</A
447> table);
448void <A
449HREF="libxml-hash.html#XMLHASHSCAN"
450>xmlHashScan</A
451> (<A
452HREF="libxml-hash.html#XMLHASHTABLEPTR"
453>xmlHashTablePtr</A
454> table,
455 <A
456HREF="libxml-hash.html#XMLHASHSCANNER"
457>xmlHashScanner</A
458> f,
459 void *data);
460void <A
461HREF="libxml-hash.html#XMLHASHSCAN3"
462>xmlHashScan3</A
463> (<A
464HREF="libxml-hash.html#XMLHASHTABLEPTR"
465>xmlHashTablePtr</A
466> table,
467 const <A
468HREF="libxml-tree.html#XMLCHAR"
469>xmlChar</A
470> *name,
471 const <A
472HREF="libxml-tree.html#XMLCHAR"
473>xmlChar</A
474> *name2,
475 const <A
476HREF="libxml-tree.html#XMLCHAR"
477>xmlChar</A
478> *name3,
479 <A
480HREF="libxml-hash.html#XMLHASHSCANNER"
481>xmlHashScanner</A
482> f,
483 void *data);
484void <A
485HREF="libxml-hash.html#XMLHASHSCANFULL"
486>xmlHashScanFull</A
487> (<A
488HREF="libxml-hash.html#XMLHASHTABLEPTR"
489>xmlHashTablePtr</A
490> table,
491 <A
492HREF="libxml-hash.html#XMLHASHSCANNERFULL"
493>xmlHashScannerFull</A
494> f,
495 void *data);
496void <A
497HREF="libxml-hash.html#XMLHASHSCANFULL3"
498>xmlHashScanFull3</A
499> (<A
500HREF="libxml-hash.html#XMLHASHTABLEPTR"
501>xmlHashTablePtr</A
502> table,
503 const <A
504HREF="libxml-tree.html#XMLCHAR"
505>xmlChar</A
506> *name,
507 const <A
508HREF="libxml-tree.html#XMLCHAR"
509>xmlChar</A
510> *name2,
511 const <A
512HREF="libxml-tree.html#XMLCHAR"
513>xmlChar</A
514> *name3,
515 <A
516HREF="libxml-hash.html#XMLHASHSCANNERFULL"
517>xmlHashScannerFull</A
518> f,
519 void *data);</PRE
520></TD
521></TR
522></TABLE
523></DIV
524><DIV
525CLASS="REFSECT1"
526><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]527NAME="AEN24678"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]528></A
529><H2
530>Description</H2
531><P
532></P
533></DIV
534><DIV
535CLASS="REFSECT1"
536><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]537NAME="AEN24681"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]538></A
539><H2
540>Details</H2
541><DIV
542CLASS="REFSECT2"
543><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]544NAME="AEN24683"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]545></A
546><H3
547><A
548NAME="XMLHASHTABLE"
549></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]550>struct xmlHashTable</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]551><TABLE
552BORDER="0"
553BGCOLOR="#D6E8FF"
554WIDTH="100%"
555CELLPADDING="6"
556><TR
557><TD
558><PRE
559CLASS="PROGRAMLISTING"
560>struct xmlHashTable;</PRE
561></TD
562></TR
563></TABLE
564><P
565></P
566></DIV
567><HR><DIV
568CLASS="REFSECT2"
569><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]570NAME="AEN24688"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]571></A
572><H3
573><A
574NAME="XMLHASHTABLEPTR"
575></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]576>xmlHashTablePtr</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]577><TABLE
578BORDER="0"
579BGCOLOR="#D6E8FF"
580WIDTH="100%"
581CELLPADDING="6"
582><TR
583><TD
584><PRE
585CLASS="PROGRAMLISTING"
586>typedef xmlHashTable *xmlHashTablePtr;</PRE
587></TD
588></TR
589></TABLE
590><P
591></P
592></DIV
593><HR><DIV
594CLASS="REFSECT2"
595><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]596NAME="AEN24693"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]597></A
598><H3
599><A
600NAME="XMLHASHDEALLOCATOR"
601></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]602>xmlHashDeallocator ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]603><TABLE
604BORDER="0"
605BGCOLOR="#D6E8FF"
606WIDTH="100%"
607CELLPADDING="6"
608><TR
609><TD
610><PRE
611CLASS="PROGRAMLISTING"
612>void (*xmlHashDeallocator) (void *payload,
613 <A
614HREF="libxml-tree.html#XMLCHAR"
615>xmlChar</A
616> *name);</PRE
617></TD
618></TR
619></TABLE
620><P
Daniel Veillard5f4b5992002-02-20 10:22:49 +0000[diff] [blame]621>Callback to free data from a hash</P
622><P
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]623></P
624><DIV
625CLASS="INFORMALTABLE"
626><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]627NAME="AEN24700"
Daniel Veillard744683d2002-01-14 17:30:20 +0000[diff] [blame]628></A
629><P
630></P
631><TABLE
632BORDER="0"
633WIDTH="100%"
634BGCOLOR="#FFD0D0"
635CELLSPACING="0"
636CELLPADDING="4"
637CLASS="CALSTABLE"
638><TBODY
639><TR
640><TD
641WIDTH="20%"
642ALIGN="RIGHT"
643VALIGN="TOP"
644><TT
645CLASS="PARAMETER"
646><I
647>payload</I
648></TT
649>&nbsp;:</TD
650><TD
651WIDTH="80%"
652ALIGN="LEFT"
653VALIGN="TOP"
Daniel Veillard5f4b5992002-02-20 10:22:49 +0000[diff] [blame]654> the data in the hash</TD
Daniel Veillard744683d2002-01-14 17:30:20 +0000[diff] [blame]655></TR
656><TR
657><TD
658WIDTH="20%"
659ALIGN="RIGHT"
660VALIGN="TOP"
661><TT
662CLASS="PARAMETER"
663><I
664>name</I
665></TT
666>&nbsp;:</TD
667><TD
668WIDTH="80%"
669ALIGN="LEFT"
670VALIGN="TOP"
Daniel Veillard5f4b5992002-02-20 10:22:49 +0000[diff] [blame]671> the name associated</TD
Daniel Veillard744683d2002-01-14 17:30:20 +0000[diff] [blame]672></TR
673></TBODY
674></TABLE
675><P
676></P
677></DIV
678></DIV
679><HR><DIV
680CLASS="REFSECT2"
681><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]682NAME="AEN24713"
Daniel Veillard744683d2002-01-14 17:30:20 +0000[diff] [blame]683></A
684><H3
685><A
Daniel Veillard06622df2002-01-21 17:53:42 +0000[diff] [blame]686NAME="XMLHASHCOPIER"
687></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]688>xmlHashCopier ()</H3
Daniel Veillard06622df2002-01-21 17:53:42 +0000[diff] [blame]689><TABLE
690BORDER="0"
691BGCOLOR="#D6E8FF"
692WIDTH="100%"
693CELLPADDING="6"
694><TR
695><TD
696><PRE
697CLASS="PROGRAMLISTING"
698>void* (*xmlHashCopier) (void *payload,
699 <A
700HREF="libxml-tree.html#XMLCHAR"
701>xmlChar</A
702> *name);</PRE
703></TD
704></TR
705></TABLE
706><P
Daniel Veillard5f4b5992002-02-20 10:22:49 +0000[diff] [blame]707>Callback to copy data from a hash</P
708><P
Daniel Veillard06622df2002-01-21 17:53:42 +0000[diff] [blame]709></P
710><DIV
711CLASS="INFORMALTABLE"
712><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]713NAME="AEN24720"
Daniel Veillard06622df2002-01-21 17:53:42 +0000[diff] [blame]714></A
715><P
716></P
717><TABLE
718BORDER="0"
719WIDTH="100%"
720BGCOLOR="#FFD0D0"
721CELLSPACING="0"
722CELLPADDING="4"
723CLASS="CALSTABLE"
724><TBODY
725><TR
726><TD
727WIDTH="20%"
728ALIGN="RIGHT"
729VALIGN="TOP"
730><TT
731CLASS="PARAMETER"
732><I
733>payload</I
734></TT
735>&nbsp;:</TD
736><TD
737WIDTH="80%"
738ALIGN="LEFT"
739VALIGN="TOP"
Daniel Veillard5f4b5992002-02-20 10:22:49 +0000[diff] [blame]740> the data in the hash</TD
Daniel Veillard06622df2002-01-21 17:53:42 +0000[diff] [blame]741></TR
742><TR
743><TD
744WIDTH="20%"
745ALIGN="RIGHT"
746VALIGN="TOP"
747><TT
748CLASS="PARAMETER"
749><I
750>name</I
751></TT
752>&nbsp;:</TD
753><TD
754WIDTH="80%"
755ALIGN="LEFT"
756VALIGN="TOP"
Daniel Veillard5f4b5992002-02-20 10:22:49 +0000[diff] [blame]757> the name associated</TD
Daniel Veillard06622df2002-01-21 17:53:42 +0000[diff] [blame]758></TR
759></TBODY
760></TABLE
761><P
762></P
763></DIV
764></DIV
765><HR><DIV
766CLASS="REFSECT2"
767><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]768NAME="AEN24733"
Daniel Veillard06622df2002-01-21 17:53:42 +0000[diff] [blame]769></A
770><H3
771><A
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]772NAME="XMLHASHSCANNER"
773></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]774>xmlHashScanner ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]775><TABLE
776BORDER="0"
777BGCOLOR="#D6E8FF"
778WIDTH="100%"
779CELLPADDING="6"
780><TR
781><TD
782><PRE
783CLASS="PROGRAMLISTING"
Daniel Veillard5f4b5992002-02-20 10:22:49 +0000[diff] [blame]784>void (*xmlHashScanner) (void *payload,
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]785 void *data,
786 <A
787HREF="libxml-tree.html#XMLCHAR"
788>xmlChar</A
789> *name);</PRE
790></TD
791></TR
792></TABLE
793><P
Daniel Veillard5f4b5992002-02-20 10:22:49 +0000[diff] [blame]794>Callback when scanning data in a hash with the simple scanner</P
795><P
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]796></P
797><DIV
798CLASS="INFORMALTABLE"
799><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]800NAME="AEN24740"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]801></A
802><P
803></P
804><TABLE
805BORDER="0"
806WIDTH="100%"
807BGCOLOR="#FFD0D0"
808CELLSPACING="0"
809CELLPADDING="4"
810CLASS="CALSTABLE"
811><TBODY
812><TR
813><TD
814WIDTH="20%"
815ALIGN="RIGHT"
816VALIGN="TOP"
817><TT
818CLASS="PARAMETER"
819><I
820>payload</I
821></TT
822>&nbsp;:</TD
823><TD
824WIDTH="80%"
825ALIGN="LEFT"
826VALIGN="TOP"
Daniel Veillard5f4b5992002-02-20 10:22:49 +0000[diff] [blame]827> the data in the hash</TD
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]828></TR
829><TR
830><TD
831WIDTH="20%"
832ALIGN="RIGHT"
833VALIGN="TOP"
834><TT
835CLASS="PARAMETER"
836><I
837>data</I
838></TT
839>&nbsp;:</TD
840><TD
841WIDTH="80%"
842ALIGN="LEFT"
843VALIGN="TOP"
Daniel Veillard5f4b5992002-02-20 10:22:49 +0000[diff] [blame]844> extra scannner data</TD
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]845></TR
846><TR
847><TD
848WIDTH="20%"
849ALIGN="RIGHT"
850VALIGN="TOP"
851><TT
852CLASS="PARAMETER"
853><I
854>name</I
855></TT
856>&nbsp;:</TD
857><TD
858WIDTH="80%"
859ALIGN="LEFT"
860VALIGN="TOP"
Daniel Veillard5f4b5992002-02-20 10:22:49 +0000[diff] [blame]861> the name associated</TD
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]862></TR
863></TBODY
864></TABLE
865><P
866></P
867></DIV
868></DIV
869><HR><DIV
870CLASS="REFSECT2"
871><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]872NAME="AEN24757"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]873></A
874><H3
875><A
876NAME="XMLHASHSCANNERFULL"
877></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]878>xmlHashScannerFull ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]879><TABLE
880BORDER="0"
881BGCOLOR="#D6E8FF"
882WIDTH="100%"
883CELLPADDING="6"
884><TR
885><TD
886><PRE
887CLASS="PROGRAMLISTING"
888>void (*xmlHashScannerFull) (void *payload,
889 void *data,
890 const <A
891HREF="libxml-tree.html#XMLCHAR"
892>xmlChar</A
893> *name,
894 const <A
895HREF="libxml-tree.html#XMLCHAR"
896>xmlChar</A
897> *name2,
898 const <A
899HREF="libxml-tree.html#XMLCHAR"
900>xmlChar</A
901> *name3);</PRE
902></TD
903></TR
904></TABLE
905><P
Daniel Veillard5f4b5992002-02-20 10:22:49 +0000[diff] [blame]906>Callback when scanning data in a hash with the full scanner</P
907><P
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]908></P
909><DIV
910CLASS="INFORMALTABLE"
911><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]912NAME="AEN24766"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]913></A
914><P
915></P
916><TABLE
917BORDER="0"
918WIDTH="100%"
919BGCOLOR="#FFD0D0"
920CELLSPACING="0"
921CELLPADDING="4"
922CLASS="CALSTABLE"
923><TBODY
924><TR
925><TD
926WIDTH="20%"
927ALIGN="RIGHT"
928VALIGN="TOP"
929><TT
930CLASS="PARAMETER"
931><I
932>payload</I
933></TT
934>&nbsp;:</TD
935><TD
936WIDTH="80%"
937ALIGN="LEFT"
938VALIGN="TOP"
Daniel Veillard5f4b5992002-02-20 10:22:49 +0000[diff] [blame]939> the data in the hash</TD
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]940></TR
941><TR
942><TD
943WIDTH="20%"
944ALIGN="RIGHT"
945VALIGN="TOP"
946><TT
947CLASS="PARAMETER"
948><I
949>data</I
950></TT
951>&nbsp;:</TD
952><TD
953WIDTH="80%"
954ALIGN="LEFT"
955VALIGN="TOP"
Daniel Veillard5f4b5992002-02-20 10:22:49 +0000[diff] [blame]956> extra scannner data</TD
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]957></TR
958><TR
959><TD
960WIDTH="20%"
961ALIGN="RIGHT"
962VALIGN="TOP"
963><TT
964CLASS="PARAMETER"
965><I
966>name</I
967></TT
968>&nbsp;:</TD
969><TD
970WIDTH="80%"
971ALIGN="LEFT"
972VALIGN="TOP"
Daniel Veillard5f4b5992002-02-20 10:22:49 +0000[diff] [blame]973> the name associated</TD
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]974></TR
975><TR
976><TD
977WIDTH="20%"
978ALIGN="RIGHT"
979VALIGN="TOP"
980><TT
981CLASS="PARAMETER"
982><I
983>name2</I
984></TT
985>&nbsp;:</TD
986><TD
987WIDTH="80%"
988ALIGN="LEFT"
989VALIGN="TOP"
Daniel Veillard5f4b5992002-02-20 10:22:49 +0000[diff] [blame]990> the second name associated</TD
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]991></TR
992><TR
993><TD
994WIDTH="20%"
995ALIGN="RIGHT"
996VALIGN="TOP"
997><TT
998CLASS="PARAMETER"
999><I
1000>name3</I
1001></TT
1002>&nbsp;:</TD
1003><TD
1004WIDTH="80%"
1005ALIGN="LEFT"
1006VALIGN="TOP"
Daniel Veillard5f4b5992002-02-20 10:22:49 +0000[diff] [blame]1007> the third name associated</TD
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1008></TR
1009></TBODY
1010></TABLE
1011><P
1012></P
1013></DIV
1014></DIV
1015><HR><DIV
1016CLASS="REFSECT2"
1017><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]1018NAME="AEN24791"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1019></A
1020><H3
1021><A
1022NAME="XMLHASHCREATE"
1023></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]1024>xmlHashCreate ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1025><TABLE
1026BORDER="0"
1027BGCOLOR="#D6E8FF"
1028WIDTH="100%"
1029CELLPADDING="6"
1030><TR
1031><TD
1032><PRE
1033CLASS="PROGRAMLISTING"
1034><A
1035HREF="libxml-hash.html#XMLHASHTABLEPTR"
1036>xmlHashTablePtr</A
1037> xmlHashCreate (int size);</PRE
1038></TD
1039></TR
1040></TABLE
1041><P
1042>Create a new xmlHashTablePtr.</P
1043><P
1044></P
1045><DIV
1046CLASS="INFORMALTABLE"
1047><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]1048NAME="AEN24798"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1049></A
1050><P
1051></P
1052><TABLE
1053BORDER="0"
1054WIDTH="100%"
1055BGCOLOR="#FFD0D0"
1056CELLSPACING="0"
1057CELLPADDING="4"
1058CLASS="CALSTABLE"
1059><TBODY
1060><TR
1061><TD
1062WIDTH="20%"
1063ALIGN="RIGHT"
1064VALIGN="TOP"
1065><TT
1066CLASS="PARAMETER"
1067><I
1068>size</I
1069></TT
1070>&nbsp;:</TD
1071><TD
1072WIDTH="80%"
1073ALIGN="LEFT"
1074VALIGN="TOP"
1075> the size of the hash table</TD
1076></TR
1077><TR
1078><TD
1079WIDTH="20%"
1080ALIGN="RIGHT"
1081VALIGN="TOP"
1082><I
1083CLASS="EMPHASIS"
1084>Returns</I
1085> :</TD
1086><TD
1087WIDTH="80%"
1088ALIGN="LEFT"
1089VALIGN="TOP"
1090>the newly created object, or NULL if an error occured.</TD
1091></TR
1092></TBODY
1093></TABLE
1094><P
1095></P
1096></DIV
1097></DIV
1098><HR><DIV
1099CLASS="REFSECT2"
1100><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]1101NAME="AEN24811"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1102></A
1103><H3
1104><A
1105NAME="XMLHASHFREE"
1106></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]1107>xmlHashFree ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1108><TABLE
1109BORDER="0"
1110BGCOLOR="#D6E8FF"
1111WIDTH="100%"
1112CELLPADDING="6"
1113><TR
1114><TD
1115><PRE
1116CLASS="PROGRAMLISTING"
1117>void xmlHashFree (<A
1118HREF="libxml-hash.html#XMLHASHTABLEPTR"
1119>xmlHashTablePtr</A
1120> table,
1121 <A
1122HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
1123>xmlHashDeallocator</A
1124> f);</PRE
1125></TD
1126></TR
1127></TABLE
1128><P
Daniel Veillardcbaf3992001-12-31 16:16:02 +0000[diff] [blame]1129>Free the hash <TT
1130CLASS="PARAMETER"
1131><I
1132>table</I
1133></TT
1134> and its contents. The userdata is
1135deallocated with <TT
1136CLASS="PARAMETER"
1137><I
1138>f</I
1139></TT
1140> if provided.</P
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1141><P
1142></P
1143><DIV
1144CLASS="INFORMALTABLE"
1145><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]1146NAME="AEN24821"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1147></A
1148><P
1149></P
1150><TABLE
1151BORDER="0"
1152WIDTH="100%"
1153BGCOLOR="#FFD0D0"
1154CELLSPACING="0"
1155CELLPADDING="4"
1156CLASS="CALSTABLE"
1157><TBODY
1158><TR
1159><TD
1160WIDTH="20%"
1161ALIGN="RIGHT"
1162VALIGN="TOP"
1163><TT
1164CLASS="PARAMETER"
1165><I
1166>table</I
1167></TT
1168>&nbsp;:</TD
1169><TD
1170WIDTH="80%"
1171ALIGN="LEFT"
1172VALIGN="TOP"
1173> the hash table</TD
1174></TR
1175><TR
1176><TD
1177WIDTH="20%"
1178ALIGN="RIGHT"
1179VALIGN="TOP"
1180><TT
1181CLASS="PARAMETER"
1182><I
1183>f</I
1184></TT
1185>&nbsp;:</TD
1186><TD
1187WIDTH="80%"
1188ALIGN="LEFT"
1189VALIGN="TOP"
1190> the deallocator function for items in the hash</TD
1191></TR
1192></TBODY
1193></TABLE
1194><P
1195></P
1196></DIV
1197></DIV
1198><HR><DIV
1199CLASS="REFSECT2"
1200><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]1201NAME="AEN24834"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1202></A
1203><H3
1204><A
1205NAME="XMLHASHADDENTRY"
1206></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]1207>xmlHashAddEntry ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1208><TABLE
1209BORDER="0"
1210BGCOLOR="#D6E8FF"
1211WIDTH="100%"
1212CELLPADDING="6"
1213><TR
1214><TD
1215><PRE
1216CLASS="PROGRAMLISTING"
1217>int xmlHashAddEntry (<A
1218HREF="libxml-hash.html#XMLHASHTABLEPTR"
1219>xmlHashTablePtr</A
1220> table,
1221 const <A
1222HREF="libxml-tree.html#XMLCHAR"
1223>xmlChar</A
1224> *name,
1225 void *userdata);</PRE
1226></TD
1227></TR
1228></TABLE
1229><P
Daniel Veillardcbaf3992001-12-31 16:16:02 +0000[diff] [blame]1230>Add the <TT
1231CLASS="PARAMETER"
1232><I
1233>userdata</I
1234></TT
1235> to the hash <TT
1236CLASS="PARAMETER"
1237><I
1238>table</I
1239></TT
1240>. This can later be retrieved
1241by using the <TT
1242CLASS="PARAMETER"
1243><I
1244>name</I
1245></TT
1246>. Duplicate names generate errors.</P
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1247><P
1248></P
1249><DIV
1250CLASS="INFORMALTABLE"
1251><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]1252NAME="AEN24845"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1253></A
1254><P
1255></P
1256><TABLE
1257BORDER="0"
1258WIDTH="100%"
1259BGCOLOR="#FFD0D0"
1260CELLSPACING="0"
1261CELLPADDING="4"
1262CLASS="CALSTABLE"
1263><TBODY
1264><TR
1265><TD
1266WIDTH="20%"
1267ALIGN="RIGHT"
1268VALIGN="TOP"
1269><TT
1270CLASS="PARAMETER"
1271><I
1272>table</I
1273></TT
1274>&nbsp;:</TD
1275><TD
1276WIDTH="80%"
1277ALIGN="LEFT"
1278VALIGN="TOP"
1279> the hash table</TD
1280></TR
1281><TR
1282><TD
1283WIDTH="20%"
1284ALIGN="RIGHT"
1285VALIGN="TOP"
1286><TT
1287CLASS="PARAMETER"
1288><I
1289>name</I
1290></TT
1291>&nbsp;:</TD
1292><TD
1293WIDTH="80%"
1294ALIGN="LEFT"
1295VALIGN="TOP"
1296> the name of the userdata</TD
1297></TR
1298><TR
1299><TD
1300WIDTH="20%"
1301ALIGN="RIGHT"
1302VALIGN="TOP"
1303><TT
1304CLASS="PARAMETER"
1305><I
1306>userdata</I
1307></TT
1308>&nbsp;:</TD
1309><TD
1310WIDTH="80%"
1311ALIGN="LEFT"
1312VALIGN="TOP"
1313> a pointer to the userdata</TD
1314></TR
1315><TR
1316><TD
1317WIDTH="20%"
1318ALIGN="RIGHT"
1319VALIGN="TOP"
1320><I
1321CLASS="EMPHASIS"
1322>Returns</I
1323> :</TD
1324><TD
1325WIDTH="80%"
1326ALIGN="LEFT"
1327VALIGN="TOP"
1328>0 the addition succeeded and -1 in case of error.</TD
1329></TR
1330></TBODY
1331></TABLE
1332><P
1333></P
1334></DIV
1335></DIV
1336><HR><DIV
1337CLASS="REFSECT2"
1338><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]1339NAME="AEN24866"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1340></A
1341><H3
1342><A
1343NAME="XMLHASHUPDATEENTRY"
1344></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]1345>xmlHashUpdateEntry ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1346><TABLE
1347BORDER="0"
1348BGCOLOR="#D6E8FF"
1349WIDTH="100%"
1350CELLPADDING="6"
1351><TR
1352><TD
1353><PRE
1354CLASS="PROGRAMLISTING"
1355>int xmlHashUpdateEntry (<A
1356HREF="libxml-hash.html#XMLHASHTABLEPTR"
1357>xmlHashTablePtr</A
1358> table,
1359 const <A
1360HREF="libxml-tree.html#XMLCHAR"
1361>xmlChar</A
1362> *name,
1363 void *userdata,
1364 <A
1365HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
1366>xmlHashDeallocator</A
1367> f);</PRE
1368></TD
1369></TR
1370></TABLE
1371><P
Daniel Veillardcbaf3992001-12-31 16:16:02 +0000[diff] [blame]1372>Add the <TT
1373CLASS="PARAMETER"
1374><I
1375>userdata</I
1376></TT
1377> to the hash <TT
1378CLASS="PARAMETER"
1379><I
1380>table</I
1381></TT
1382>. This can later be retrieved
1383by using the <TT
1384CLASS="PARAMETER"
1385><I
1386>name</I
1387></TT
1388>. Existing entry for this <TT
1389CLASS="PARAMETER"
1390><I
1391>name</I
1392></TT
1393> will be removed
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1394and freed with <TT
1395CLASS="PARAMETER"
1396><I
1397>f</I
1398></TT
1399> if found.</P
1400><P
1401></P
1402><DIV
1403CLASS="INFORMALTABLE"
1404><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]1405NAME="AEN24880"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1406></A
1407><P
1408></P
1409><TABLE
1410BORDER="0"
1411WIDTH="100%"
1412BGCOLOR="#FFD0D0"
1413CELLSPACING="0"
1414CELLPADDING="4"
1415CLASS="CALSTABLE"
1416><TBODY
1417><TR
1418><TD
1419WIDTH="20%"
1420ALIGN="RIGHT"
1421VALIGN="TOP"
1422><TT
1423CLASS="PARAMETER"
1424><I
1425>table</I
1426></TT
1427>&nbsp;:</TD
1428><TD
1429WIDTH="80%"
1430ALIGN="LEFT"
1431VALIGN="TOP"
1432> the hash table</TD
1433></TR
1434><TR
1435><TD
1436WIDTH="20%"
1437ALIGN="RIGHT"
1438VALIGN="TOP"
1439><TT
1440CLASS="PARAMETER"
1441><I
1442>name</I
1443></TT
1444>&nbsp;:</TD
1445><TD
1446WIDTH="80%"
1447ALIGN="LEFT"
1448VALIGN="TOP"
1449> the name of the userdata</TD
1450></TR
1451><TR
1452><TD
1453WIDTH="20%"
1454ALIGN="RIGHT"
1455VALIGN="TOP"
1456><TT
1457CLASS="PARAMETER"
1458><I
1459>userdata</I
1460></TT
1461>&nbsp;:</TD
1462><TD
1463WIDTH="80%"
1464ALIGN="LEFT"
1465VALIGN="TOP"
1466> a pointer to the userdata</TD
1467></TR
1468><TR
1469><TD
1470WIDTH="20%"
1471ALIGN="RIGHT"
1472VALIGN="TOP"
1473><TT
1474CLASS="PARAMETER"
1475><I
1476>f</I
1477></TT
1478>&nbsp;:</TD
1479><TD
1480WIDTH="80%"
1481ALIGN="LEFT"
1482VALIGN="TOP"
1483> the deallocator function for replaced item (if any)</TD
1484></TR
1485><TR
1486><TD
1487WIDTH="20%"
1488ALIGN="RIGHT"
1489VALIGN="TOP"
1490><I
1491CLASS="EMPHASIS"
1492>Returns</I
1493> :</TD
1494><TD
1495WIDTH="80%"
1496ALIGN="LEFT"
1497VALIGN="TOP"
1498>0 the addition succeeded and -1 in case of error.</TD
1499></TR
1500></TBODY
1501></TABLE
1502><P
1503></P
1504></DIV
1505></DIV
1506><HR><DIV
1507CLASS="REFSECT2"
1508><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]1509NAME="AEN24905"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1510></A
1511><H3
1512><A
1513NAME="XMLHASHADDENTRY2"
1514></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]1515>xmlHashAddEntry2 ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1516><TABLE
1517BORDER="0"
1518BGCOLOR="#D6E8FF"
1519WIDTH="100%"
1520CELLPADDING="6"
1521><TR
1522><TD
1523><PRE
1524CLASS="PROGRAMLISTING"
1525>int xmlHashAddEntry2 (<A
1526HREF="libxml-hash.html#XMLHASHTABLEPTR"
1527>xmlHashTablePtr</A
1528> table,
1529 const <A
1530HREF="libxml-tree.html#XMLCHAR"
1531>xmlChar</A
1532> *name,
1533 const <A
1534HREF="libxml-tree.html#XMLCHAR"
1535>xmlChar</A
1536> *name2,
1537 void *userdata);</PRE
1538></TD
1539></TR
1540></TABLE
1541><P
Daniel Veillardcbaf3992001-12-31 16:16:02 +0000[diff] [blame]1542>Add the <TT
1543CLASS="PARAMETER"
1544><I
1545>userdata</I
1546></TT
1547> to the hash <TT
1548CLASS="PARAMETER"
1549><I
1550>table</I
1551></TT
1552>. This can later be retrieved
1553by using the (<TT
1554CLASS="PARAMETER"
1555><I
1556>name</I
1557></TT
1558>, <TT
1559CLASS="PARAMETER"
1560><I
1561>name2</I
1562></TT
1563>) tuple. Duplicate tuples generate errors.</P
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1564><P
1565></P
1566><DIV
1567CLASS="INFORMALTABLE"
1568><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]1569NAME="AEN24918"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1570></A
1571><P
1572></P
1573><TABLE
1574BORDER="0"
1575WIDTH="100%"
1576BGCOLOR="#FFD0D0"
1577CELLSPACING="0"
1578CELLPADDING="4"
1579CLASS="CALSTABLE"
1580><TBODY
1581><TR
1582><TD
1583WIDTH="20%"
1584ALIGN="RIGHT"
1585VALIGN="TOP"
1586><TT
1587CLASS="PARAMETER"
1588><I
1589>table</I
1590></TT
1591>&nbsp;:</TD
1592><TD
1593WIDTH="80%"
1594ALIGN="LEFT"
1595VALIGN="TOP"
1596> the hash table</TD
1597></TR
1598><TR
1599><TD
1600WIDTH="20%"
1601ALIGN="RIGHT"
1602VALIGN="TOP"
1603><TT
1604CLASS="PARAMETER"
1605><I
1606>name</I
1607></TT
1608>&nbsp;:</TD
1609><TD
1610WIDTH="80%"
1611ALIGN="LEFT"
1612VALIGN="TOP"
1613> the name of the userdata</TD
1614></TR
1615><TR
1616><TD
1617WIDTH="20%"
1618ALIGN="RIGHT"
1619VALIGN="TOP"
1620><TT
1621CLASS="PARAMETER"
1622><I
1623>name2</I
1624></TT
1625>&nbsp;:</TD
1626><TD
1627WIDTH="80%"
1628ALIGN="LEFT"
1629VALIGN="TOP"
1630> a second name of the userdata</TD
1631></TR
1632><TR
1633><TD
1634WIDTH="20%"
1635ALIGN="RIGHT"
1636VALIGN="TOP"
1637><TT
1638CLASS="PARAMETER"
1639><I
1640>userdata</I
1641></TT
1642>&nbsp;:</TD
1643><TD
1644WIDTH="80%"
1645ALIGN="LEFT"
1646VALIGN="TOP"
1647> a pointer to the userdata</TD
1648></TR
1649><TR
1650><TD
1651WIDTH="20%"
1652ALIGN="RIGHT"
1653VALIGN="TOP"
1654><I
1655CLASS="EMPHASIS"
1656>Returns</I
1657> :</TD
1658><TD
1659WIDTH="80%"
1660ALIGN="LEFT"
1661VALIGN="TOP"
1662>0 the addition succeeded and -1 in case of error.</TD
1663></TR
1664></TBODY
1665></TABLE
1666><P
1667></P
1668></DIV
1669></DIV
1670><HR><DIV
1671CLASS="REFSECT2"
1672><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]1673NAME="AEN24943"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1674></A
1675><H3
1676><A
1677NAME="XMLHASHUPDATEENTRY2"
1678></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]1679>xmlHashUpdateEntry2 ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1680><TABLE
1681BORDER="0"
1682BGCOLOR="#D6E8FF"
1683WIDTH="100%"
1684CELLPADDING="6"
1685><TR
1686><TD
1687><PRE
1688CLASS="PROGRAMLISTING"
1689>int xmlHashUpdateEntry2 (<A
1690HREF="libxml-hash.html#XMLHASHTABLEPTR"
1691>xmlHashTablePtr</A
1692> table,
1693 const <A
1694HREF="libxml-tree.html#XMLCHAR"
1695>xmlChar</A
1696> *name,
1697 const <A
1698HREF="libxml-tree.html#XMLCHAR"
1699>xmlChar</A
1700> *name2,
1701 void *userdata,
1702 <A
1703HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
1704>xmlHashDeallocator</A
1705> f);</PRE
1706></TD
1707></TR
1708></TABLE
1709><P
Daniel Veillardcbaf3992001-12-31 16:16:02 +0000[diff] [blame]1710>Add the <TT
1711CLASS="PARAMETER"
1712><I
1713>userdata</I
1714></TT
1715> to the hash <TT
1716CLASS="PARAMETER"
1717><I
1718>table</I
1719></TT
1720>. This can later be retrieved
1721by using the (<TT
1722CLASS="PARAMETER"
1723><I
1724>name</I
1725></TT
1726>, <TT
1727CLASS="PARAMETER"
1728><I
1729>name2</I
1730></TT
1731>) tuple. Existing entry for this tuple will
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1732be removed and freed with <TT
1733CLASS="PARAMETER"
1734><I
1735>f</I
1736></TT
1737> if found.</P
1738><P
1739></P
1740><DIV
1741CLASS="INFORMALTABLE"
1742><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]1743NAME="AEN24958"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1744></A
1745><P
1746></P
1747><TABLE
1748BORDER="0"
1749WIDTH="100%"
1750BGCOLOR="#FFD0D0"
1751CELLSPACING="0"
1752CELLPADDING="4"
1753CLASS="CALSTABLE"
1754><TBODY
1755><TR
1756><TD
1757WIDTH="20%"
1758ALIGN="RIGHT"
1759VALIGN="TOP"
1760><TT
1761CLASS="PARAMETER"
1762><I
1763>table</I
1764></TT
1765>&nbsp;:</TD
1766><TD
1767WIDTH="80%"
1768ALIGN="LEFT"
1769VALIGN="TOP"
1770> the hash table</TD
1771></TR
1772><TR
1773><TD
1774WIDTH="20%"
1775ALIGN="RIGHT"
1776VALIGN="TOP"
1777><TT
1778CLASS="PARAMETER"
1779><I
1780>name</I
1781></TT
1782>&nbsp;:</TD
1783><TD
1784WIDTH="80%"
1785ALIGN="LEFT"
1786VALIGN="TOP"
1787> the name of the userdata</TD
1788></TR
1789><TR
1790><TD
1791WIDTH="20%"
1792ALIGN="RIGHT"
1793VALIGN="TOP"
1794><TT
1795CLASS="PARAMETER"
1796><I
1797>name2</I
1798></TT
1799>&nbsp;:</TD
1800><TD
1801WIDTH="80%"
1802ALIGN="LEFT"
1803VALIGN="TOP"
1804> a second name of the userdata</TD
1805></TR
1806><TR
1807><TD
1808WIDTH="20%"
1809ALIGN="RIGHT"
1810VALIGN="TOP"
1811><TT
1812CLASS="PARAMETER"
1813><I
1814>userdata</I
1815></TT
1816>&nbsp;:</TD
1817><TD
1818WIDTH="80%"
1819ALIGN="LEFT"
1820VALIGN="TOP"
1821> a pointer to the userdata</TD
1822></TR
1823><TR
1824><TD
1825WIDTH="20%"
1826ALIGN="RIGHT"
1827VALIGN="TOP"
1828><TT
1829CLASS="PARAMETER"
1830><I
1831>f</I
1832></TT
1833>&nbsp;:</TD
1834><TD
1835WIDTH="80%"
1836ALIGN="LEFT"
1837VALIGN="TOP"
1838> the deallocator function for replaced item (if any)</TD
1839></TR
1840><TR
1841><TD
1842WIDTH="20%"
1843ALIGN="RIGHT"
1844VALIGN="TOP"
1845><I
1846CLASS="EMPHASIS"
1847>Returns</I
1848> :</TD
1849><TD
1850WIDTH="80%"
1851ALIGN="LEFT"
1852VALIGN="TOP"
1853>0 the addition succeeded and -1 in case of error.</TD
1854></TR
1855></TBODY
1856></TABLE
1857><P
1858></P
1859></DIV
1860></DIV
1861><HR><DIV
1862CLASS="REFSECT2"
1863><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]1864NAME="AEN24987"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1865></A
1866><H3
1867><A
1868NAME="XMLHASHADDENTRY3"
1869></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]1870>xmlHashAddEntry3 ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1871><TABLE
1872BORDER="0"
1873BGCOLOR="#D6E8FF"
1874WIDTH="100%"
1875CELLPADDING="6"
1876><TR
1877><TD
1878><PRE
1879CLASS="PROGRAMLISTING"
1880>int xmlHashAddEntry3 (<A
1881HREF="libxml-hash.html#XMLHASHTABLEPTR"
1882>xmlHashTablePtr</A
1883> table,
1884 const <A
1885HREF="libxml-tree.html#XMLCHAR"
1886>xmlChar</A
1887> *name,
1888 const <A
1889HREF="libxml-tree.html#XMLCHAR"
1890>xmlChar</A
1891> *name2,
1892 const <A
1893HREF="libxml-tree.html#XMLCHAR"
1894>xmlChar</A
1895> *name3,
1896 void *userdata);</PRE
1897></TD
1898></TR
1899></TABLE
1900><P
Daniel Veillardcbaf3992001-12-31 16:16:02 +0000[diff] [blame]1901>Add the <TT
1902CLASS="PARAMETER"
1903><I
1904>userdata</I
1905></TT
1906> to the hash <TT
1907CLASS="PARAMETER"
1908><I
1909>table</I
1910></TT
1911>. This can later be retrieved
1912by using the tuple (<TT
1913CLASS="PARAMETER"
1914><I
1915>name</I
1916></TT
1917>, <TT
1918CLASS="PARAMETER"
1919><I
1920>name2</I
1921></TT
1922>, <TT
1923CLASS="PARAMETER"
1924><I
1925>name3</I
1926></TT
1927>). Duplicate entries generate
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1928errors.</P
1929><P
1930></P
1931><DIV
1932CLASS="INFORMALTABLE"
1933><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]1934NAME="AEN25002"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1935></A
1936><P
1937></P
1938><TABLE
1939BORDER="0"
1940WIDTH="100%"
1941BGCOLOR="#FFD0D0"
1942CELLSPACING="0"
1943CELLPADDING="4"
1944CLASS="CALSTABLE"
1945><TBODY
1946><TR
1947><TD
1948WIDTH="20%"
1949ALIGN="RIGHT"
1950VALIGN="TOP"
1951><TT
1952CLASS="PARAMETER"
1953><I
1954>table</I
1955></TT
1956>&nbsp;:</TD
1957><TD
1958WIDTH="80%"
1959ALIGN="LEFT"
1960VALIGN="TOP"
1961> the hash table</TD
1962></TR
1963><TR
1964><TD
1965WIDTH="20%"
1966ALIGN="RIGHT"
1967VALIGN="TOP"
1968><TT
1969CLASS="PARAMETER"
1970><I
1971>name</I
1972></TT
1973>&nbsp;:</TD
1974><TD
1975WIDTH="80%"
1976ALIGN="LEFT"
1977VALIGN="TOP"
1978> the name of the userdata</TD
1979></TR
1980><TR
1981><TD
1982WIDTH="20%"
1983ALIGN="RIGHT"
1984VALIGN="TOP"
1985><TT
1986CLASS="PARAMETER"
1987><I
1988>name2</I
1989></TT
1990>&nbsp;:</TD
1991><TD
1992WIDTH="80%"
1993ALIGN="LEFT"
1994VALIGN="TOP"
1995> a second name of the userdata</TD
1996></TR
1997><TR
1998><TD
1999WIDTH="20%"
2000ALIGN="RIGHT"
2001VALIGN="TOP"
2002><TT
2003CLASS="PARAMETER"
2004><I
2005>name3</I
2006></TT
2007>&nbsp;:</TD
2008><TD
2009WIDTH="80%"
2010ALIGN="LEFT"
2011VALIGN="TOP"
2012> a third name of the userdata</TD
2013></TR
2014><TR
2015><TD
2016WIDTH="20%"
2017ALIGN="RIGHT"
2018VALIGN="TOP"
2019><TT
2020CLASS="PARAMETER"
2021><I
2022>userdata</I
2023></TT
2024>&nbsp;:</TD
2025><TD
2026WIDTH="80%"
2027ALIGN="LEFT"
2028VALIGN="TOP"
2029> a pointer to the userdata</TD
2030></TR
2031><TR
2032><TD
2033WIDTH="20%"
2034ALIGN="RIGHT"
2035VALIGN="TOP"
2036><I
2037CLASS="EMPHASIS"
2038>Returns</I
2039> :</TD
2040><TD
2041WIDTH="80%"
2042ALIGN="LEFT"
2043VALIGN="TOP"
2044>0 the addition succeeded and -1 in case of error.</TD
2045></TR
2046></TBODY
2047></TABLE
2048><P
2049></P
2050></DIV
2051></DIV
2052><HR><DIV
2053CLASS="REFSECT2"
2054><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]2055NAME="AEN25031"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2056></A
2057><H3
2058><A
2059NAME="XMLHASHUPDATEENTRY3"
2060></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]2061>xmlHashUpdateEntry3 ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2062><TABLE
2063BORDER="0"
2064BGCOLOR="#D6E8FF"
2065WIDTH="100%"
2066CELLPADDING="6"
2067><TR
2068><TD
2069><PRE
2070CLASS="PROGRAMLISTING"
2071>int xmlHashUpdateEntry3 (<A
2072HREF="libxml-hash.html#XMLHASHTABLEPTR"
2073>xmlHashTablePtr</A
2074> table,
2075 const <A
2076HREF="libxml-tree.html#XMLCHAR"
2077>xmlChar</A
2078> *name,
2079 const <A
2080HREF="libxml-tree.html#XMLCHAR"
2081>xmlChar</A
2082> *name2,
2083 const <A
2084HREF="libxml-tree.html#XMLCHAR"
2085>xmlChar</A
2086> *name3,
2087 void *userdata,
2088 <A
2089HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
2090>xmlHashDeallocator</A
2091> f);</PRE
2092></TD
2093></TR
2094></TABLE
2095><P
Daniel Veillardcbaf3992001-12-31 16:16:02 +0000[diff] [blame]2096>Add the <TT
2097CLASS="PARAMETER"
2098><I
2099>userdata</I
2100></TT
2101> to the hash <TT
2102CLASS="PARAMETER"
2103><I
2104>table</I
2105></TT
2106>. This can later be retrieved
2107by using the tuple (<TT
2108CLASS="PARAMETER"
2109><I
2110>name</I
2111></TT
2112>, <TT
2113CLASS="PARAMETER"
2114><I
2115>name2</I
2116></TT
2117>, <TT
2118CLASS="PARAMETER"
2119><I
2120>name3</I
2121></TT
2122>). Existing entry for this tuple
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2123will be removed and freed with <TT
2124CLASS="PARAMETER"
2125><I
2126>f</I
2127></TT
2128> if found.</P
2129><P
2130></P
2131><DIV
2132CLASS="INFORMALTABLE"
2133><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]2134NAME="AEN25048"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2135></A
2136><P
2137></P
2138><TABLE
2139BORDER="0"
2140WIDTH="100%"
2141BGCOLOR="#FFD0D0"
2142CELLSPACING="0"
2143CELLPADDING="4"
2144CLASS="CALSTABLE"
2145><TBODY
2146><TR
2147><TD
2148WIDTH="20%"
2149ALIGN="RIGHT"
2150VALIGN="TOP"
2151><TT
2152CLASS="PARAMETER"
2153><I
2154>table</I
2155></TT
2156>&nbsp;:</TD
2157><TD
2158WIDTH="80%"
2159ALIGN="LEFT"
2160VALIGN="TOP"
2161> the hash table</TD
2162></TR
2163><TR
2164><TD
2165WIDTH="20%"
2166ALIGN="RIGHT"
2167VALIGN="TOP"
2168><TT
2169CLASS="PARAMETER"
2170><I
2171>name</I
2172></TT
2173>&nbsp;:</TD
2174><TD
2175WIDTH="80%"
2176ALIGN="LEFT"
2177VALIGN="TOP"
2178> the name of the userdata</TD
2179></TR
2180><TR
2181><TD
2182WIDTH="20%"
2183ALIGN="RIGHT"
2184VALIGN="TOP"
2185><TT
2186CLASS="PARAMETER"
2187><I
2188>name2</I
2189></TT
2190>&nbsp;:</TD
2191><TD
2192WIDTH="80%"
2193ALIGN="LEFT"
2194VALIGN="TOP"
2195> a second name of the userdata</TD
2196></TR
2197><TR
2198><TD
2199WIDTH="20%"
2200ALIGN="RIGHT"
2201VALIGN="TOP"
2202><TT
2203CLASS="PARAMETER"
2204><I
2205>name3</I
2206></TT
2207>&nbsp;:</TD
2208><TD
2209WIDTH="80%"
2210ALIGN="LEFT"
2211VALIGN="TOP"
2212> a third name of the userdata</TD
2213></TR
2214><TR
2215><TD
2216WIDTH="20%"
2217ALIGN="RIGHT"
2218VALIGN="TOP"
2219><TT
2220CLASS="PARAMETER"
2221><I
2222>userdata</I
2223></TT
2224>&nbsp;:</TD
2225><TD
2226WIDTH="80%"
2227ALIGN="LEFT"
2228VALIGN="TOP"
2229> a pointer to the userdata</TD
2230></TR
2231><TR
2232><TD
2233WIDTH="20%"
2234ALIGN="RIGHT"
2235VALIGN="TOP"
2236><TT
2237CLASS="PARAMETER"
2238><I
2239>f</I
2240></TT
2241>&nbsp;:</TD
2242><TD
2243WIDTH="80%"
2244ALIGN="LEFT"
2245VALIGN="TOP"
2246> the deallocator function for replaced item (if any)</TD
2247></TR
2248><TR
2249><TD
2250WIDTH="20%"
2251ALIGN="RIGHT"
2252VALIGN="TOP"
2253><I
2254CLASS="EMPHASIS"
2255>Returns</I
2256> :</TD
2257><TD
2258WIDTH="80%"
2259ALIGN="LEFT"
2260VALIGN="TOP"
2261>0 the addition succeeded and -1 in case of error.</TD
2262></TR
2263></TBODY
2264></TABLE
2265><P
2266></P
2267></DIV
2268></DIV
2269><HR><DIV
2270CLASS="REFSECT2"
2271><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]2272NAME="AEN25081"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2273></A
2274><H3
2275><A
2276NAME="XMLHASHREMOVEENTRY"
2277></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]2278>xmlHashRemoveEntry ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2279><TABLE
2280BORDER="0"
2281BGCOLOR="#D6E8FF"
2282WIDTH="100%"
2283CELLPADDING="6"
2284><TR
2285><TD
2286><PRE
2287CLASS="PROGRAMLISTING"
2288>int xmlHashRemoveEntry (<A
2289HREF="libxml-hash.html#XMLHASHTABLEPTR"
2290>xmlHashTablePtr</A
2291> table,
2292 const <A
2293HREF="libxml-tree.html#XMLCHAR"
2294>xmlChar</A
2295> *name,
2296 <A
2297HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
2298>xmlHashDeallocator</A
2299> f);</PRE
2300></TD
2301></TR
2302></TABLE
2303><P
Daniel Veillardcbaf3992001-12-31 16:16:02 +0000[diff] [blame]2304>Find the userdata specified by the <TT
2305CLASS="PARAMETER"
2306><I
2307>name</I
2308></TT
2309> and remove
2310it from the hash <TT
2311CLASS="PARAMETER"
2312><I
2313>table</I
2314></TT
2315>. Existing userdata for this tuple will be removed
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2316and freed with <TT
2317CLASS="PARAMETER"
2318><I
2319>f</I
2320></TT
2321>.</P
2322><P
2323></P
2324><DIV
2325CLASS="INFORMALTABLE"
2326><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]2327NAME="AEN25093"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2328></A
2329><P
2330></P
2331><TABLE
2332BORDER="0"
2333WIDTH="100%"
2334BGCOLOR="#FFD0D0"
2335CELLSPACING="0"
2336CELLPADDING="4"
2337CLASS="CALSTABLE"
2338><TBODY
2339><TR
2340><TD
2341WIDTH="20%"
2342ALIGN="RIGHT"
2343VALIGN="TOP"
2344><TT
2345CLASS="PARAMETER"
2346><I
2347>table</I
2348></TT
2349>&nbsp;:</TD
2350><TD
2351WIDTH="80%"
2352ALIGN="LEFT"
2353VALIGN="TOP"
2354> the hash table</TD
2355></TR
2356><TR
2357><TD
2358WIDTH="20%"
2359ALIGN="RIGHT"
2360VALIGN="TOP"
2361><TT
2362CLASS="PARAMETER"
2363><I
2364>name</I
2365></TT
2366>&nbsp;:</TD
2367><TD
2368WIDTH="80%"
2369ALIGN="LEFT"
2370VALIGN="TOP"
2371> the name of the userdata</TD
2372></TR
2373><TR
2374><TD
2375WIDTH="20%"
2376ALIGN="RIGHT"
2377VALIGN="TOP"
2378><TT
2379CLASS="PARAMETER"
2380><I
2381>f</I
2382></TT
2383>&nbsp;:</TD
2384><TD
2385WIDTH="80%"
2386ALIGN="LEFT"
2387VALIGN="TOP"
2388> the deallocator function for removed item (if any)</TD
2389></TR
2390><TR
2391><TD
2392WIDTH="20%"
2393ALIGN="RIGHT"
2394VALIGN="TOP"
2395><I
2396CLASS="EMPHASIS"
2397>Returns</I
2398> :</TD
2399><TD
2400WIDTH="80%"
2401ALIGN="LEFT"
2402VALIGN="TOP"
2403>0 if the removal succeeded and -1 in case of error or not found.</TD
2404></TR
2405></TBODY
2406></TABLE
2407><P
2408></P
2409></DIV
2410></DIV
2411><HR><DIV
2412CLASS="REFSECT2"
2413><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]2414NAME="AEN25114"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2415></A
2416><H3
2417><A
2418NAME="XMLHASHREMOVEENTRY2"
2419></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]2420>xmlHashRemoveEntry2 ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2421><TABLE
2422BORDER="0"
2423BGCOLOR="#D6E8FF"
2424WIDTH="100%"
2425CELLPADDING="6"
2426><TR
2427><TD
2428><PRE
2429CLASS="PROGRAMLISTING"
2430>int xmlHashRemoveEntry2 (<A
2431HREF="libxml-hash.html#XMLHASHTABLEPTR"
2432>xmlHashTablePtr</A
2433> table,
2434 const <A
2435HREF="libxml-tree.html#XMLCHAR"
2436>xmlChar</A
2437> *name,
2438 const <A
2439HREF="libxml-tree.html#XMLCHAR"
2440>xmlChar</A
2441> *name2,
2442 <A
2443HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
2444>xmlHashDeallocator</A
2445> f);</PRE
2446></TD
2447></TR
2448></TABLE
2449><P
Daniel Veillardcbaf3992001-12-31 16:16:02 +0000[diff] [blame]2450>Find the userdata specified by the (<TT
2451CLASS="PARAMETER"
2452><I
2453>name</I
2454></TT
2455>, <TT
2456CLASS="PARAMETER"
2457><I
2458>name2</I
2459></TT
2460>) tuple and remove
2461it from the hash <TT
2462CLASS="PARAMETER"
2463><I
2464>table</I
2465></TT
2466>. Existing userdata for this tuple will be removed
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2467and freed with <TT
2468CLASS="PARAMETER"
2469><I
2470>f</I
2471></TT
2472>.</P
2473><P
2474></P
2475><DIV
2476CLASS="INFORMALTABLE"
2477><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]2478NAME="AEN25128"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2479></A
2480><P
2481></P
2482><TABLE
2483BORDER="0"
2484WIDTH="100%"
2485BGCOLOR="#FFD0D0"
2486CELLSPACING="0"
2487CELLPADDING="4"
2488CLASS="CALSTABLE"
2489><TBODY
2490><TR
2491><TD
2492WIDTH="20%"
2493ALIGN="RIGHT"
2494VALIGN="TOP"
2495><TT
2496CLASS="PARAMETER"
2497><I
2498>table</I
2499></TT
2500>&nbsp;:</TD
2501><TD
2502WIDTH="80%"
2503ALIGN="LEFT"
2504VALIGN="TOP"
2505> the hash table</TD
2506></TR
2507><TR
2508><TD
2509WIDTH="20%"
2510ALIGN="RIGHT"
2511VALIGN="TOP"
2512><TT
2513CLASS="PARAMETER"
2514><I
2515>name</I
2516></TT
2517>&nbsp;:</TD
2518><TD
2519WIDTH="80%"
2520ALIGN="LEFT"
2521VALIGN="TOP"
2522> the name of the userdata</TD
2523></TR
2524><TR
2525><TD
2526WIDTH="20%"
2527ALIGN="RIGHT"
2528VALIGN="TOP"
2529><TT
2530CLASS="PARAMETER"
2531><I
2532>name2</I
2533></TT
2534>&nbsp;:</TD
2535><TD
2536WIDTH="80%"
2537ALIGN="LEFT"
2538VALIGN="TOP"
2539> a second name of the userdata</TD
2540></TR
2541><TR
2542><TD
2543WIDTH="20%"
2544ALIGN="RIGHT"
2545VALIGN="TOP"
2546><TT
2547CLASS="PARAMETER"
2548><I
2549>f</I
2550></TT
2551>&nbsp;:</TD
2552><TD
2553WIDTH="80%"
2554ALIGN="LEFT"
2555VALIGN="TOP"
2556> the deallocator function for removed item (if any)</TD
2557></TR
2558><TR
2559><TD
2560WIDTH="20%"
2561ALIGN="RIGHT"
2562VALIGN="TOP"
2563><I
2564CLASS="EMPHASIS"
2565>Returns</I
2566> :</TD
2567><TD
2568WIDTH="80%"
2569ALIGN="LEFT"
2570VALIGN="TOP"
2571>0 if the removal succeeded and -1 in case of error or not found.</TD
2572></TR
2573></TBODY
2574></TABLE
2575><P
2576></P
2577></DIV
2578></DIV
2579><HR><DIV
2580CLASS="REFSECT2"
2581><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]2582NAME="AEN25153"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2583></A
2584><H3
2585><A
2586NAME="XMLHASHREMOVEENTRY3"
2587></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]2588>xmlHashRemoveEntry3 ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2589><TABLE
2590BORDER="0"
2591BGCOLOR="#D6E8FF"
2592WIDTH="100%"
2593CELLPADDING="6"
2594><TR
2595><TD
2596><PRE
2597CLASS="PROGRAMLISTING"
2598>int xmlHashRemoveEntry3 (<A
2599HREF="libxml-hash.html#XMLHASHTABLEPTR"
2600>xmlHashTablePtr</A
2601> table,
2602 const <A
2603HREF="libxml-tree.html#XMLCHAR"
2604>xmlChar</A
2605> *name,
2606 const <A
2607HREF="libxml-tree.html#XMLCHAR"
2608>xmlChar</A
2609> *name2,
2610 const <A
2611HREF="libxml-tree.html#XMLCHAR"
2612>xmlChar</A
2613> *name3,
2614 <A
2615HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
2616>xmlHashDeallocator</A
2617> f);</PRE
2618></TD
2619></TR
2620></TABLE
2621><P
Daniel Veillardcbaf3992001-12-31 16:16:02 +0000[diff] [blame]2622>Find the userdata specified by the (<TT
2623CLASS="PARAMETER"
2624><I
2625>name</I
2626></TT
2627>, <TT
2628CLASS="PARAMETER"
2629><I
2630>name2</I
2631></TT
2632>, <TT
2633CLASS="PARAMETER"
2634><I
2635>name3</I
2636></TT
2637>) tuple and remove
2638it from the hash <TT
2639CLASS="PARAMETER"
2640><I
2641>table</I
2642></TT
2643>. Existing userdata for this tuple will be removed
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2644and freed with <TT
2645CLASS="PARAMETER"
2646><I
2647>f</I
2648></TT
2649>.</P
2650><P
2651></P
2652><DIV
2653CLASS="INFORMALTABLE"
2654><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]2655NAME="AEN25169"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2656></A
2657><P
2658></P
2659><TABLE
2660BORDER="0"
2661WIDTH="100%"
2662BGCOLOR="#FFD0D0"
2663CELLSPACING="0"
2664CELLPADDING="4"
2665CLASS="CALSTABLE"
2666><TBODY
2667><TR
2668><TD
2669WIDTH="20%"
2670ALIGN="RIGHT"
2671VALIGN="TOP"
2672><TT
2673CLASS="PARAMETER"
2674><I
2675>table</I
2676></TT
2677>&nbsp;:</TD
2678><TD
2679WIDTH="80%"
2680ALIGN="LEFT"
2681VALIGN="TOP"
2682> the hash table</TD
2683></TR
2684><TR
2685><TD
2686WIDTH="20%"
2687ALIGN="RIGHT"
2688VALIGN="TOP"
2689><TT
2690CLASS="PARAMETER"
2691><I
2692>name</I
2693></TT
2694>&nbsp;:</TD
2695><TD
2696WIDTH="80%"
2697ALIGN="LEFT"
2698VALIGN="TOP"
2699> the name of the userdata</TD
2700></TR
2701><TR
2702><TD
2703WIDTH="20%"
2704ALIGN="RIGHT"
2705VALIGN="TOP"
2706><TT
2707CLASS="PARAMETER"
2708><I
2709>name2</I
2710></TT
2711>&nbsp;:</TD
2712><TD
2713WIDTH="80%"
2714ALIGN="LEFT"
2715VALIGN="TOP"
2716> a second name of the userdata</TD
2717></TR
2718><TR
2719><TD
2720WIDTH="20%"
2721ALIGN="RIGHT"
2722VALIGN="TOP"
2723><TT
2724CLASS="PARAMETER"
2725><I
2726>name3</I
2727></TT
2728>&nbsp;:</TD
2729><TD
2730WIDTH="80%"
2731ALIGN="LEFT"
2732VALIGN="TOP"
2733> a third name of the userdata</TD
2734></TR
2735><TR
2736><TD
2737WIDTH="20%"
2738ALIGN="RIGHT"
2739VALIGN="TOP"
2740><TT
2741CLASS="PARAMETER"
2742><I
2743>f</I
2744></TT
2745>&nbsp;:</TD
2746><TD
2747WIDTH="80%"
2748ALIGN="LEFT"
2749VALIGN="TOP"
2750> the deallocator function for removed item (if any)</TD
2751></TR
2752><TR
2753><TD
2754WIDTH="20%"
2755ALIGN="RIGHT"
2756VALIGN="TOP"
2757><I
2758CLASS="EMPHASIS"
2759>Returns</I
2760> :</TD
2761><TD
2762WIDTH="80%"
2763ALIGN="LEFT"
2764VALIGN="TOP"
2765>0 if the removal succeeded and -1 in case of error or not found.</TD
2766></TR
2767></TBODY
2768></TABLE
2769><P
2770></P
2771></DIV
2772></DIV
2773><HR><DIV
2774CLASS="REFSECT2"
2775><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]2776NAME="AEN25198"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2777></A
2778><H3
2779><A
2780NAME="XMLHASHLOOKUP"
2781></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]2782>xmlHashLookup ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2783><TABLE
2784BORDER="0"
2785BGCOLOR="#D6E8FF"
2786WIDTH="100%"
2787CELLPADDING="6"
2788><TR
2789><TD
2790><PRE
2791CLASS="PROGRAMLISTING"
2792>void* xmlHashLookup (<A
2793HREF="libxml-hash.html#XMLHASHTABLEPTR"
2794>xmlHashTablePtr</A
2795> table,
2796 const <A
2797HREF="libxml-tree.html#XMLCHAR"
2798>xmlChar</A
2799> *name);</PRE
2800></TD
2801></TR
2802></TABLE
2803><P
Daniel Veillardcbaf3992001-12-31 16:16:02 +0000[diff] [blame]2804>Find the userdata specified by the <TT
2805CLASS="PARAMETER"
2806><I
2807>name</I
2808></TT
2809>.</P
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2810><P
2811></P
2812><DIV
2813CLASS="INFORMALTABLE"
2814><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]2815NAME="AEN25207"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2816></A
2817><P
2818></P
2819><TABLE
2820BORDER="0"
2821WIDTH="100%"
2822BGCOLOR="#FFD0D0"
2823CELLSPACING="0"
2824CELLPADDING="4"
2825CLASS="CALSTABLE"
2826><TBODY
2827><TR
2828><TD
2829WIDTH="20%"
2830ALIGN="RIGHT"
2831VALIGN="TOP"
2832><TT
2833CLASS="PARAMETER"
2834><I
2835>table</I
2836></TT
2837>&nbsp;:</TD
2838><TD
2839WIDTH="80%"
2840ALIGN="LEFT"
2841VALIGN="TOP"
2842> the hash table</TD
2843></TR
2844><TR
2845><TD
2846WIDTH="20%"
2847ALIGN="RIGHT"
2848VALIGN="TOP"
2849><TT
2850CLASS="PARAMETER"
2851><I
2852>name</I
2853></TT
2854>&nbsp;:</TD
2855><TD
2856WIDTH="80%"
2857ALIGN="LEFT"
2858VALIGN="TOP"
2859> the name of the userdata</TD
2860></TR
2861></TBODY
2862></TABLE
2863><P
2864></P
2865></DIV
2866></DIV
2867><HR><DIV
2868CLASS="REFSECT2"
2869><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]2870NAME="AEN25220"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2871></A
2872><H3
2873><A
2874NAME="XMLHASHLOOKUP2"
2875></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]2876>xmlHashLookup2 ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2877><TABLE
2878BORDER="0"
2879BGCOLOR="#D6E8FF"
2880WIDTH="100%"
2881CELLPADDING="6"
2882><TR
2883><TD
2884><PRE
2885CLASS="PROGRAMLISTING"
2886>void* xmlHashLookup2 (<A
2887HREF="libxml-hash.html#XMLHASHTABLEPTR"
2888>xmlHashTablePtr</A
2889> table,
2890 const <A
2891HREF="libxml-tree.html#XMLCHAR"
2892>xmlChar</A
2893> *name,
2894 const <A
2895HREF="libxml-tree.html#XMLCHAR"
2896>xmlChar</A
2897> *name2);</PRE
2898></TD
2899></TR
2900></TABLE
2901><P
Daniel Veillardcbaf3992001-12-31 16:16:02 +0000[diff] [blame]2902>Find the userdata specified by the (<TT
2903CLASS="PARAMETER"
2904><I
2905>name</I
2906></TT
2907>, <TT
2908CLASS="PARAMETER"
2909><I
2910>name2</I
2911></TT
2912>) tuple.</P
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2913><P
2914></P
2915><DIV
2916CLASS="INFORMALTABLE"
2917><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]2918NAME="AEN25231"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2919></A
2920><P
2921></P
2922><TABLE
2923BORDER="0"
2924WIDTH="100%"
2925BGCOLOR="#FFD0D0"
2926CELLSPACING="0"
2927CELLPADDING="4"
2928CLASS="CALSTABLE"
2929><TBODY
2930><TR
2931><TD
2932WIDTH="20%"
2933ALIGN="RIGHT"
2934VALIGN="TOP"
2935><TT
2936CLASS="PARAMETER"
2937><I
2938>table</I
2939></TT
2940>&nbsp;:</TD
2941><TD
2942WIDTH="80%"
2943ALIGN="LEFT"
2944VALIGN="TOP"
2945> the hash table</TD
2946></TR
2947><TR
2948><TD
2949WIDTH="20%"
2950ALIGN="RIGHT"
2951VALIGN="TOP"
2952><TT
2953CLASS="PARAMETER"
2954><I
2955>name</I
2956></TT
2957>&nbsp;:</TD
2958><TD
2959WIDTH="80%"
2960ALIGN="LEFT"
2961VALIGN="TOP"
2962> the name of the userdata</TD
2963></TR
2964><TR
2965><TD
2966WIDTH="20%"
2967ALIGN="RIGHT"
2968VALIGN="TOP"
2969><TT
2970CLASS="PARAMETER"
2971><I
2972>name2</I
2973></TT
2974>&nbsp;:</TD
2975><TD
2976WIDTH="80%"
2977ALIGN="LEFT"
2978VALIGN="TOP"
2979> a second name of the userdata</TD
2980></TR
2981></TBODY
2982></TABLE
2983><P
2984></P
2985></DIV
2986></DIV
2987><HR><DIV
2988CLASS="REFSECT2"
2989><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]2990NAME="AEN25248"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2991></A
2992><H3
2993><A
2994NAME="XMLHASHLOOKUP3"
2995></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]2996>xmlHashLookup3 ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2997><TABLE
2998BORDER="0"
2999BGCOLOR="#D6E8FF"
3000WIDTH="100%"
3001CELLPADDING="6"
3002><TR
3003><TD
3004><PRE
3005CLASS="PROGRAMLISTING"
3006>void* xmlHashLookup3 (<A
3007HREF="libxml-hash.html#XMLHASHTABLEPTR"
3008>xmlHashTablePtr</A
3009> table,
3010 const <A
3011HREF="libxml-tree.html#XMLCHAR"
3012>xmlChar</A
3013> *name,
3014 const <A
3015HREF="libxml-tree.html#XMLCHAR"
3016>xmlChar</A
3017> *name2,
3018 const <A
3019HREF="libxml-tree.html#XMLCHAR"
3020>xmlChar</A
3021> *name3);</PRE
3022></TD
3023></TR
3024></TABLE
3025><P
Daniel Veillardcbaf3992001-12-31 16:16:02 +0000[diff] [blame]3026>Find the userdata specified by the (<TT
3027CLASS="PARAMETER"
3028><I
3029>name</I
3030></TT
3031>, <TT
3032CLASS="PARAMETER"
3033><I
3034>name2</I
3035></TT
3036>, <TT
3037CLASS="PARAMETER"
3038><I
3039>name3</I
3040></TT
3041>) tuple.</P
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3042><P
3043></P
3044><DIV
3045CLASS="INFORMALTABLE"
3046><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]3047NAME="AEN25261"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3048></A
3049><P
3050></P
3051><TABLE
3052BORDER="0"
3053WIDTH="100%"
3054BGCOLOR="#FFD0D0"
3055CELLSPACING="0"
3056CELLPADDING="4"
3057CLASS="CALSTABLE"
3058><TBODY
3059><TR
3060><TD
3061WIDTH="20%"
3062ALIGN="RIGHT"
3063VALIGN="TOP"
3064><TT
3065CLASS="PARAMETER"
3066><I
3067>table</I
3068></TT
3069>&nbsp;:</TD
3070><TD
3071WIDTH="80%"
3072ALIGN="LEFT"
3073VALIGN="TOP"
3074> the hash table</TD
3075></TR
3076><TR
3077><TD
3078WIDTH="20%"
3079ALIGN="RIGHT"
3080VALIGN="TOP"
3081><TT
3082CLASS="PARAMETER"
3083><I
3084>name</I
3085></TT
3086>&nbsp;:</TD
3087><TD
3088WIDTH="80%"
3089ALIGN="LEFT"
3090VALIGN="TOP"
3091> the name of the userdata</TD
3092></TR
3093><TR
3094><TD
3095WIDTH="20%"
3096ALIGN="RIGHT"
3097VALIGN="TOP"
3098><TT
3099CLASS="PARAMETER"
3100><I
3101>name2</I
3102></TT
3103>&nbsp;:</TD
3104><TD
3105WIDTH="80%"
3106ALIGN="LEFT"
3107VALIGN="TOP"
3108> a second name of the userdata</TD
3109></TR
3110><TR
3111><TD
3112WIDTH="20%"
3113ALIGN="RIGHT"
3114VALIGN="TOP"
3115><TT
3116CLASS="PARAMETER"
3117><I
3118>name3</I
3119></TT
3120>&nbsp;:</TD
3121><TD
3122WIDTH="80%"
3123ALIGN="LEFT"
3124VALIGN="TOP"
3125> a third name of the userdata</TD
3126></TR
3127></TBODY
3128></TABLE
3129><P
3130></P
3131></DIV
3132></DIV
3133><HR><DIV
3134CLASS="REFSECT2"
3135><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]3136NAME="AEN25282"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3137></A
3138><H3
3139><A
3140NAME="XMLHASHCOPY"
3141></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]3142>xmlHashCopy ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3143><TABLE
3144BORDER="0"
3145BGCOLOR="#D6E8FF"
3146WIDTH="100%"
3147CELLPADDING="6"
3148><TR
3149><TD
3150><PRE
3151CLASS="PROGRAMLISTING"
3152><A
3153HREF="libxml-hash.html#XMLHASHTABLEPTR"
3154>xmlHashTablePtr</A
3155> xmlHashCopy (<A
3156HREF="libxml-hash.html#XMLHASHTABLEPTR"
3157>xmlHashTablePtr</A
3158> table,
3159 <A
3160HREF="libxml-hash.html#XMLHASHCOPIER"
3161>xmlHashCopier</A
3162> f);</PRE
3163></TD
3164></TR
3165></TABLE
3166><P
Daniel Veillardcbaf3992001-12-31 16:16:02 +0000[diff] [blame]3167>Scan the hash <TT
3168CLASS="PARAMETER"
3169><I
3170>table</I
3171></TT
3172> and applied <TT
3173CLASS="PARAMETER"
3174><I
3175>f</I
3176></TT
3177> to each value.</P
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3178><P
3179></P
3180><DIV
3181CLASS="INFORMALTABLE"
3182><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]3183NAME="AEN25293"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3184></A
3185><P
3186></P
3187><TABLE
3188BORDER="0"
3189WIDTH="100%"
3190BGCOLOR="#FFD0D0"
3191CELLSPACING="0"
3192CELLPADDING="4"
3193CLASS="CALSTABLE"
3194><TBODY
3195><TR
3196><TD
3197WIDTH="20%"
3198ALIGN="RIGHT"
3199VALIGN="TOP"
3200><TT
3201CLASS="PARAMETER"
3202><I
3203>table</I
3204></TT
3205>&nbsp;:</TD
3206><TD
3207WIDTH="80%"
3208ALIGN="LEFT"
3209VALIGN="TOP"
3210> the hash table</TD
3211></TR
3212><TR
3213><TD
3214WIDTH="20%"
3215ALIGN="RIGHT"
3216VALIGN="TOP"
3217><TT
3218CLASS="PARAMETER"
3219><I
3220>f</I
3221></TT
3222>&nbsp;:</TD
3223><TD
3224WIDTH="80%"
3225ALIGN="LEFT"
3226VALIGN="TOP"
3227> the copier function for items in the hash</TD
3228></TR
3229><TR
3230><TD
3231WIDTH="20%"
3232ALIGN="RIGHT"
3233VALIGN="TOP"
3234><I
3235CLASS="EMPHASIS"
3236>Returns</I
3237> :</TD
3238><TD
3239WIDTH="80%"
3240ALIGN="LEFT"
3241VALIGN="TOP"
3242>the new table or NULL in case of error.</TD
3243></TR
3244></TBODY
3245></TABLE
3246><P
3247></P
3248></DIV
3249></DIV
3250><HR><DIV
3251CLASS="REFSECT2"
3252><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]3253NAME="AEN25310"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3254></A
3255><H3
3256><A
3257NAME="XMLHASHSIZE"
3258></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]3259>xmlHashSize ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3260><TABLE
3261BORDER="0"
3262BGCOLOR="#D6E8FF"
3263WIDTH="100%"
3264CELLPADDING="6"
3265><TR
3266><TD
3267><PRE
3268CLASS="PROGRAMLISTING"
3269>int xmlHashSize (<A
3270HREF="libxml-hash.html#XMLHASHTABLEPTR"
3271>xmlHashTablePtr</A
3272> table);</PRE
3273></TD
3274></TR
3275></TABLE
3276><P
Daniel Veillardcbaf3992001-12-31 16:16:02 +0000[diff] [blame]3277>Query the number of elements installed in the hash <TT
3278CLASS="PARAMETER"
3279><I
3280>table</I
3281></TT
3282>.</P
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3283><P
3284></P
3285><DIV
3286CLASS="INFORMALTABLE"
3287><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]3288NAME="AEN25318"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3289></A
3290><P
3291></P
3292><TABLE
3293BORDER="0"
3294WIDTH="100%"
3295BGCOLOR="#FFD0D0"
3296CELLSPACING="0"
3297CELLPADDING="4"
3298CLASS="CALSTABLE"
3299><TBODY
3300><TR
3301><TD
3302WIDTH="20%"
3303ALIGN="RIGHT"
3304VALIGN="TOP"
3305><TT
3306CLASS="PARAMETER"
3307><I
3308>table</I
3309></TT
3310>&nbsp;:</TD
3311><TD
3312WIDTH="80%"
3313ALIGN="LEFT"
3314VALIGN="TOP"
3315> the hash table</TD
3316></TR
3317><TR
3318><TD
3319WIDTH="20%"
3320ALIGN="RIGHT"
3321VALIGN="TOP"
3322><I
3323CLASS="EMPHASIS"
3324>Returns</I
3325> :</TD
3326><TD
3327WIDTH="80%"
3328ALIGN="LEFT"
3329VALIGN="TOP"
3330>the number of elements in the hash table or
3331-1 in case of error</TD
3332></TR
3333></TBODY
3334></TABLE
3335><P
3336></P
3337></DIV
3338></DIV
3339><HR><DIV
3340CLASS="REFSECT2"
3341><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]3342NAME="AEN25331"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3343></A
3344><H3
3345><A
3346NAME="XMLHASHSCAN"
3347></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]3348>xmlHashScan ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3349><TABLE
3350BORDER="0"
3351BGCOLOR="#D6E8FF"
3352WIDTH="100%"
3353CELLPADDING="6"
3354><TR
3355><TD
3356><PRE
3357CLASS="PROGRAMLISTING"
3358>void xmlHashScan (<A
3359HREF="libxml-hash.html#XMLHASHTABLEPTR"
3360>xmlHashTablePtr</A
3361> table,
3362 <A
3363HREF="libxml-hash.html#XMLHASHSCANNER"
3364>xmlHashScanner</A
3365> f,
3366 void *data);</PRE
3367></TD
3368></TR
3369></TABLE
3370><P
Daniel Veillardcbaf3992001-12-31 16:16:02 +0000[diff] [blame]3371>Scan the hash <TT
3372CLASS="PARAMETER"
3373><I
3374>table</I
3375></TT
3376> and applied <TT
3377CLASS="PARAMETER"
3378><I
3379>f</I
3380></TT
3381> to each value.</P
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3382><P
3383></P
3384><DIV
3385CLASS="INFORMALTABLE"
3386><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]3387NAME="AEN25341"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3388></A
3389><P
3390></P
3391><TABLE
3392BORDER="0"
3393WIDTH="100%"
3394BGCOLOR="#FFD0D0"
3395CELLSPACING="0"
3396CELLPADDING="4"
3397CLASS="CALSTABLE"
3398><TBODY
3399><TR
3400><TD
3401WIDTH="20%"
3402ALIGN="RIGHT"
3403VALIGN="TOP"
3404><TT
3405CLASS="PARAMETER"
3406><I
3407>table</I
3408></TT
3409>&nbsp;:</TD
3410><TD
3411WIDTH="80%"
3412ALIGN="LEFT"
3413VALIGN="TOP"
3414> the hash table</TD
3415></TR
3416><TR
3417><TD
3418WIDTH="20%"
3419ALIGN="RIGHT"
3420VALIGN="TOP"
3421><TT
3422CLASS="PARAMETER"
3423><I
3424>f</I
3425></TT
3426>&nbsp;:</TD
3427><TD
3428WIDTH="80%"
3429ALIGN="LEFT"
3430VALIGN="TOP"
3431> the scanner function for items in the hash</TD
3432></TR
3433><TR
3434><TD
3435WIDTH="20%"
3436ALIGN="RIGHT"
3437VALIGN="TOP"
3438><TT
3439CLASS="PARAMETER"
3440><I
3441>data</I
3442></TT
3443>&nbsp;:</TD
3444><TD
3445WIDTH="80%"
3446ALIGN="LEFT"
3447VALIGN="TOP"
3448> extra data passed to f</TD
3449></TR
3450></TBODY
3451></TABLE
3452><P
3453></P
3454></DIV
3455></DIV
3456><HR><DIV
3457CLASS="REFSECT2"
3458><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]3459NAME="AEN25358"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3460></A
3461><H3
3462><A
3463NAME="XMLHASHSCAN3"
3464></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]3465>xmlHashScan3 ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3466><TABLE
3467BORDER="0"
3468BGCOLOR="#D6E8FF"
3469WIDTH="100%"
3470CELLPADDING="6"
3471><TR
3472><TD
3473><PRE
3474CLASS="PROGRAMLISTING"
3475>void xmlHashScan3 (<A
3476HREF="libxml-hash.html#XMLHASHTABLEPTR"
3477>xmlHashTablePtr</A
3478> table,
3479 const <A
3480HREF="libxml-tree.html#XMLCHAR"
3481>xmlChar</A
3482> *name,
3483 const <A
3484HREF="libxml-tree.html#XMLCHAR"
3485>xmlChar</A
3486> *name2,
3487 const <A
3488HREF="libxml-tree.html#XMLCHAR"
3489>xmlChar</A
3490> *name3,
3491 <A
3492HREF="libxml-hash.html#XMLHASHSCANNER"
3493>xmlHashScanner</A
3494> f,
3495 void *data);</PRE
3496></TD
3497></TR
3498></TABLE
3499><P
Daniel Veillardcbaf3992001-12-31 16:16:02 +0000[diff] [blame]3500>Scan the hash <TT
3501CLASS="PARAMETER"
3502><I
3503>table</I
3504></TT
3505> and applied <TT
3506CLASS="PARAMETER"
3507><I
3508>f</I
3509></TT
3510> to each value matching
3511(<TT
3512CLASS="PARAMETER"
3513><I
3514>name</I
3515></TT
3516>, <TT
3517CLASS="PARAMETER"
3518><I
3519>name2</I
3520></TT
3521>, <TT
3522CLASS="PARAMETER"
3523><I
3524>name3</I
3525></TT
3526>) tuple. If one of the names is null,
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3527the comparison is considered to match.</P
3528><P
3529></P
3530><DIV
3531CLASS="INFORMALTABLE"
3532><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]3533NAME="AEN25374"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3534></A
3535><P
3536></P
3537><TABLE
3538BORDER="0"
3539WIDTH="100%"
3540BGCOLOR="#FFD0D0"
3541CELLSPACING="0"
3542CELLPADDING="4"
3543CLASS="CALSTABLE"
3544><TBODY
3545><TR
3546><TD
3547WIDTH="20%"
3548ALIGN="RIGHT"
3549VALIGN="TOP"
3550><TT
3551CLASS="PARAMETER"
3552><I
3553>table</I
3554></TT
3555>&nbsp;:</TD
3556><TD
3557WIDTH="80%"
3558ALIGN="LEFT"
3559VALIGN="TOP"
3560> the hash table</TD
3561></TR
3562><TR
3563><TD
3564WIDTH="20%"
3565ALIGN="RIGHT"
3566VALIGN="TOP"
3567><TT
3568CLASS="PARAMETER"
3569><I
3570>name</I
3571></TT
3572>&nbsp;:</TD
3573><TD
3574WIDTH="80%"
3575ALIGN="LEFT"
3576VALIGN="TOP"
3577> the name of the userdata or NULL</TD
3578></TR
3579><TR
3580><TD
3581WIDTH="20%"
3582ALIGN="RIGHT"
3583VALIGN="TOP"
3584><TT
3585CLASS="PARAMETER"
3586><I
3587>name2</I
3588></TT
3589>&nbsp;:</TD
3590><TD
3591WIDTH="80%"
3592ALIGN="LEFT"
3593VALIGN="TOP"
3594> a second name of the userdata or NULL</TD
3595></TR
3596><TR
3597><TD
3598WIDTH="20%"
3599ALIGN="RIGHT"
3600VALIGN="TOP"
3601><TT
3602CLASS="PARAMETER"
3603><I
3604>name3</I
3605></TT
3606>&nbsp;:</TD
3607><TD
3608WIDTH="80%"
3609ALIGN="LEFT"
3610VALIGN="TOP"
3611> a third name of the userdata or NULL</TD
3612></TR
3613><TR
3614><TD
3615WIDTH="20%"
3616ALIGN="RIGHT"
3617VALIGN="TOP"
3618><TT
3619CLASS="PARAMETER"
3620><I
3621>f</I
3622></TT
3623>&nbsp;:</TD
3624><TD
3625WIDTH="80%"
3626ALIGN="LEFT"
3627VALIGN="TOP"
3628> the scanner function for items in the hash</TD
3629></TR
3630><TR
3631><TD
3632WIDTH="20%"
3633ALIGN="RIGHT"
3634VALIGN="TOP"
3635><TT
3636CLASS="PARAMETER"
3637><I
3638>data</I
3639></TT
3640>&nbsp;:</TD
3641><TD
3642WIDTH="80%"
3643ALIGN="LEFT"
3644VALIGN="TOP"
3645> extra data passed to f</TD
3646></TR
3647></TBODY
3648></TABLE
3649><P
3650></P
3651></DIV
3652></DIV
3653><HR><DIV
3654CLASS="REFSECT2"
3655><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]3656NAME="AEN25403"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3657></A
3658><H3
3659><A
3660NAME="XMLHASHSCANFULL"
3661></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]3662>xmlHashScanFull ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3663><TABLE
3664BORDER="0"
3665BGCOLOR="#D6E8FF"
3666WIDTH="100%"
3667CELLPADDING="6"
3668><TR
3669><TD
3670><PRE
3671CLASS="PROGRAMLISTING"
3672>void xmlHashScanFull (<A
3673HREF="libxml-hash.html#XMLHASHTABLEPTR"
3674>xmlHashTablePtr</A
3675> table,
3676 <A
3677HREF="libxml-hash.html#XMLHASHSCANNERFULL"
3678>xmlHashScannerFull</A
3679> f,
3680 void *data);</PRE
3681></TD
3682></TR
3683></TABLE
3684><P
Daniel Veillardcbaf3992001-12-31 16:16:02 +0000[diff] [blame]3685>Scan the hash <TT
3686CLASS="PARAMETER"
3687><I
3688>table</I
3689></TT
3690> and applied <TT
3691CLASS="PARAMETER"
3692><I
3693>f</I
3694></TT
3695> to each value.</P
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3696><P
3697></P
3698><DIV
3699CLASS="INFORMALTABLE"
3700><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]3701NAME="AEN25413"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3702></A
3703><P
3704></P
3705><TABLE
3706BORDER="0"
3707WIDTH="100%"
3708BGCOLOR="#FFD0D0"
3709CELLSPACING="0"
3710CELLPADDING="4"
3711CLASS="CALSTABLE"
3712><TBODY
3713><TR
3714><TD
3715WIDTH="20%"
3716ALIGN="RIGHT"
3717VALIGN="TOP"
3718><TT
3719CLASS="PARAMETER"
3720><I
3721>table</I
3722></TT
3723>&nbsp;:</TD
3724><TD
3725WIDTH="80%"
3726ALIGN="LEFT"
3727VALIGN="TOP"
3728> the hash table</TD
3729></TR
3730><TR
3731><TD
3732WIDTH="20%"
3733ALIGN="RIGHT"
3734VALIGN="TOP"
3735><TT
3736CLASS="PARAMETER"
3737><I
3738>f</I
3739></TT
3740>&nbsp;:</TD
3741><TD
3742WIDTH="80%"
3743ALIGN="LEFT"
3744VALIGN="TOP"
3745> the scanner function for items in the hash</TD
3746></TR
3747><TR
3748><TD
3749WIDTH="20%"
3750ALIGN="RIGHT"
3751VALIGN="TOP"
3752><TT
3753CLASS="PARAMETER"
3754><I
3755>data</I
3756></TT
3757>&nbsp;:</TD
3758><TD
3759WIDTH="80%"
3760ALIGN="LEFT"
3761VALIGN="TOP"
3762> extra data passed to f</TD
3763></TR
3764></TBODY
3765></TABLE
3766><P
3767></P
3768></DIV
3769></DIV
3770><HR><DIV
3771CLASS="REFSECT2"
3772><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]3773NAME="AEN25430"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3774></A
3775><H3
3776><A
3777NAME="XMLHASHSCANFULL3"
3778></A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]3779>xmlHashScanFull3 ()</H3
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3780><TABLE
3781BORDER="0"
3782BGCOLOR="#D6E8FF"
3783WIDTH="100%"
3784CELLPADDING="6"
3785><TR
3786><TD
3787><PRE
3788CLASS="PROGRAMLISTING"
3789>void xmlHashScanFull3 (<A
3790HREF="libxml-hash.html#XMLHASHTABLEPTR"
3791>xmlHashTablePtr</A
3792> table,
3793 const <A
3794HREF="libxml-tree.html#XMLCHAR"
3795>xmlChar</A
3796> *name,
3797 const <A
3798HREF="libxml-tree.html#XMLCHAR"
3799>xmlChar</A
3800> *name2,
3801 const <A
3802HREF="libxml-tree.html#XMLCHAR"
3803>xmlChar</A
3804> *name3,
3805 <A
3806HREF="libxml-hash.html#XMLHASHSCANNERFULL"
3807>xmlHashScannerFull</A
3808> f,
3809 void *data);</PRE
3810></TD
3811></TR
3812></TABLE
3813><P
Daniel Veillardcbaf3992001-12-31 16:16:02 +0000[diff] [blame]3814>Scan the hash <TT
3815CLASS="PARAMETER"
3816><I
3817>table</I
3818></TT
3819> and applied <TT
3820CLASS="PARAMETER"
3821><I
3822>f</I
3823></TT
3824> to each value matching
3825(<TT
3826CLASS="PARAMETER"
3827><I
3828>name</I
3829></TT
3830>, <TT
3831CLASS="PARAMETER"
3832><I
3833>name2</I
3834></TT
3835>, <TT
3836CLASS="PARAMETER"
3837><I
3838>name3</I
3839></TT
3840>) tuple. If one of the names is null,
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3841the comparison is considered to match.</P
3842><P
3843></P
3844><DIV
3845CLASS="INFORMALTABLE"
3846><A
Daniel Veillardaf43f632002-03-08 15:05:20 +0000[diff] [blame^]3847NAME="AEN25446"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3848></A
3849><P
3850></P
3851><TABLE
3852BORDER="0"
3853WIDTH="100%"
3854BGCOLOR="#FFD0D0"
3855CELLSPACING="0"
3856CELLPADDING="4"
3857CLASS="CALSTABLE"
3858><TBODY
3859><TR
3860><TD
3861WIDTH="20%"
3862ALIGN="RIGHT"
3863VALIGN="TOP"
3864><TT
3865CLASS="PARAMETER"
3866><I
3867>table</I
3868></TT
3869>&nbsp;:</TD
3870><TD
3871WIDTH="80%"
3872ALIGN="LEFT"
3873VALIGN="TOP"
3874> the hash table</TD
3875></TR
3876><TR
3877><TD
3878WIDTH="20%"
3879ALIGN="RIGHT"
3880VALIGN="TOP"
3881><TT
3882CLASS="PARAMETER"
3883><I
3884>name</I
3885></TT
3886>&nbsp;:</TD
3887><TD
3888WIDTH="80%"
3889ALIGN="LEFT"
3890VALIGN="TOP"
3891> the name of the userdata or NULL</TD
3892></TR
3893><TR
3894><TD
3895WIDTH="20%"
3896ALIGN="RIGHT"
3897VALIGN="TOP"
3898><TT
3899CLASS="PARAMETER"
3900><I
3901>name2</I
3902></TT
3903>&nbsp;:</TD
3904><TD
3905WIDTH="80%"
3906ALIGN="LEFT"
3907VALIGN="TOP"
3908> a second name of the userdata or NULL</TD
3909></TR
3910><TR
3911><TD
3912WIDTH="20%"
3913ALIGN="RIGHT"
3914VALIGN="TOP"
3915><TT
3916CLASS="PARAMETER"
3917><I
3918>name3</I
3919></TT
3920>&nbsp;:</TD
3921><TD
3922WIDTH="80%"
3923ALIGN="LEFT"
3924VALIGN="TOP"
3925> a third name of the userdata or NULL</TD
3926></TR
3927><TR
3928><TD
3929WIDTH="20%"
3930ALIGN="RIGHT"
3931VALIGN="TOP"
3932><TT
3933CLASS="PARAMETER"
3934><I
3935>f</I
3936></TT
3937>&nbsp;:</TD
3938><TD
3939WIDTH="80%"
3940ALIGN="LEFT"
3941VALIGN="TOP"
3942> the scanner function for items in the hash</TD
3943></TR
3944><TR
3945><TD
3946WIDTH="20%"
3947ALIGN="RIGHT"
3948VALIGN="TOP"
3949><TT
3950CLASS="PARAMETER"
3951><I
3952>data</I
3953></TT
3954>&nbsp;:</TD
3955><TD
3956WIDTH="80%"
3957ALIGN="LEFT"
3958VALIGN="TOP"
3959> extra data passed to f</TD
3960></TR
3961></TBODY
3962></TABLE
3963><P
3964></P
3965></DIV
3966></DIV
3967></DIV
3968><DIV
3969CLASS="NAVFOOTER"
3970><BR
3971CLEAR="all"><BR><TABLE
3972WIDTH="100%"
3973BORDER="0"
3974BGCOLOR="#000000"
3975CELLPADDING="1"
3976CELLSPACING="0"
3977><TR
3978><TD
3979WIDTH="25%"
3980BGCOLOR="#C00000"
3981ALIGN="left"
3982><A
3983HREF="libxml-encoding.html"
3984><FONT
3985COLOR="#FFFFFF"
3986SIZE="3"
3987><B
3988>&#60;&#60;&#60; Previous Page</B
3989></FONT
3990></A
3991></TD
3992><TD
3993WIDTH="25%"
3994BGCOLOR="#0000C0"
3995ALIGN="center"
3996><FONT
3997COLOR="#FFFFFF"
3998SIZE="3"
3999><B
4000><A
4001HREF="book1.html"
4002><FONT
4003COLOR="#FFFFFF"
4004SIZE="3"
4005><B
4006>Home</B
4007></FONT
4008></A
4009></B
4010></FONT
4011></TD
4012><TD
4013WIDTH="25%"
4014BGCOLOR="#00C000"
4015ALIGN="center"
4016><FONT
4017COLOR="#FFFFFF"
4018SIZE="3"
4019><B
4020><A
4021HREF="libxml-lib.html"
4022><FONT
4023COLOR="#FFFFFF"
4024SIZE="3"
4025><B
4026>Up</B
4027></FONT
4028></A
4029></B
4030></FONT
4031></TD
4032><TD
4033WIDTH="25%"
4034BGCOLOR="#C00000"
4035ALIGN="right"
4036><A
4037HREF="libxml-debugxml.html"
4038><FONT
4039COLOR="#FFFFFF"
4040SIZE="3"
4041><B
4042>Next Page &#62;&#62;&#62;</B
4043></FONT
4044></A
4045></TD
4046></TR
4047><TR
4048><TD
4049COLSPAN="2"
4050ALIGN="left"
4051><FONT
4052COLOR="#FFFFFF"
4053SIZE="3"
4054><B
4055>encoding</B
4056></FONT
4057></TD
4058><TD
4059COLSPAN="2"
4060ALIGN="right"
4061><FONT
4062COLOR="#FFFFFF"
4063SIZE="3"
4064><B
4065>debugXML</B
4066></FONT
4067></TD
4068></TR
4069></TABLE
4070></DIV
4071></BODY
4072></HTML
4073>