Gitiles
Code Review Sign In
gerrit-public.fairphone.software / platform / external / libxml2 / ef90ba7e3b530a8eb9ed27f57f0ced139b839780 / . / doc / html / libxml-hash.html
blob: 227a5608f5efc563a5555dca9734cc85c75709ee [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 Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]126NAME="AEN24351"
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 Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]134NAME="AEN24354"
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);
173void* (<A
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 Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]527NAME="AEN24452"
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 Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]537NAME="AEN24455"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]538></A
539><H2
540>Details</H2
541><DIV
542CLASS="REFSECT2"
543><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]544NAME="AEN24457"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]545></A
546><H3
547><A
548NAME="XMLHASHTABLE"
549></A
550>struct xmlHashTable</H3
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 Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]570NAME="AEN24462"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]571></A
572><H3
573><A
574NAME="XMLHASHTABLEPTR"
575></A
576>xmlHashTablePtr</H3
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 Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]596NAME="AEN24467"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]597></A
598><H3
599><A
600NAME="XMLHASHDEALLOCATOR"
601></A
602>xmlHashDeallocator ()</H3
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
621></P
622><DIV
623CLASS="INFORMALTABLE"
624><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]625NAME="AEN24473"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]626></A
627><P
628></P
629><TABLE
630BORDER="0"
631WIDTH="100%"
632BGCOLOR="#FFD0D0"
633CELLSPACING="0"
634CELLPADDING="4"
635CLASS="CALSTABLE"
636><TBODY
637><TR
638><TD
639WIDTH="20%"
640ALIGN="RIGHT"
641VALIGN="TOP"
642><TT
643CLASS="PARAMETER"
644><I
645>payload</I
646></TT
647>&nbsp;:</TD
648><TD
649WIDTH="80%"
650ALIGN="LEFT"
651VALIGN="TOP"
652>&nbsp;</TD
653></TR
654><TR
655><TD
656WIDTH="20%"
657ALIGN="RIGHT"
658VALIGN="TOP"
659><TT
660CLASS="PARAMETER"
661><I
662>name</I
663></TT
664>&nbsp;:</TD
665><TD
666WIDTH="80%"
667ALIGN="LEFT"
668VALIGN="TOP"
669>&nbsp;</TD
670></TR
671></TBODY
672></TABLE
673><P
674></P
675></DIV
676></DIV
677><HR><DIV
678CLASS="REFSECT2"
679><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]680NAME="AEN24486"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]681></A
682><H3
683><A
684NAME="XMLHASHCOPIER"
685></A
686>xmlHashCopier ()</H3
687><TABLE
688BORDER="0"
689BGCOLOR="#D6E8FF"
690WIDTH="100%"
691CELLPADDING="6"
692><TR
693><TD
694><PRE
695CLASS="PROGRAMLISTING"
696>void* (*xmlHashCopier) (void *payload,
697 <A
698HREF="libxml-tree.html#XMLCHAR"
699>xmlChar</A
700> *name);</PRE
701></TD
702></TR
703></TABLE
704><P
705></P
706><DIV
707CLASS="INFORMALTABLE"
708><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]709NAME="AEN24492"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]710></A
711><P
712></P
713><TABLE
714BORDER="0"
715WIDTH="100%"
716BGCOLOR="#FFD0D0"
717CELLSPACING="0"
718CELLPADDING="4"
719CLASS="CALSTABLE"
720><TBODY
721><TR
722><TD
723WIDTH="20%"
724ALIGN="RIGHT"
725VALIGN="TOP"
726><TT
727CLASS="PARAMETER"
728><I
729>payload</I
730></TT
731>&nbsp;:</TD
732><TD
733WIDTH="80%"
734ALIGN="LEFT"
735VALIGN="TOP"
736>&nbsp;</TD
737></TR
738><TR
739><TD
740WIDTH="20%"
741ALIGN="RIGHT"
742VALIGN="TOP"
743><TT
744CLASS="PARAMETER"
745><I
746>name</I
747></TT
748>&nbsp;:</TD
749><TD
750WIDTH="80%"
751ALIGN="LEFT"
752VALIGN="TOP"
753>&nbsp;</TD
754></TR
755></TBODY
756></TABLE
757><P
758></P
759></DIV
760></DIV
761><HR><DIV
762CLASS="REFSECT2"
763><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]764NAME="AEN24505"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]765></A
766><H3
767><A
768NAME="XMLHASHSCANNER"
769></A
770>xmlHashScanner ()</H3
771><TABLE
772BORDER="0"
773BGCOLOR="#D6E8FF"
774WIDTH="100%"
775CELLPADDING="6"
776><TR
777><TD
778><PRE
779CLASS="PROGRAMLISTING"
780>void* (*xmlHashScanner) (void *payload,
781 void *data,
782 <A
783HREF="libxml-tree.html#XMLCHAR"
784>xmlChar</A
785> *name);</PRE
786></TD
787></TR
788></TABLE
789><P
790></P
791><DIV
792CLASS="INFORMALTABLE"
793><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]794NAME="AEN24511"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]795></A
796><P
797></P
798><TABLE
799BORDER="0"
800WIDTH="100%"
801BGCOLOR="#FFD0D0"
802CELLSPACING="0"
803CELLPADDING="4"
804CLASS="CALSTABLE"
805><TBODY
806><TR
807><TD
808WIDTH="20%"
809ALIGN="RIGHT"
810VALIGN="TOP"
811><TT
812CLASS="PARAMETER"
813><I
814>payload</I
815></TT
816>&nbsp;:</TD
817><TD
818WIDTH="80%"
819ALIGN="LEFT"
820VALIGN="TOP"
821>&nbsp;</TD
822></TR
823><TR
824><TD
825WIDTH="20%"
826ALIGN="RIGHT"
827VALIGN="TOP"
828><TT
829CLASS="PARAMETER"
830><I
831>data</I
832></TT
833>&nbsp;:</TD
834><TD
835WIDTH="80%"
836ALIGN="LEFT"
837VALIGN="TOP"
838>&nbsp;</TD
839></TR
840><TR
841><TD
842WIDTH="20%"
843ALIGN="RIGHT"
844VALIGN="TOP"
845><TT
846CLASS="PARAMETER"
847><I
848>name</I
849></TT
850>&nbsp;:</TD
851><TD
852WIDTH="80%"
853ALIGN="LEFT"
854VALIGN="TOP"
855>&nbsp;</TD
856></TR
857></TBODY
858></TABLE
859><P
860></P
861></DIV
862></DIV
863><HR><DIV
864CLASS="REFSECT2"
865><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]866NAME="AEN24528"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]867></A
868><H3
869><A
870NAME="XMLHASHSCANNERFULL"
871></A
872>xmlHashScannerFull ()</H3
873><TABLE
874BORDER="0"
875BGCOLOR="#D6E8FF"
876WIDTH="100%"
877CELLPADDING="6"
878><TR
879><TD
880><PRE
881CLASS="PROGRAMLISTING"
882>void (*xmlHashScannerFull) (void *payload,
883 void *data,
884 const <A
885HREF="libxml-tree.html#XMLCHAR"
886>xmlChar</A
887> *name,
888 const <A
889HREF="libxml-tree.html#XMLCHAR"
890>xmlChar</A
891> *name2,
892 const <A
893HREF="libxml-tree.html#XMLCHAR"
894>xmlChar</A
895> *name3);</PRE
896></TD
897></TR
898></TABLE
899><P
900></P
901><DIV
902CLASS="INFORMALTABLE"
903><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]904NAME="AEN24536"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]905></A
906><P
907></P
908><TABLE
909BORDER="0"
910WIDTH="100%"
911BGCOLOR="#FFD0D0"
912CELLSPACING="0"
913CELLPADDING="4"
914CLASS="CALSTABLE"
915><TBODY
916><TR
917><TD
918WIDTH="20%"
919ALIGN="RIGHT"
920VALIGN="TOP"
921><TT
922CLASS="PARAMETER"
923><I
924>payload</I
925></TT
926>&nbsp;:</TD
927><TD
928WIDTH="80%"
929ALIGN="LEFT"
930VALIGN="TOP"
931>&nbsp;</TD
932></TR
933><TR
934><TD
935WIDTH="20%"
936ALIGN="RIGHT"
937VALIGN="TOP"
938><TT
939CLASS="PARAMETER"
940><I
941>data</I
942></TT
943>&nbsp;:</TD
944><TD
945WIDTH="80%"
946ALIGN="LEFT"
947VALIGN="TOP"
948>&nbsp;</TD
949></TR
950><TR
951><TD
952WIDTH="20%"
953ALIGN="RIGHT"
954VALIGN="TOP"
955><TT
956CLASS="PARAMETER"
957><I
958>name</I
959></TT
960>&nbsp;:</TD
961><TD
962WIDTH="80%"
963ALIGN="LEFT"
964VALIGN="TOP"
965>&nbsp;</TD
966></TR
967><TR
968><TD
969WIDTH="20%"
970ALIGN="RIGHT"
971VALIGN="TOP"
972><TT
973CLASS="PARAMETER"
974><I
975>name2</I
976></TT
977>&nbsp;:</TD
978><TD
979WIDTH="80%"
980ALIGN="LEFT"
981VALIGN="TOP"
982>&nbsp;</TD
983></TR
984><TR
985><TD
986WIDTH="20%"
987ALIGN="RIGHT"
988VALIGN="TOP"
989><TT
990CLASS="PARAMETER"
991><I
992>name3</I
993></TT
994>&nbsp;:</TD
995><TD
996WIDTH="80%"
997ALIGN="LEFT"
998VALIGN="TOP"
999>&nbsp;</TD
1000></TR
1001></TBODY
1002></TABLE
1003><P
1004></P
1005></DIV
1006></DIV
1007><HR><DIV
1008CLASS="REFSECT2"
1009><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]1010NAME="AEN24561"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1011></A
1012><H3
1013><A
1014NAME="XMLHASHCREATE"
1015></A
1016>xmlHashCreate ()</H3
1017><TABLE
1018BORDER="0"
1019BGCOLOR="#D6E8FF"
1020WIDTH="100%"
1021CELLPADDING="6"
1022><TR
1023><TD
1024><PRE
1025CLASS="PROGRAMLISTING"
1026><A
1027HREF="libxml-hash.html#XMLHASHTABLEPTR"
1028>xmlHashTablePtr</A
1029> xmlHashCreate (int size);</PRE
1030></TD
1031></TR
1032></TABLE
1033><P
1034>Create a new xmlHashTablePtr.</P
1035><P
1036></P
1037><DIV
1038CLASS="INFORMALTABLE"
1039><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]1040NAME="AEN24568"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1041></A
1042><P
1043></P
1044><TABLE
1045BORDER="0"
1046WIDTH="100%"
1047BGCOLOR="#FFD0D0"
1048CELLSPACING="0"
1049CELLPADDING="4"
1050CLASS="CALSTABLE"
1051><TBODY
1052><TR
1053><TD
1054WIDTH="20%"
1055ALIGN="RIGHT"
1056VALIGN="TOP"
1057><TT
1058CLASS="PARAMETER"
1059><I
1060>size</I
1061></TT
1062>&nbsp;:</TD
1063><TD
1064WIDTH="80%"
1065ALIGN="LEFT"
1066VALIGN="TOP"
1067> the size of the hash table</TD
1068></TR
1069><TR
1070><TD
1071WIDTH="20%"
1072ALIGN="RIGHT"
1073VALIGN="TOP"
1074><I
1075CLASS="EMPHASIS"
1076>Returns</I
1077> :</TD
1078><TD
1079WIDTH="80%"
1080ALIGN="LEFT"
1081VALIGN="TOP"
1082>the newly created object, or NULL if an error occured.</TD
1083></TR
1084></TBODY
1085></TABLE
1086><P
1087></P
1088></DIV
1089></DIV
1090><HR><DIV
1091CLASS="REFSECT2"
1092><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]1093NAME="AEN24581"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1094></A
1095><H3
1096><A
1097NAME="XMLHASHFREE"
1098></A
1099>xmlHashFree ()</H3
1100><TABLE
1101BORDER="0"
1102BGCOLOR="#D6E8FF"
1103WIDTH="100%"
1104CELLPADDING="6"
1105><TR
1106><TD
1107><PRE
1108CLASS="PROGRAMLISTING"
1109>void xmlHashFree (<A
1110HREF="libxml-hash.html#XMLHASHTABLEPTR"
1111>xmlHashTablePtr</A
1112> table,
1113 <A
1114HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
1115>xmlHashDeallocator</A
1116> f);</PRE
1117></TD
1118></TR
1119></TABLE
1120><P
1121>Free the hash table and its contents. The userdata is
1122deallocated with f if provided.</P
1123><P
1124></P
1125><DIV
1126CLASS="INFORMALTABLE"
1127><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]1128NAME="AEN24589"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1129></A
1130><P
1131></P
1132><TABLE
1133BORDER="0"
1134WIDTH="100%"
1135BGCOLOR="#FFD0D0"
1136CELLSPACING="0"
1137CELLPADDING="4"
1138CLASS="CALSTABLE"
1139><TBODY
1140><TR
1141><TD
1142WIDTH="20%"
1143ALIGN="RIGHT"
1144VALIGN="TOP"
1145><TT
1146CLASS="PARAMETER"
1147><I
1148>table</I
1149></TT
1150>&nbsp;:</TD
1151><TD
1152WIDTH="80%"
1153ALIGN="LEFT"
1154VALIGN="TOP"
1155> the hash table</TD
1156></TR
1157><TR
1158><TD
1159WIDTH="20%"
1160ALIGN="RIGHT"
1161VALIGN="TOP"
1162><TT
1163CLASS="PARAMETER"
1164><I
1165>f</I
1166></TT
1167>&nbsp;:</TD
1168><TD
1169WIDTH="80%"
1170ALIGN="LEFT"
1171VALIGN="TOP"
1172> the deallocator function for items in the hash</TD
1173></TR
1174></TBODY
1175></TABLE
1176><P
1177></P
1178></DIV
1179></DIV
1180><HR><DIV
1181CLASS="REFSECT2"
1182><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]1183NAME="AEN24602"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1184></A
1185><H3
1186><A
1187NAME="XMLHASHADDENTRY"
1188></A
1189>xmlHashAddEntry ()</H3
1190><TABLE
1191BORDER="0"
1192BGCOLOR="#D6E8FF"
1193WIDTH="100%"
1194CELLPADDING="6"
1195><TR
1196><TD
1197><PRE
1198CLASS="PROGRAMLISTING"
1199>int xmlHashAddEntry (<A
1200HREF="libxml-hash.html#XMLHASHTABLEPTR"
1201>xmlHashTablePtr</A
1202> table,
1203 const <A
1204HREF="libxml-tree.html#XMLCHAR"
1205>xmlChar</A
1206> *name,
1207 void *userdata);</PRE
1208></TD
1209></TR
1210></TABLE
1211><P
1212>Add the userdata to the hash table. This can later be retrieved
1213by using the name. Duplicate names generate errors.</P
1214><P
1215></P
1216><DIV
1217CLASS="INFORMALTABLE"
1218><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]1219NAME="AEN24610"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1220></A
1221><P
1222></P
1223><TABLE
1224BORDER="0"
1225WIDTH="100%"
1226BGCOLOR="#FFD0D0"
1227CELLSPACING="0"
1228CELLPADDING="4"
1229CLASS="CALSTABLE"
1230><TBODY
1231><TR
1232><TD
1233WIDTH="20%"
1234ALIGN="RIGHT"
1235VALIGN="TOP"
1236><TT
1237CLASS="PARAMETER"
1238><I
1239>table</I
1240></TT
1241>&nbsp;:</TD
1242><TD
1243WIDTH="80%"
1244ALIGN="LEFT"
1245VALIGN="TOP"
1246> the hash table</TD
1247></TR
1248><TR
1249><TD
1250WIDTH="20%"
1251ALIGN="RIGHT"
1252VALIGN="TOP"
1253><TT
1254CLASS="PARAMETER"
1255><I
1256>name</I
1257></TT
1258>&nbsp;:</TD
1259><TD
1260WIDTH="80%"
1261ALIGN="LEFT"
1262VALIGN="TOP"
1263> the name of the userdata</TD
1264></TR
1265><TR
1266><TD
1267WIDTH="20%"
1268ALIGN="RIGHT"
1269VALIGN="TOP"
1270><TT
1271CLASS="PARAMETER"
1272><I
1273>userdata</I
1274></TT
1275>&nbsp;:</TD
1276><TD
1277WIDTH="80%"
1278ALIGN="LEFT"
1279VALIGN="TOP"
1280> a pointer to the userdata</TD
1281></TR
1282><TR
1283><TD
1284WIDTH="20%"
1285ALIGN="RIGHT"
1286VALIGN="TOP"
1287><I
1288CLASS="EMPHASIS"
1289>Returns</I
1290> :</TD
1291><TD
1292WIDTH="80%"
1293ALIGN="LEFT"
1294VALIGN="TOP"
1295>0 the addition succeeded and -1 in case of error.</TD
1296></TR
1297></TBODY
1298></TABLE
1299><P
1300></P
1301></DIV
1302></DIV
1303><HR><DIV
1304CLASS="REFSECT2"
1305><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]1306NAME="AEN24631"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1307></A
1308><H3
1309><A
1310NAME="XMLHASHUPDATEENTRY"
1311></A
1312>xmlHashUpdateEntry ()</H3
1313><TABLE
1314BORDER="0"
1315BGCOLOR="#D6E8FF"
1316WIDTH="100%"
1317CELLPADDING="6"
1318><TR
1319><TD
1320><PRE
1321CLASS="PROGRAMLISTING"
1322>int xmlHashUpdateEntry (<A
1323HREF="libxml-hash.html#XMLHASHTABLEPTR"
1324>xmlHashTablePtr</A
1325> table,
1326 const <A
1327HREF="libxml-tree.html#XMLCHAR"
1328>xmlChar</A
1329> *name,
1330 void *userdata,
1331 <A
1332HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
1333>xmlHashDeallocator</A
1334> f);</PRE
1335></TD
1336></TR
1337></TABLE
1338><P
1339>Add the userdata to the hash table. This can later be retrieved
1340by using the name. Existing entry for this name will be removed
1341and freed with <TT
1342CLASS="PARAMETER"
1343><I
1344>f</I
1345></TT
1346> if found.</P
1347><P
1348></P
1349><DIV
1350CLASS="INFORMALTABLE"
1351><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]1352NAME="AEN24641"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1353></A
1354><P
1355></P
1356><TABLE
1357BORDER="0"
1358WIDTH="100%"
1359BGCOLOR="#FFD0D0"
1360CELLSPACING="0"
1361CELLPADDING="4"
1362CLASS="CALSTABLE"
1363><TBODY
1364><TR
1365><TD
1366WIDTH="20%"
1367ALIGN="RIGHT"
1368VALIGN="TOP"
1369><TT
1370CLASS="PARAMETER"
1371><I
1372>table</I
1373></TT
1374>&nbsp;:</TD
1375><TD
1376WIDTH="80%"
1377ALIGN="LEFT"
1378VALIGN="TOP"
1379> the hash table</TD
1380></TR
1381><TR
1382><TD
1383WIDTH="20%"
1384ALIGN="RIGHT"
1385VALIGN="TOP"
1386><TT
1387CLASS="PARAMETER"
1388><I
1389>name</I
1390></TT
1391>&nbsp;:</TD
1392><TD
1393WIDTH="80%"
1394ALIGN="LEFT"
1395VALIGN="TOP"
1396> the name of the userdata</TD
1397></TR
1398><TR
1399><TD
1400WIDTH="20%"
1401ALIGN="RIGHT"
1402VALIGN="TOP"
1403><TT
1404CLASS="PARAMETER"
1405><I
1406>userdata</I
1407></TT
1408>&nbsp;:</TD
1409><TD
1410WIDTH="80%"
1411ALIGN="LEFT"
1412VALIGN="TOP"
1413> a pointer to the userdata</TD
1414></TR
1415><TR
1416><TD
1417WIDTH="20%"
1418ALIGN="RIGHT"
1419VALIGN="TOP"
1420><TT
1421CLASS="PARAMETER"
1422><I
1423>f</I
1424></TT
1425>&nbsp;:</TD
1426><TD
1427WIDTH="80%"
1428ALIGN="LEFT"
1429VALIGN="TOP"
1430> the deallocator function for replaced item (if any)</TD
1431></TR
1432><TR
1433><TD
1434WIDTH="20%"
1435ALIGN="RIGHT"
1436VALIGN="TOP"
1437><I
1438CLASS="EMPHASIS"
1439>Returns</I
1440> :</TD
1441><TD
1442WIDTH="80%"
1443ALIGN="LEFT"
1444VALIGN="TOP"
1445>0 the addition succeeded and -1 in case of error.</TD
1446></TR
1447></TBODY
1448></TABLE
1449><P
1450></P
1451></DIV
1452></DIV
1453><HR><DIV
1454CLASS="REFSECT2"
1455><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]1456NAME="AEN24666"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1457></A
1458><H3
1459><A
1460NAME="XMLHASHADDENTRY2"
1461></A
1462>xmlHashAddEntry2 ()</H3
1463><TABLE
1464BORDER="0"
1465BGCOLOR="#D6E8FF"
1466WIDTH="100%"
1467CELLPADDING="6"
1468><TR
1469><TD
1470><PRE
1471CLASS="PROGRAMLISTING"
1472>int xmlHashAddEntry2 (<A
1473HREF="libxml-hash.html#XMLHASHTABLEPTR"
1474>xmlHashTablePtr</A
1475> table,
1476 const <A
1477HREF="libxml-tree.html#XMLCHAR"
1478>xmlChar</A
1479> *name,
1480 const <A
1481HREF="libxml-tree.html#XMLCHAR"
1482>xmlChar</A
1483> *name2,
1484 void *userdata);</PRE
1485></TD
1486></TR
1487></TABLE
1488><P
1489>Add the userdata to the hash table. This can later be retrieved
1490by using the (name, name2) tuple. Duplicate tuples generate errors.</P
1491><P
1492></P
1493><DIV
1494CLASS="INFORMALTABLE"
1495><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]1496NAME="AEN24675"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1497></A
1498><P
1499></P
1500><TABLE
1501BORDER="0"
1502WIDTH="100%"
1503BGCOLOR="#FFD0D0"
1504CELLSPACING="0"
1505CELLPADDING="4"
1506CLASS="CALSTABLE"
1507><TBODY
1508><TR
1509><TD
1510WIDTH="20%"
1511ALIGN="RIGHT"
1512VALIGN="TOP"
1513><TT
1514CLASS="PARAMETER"
1515><I
1516>table</I
1517></TT
1518>&nbsp;:</TD
1519><TD
1520WIDTH="80%"
1521ALIGN="LEFT"
1522VALIGN="TOP"
1523> the hash table</TD
1524></TR
1525><TR
1526><TD
1527WIDTH="20%"
1528ALIGN="RIGHT"
1529VALIGN="TOP"
1530><TT
1531CLASS="PARAMETER"
1532><I
1533>name</I
1534></TT
1535>&nbsp;:</TD
1536><TD
1537WIDTH="80%"
1538ALIGN="LEFT"
1539VALIGN="TOP"
1540> the name of the userdata</TD
1541></TR
1542><TR
1543><TD
1544WIDTH="20%"
1545ALIGN="RIGHT"
1546VALIGN="TOP"
1547><TT
1548CLASS="PARAMETER"
1549><I
1550>name2</I
1551></TT
1552>&nbsp;:</TD
1553><TD
1554WIDTH="80%"
1555ALIGN="LEFT"
1556VALIGN="TOP"
1557> a second name of the userdata</TD
1558></TR
1559><TR
1560><TD
1561WIDTH="20%"
1562ALIGN="RIGHT"
1563VALIGN="TOP"
1564><TT
1565CLASS="PARAMETER"
1566><I
1567>userdata</I
1568></TT
1569>&nbsp;:</TD
1570><TD
1571WIDTH="80%"
1572ALIGN="LEFT"
1573VALIGN="TOP"
1574> a pointer to the userdata</TD
1575></TR
1576><TR
1577><TD
1578WIDTH="20%"
1579ALIGN="RIGHT"
1580VALIGN="TOP"
1581><I
1582CLASS="EMPHASIS"
1583>Returns</I
1584> :</TD
1585><TD
1586WIDTH="80%"
1587ALIGN="LEFT"
1588VALIGN="TOP"
1589>0 the addition succeeded and -1 in case of error.</TD
1590></TR
1591></TBODY
1592></TABLE
1593><P
1594></P
1595></DIV
1596></DIV
1597><HR><DIV
1598CLASS="REFSECT2"
1599><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]1600NAME="AEN24700"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1601></A
1602><H3
1603><A
1604NAME="XMLHASHUPDATEENTRY2"
1605></A
1606>xmlHashUpdateEntry2 ()</H3
1607><TABLE
1608BORDER="0"
1609BGCOLOR="#D6E8FF"
1610WIDTH="100%"
1611CELLPADDING="6"
1612><TR
1613><TD
1614><PRE
1615CLASS="PROGRAMLISTING"
1616>int xmlHashUpdateEntry2 (<A
1617HREF="libxml-hash.html#XMLHASHTABLEPTR"
1618>xmlHashTablePtr</A
1619> table,
1620 const <A
1621HREF="libxml-tree.html#XMLCHAR"
1622>xmlChar</A
1623> *name,
1624 const <A
1625HREF="libxml-tree.html#XMLCHAR"
1626>xmlChar</A
1627> *name2,
1628 void *userdata,
1629 <A
1630HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
1631>xmlHashDeallocator</A
1632> f);</PRE
1633></TD
1634></TR
1635></TABLE
1636><P
1637>Add the userdata to the hash table. This can later be retrieved
1638by using the (name, name2) tuple. Existing entry for this tuple will
1639be removed and freed with <TT
1640CLASS="PARAMETER"
1641><I
1642>f</I
1643></TT
1644> if found.</P
1645><P
1646></P
1647><DIV
1648CLASS="INFORMALTABLE"
1649><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]1650NAME="AEN24711"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1651></A
1652><P
1653></P
1654><TABLE
1655BORDER="0"
1656WIDTH="100%"
1657BGCOLOR="#FFD0D0"
1658CELLSPACING="0"
1659CELLPADDING="4"
1660CLASS="CALSTABLE"
1661><TBODY
1662><TR
1663><TD
1664WIDTH="20%"
1665ALIGN="RIGHT"
1666VALIGN="TOP"
1667><TT
1668CLASS="PARAMETER"
1669><I
1670>table</I
1671></TT
1672>&nbsp;:</TD
1673><TD
1674WIDTH="80%"
1675ALIGN="LEFT"
1676VALIGN="TOP"
1677> the hash table</TD
1678></TR
1679><TR
1680><TD
1681WIDTH="20%"
1682ALIGN="RIGHT"
1683VALIGN="TOP"
1684><TT
1685CLASS="PARAMETER"
1686><I
1687>name</I
1688></TT
1689>&nbsp;:</TD
1690><TD
1691WIDTH="80%"
1692ALIGN="LEFT"
1693VALIGN="TOP"
1694> the name of the userdata</TD
1695></TR
1696><TR
1697><TD
1698WIDTH="20%"
1699ALIGN="RIGHT"
1700VALIGN="TOP"
1701><TT
1702CLASS="PARAMETER"
1703><I
1704>name2</I
1705></TT
1706>&nbsp;:</TD
1707><TD
1708WIDTH="80%"
1709ALIGN="LEFT"
1710VALIGN="TOP"
1711> a second name of the userdata</TD
1712></TR
1713><TR
1714><TD
1715WIDTH="20%"
1716ALIGN="RIGHT"
1717VALIGN="TOP"
1718><TT
1719CLASS="PARAMETER"
1720><I
1721>userdata</I
1722></TT
1723>&nbsp;:</TD
1724><TD
1725WIDTH="80%"
1726ALIGN="LEFT"
1727VALIGN="TOP"
1728> a pointer to the userdata</TD
1729></TR
1730><TR
1731><TD
1732WIDTH="20%"
1733ALIGN="RIGHT"
1734VALIGN="TOP"
1735><TT
1736CLASS="PARAMETER"
1737><I
1738>f</I
1739></TT
1740>&nbsp;:</TD
1741><TD
1742WIDTH="80%"
1743ALIGN="LEFT"
1744VALIGN="TOP"
1745> the deallocator function for replaced item (if any)</TD
1746></TR
1747><TR
1748><TD
1749WIDTH="20%"
1750ALIGN="RIGHT"
1751VALIGN="TOP"
1752><I
1753CLASS="EMPHASIS"
1754>Returns</I
1755> :</TD
1756><TD
1757WIDTH="80%"
1758ALIGN="LEFT"
1759VALIGN="TOP"
1760>0 the addition succeeded and -1 in case of error.</TD
1761></TR
1762></TBODY
1763></TABLE
1764><P
1765></P
1766></DIV
1767></DIV
1768><HR><DIV
1769CLASS="REFSECT2"
1770><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]1771NAME="AEN24740"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1772></A
1773><H3
1774><A
1775NAME="XMLHASHADDENTRY3"
1776></A
1777>xmlHashAddEntry3 ()</H3
1778><TABLE
1779BORDER="0"
1780BGCOLOR="#D6E8FF"
1781WIDTH="100%"
1782CELLPADDING="6"
1783><TR
1784><TD
1785><PRE
1786CLASS="PROGRAMLISTING"
1787>int xmlHashAddEntry3 (<A
1788HREF="libxml-hash.html#XMLHASHTABLEPTR"
1789>xmlHashTablePtr</A
1790> table,
1791 const <A
1792HREF="libxml-tree.html#XMLCHAR"
1793>xmlChar</A
1794> *name,
1795 const <A
1796HREF="libxml-tree.html#XMLCHAR"
1797>xmlChar</A
1798> *name2,
1799 const <A
1800HREF="libxml-tree.html#XMLCHAR"
1801>xmlChar</A
1802> *name3,
1803 void *userdata);</PRE
1804></TD
1805></TR
1806></TABLE
1807><P
1808>Add the userdata to the hash table. This can later be retrieved
1809by using the tuple (name, name2, name3). Duplicate entries generate
1810errors.</P
1811><P
1812></P
1813><DIV
1814CLASS="INFORMALTABLE"
1815><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]1816NAME="AEN24750"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1817></A
1818><P
1819></P
1820><TABLE
1821BORDER="0"
1822WIDTH="100%"
1823BGCOLOR="#FFD0D0"
1824CELLSPACING="0"
1825CELLPADDING="4"
1826CLASS="CALSTABLE"
1827><TBODY
1828><TR
1829><TD
1830WIDTH="20%"
1831ALIGN="RIGHT"
1832VALIGN="TOP"
1833><TT
1834CLASS="PARAMETER"
1835><I
1836>table</I
1837></TT
1838>&nbsp;:</TD
1839><TD
1840WIDTH="80%"
1841ALIGN="LEFT"
1842VALIGN="TOP"
1843> the hash table</TD
1844></TR
1845><TR
1846><TD
1847WIDTH="20%"
1848ALIGN="RIGHT"
1849VALIGN="TOP"
1850><TT
1851CLASS="PARAMETER"
1852><I
1853>name</I
1854></TT
1855>&nbsp;:</TD
1856><TD
1857WIDTH="80%"
1858ALIGN="LEFT"
1859VALIGN="TOP"
1860> the name of the userdata</TD
1861></TR
1862><TR
1863><TD
1864WIDTH="20%"
1865ALIGN="RIGHT"
1866VALIGN="TOP"
1867><TT
1868CLASS="PARAMETER"
1869><I
1870>name2</I
1871></TT
1872>&nbsp;:</TD
1873><TD
1874WIDTH="80%"
1875ALIGN="LEFT"
1876VALIGN="TOP"
1877> a second name of the userdata</TD
1878></TR
1879><TR
1880><TD
1881WIDTH="20%"
1882ALIGN="RIGHT"
1883VALIGN="TOP"
1884><TT
1885CLASS="PARAMETER"
1886><I
1887>name3</I
1888></TT
1889>&nbsp;:</TD
1890><TD
1891WIDTH="80%"
1892ALIGN="LEFT"
1893VALIGN="TOP"
1894> a third name of the userdata</TD
1895></TR
1896><TR
1897><TD
1898WIDTH="20%"
1899ALIGN="RIGHT"
1900VALIGN="TOP"
1901><TT
1902CLASS="PARAMETER"
1903><I
1904>userdata</I
1905></TT
1906>&nbsp;:</TD
1907><TD
1908WIDTH="80%"
1909ALIGN="LEFT"
1910VALIGN="TOP"
1911> a pointer to the userdata</TD
1912></TR
1913><TR
1914><TD
1915WIDTH="20%"
1916ALIGN="RIGHT"
1917VALIGN="TOP"
1918><I
1919CLASS="EMPHASIS"
1920>Returns</I
1921> :</TD
1922><TD
1923WIDTH="80%"
1924ALIGN="LEFT"
1925VALIGN="TOP"
1926>0 the addition succeeded and -1 in case of error.</TD
1927></TR
1928></TBODY
1929></TABLE
1930><P
1931></P
1932></DIV
1933></DIV
1934><HR><DIV
1935CLASS="REFSECT2"
1936><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]1937NAME="AEN24779"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1938></A
1939><H3
1940><A
1941NAME="XMLHASHUPDATEENTRY3"
1942></A
1943>xmlHashUpdateEntry3 ()</H3
1944><TABLE
1945BORDER="0"
1946BGCOLOR="#D6E8FF"
1947WIDTH="100%"
1948CELLPADDING="6"
1949><TR
1950><TD
1951><PRE
1952CLASS="PROGRAMLISTING"
1953>int xmlHashUpdateEntry3 (<A
1954HREF="libxml-hash.html#XMLHASHTABLEPTR"
1955>xmlHashTablePtr</A
1956> table,
1957 const <A
1958HREF="libxml-tree.html#XMLCHAR"
1959>xmlChar</A
1960> *name,
1961 const <A
1962HREF="libxml-tree.html#XMLCHAR"
1963>xmlChar</A
1964> *name2,
1965 const <A
1966HREF="libxml-tree.html#XMLCHAR"
1967>xmlChar</A
1968> *name3,
1969 void *userdata,
1970 <A
1971HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
1972>xmlHashDeallocator</A
1973> f);</PRE
1974></TD
1975></TR
1976></TABLE
1977><P
1978>Add the userdata to the hash table. This can later be retrieved
1979by using the tuple (name, name2, name3). Existing entry for this tuple
1980will be removed and freed with <TT
1981CLASS="PARAMETER"
1982><I
1983>f</I
1984></TT
1985> if found.</P
1986><P
1987></P
1988><DIV
1989CLASS="INFORMALTABLE"
1990><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]1991NAME="AEN24791"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]1992></A
1993><P
1994></P
1995><TABLE
1996BORDER="0"
1997WIDTH="100%"
1998BGCOLOR="#FFD0D0"
1999CELLSPACING="0"
2000CELLPADDING="4"
2001CLASS="CALSTABLE"
2002><TBODY
2003><TR
2004><TD
2005WIDTH="20%"
2006ALIGN="RIGHT"
2007VALIGN="TOP"
2008><TT
2009CLASS="PARAMETER"
2010><I
2011>table</I
2012></TT
2013>&nbsp;:</TD
2014><TD
2015WIDTH="80%"
2016ALIGN="LEFT"
2017VALIGN="TOP"
2018> the hash table</TD
2019></TR
2020><TR
2021><TD
2022WIDTH="20%"
2023ALIGN="RIGHT"
2024VALIGN="TOP"
2025><TT
2026CLASS="PARAMETER"
2027><I
2028>name</I
2029></TT
2030>&nbsp;:</TD
2031><TD
2032WIDTH="80%"
2033ALIGN="LEFT"
2034VALIGN="TOP"
2035> the name of the userdata</TD
2036></TR
2037><TR
2038><TD
2039WIDTH="20%"
2040ALIGN="RIGHT"
2041VALIGN="TOP"
2042><TT
2043CLASS="PARAMETER"
2044><I
2045>name2</I
2046></TT
2047>&nbsp;:</TD
2048><TD
2049WIDTH="80%"
2050ALIGN="LEFT"
2051VALIGN="TOP"
2052> a second name of the userdata</TD
2053></TR
2054><TR
2055><TD
2056WIDTH="20%"
2057ALIGN="RIGHT"
2058VALIGN="TOP"
2059><TT
2060CLASS="PARAMETER"
2061><I
2062>name3</I
2063></TT
2064>&nbsp;:</TD
2065><TD
2066WIDTH="80%"
2067ALIGN="LEFT"
2068VALIGN="TOP"
2069> a third name of the userdata</TD
2070></TR
2071><TR
2072><TD
2073WIDTH="20%"
2074ALIGN="RIGHT"
2075VALIGN="TOP"
2076><TT
2077CLASS="PARAMETER"
2078><I
2079>userdata</I
2080></TT
2081>&nbsp;:</TD
2082><TD
2083WIDTH="80%"
2084ALIGN="LEFT"
2085VALIGN="TOP"
2086> a pointer to the userdata</TD
2087></TR
2088><TR
2089><TD
2090WIDTH="20%"
2091ALIGN="RIGHT"
2092VALIGN="TOP"
2093><TT
2094CLASS="PARAMETER"
2095><I
2096>f</I
2097></TT
2098>&nbsp;:</TD
2099><TD
2100WIDTH="80%"
2101ALIGN="LEFT"
2102VALIGN="TOP"
2103> the deallocator function for replaced item (if any)</TD
2104></TR
2105><TR
2106><TD
2107WIDTH="20%"
2108ALIGN="RIGHT"
2109VALIGN="TOP"
2110><I
2111CLASS="EMPHASIS"
2112>Returns</I
2113> :</TD
2114><TD
2115WIDTH="80%"
2116ALIGN="LEFT"
2117VALIGN="TOP"
2118>0 the addition succeeded and -1 in case of error.</TD
2119></TR
2120></TBODY
2121></TABLE
2122><P
2123></P
2124></DIV
2125></DIV
2126><HR><DIV
2127CLASS="REFSECT2"
2128><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]2129NAME="AEN24824"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2130></A
2131><H3
2132><A
2133NAME="XMLHASHREMOVEENTRY"
2134></A
2135>xmlHashRemoveEntry ()</H3
2136><TABLE
2137BORDER="0"
2138BGCOLOR="#D6E8FF"
2139WIDTH="100%"
2140CELLPADDING="6"
2141><TR
2142><TD
2143><PRE
2144CLASS="PROGRAMLISTING"
2145>int xmlHashRemoveEntry (<A
2146HREF="libxml-hash.html#XMLHASHTABLEPTR"
2147>xmlHashTablePtr</A
2148> table,
2149 const <A
2150HREF="libxml-tree.html#XMLCHAR"
2151>xmlChar</A
2152> *name,
2153 <A
2154HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
2155>xmlHashDeallocator</A
2156> f);</PRE
2157></TD
2158></TR
2159></TABLE
2160><P
2161>Find the userdata specified by the (name, name2, name3) tuple and remove
2162it from the hash table. Existing userdata for this tuple will be removed
2163and freed with <TT
2164CLASS="PARAMETER"
2165><I
2166>f</I
2167></TT
2168>.</P
2169><P
2170></P
2171><DIV
2172CLASS="INFORMALTABLE"
2173><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]2174NAME="AEN24834"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2175></A
2176><P
2177></P
2178><TABLE
2179BORDER="0"
2180WIDTH="100%"
2181BGCOLOR="#FFD0D0"
2182CELLSPACING="0"
2183CELLPADDING="4"
2184CLASS="CALSTABLE"
2185><TBODY
2186><TR
2187><TD
2188WIDTH="20%"
2189ALIGN="RIGHT"
2190VALIGN="TOP"
2191><TT
2192CLASS="PARAMETER"
2193><I
2194>table</I
2195></TT
2196>&nbsp;:</TD
2197><TD
2198WIDTH="80%"
2199ALIGN="LEFT"
2200VALIGN="TOP"
2201> the hash table</TD
2202></TR
2203><TR
2204><TD
2205WIDTH="20%"
2206ALIGN="RIGHT"
2207VALIGN="TOP"
2208><TT
2209CLASS="PARAMETER"
2210><I
2211>name</I
2212></TT
2213>&nbsp;:</TD
2214><TD
2215WIDTH="80%"
2216ALIGN="LEFT"
2217VALIGN="TOP"
2218> the name of the userdata</TD
2219></TR
2220><TR
2221><TD
2222WIDTH="20%"
2223ALIGN="RIGHT"
2224VALIGN="TOP"
2225><TT
2226CLASS="PARAMETER"
2227><I
2228>f</I
2229></TT
2230>&nbsp;:</TD
2231><TD
2232WIDTH="80%"
2233ALIGN="LEFT"
2234VALIGN="TOP"
2235> the deallocator function for removed item (if any)</TD
2236></TR
2237><TR
2238><TD
2239WIDTH="20%"
2240ALIGN="RIGHT"
2241VALIGN="TOP"
2242><I
2243CLASS="EMPHASIS"
2244>Returns</I
2245> :</TD
2246><TD
2247WIDTH="80%"
2248ALIGN="LEFT"
2249VALIGN="TOP"
2250>0 if the removal succeeded and -1 in case of error or not found.</TD
2251></TR
2252></TBODY
2253></TABLE
2254><P
2255></P
2256></DIV
2257></DIV
2258><HR><DIV
2259CLASS="REFSECT2"
2260><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]2261NAME="AEN24855"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2262></A
2263><H3
2264><A
2265NAME="XMLHASHREMOVEENTRY2"
2266></A
2267>xmlHashRemoveEntry2 ()</H3
2268><TABLE
2269BORDER="0"
2270BGCOLOR="#D6E8FF"
2271WIDTH="100%"
2272CELLPADDING="6"
2273><TR
2274><TD
2275><PRE
2276CLASS="PROGRAMLISTING"
2277>int xmlHashRemoveEntry2 (<A
2278HREF="libxml-hash.html#XMLHASHTABLEPTR"
2279>xmlHashTablePtr</A
2280> table,
2281 const <A
2282HREF="libxml-tree.html#XMLCHAR"
2283>xmlChar</A
2284> *name,
2285 const <A
2286HREF="libxml-tree.html#XMLCHAR"
2287>xmlChar</A
2288> *name2,
2289 <A
2290HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
2291>xmlHashDeallocator</A
2292> f);</PRE
2293></TD
2294></TR
2295></TABLE
2296><P
2297>Find the userdata specified by the (name, name2, name3) tuple and remove
2298it from the hash table. Existing userdata for this tuple will be removed
2299and freed with <TT
2300CLASS="PARAMETER"
2301><I
2302>f</I
2303></TT
2304>.</P
2305><P
2306></P
2307><DIV
2308CLASS="INFORMALTABLE"
2309><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]2310NAME="AEN24866"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2311></A
2312><P
2313></P
2314><TABLE
2315BORDER="0"
2316WIDTH="100%"
2317BGCOLOR="#FFD0D0"
2318CELLSPACING="0"
2319CELLPADDING="4"
2320CLASS="CALSTABLE"
2321><TBODY
2322><TR
2323><TD
2324WIDTH="20%"
2325ALIGN="RIGHT"
2326VALIGN="TOP"
2327><TT
2328CLASS="PARAMETER"
2329><I
2330>table</I
2331></TT
2332>&nbsp;:</TD
2333><TD
2334WIDTH="80%"
2335ALIGN="LEFT"
2336VALIGN="TOP"
2337> the hash table</TD
2338></TR
2339><TR
2340><TD
2341WIDTH="20%"
2342ALIGN="RIGHT"
2343VALIGN="TOP"
2344><TT
2345CLASS="PARAMETER"
2346><I
2347>name</I
2348></TT
2349>&nbsp;:</TD
2350><TD
2351WIDTH="80%"
2352ALIGN="LEFT"
2353VALIGN="TOP"
2354> the name of the userdata</TD
2355></TR
2356><TR
2357><TD
2358WIDTH="20%"
2359ALIGN="RIGHT"
2360VALIGN="TOP"
2361><TT
2362CLASS="PARAMETER"
2363><I
2364>name2</I
2365></TT
2366>&nbsp;:</TD
2367><TD
2368WIDTH="80%"
2369ALIGN="LEFT"
2370VALIGN="TOP"
2371> a second 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 Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]2414NAME="AEN24891"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2415></A
2416><H3
2417><A
2418NAME="XMLHASHREMOVEENTRY3"
2419></A
2420>xmlHashRemoveEntry3 ()</H3
2421><TABLE
2422BORDER="0"
2423BGCOLOR="#D6E8FF"
2424WIDTH="100%"
2425CELLPADDING="6"
2426><TR
2427><TD
2428><PRE
2429CLASS="PROGRAMLISTING"
2430>int xmlHashRemoveEntry3 (<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 const <A
2443HREF="libxml-tree.html#XMLCHAR"
2444>xmlChar</A
2445> *name3,
2446 <A
2447HREF="libxml-hash.html#XMLHASHDEALLOCATOR"
2448>xmlHashDeallocator</A
2449> f);</PRE
2450></TD
2451></TR
2452></TABLE
2453><P
2454>Find the userdata specified by the (name, name2, name3) tuple and remove
2455it from the hash table. Existing userdata for this tuple will be removed
2456and freed with <TT
2457CLASS="PARAMETER"
2458><I
2459>f</I
2460></TT
2461>.</P
2462><P
2463></P
2464><DIV
2465CLASS="INFORMALTABLE"
2466><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]2467NAME="AEN24903"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2468></A
2469><P
2470></P
2471><TABLE
2472BORDER="0"
2473WIDTH="100%"
2474BGCOLOR="#FFD0D0"
2475CELLSPACING="0"
2476CELLPADDING="4"
2477CLASS="CALSTABLE"
2478><TBODY
2479><TR
2480><TD
2481WIDTH="20%"
2482ALIGN="RIGHT"
2483VALIGN="TOP"
2484><TT
2485CLASS="PARAMETER"
2486><I
2487>table</I
2488></TT
2489>&nbsp;:</TD
2490><TD
2491WIDTH="80%"
2492ALIGN="LEFT"
2493VALIGN="TOP"
2494> the hash table</TD
2495></TR
2496><TR
2497><TD
2498WIDTH="20%"
2499ALIGN="RIGHT"
2500VALIGN="TOP"
2501><TT
2502CLASS="PARAMETER"
2503><I
2504>name</I
2505></TT
2506>&nbsp;:</TD
2507><TD
2508WIDTH="80%"
2509ALIGN="LEFT"
2510VALIGN="TOP"
2511> the name of the userdata</TD
2512></TR
2513><TR
2514><TD
2515WIDTH="20%"
2516ALIGN="RIGHT"
2517VALIGN="TOP"
2518><TT
2519CLASS="PARAMETER"
2520><I
2521>name2</I
2522></TT
2523>&nbsp;:</TD
2524><TD
2525WIDTH="80%"
2526ALIGN="LEFT"
2527VALIGN="TOP"
2528> a second name of the userdata</TD
2529></TR
2530><TR
2531><TD
2532WIDTH="20%"
2533ALIGN="RIGHT"
2534VALIGN="TOP"
2535><TT
2536CLASS="PARAMETER"
2537><I
2538>name3</I
2539></TT
2540>&nbsp;:</TD
2541><TD
2542WIDTH="80%"
2543ALIGN="LEFT"
2544VALIGN="TOP"
2545> a third name of the userdata</TD
2546></TR
2547><TR
2548><TD
2549WIDTH="20%"
2550ALIGN="RIGHT"
2551VALIGN="TOP"
2552><TT
2553CLASS="PARAMETER"
2554><I
2555>f</I
2556></TT
2557>&nbsp;:</TD
2558><TD
2559WIDTH="80%"
2560ALIGN="LEFT"
2561VALIGN="TOP"
2562> the deallocator function for removed item (if any)</TD
2563></TR
2564><TR
2565><TD
2566WIDTH="20%"
2567ALIGN="RIGHT"
2568VALIGN="TOP"
2569><I
2570CLASS="EMPHASIS"
2571>Returns</I
2572> :</TD
2573><TD
2574WIDTH="80%"
2575ALIGN="LEFT"
2576VALIGN="TOP"
2577>0 if the removal succeeded and -1 in case of error or not found.</TD
2578></TR
2579></TBODY
2580></TABLE
2581><P
2582></P
2583></DIV
2584></DIV
2585><HR><DIV
2586CLASS="REFSECT2"
2587><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]2588NAME="AEN24932"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2589></A
2590><H3
2591><A
2592NAME="XMLHASHLOOKUP"
2593></A
2594>xmlHashLookup ()</H3
2595><TABLE
2596BORDER="0"
2597BGCOLOR="#D6E8FF"
2598WIDTH="100%"
2599CELLPADDING="6"
2600><TR
2601><TD
2602><PRE
2603CLASS="PROGRAMLISTING"
2604>void* xmlHashLookup (<A
2605HREF="libxml-hash.html#XMLHASHTABLEPTR"
2606>xmlHashTablePtr</A
2607> table,
2608 const <A
2609HREF="libxml-tree.html#XMLCHAR"
2610>xmlChar</A
2611> *name);</PRE
2612></TD
2613></TR
2614></TABLE
2615><P
2616>Find the userdata specified by the name.</P
2617><P
2618></P
2619><DIV
2620CLASS="INFORMALTABLE"
2621><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]2622NAME="AEN24940"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2623></A
2624><P
2625></P
2626><TABLE
2627BORDER="0"
2628WIDTH="100%"
2629BGCOLOR="#FFD0D0"
2630CELLSPACING="0"
2631CELLPADDING="4"
2632CLASS="CALSTABLE"
2633><TBODY
2634><TR
2635><TD
2636WIDTH="20%"
2637ALIGN="RIGHT"
2638VALIGN="TOP"
2639><TT
2640CLASS="PARAMETER"
2641><I
2642>table</I
2643></TT
2644>&nbsp;:</TD
2645><TD
2646WIDTH="80%"
2647ALIGN="LEFT"
2648VALIGN="TOP"
2649> the hash table</TD
2650></TR
2651><TR
2652><TD
2653WIDTH="20%"
2654ALIGN="RIGHT"
2655VALIGN="TOP"
2656><TT
2657CLASS="PARAMETER"
2658><I
2659>name</I
2660></TT
2661>&nbsp;:</TD
2662><TD
2663WIDTH="80%"
2664ALIGN="LEFT"
2665VALIGN="TOP"
2666> the name of the userdata</TD
2667></TR
2668></TBODY
2669></TABLE
2670><P
2671></P
2672></DIV
2673></DIV
2674><HR><DIV
2675CLASS="REFSECT2"
2676><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]2677NAME="AEN24953"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2678></A
2679><H3
2680><A
2681NAME="XMLHASHLOOKUP2"
2682></A
2683>xmlHashLookup2 ()</H3
2684><TABLE
2685BORDER="0"
2686BGCOLOR="#D6E8FF"
2687WIDTH="100%"
2688CELLPADDING="6"
2689><TR
2690><TD
2691><PRE
2692CLASS="PROGRAMLISTING"
2693>void* xmlHashLookup2 (<A
2694HREF="libxml-hash.html#XMLHASHTABLEPTR"
2695>xmlHashTablePtr</A
2696> table,
2697 const <A
2698HREF="libxml-tree.html#XMLCHAR"
2699>xmlChar</A
2700> *name,
2701 const <A
2702HREF="libxml-tree.html#XMLCHAR"
2703>xmlChar</A
2704> *name2);</PRE
2705></TD
2706></TR
2707></TABLE
2708><P
2709>Find the userdata specified by the (name, name2) tuple.</P
2710><P
2711></P
2712><DIV
2713CLASS="INFORMALTABLE"
2714><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]2715NAME="AEN24962"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2716></A
2717><P
2718></P
2719><TABLE
2720BORDER="0"
2721WIDTH="100%"
2722BGCOLOR="#FFD0D0"
2723CELLSPACING="0"
2724CELLPADDING="4"
2725CLASS="CALSTABLE"
2726><TBODY
2727><TR
2728><TD
2729WIDTH="20%"
2730ALIGN="RIGHT"
2731VALIGN="TOP"
2732><TT
2733CLASS="PARAMETER"
2734><I
2735>table</I
2736></TT
2737>&nbsp;:</TD
2738><TD
2739WIDTH="80%"
2740ALIGN="LEFT"
2741VALIGN="TOP"
2742> the hash table</TD
2743></TR
2744><TR
2745><TD
2746WIDTH="20%"
2747ALIGN="RIGHT"
2748VALIGN="TOP"
2749><TT
2750CLASS="PARAMETER"
2751><I
2752>name</I
2753></TT
2754>&nbsp;:</TD
2755><TD
2756WIDTH="80%"
2757ALIGN="LEFT"
2758VALIGN="TOP"
2759> the name of the userdata</TD
2760></TR
2761><TR
2762><TD
2763WIDTH="20%"
2764ALIGN="RIGHT"
2765VALIGN="TOP"
2766><TT
2767CLASS="PARAMETER"
2768><I
2769>name2</I
2770></TT
2771>&nbsp;:</TD
2772><TD
2773WIDTH="80%"
2774ALIGN="LEFT"
2775VALIGN="TOP"
2776> a second name of the userdata</TD
2777></TR
2778></TBODY
2779></TABLE
2780><P
2781></P
2782></DIV
2783></DIV
2784><HR><DIV
2785CLASS="REFSECT2"
2786><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]2787NAME="AEN24979"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2788></A
2789><H3
2790><A
2791NAME="XMLHASHLOOKUP3"
2792></A
2793>xmlHashLookup3 ()</H3
2794><TABLE
2795BORDER="0"
2796BGCOLOR="#D6E8FF"
2797WIDTH="100%"
2798CELLPADDING="6"
2799><TR
2800><TD
2801><PRE
2802CLASS="PROGRAMLISTING"
2803>void* xmlHashLookup3 (<A
2804HREF="libxml-hash.html#XMLHASHTABLEPTR"
2805>xmlHashTablePtr</A
2806> table,
2807 const <A
2808HREF="libxml-tree.html#XMLCHAR"
2809>xmlChar</A
2810> *name,
2811 const <A
2812HREF="libxml-tree.html#XMLCHAR"
2813>xmlChar</A
2814> *name2,
2815 const <A
2816HREF="libxml-tree.html#XMLCHAR"
2817>xmlChar</A
2818> *name3);</PRE
2819></TD
2820></TR
2821></TABLE
2822><P
2823>Find the userdata specified by the (name, name2, name3) tuple.</P
2824><P
2825></P
2826><DIV
2827CLASS="INFORMALTABLE"
2828><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]2829NAME="AEN24989"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2830></A
2831><P
2832></P
2833><TABLE
2834BORDER="0"
2835WIDTH="100%"
2836BGCOLOR="#FFD0D0"
2837CELLSPACING="0"
2838CELLPADDING="4"
2839CLASS="CALSTABLE"
2840><TBODY
2841><TR
2842><TD
2843WIDTH="20%"
2844ALIGN="RIGHT"
2845VALIGN="TOP"
2846><TT
2847CLASS="PARAMETER"
2848><I
2849>table</I
2850></TT
2851>&nbsp;:</TD
2852><TD
2853WIDTH="80%"
2854ALIGN="LEFT"
2855VALIGN="TOP"
2856> the hash table</TD
2857></TR
2858><TR
2859><TD
2860WIDTH="20%"
2861ALIGN="RIGHT"
2862VALIGN="TOP"
2863><TT
2864CLASS="PARAMETER"
2865><I
2866>name</I
2867></TT
2868>&nbsp;:</TD
2869><TD
2870WIDTH="80%"
2871ALIGN="LEFT"
2872VALIGN="TOP"
2873> the name of the userdata</TD
2874></TR
2875><TR
2876><TD
2877WIDTH="20%"
2878ALIGN="RIGHT"
2879VALIGN="TOP"
2880><TT
2881CLASS="PARAMETER"
2882><I
2883>name2</I
2884></TT
2885>&nbsp;:</TD
2886><TD
2887WIDTH="80%"
2888ALIGN="LEFT"
2889VALIGN="TOP"
2890> a second name of the userdata</TD
2891></TR
2892><TR
2893><TD
2894WIDTH="20%"
2895ALIGN="RIGHT"
2896VALIGN="TOP"
2897><TT
2898CLASS="PARAMETER"
2899><I
2900>name3</I
2901></TT
2902>&nbsp;:</TD
2903><TD
2904WIDTH="80%"
2905ALIGN="LEFT"
2906VALIGN="TOP"
2907> a third name of the userdata</TD
2908></TR
2909></TBODY
2910></TABLE
2911><P
2912></P
2913></DIV
2914></DIV
2915><HR><DIV
2916CLASS="REFSECT2"
2917><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]2918NAME="AEN25010"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2919></A
2920><H3
2921><A
2922NAME="XMLHASHCOPY"
2923></A
2924>xmlHashCopy ()</H3
2925><TABLE
2926BORDER="0"
2927BGCOLOR="#D6E8FF"
2928WIDTH="100%"
2929CELLPADDING="6"
2930><TR
2931><TD
2932><PRE
2933CLASS="PROGRAMLISTING"
2934><A
2935HREF="libxml-hash.html#XMLHASHTABLEPTR"
2936>xmlHashTablePtr</A
2937> xmlHashCopy (<A
2938HREF="libxml-hash.html#XMLHASHTABLEPTR"
2939>xmlHashTablePtr</A
2940> table,
2941 <A
2942HREF="libxml-hash.html#XMLHASHCOPIER"
2943>xmlHashCopier</A
2944> f);</PRE
2945></TD
2946></TR
2947></TABLE
2948><P
2949>Scan the hash table and applied f to each value.</P
2950><P
2951></P
2952><DIV
2953CLASS="INFORMALTABLE"
2954><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]2955NAME="AEN25019"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]2956></A
2957><P
2958></P
2959><TABLE
2960BORDER="0"
2961WIDTH="100%"
2962BGCOLOR="#FFD0D0"
2963CELLSPACING="0"
2964CELLPADDING="4"
2965CLASS="CALSTABLE"
2966><TBODY
2967><TR
2968><TD
2969WIDTH="20%"
2970ALIGN="RIGHT"
2971VALIGN="TOP"
2972><TT
2973CLASS="PARAMETER"
2974><I
2975>table</I
2976></TT
2977>&nbsp;:</TD
2978><TD
2979WIDTH="80%"
2980ALIGN="LEFT"
2981VALIGN="TOP"
2982> the hash table</TD
2983></TR
2984><TR
2985><TD
2986WIDTH="20%"
2987ALIGN="RIGHT"
2988VALIGN="TOP"
2989><TT
2990CLASS="PARAMETER"
2991><I
2992>f</I
2993></TT
2994>&nbsp;:</TD
2995><TD
2996WIDTH="80%"
2997ALIGN="LEFT"
2998VALIGN="TOP"
2999> the copier function for items in the hash</TD
3000></TR
3001><TR
3002><TD
3003WIDTH="20%"
3004ALIGN="RIGHT"
3005VALIGN="TOP"
3006><I
3007CLASS="EMPHASIS"
3008>Returns</I
3009> :</TD
3010><TD
3011WIDTH="80%"
3012ALIGN="LEFT"
3013VALIGN="TOP"
3014>the new table or NULL in case of error.</TD
3015></TR
3016></TBODY
3017></TABLE
3018><P
3019></P
3020></DIV
3021></DIV
3022><HR><DIV
3023CLASS="REFSECT2"
3024><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]3025NAME="AEN25036"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3026></A
3027><H3
3028><A
3029NAME="XMLHASHSIZE"
3030></A
3031>xmlHashSize ()</H3
3032><TABLE
3033BORDER="0"
3034BGCOLOR="#D6E8FF"
3035WIDTH="100%"
3036CELLPADDING="6"
3037><TR
3038><TD
3039><PRE
3040CLASS="PROGRAMLISTING"
3041>int xmlHashSize (<A
3042HREF="libxml-hash.html#XMLHASHTABLEPTR"
3043>xmlHashTablePtr</A
3044> table);</PRE
3045></TD
3046></TR
3047></TABLE
3048><P
3049>Query the number of element installed in the hash table.</P
3050><P
3051></P
3052><DIV
3053CLASS="INFORMALTABLE"
3054><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]3055NAME="AEN25043"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3056></A
3057><P
3058></P
3059><TABLE
3060BORDER="0"
3061WIDTH="100%"
3062BGCOLOR="#FFD0D0"
3063CELLSPACING="0"
3064CELLPADDING="4"
3065CLASS="CALSTABLE"
3066><TBODY
3067><TR
3068><TD
3069WIDTH="20%"
3070ALIGN="RIGHT"
3071VALIGN="TOP"
3072><TT
3073CLASS="PARAMETER"
3074><I
3075>table</I
3076></TT
3077>&nbsp;:</TD
3078><TD
3079WIDTH="80%"
3080ALIGN="LEFT"
3081VALIGN="TOP"
3082> the hash table</TD
3083></TR
3084><TR
3085><TD
3086WIDTH="20%"
3087ALIGN="RIGHT"
3088VALIGN="TOP"
3089><I
3090CLASS="EMPHASIS"
3091>Returns</I
3092> :</TD
3093><TD
3094WIDTH="80%"
3095ALIGN="LEFT"
3096VALIGN="TOP"
3097>the number of elements in the hash table or
3098-1 in case of error</TD
3099></TR
3100></TBODY
3101></TABLE
3102><P
3103></P
3104></DIV
3105></DIV
3106><HR><DIV
3107CLASS="REFSECT2"
3108><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]3109NAME="AEN25056"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3110></A
3111><H3
3112><A
3113NAME="XMLHASHSCAN"
3114></A
3115>xmlHashScan ()</H3
3116><TABLE
3117BORDER="0"
3118BGCOLOR="#D6E8FF"
3119WIDTH="100%"
3120CELLPADDING="6"
3121><TR
3122><TD
3123><PRE
3124CLASS="PROGRAMLISTING"
3125>void xmlHashScan (<A
3126HREF="libxml-hash.html#XMLHASHTABLEPTR"
3127>xmlHashTablePtr</A
3128> table,
3129 <A
3130HREF="libxml-hash.html#XMLHASHSCANNER"
3131>xmlHashScanner</A
3132> f,
3133 void *data);</PRE
3134></TD
3135></TR
3136></TABLE
3137><P
3138>Scan the hash table and applied f to each value.</P
3139><P
3140></P
3141><DIV
3142CLASS="INFORMALTABLE"
3143><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]3144NAME="AEN25064"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3145></A
3146><P
3147></P
3148><TABLE
3149BORDER="0"
3150WIDTH="100%"
3151BGCOLOR="#FFD0D0"
3152CELLSPACING="0"
3153CELLPADDING="4"
3154CLASS="CALSTABLE"
3155><TBODY
3156><TR
3157><TD
3158WIDTH="20%"
3159ALIGN="RIGHT"
3160VALIGN="TOP"
3161><TT
3162CLASS="PARAMETER"
3163><I
3164>table</I
3165></TT
3166>&nbsp;:</TD
3167><TD
3168WIDTH="80%"
3169ALIGN="LEFT"
3170VALIGN="TOP"
3171> the hash table</TD
3172></TR
3173><TR
3174><TD
3175WIDTH="20%"
3176ALIGN="RIGHT"
3177VALIGN="TOP"
3178><TT
3179CLASS="PARAMETER"
3180><I
3181>f</I
3182></TT
3183>&nbsp;:</TD
3184><TD
3185WIDTH="80%"
3186ALIGN="LEFT"
3187VALIGN="TOP"
3188> the scanner function for items in the hash</TD
3189></TR
3190><TR
3191><TD
3192WIDTH="20%"
3193ALIGN="RIGHT"
3194VALIGN="TOP"
3195><TT
3196CLASS="PARAMETER"
3197><I
3198>data</I
3199></TT
3200>&nbsp;:</TD
3201><TD
3202WIDTH="80%"
3203ALIGN="LEFT"
3204VALIGN="TOP"
3205> extra data passed to f</TD
3206></TR
3207></TBODY
3208></TABLE
3209><P
3210></P
3211></DIV
3212></DIV
3213><HR><DIV
3214CLASS="REFSECT2"
3215><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]3216NAME="AEN25081"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3217></A
3218><H3
3219><A
3220NAME="XMLHASHSCAN3"
3221></A
3222>xmlHashScan3 ()</H3
3223><TABLE
3224BORDER="0"
3225BGCOLOR="#D6E8FF"
3226WIDTH="100%"
3227CELLPADDING="6"
3228><TR
3229><TD
3230><PRE
3231CLASS="PROGRAMLISTING"
3232>void xmlHashScan3 (<A
3233HREF="libxml-hash.html#XMLHASHTABLEPTR"
3234>xmlHashTablePtr</A
3235> table,
3236 const <A
3237HREF="libxml-tree.html#XMLCHAR"
3238>xmlChar</A
3239> *name,
3240 const <A
3241HREF="libxml-tree.html#XMLCHAR"
3242>xmlChar</A
3243> *name2,
3244 const <A
3245HREF="libxml-tree.html#XMLCHAR"
3246>xmlChar</A
3247> *name3,
3248 <A
3249HREF="libxml-hash.html#XMLHASHSCANNER"
3250>xmlHashScanner</A
3251> f,
3252 void *data);</PRE
3253></TD
3254></TR
3255></TABLE
3256><P
3257>Scan the hash table and applied f to each value matching
3258(name, name2, name3) tuple. If one of the names is null,
3259the comparison is considered to match.</P
3260><P
3261></P
3262><DIV
3263CLASS="INFORMALTABLE"
3264><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]3265NAME="AEN25092"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3266></A
3267><P
3268></P
3269><TABLE
3270BORDER="0"
3271WIDTH="100%"
3272BGCOLOR="#FFD0D0"
3273CELLSPACING="0"
3274CELLPADDING="4"
3275CLASS="CALSTABLE"
3276><TBODY
3277><TR
3278><TD
3279WIDTH="20%"
3280ALIGN="RIGHT"
3281VALIGN="TOP"
3282><TT
3283CLASS="PARAMETER"
3284><I
3285>table</I
3286></TT
3287>&nbsp;:</TD
3288><TD
3289WIDTH="80%"
3290ALIGN="LEFT"
3291VALIGN="TOP"
3292> the hash table</TD
3293></TR
3294><TR
3295><TD
3296WIDTH="20%"
3297ALIGN="RIGHT"
3298VALIGN="TOP"
3299><TT
3300CLASS="PARAMETER"
3301><I
3302>name</I
3303></TT
3304>&nbsp;:</TD
3305><TD
3306WIDTH="80%"
3307ALIGN="LEFT"
3308VALIGN="TOP"
3309> the name of the userdata or NULL</TD
3310></TR
3311><TR
3312><TD
3313WIDTH="20%"
3314ALIGN="RIGHT"
3315VALIGN="TOP"
3316><TT
3317CLASS="PARAMETER"
3318><I
3319>name2</I
3320></TT
3321>&nbsp;:</TD
3322><TD
3323WIDTH="80%"
3324ALIGN="LEFT"
3325VALIGN="TOP"
3326> a second name of the userdata or NULL</TD
3327></TR
3328><TR
3329><TD
3330WIDTH="20%"
3331ALIGN="RIGHT"
3332VALIGN="TOP"
3333><TT
3334CLASS="PARAMETER"
3335><I
3336>name3</I
3337></TT
3338>&nbsp;:</TD
3339><TD
3340WIDTH="80%"
3341ALIGN="LEFT"
3342VALIGN="TOP"
3343> a third name of the userdata or NULL</TD
3344></TR
3345><TR
3346><TD
3347WIDTH="20%"
3348ALIGN="RIGHT"
3349VALIGN="TOP"
3350><TT
3351CLASS="PARAMETER"
3352><I
3353>f</I
3354></TT
3355>&nbsp;:</TD
3356><TD
3357WIDTH="80%"
3358ALIGN="LEFT"
3359VALIGN="TOP"
3360> the scanner function for items in the hash</TD
3361></TR
3362><TR
3363><TD
3364WIDTH="20%"
3365ALIGN="RIGHT"
3366VALIGN="TOP"
3367><TT
3368CLASS="PARAMETER"
3369><I
3370>data</I
3371></TT
3372>&nbsp;:</TD
3373><TD
3374WIDTH="80%"
3375ALIGN="LEFT"
3376VALIGN="TOP"
3377> extra data passed to f</TD
3378></TR
3379></TBODY
3380></TABLE
3381><P
3382></P
3383></DIV
3384></DIV
3385><HR><DIV
3386CLASS="REFSECT2"
3387><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]3388NAME="AEN25121"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3389></A
3390><H3
3391><A
3392NAME="XMLHASHSCANFULL"
3393></A
3394>xmlHashScanFull ()</H3
3395><TABLE
3396BORDER="0"
3397BGCOLOR="#D6E8FF"
3398WIDTH="100%"
3399CELLPADDING="6"
3400><TR
3401><TD
3402><PRE
3403CLASS="PROGRAMLISTING"
3404>void xmlHashScanFull (<A
3405HREF="libxml-hash.html#XMLHASHTABLEPTR"
3406>xmlHashTablePtr</A
3407> table,
3408 <A
3409HREF="libxml-hash.html#XMLHASHSCANNERFULL"
3410>xmlHashScannerFull</A
3411> f,
3412 void *data);</PRE
3413></TD
3414></TR
3415></TABLE
3416><P
3417>Scan the hash table and applied f to each value.</P
3418><P
3419></P
3420><DIV
3421CLASS="INFORMALTABLE"
3422><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]3423NAME="AEN25129"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3424></A
3425><P
3426></P
3427><TABLE
3428BORDER="0"
3429WIDTH="100%"
3430BGCOLOR="#FFD0D0"
3431CELLSPACING="0"
3432CELLPADDING="4"
3433CLASS="CALSTABLE"
3434><TBODY
3435><TR
3436><TD
3437WIDTH="20%"
3438ALIGN="RIGHT"
3439VALIGN="TOP"
3440><TT
3441CLASS="PARAMETER"
3442><I
3443>table</I
3444></TT
3445>&nbsp;:</TD
3446><TD
3447WIDTH="80%"
3448ALIGN="LEFT"
3449VALIGN="TOP"
3450> the hash table</TD
3451></TR
3452><TR
3453><TD
3454WIDTH="20%"
3455ALIGN="RIGHT"
3456VALIGN="TOP"
3457><TT
3458CLASS="PARAMETER"
3459><I
3460>f</I
3461></TT
3462>&nbsp;:</TD
3463><TD
3464WIDTH="80%"
3465ALIGN="LEFT"
3466VALIGN="TOP"
3467> the scanner function for items in the hash</TD
3468></TR
3469><TR
3470><TD
3471WIDTH="20%"
3472ALIGN="RIGHT"
3473VALIGN="TOP"
3474><TT
3475CLASS="PARAMETER"
3476><I
3477>data</I
3478></TT
3479>&nbsp;:</TD
3480><TD
3481WIDTH="80%"
3482ALIGN="LEFT"
3483VALIGN="TOP"
3484> extra data passed to f</TD
3485></TR
3486></TBODY
3487></TABLE
3488><P
3489></P
3490></DIV
3491></DIV
3492><HR><DIV
3493CLASS="REFSECT2"
3494><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]3495NAME="AEN25146"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3496></A
3497><H3
3498><A
3499NAME="XMLHASHSCANFULL3"
3500></A
3501>xmlHashScanFull3 ()</H3
3502><TABLE
3503BORDER="0"
3504BGCOLOR="#D6E8FF"
3505WIDTH="100%"
3506CELLPADDING="6"
3507><TR
3508><TD
3509><PRE
3510CLASS="PROGRAMLISTING"
3511>void xmlHashScanFull3 (<A
3512HREF="libxml-hash.html#XMLHASHTABLEPTR"
3513>xmlHashTablePtr</A
3514> table,
3515 const <A
3516HREF="libxml-tree.html#XMLCHAR"
3517>xmlChar</A
3518> *name,
3519 const <A
3520HREF="libxml-tree.html#XMLCHAR"
3521>xmlChar</A
3522> *name2,
3523 const <A
3524HREF="libxml-tree.html#XMLCHAR"
3525>xmlChar</A
3526> *name3,
3527 <A
3528HREF="libxml-hash.html#XMLHASHSCANNERFULL"
3529>xmlHashScannerFull</A
3530> f,
3531 void *data);</PRE
3532></TD
3533></TR
3534></TABLE
3535><P
3536>Scan the hash table and applied f to each value matching
3537(name, name2, name3) tuple. If one of the names is null,
3538the comparison is considered to match.</P
3539><P
3540></P
3541><DIV
3542CLASS="INFORMALTABLE"
3543><A
Daniel Veillardef90ba72001-12-07 14:24:22 +0000[diff] [blame^]3544NAME="AEN25157"
Daniel Veillardb36d4fe2001-11-28 13:40:42 +0000[diff] [blame]3545></A
3546><P
3547></P
3548><TABLE
3549BORDER="0"
3550WIDTH="100%"
3551BGCOLOR="#FFD0D0"
3552CELLSPACING="0"
3553CELLPADDING="4"
3554CLASS="CALSTABLE"
3555><TBODY
3556><TR
3557><TD
3558WIDTH="20%"
3559ALIGN="RIGHT"
3560VALIGN="TOP"
3561><TT
3562CLASS="PARAMETER"
3563><I
3564>table</I
3565></TT
3566>&nbsp;:</TD
3567><TD
3568WIDTH="80%"
3569ALIGN="LEFT"
3570VALIGN="TOP"
3571> the hash table</TD
3572></TR
3573><TR
3574><TD
3575WIDTH="20%"
3576ALIGN="RIGHT"
3577VALIGN="TOP"
3578><TT
3579CLASS="PARAMETER"
3580><I
3581>name</I
3582></TT
3583>&nbsp;:</TD
3584><TD
3585WIDTH="80%"
3586ALIGN="LEFT"
3587VALIGN="TOP"
3588> the name of the userdata or NULL</TD
3589></TR
3590><TR
3591><TD
3592WIDTH="20%"
3593ALIGN="RIGHT"
3594VALIGN="TOP"
3595><TT
3596CLASS="PARAMETER"
3597><I
3598>name2</I
3599></TT
3600>&nbsp;:</TD
3601><TD
3602WIDTH="80%"
3603ALIGN="LEFT"
3604VALIGN="TOP"
3605> a second name of the userdata or NULL</TD
3606></TR
3607><TR
3608><TD
3609WIDTH="20%"
3610ALIGN="RIGHT"
3611VALIGN="TOP"
3612><TT
3613CLASS="PARAMETER"
3614><I
3615>name3</I
3616></TT
3617>&nbsp;:</TD
3618><TD
3619WIDTH="80%"
3620ALIGN="LEFT"
3621VALIGN="TOP"
3622> a third name of the userdata or NULL</TD
3623></TR
3624><TR
3625><TD
3626WIDTH="20%"
3627ALIGN="RIGHT"
3628VALIGN="TOP"
3629><TT
3630CLASS="PARAMETER"
3631><I
3632>f</I
3633></TT
3634>&nbsp;:</TD
3635><TD
3636WIDTH="80%"
3637ALIGN="LEFT"
3638VALIGN="TOP"
3639> the scanner function for items in the hash</TD
3640></TR
3641><TR
3642><TD
3643WIDTH="20%"
3644ALIGN="RIGHT"
3645VALIGN="TOP"
3646><TT
3647CLASS="PARAMETER"
3648><I
3649>data</I
3650></TT
3651>&nbsp;:</TD
3652><TD
3653WIDTH="80%"
3654ALIGN="LEFT"
3655VALIGN="TOP"
3656> extra data passed to f</TD
3657></TR
3658></TBODY
3659></TABLE
3660><P
3661></P
3662></DIV
3663></DIV
3664></DIV
3665><DIV
3666CLASS="NAVFOOTER"
3667><BR
3668CLEAR="all"><BR><TABLE
3669WIDTH="100%"
3670BORDER="0"
3671BGCOLOR="#000000"
3672CELLPADDING="1"
3673CELLSPACING="0"
3674><TR
3675><TD
3676WIDTH="25%"
3677BGCOLOR="#C00000"
3678ALIGN="left"
3679><A
3680HREF="libxml-encoding.html"
3681><FONT
3682COLOR="#FFFFFF"
3683SIZE="3"
3684><B
3685>&#60;&#60;&#60; Previous Page</B
3686></FONT
3687></A
3688></TD
3689><TD
3690WIDTH="25%"
3691BGCOLOR="#0000C0"
3692ALIGN="center"
3693><FONT
3694COLOR="#FFFFFF"
3695SIZE="3"
3696><B
3697><A
3698HREF="book1.html"
3699><FONT
3700COLOR="#FFFFFF"
3701SIZE="3"
3702><B
3703>Home</B
3704></FONT
3705></A
3706></B
3707></FONT
3708></TD
3709><TD
3710WIDTH="25%"
3711BGCOLOR="#00C000"
3712ALIGN="center"
3713><FONT
3714COLOR="#FFFFFF"
3715SIZE="3"
3716><B
3717><A
3718HREF="libxml-lib.html"
3719><FONT
3720COLOR="#FFFFFF"
3721SIZE="3"
3722><B
3723>Up</B
3724></FONT
3725></A
3726></B
3727></FONT
3728></TD
3729><TD
3730WIDTH="25%"
3731BGCOLOR="#C00000"
3732ALIGN="right"
3733><A
3734HREF="libxml-debugxml.html"
3735><FONT
3736COLOR="#FFFFFF"
3737SIZE="3"
3738><B
3739>Next Page &#62;&#62;&#62;</B
3740></FONT
3741></A
3742></TD
3743></TR
3744><TR
3745><TD
3746COLSPAN="2"
3747ALIGN="left"
3748><FONT
3749COLOR="#FFFFFF"
3750SIZE="3"
3751><B
3752>encoding</B
3753></FONT
3754></TD
3755><TD
3756COLSPAN="2"
3757ALIGN="right"
3758><FONT
3759COLOR="#FFFFFF"
3760SIZE="3"
3761><B
3762>debugXML</B
3763></FONT
3764></TD
3765></TR
3766></TABLE
3767></DIV
3768></BODY
3769></HTML
3770>