1
0
Fork 0
cl-sites/HyperSpec-7-0/HyperSpec/Body/f_hash_1.htm
2024-04-01 10:24:07 +02:00

74 lines
4.1 KiB
HTML

<!-- Common Lisp HyperSpec (TM), version 7.0 generated by Kent M. Pitman on Mon, 11-Apr-2005 2:31am EDT -->
<HTML>
<HEAD>
<TITLE>CLHS: Function HASH-TABLE-COUNT</TITLE>
<LINK HREF="../Data/clhs.css" REL="stylesheet" TYPE="text/css" />
<META HTTP-EQUIV="Author" CONTENT="Kent M. Pitman">
<META HTTP-EQUIV="Organization" CONTENT="LispWorks Ltd.">
<LINK REL=TOP HREF="../Front/index.htm">
<LINK REL=COPYRIGHT HREF="../Front/Help.htm#Legal">
<LINK REL=DISCLAIMER HREF="../Front/Help.htm#Disclaimer">
<LINK REL=PREV HREF="f_hash_t.htm">
<LINK REL=UP HREF="c_hash_t.htm">
<LINK REL=NEXT HREF="f_hash_2.htm">
</HEAD>
<BODY>
<H1><A REV=MADE HREF="http://www.lispworks.com/"><IMG WIDTH=80 HEIGHT=65 ALT="[LISPWORKS]" SRC="../Graphics/LWSmall.gif" ALIGN=Bottom></A><A REL=TOP HREF="../Front/index.htm"><IMG WIDTH=237 HEIGHT=65 ALT="[Common Lisp HyperSpec (TM)]" SRC="../Graphics/CLHS_Sm.gif" ALIGN=Bottom></A> <A REL=PREV HREF="f_hash_t.htm"><IMG WIDTH=40 HEIGHT=40 ALT="[Previous]" SRC="../Graphics/Prev.gif" ALIGN=Bottom></A><A REL=UP HREF="c_hash_t.htm"><IMG WIDTH=40 HEIGHT=40 ALT="[Up]" SRC="../Graphics/Up.gif" ALIGN=Bottom></A><A REL=NEXT HREF="f_hash_2.htm"><IMG WIDTH=40 HEIGHT=40 ALT="[Next]" SRC="../Graphics/Next.gif" ALIGN=Bottom></A></H1>
<HR>
<A NAME="hash-table-count"><I>Function</I> <B>HASH-TABLE-COUNT</B></A> <P>
<P><B>Syntax:</B><P>
<P>
<B>hash-table-count</B> <I>hash-table</I> =&gt; <I>count</I><P>
<P>
<P><B>Arguments and Values:</B><P>
<P>
<I>hash-table</I>---a <A REL=DEFINITION HREF="26_glo_h.htm#hash_table"><I>hash table</I></A>. <P>
<I>count</I>---a non-negative <A REL=DEFINITION HREF="26_glo_i.htm#integer"><I>integer</I></A>. <P>
<P><B>Description:</B><P>
<P>
Returns the number of entries in the <I>hash-table</I>. If <I>hash-table</I> has just been created or newly cleared (see <A REL=DEFINITION HREF="f_clrhas.htm#clrhash"><B>clrhash</B></A>) the entry count is <TT>0</TT>. <P>
<P><B>Examples:</B><P>
<P>
<PRE>
(setq table (make-hash-table)) =&gt; #&lt;HASH-TABLE EQL 0/120 32115135&gt;
(hash-table-count table) =&gt; 0
(setf (gethash 57 table) &quot;fifty-seven&quot;) =&gt; &quot;fifty-seven&quot;
(hash-table-count table) =&gt; 1
(dotimes (i 100) (setf (gethash i table) i)) =&gt; NIL
(hash-table-count table) =&gt; 100
</PRE>
</TT> <P>
<P><B>Side Effects:</B> None.
<P>
<P><B>Affected By:</B><P>
<P>
<A REL=DEFINITION HREF="f_clrhas.htm#clrhash"><B>clrhash</B></A>, <A REL=DEFINITION HREF="f_remhas.htm#remhash"><B>remhash</B></A>, <A REL=DEFINITION HREF="m_setf_.htm#setf"><B>setf</B></A> of <A REL=DEFINITION HREF="f_gethas.htm#gethash"><B>gethash</B></A> <P>
<P><B>Exceptional Situations:</B> None.
<P>
<P><B>See Also:</B><P>
<P>
<A REL=DEFINITION HREF="f_hash_4.htm#hash-table-size"><B>hash-table-size</B></A> <P>
<P><B>Notes:</B><P>
<P>
The following relationships are functionally correct, although in practice using <A REL=DEFINITION HREF="#hash-table-count"><B>hash-table-count</B></A> is probably much faster: <P>
<PRE>
(hash-table-count table) ==
(loop for value being the hash-values of table count t) ==
(let ((total 0))
(maphash #'(lambda (key value)
(declare (ignore key value))
(incf total))
table)
total)
</PRE>
</TT> <P>
<HR>
<A REL=NAVIGATOR HREF="../Front/StartPts.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Starting Points]" SRC="../Graphics/StartPts.gif" ALIGN=Bottom></A><A REL=TOC HREF="../Front/Contents.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Contents]" SRC="../Graphics/Contents.gif" ALIGN=Bottom></A><A REL=INDEX HREF="../Front/X_Master.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Index]" SRC="../Graphics/Index.gif" ALIGN=Bottom></A><A REL=INDEX HREF="../Front/X_Symbol.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Symbols]" SRC="../Graphics/Symbols.gif" ALIGN=Bottom></A><A REL=GLOSSARY HREF="../Body/26_a.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Glossary]" SRC="../Graphics/Glossary.gif" ALIGN=Bottom></A><A HREF="../Front/X3J13Iss.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Issues]" SRC="../Graphics/Issues.gif" ALIGN=Bottom></A><BR>
<A REL=COPYRIGHT HREF="../Front/Help.htm#Legal"><I>Copyright 1996-2005, LispWorks Ltd. All rights reserved.</I></A><P>
</BODY>
</HTML>