cl-cookbook-contrib

[cl-cookbook-contrib] [ cl-cookbook-Bugs-538880 ] First part for the Hash Tables section

[<no...@so...>]

Bugs item #538880, was opened at 2002-04-03 10:56
You can respond by visiting: 
http://sourceforge.net/tracker/?func=detail&atid=447472&aid=538880&group_id=46815

Category: None
Group: None
Status: Open
Resolution: None
Priority: 5
Submitted By: Nobody/Anonymous (nobody)
Assigned to: Nobody/Anonymous (nobody)
Summary: First part for the Hash Tables section

Initial Comment:
Introduction

Hash Tables are a powerful data structure, associating
keys with values in a very efficient way. Hash Tables
are preferred over association lists whenever
performance is an issue and there are more than just a
few key-value pairs to maintain.

Creating a Hash Table

Hash Tables are created using the function
MAKE-HASH-TABLE. It has no required argument. Its most
used optional keyword argument is :TEST, specifying the
function used to test the equality of keys.

Getting a value from a Hash Table

The function GETHASH takes two required arguments: a
key and a hash table. It returns two values: the value
corresponding to the key in the hash table (or NIL if
not found), and a boolean indicating whether the key
was found in the table. That second value is necessary
since NIL is a valid value in a key-value pair, so
getting NIL as first value from GETHASH does not
necessarily mean that the key was not found in the
table.


----------------------------------------------------------------------

You can respond by visiting: 
http://sourceforge.net/tracker/?func=detail&atid=447472&aid=538880&group_id=46815

[cl-cookbook-contrib] [ cl-cookbook-Bugs-538888 ] First part for the Hash Tables section

[<no...@so...>]

Bugs item #538888, was opened at 2002-04-03 19:07
You can respond by visiting: 
http://sourceforge.net/tracker/?func=detail&atid=447472&aid=538888&group_id=46815

Category: None
Group: None
Status: Open
Resolution: None
Priority: 5
Submitted By: Matthieu Villeneuve (mvilleneuve)
Assigned to: Nobody/Anonymous (nobody)
Summary: First part for the Hash Tables section

Initial Comment:
Introduction 

Hash Tables are a powerful data structure, associating
keys with values in a very efficient way. Hash Tables
are often preferred over association lists whenever
performance is an issue, but they introduce a little
overhead that makes assoc lists better if there are
only a few key-value pairs to maintain.

Creating a Hash Table 

Hash Tables are created using the function
MAKE-HASH-TABLE. It has no required argument. Its most
used optional keyword argument is :TEST, specifying the
function used to test the equality of keys. 

Getting a value from a Hash Table 

The function GETHASH takes two required arguments: a
key and a hash table. It returns two values: the value
corresponding to the key in the hash table (or NIL if
not found), and a boolean indicating whether the key
was found in the table. That second value is necessary
since NIL is a valid value in a key-value pair, so
getting NIL as first value from GETHASH does not
necessarily mean that the key was not found in the
table.


----------------------------------------------------------------------

You can respond by visiting: 
http://sourceforge.net/tracker/?func=detail&atid=447472&aid=538888&group_id=46815

Re: [cl-cookbook-contrib] [ cl-cookbook-Bugs-538888 ] First part for the Hash Tables section

[<ed...@ag...>]

Hi Matthieu!

Thanks for your contributions. I've given full developer status to
your Sourceforge account, so you can add these to the cookbook
yourself.[1]

I hope you'll contribute more stuff in the future. In this case I'd
also ask you to subscribe to the cl-cookbook-contrib mailing list.

Thanks in advance,
Edi.


[1] Please don't forget to add your name to the list of contributors
    in index.html and to update the CHANGELOG file.


> Bugs item #538888, was opened at 2002-04-03 19:07
> You can respond by visiting: 
> http://sourceforge.net/tracker/?func=detail&atid=447472&aid=538888&group_id=46815
> 
> Category: None
> Group: None
> Status: Open
> Resolution: None
> Priority: 5
> Submitted By: Matthieu Villeneuve (mvilleneuve)
> Assigned to: Nobody/Anonymous (nobody)
> Summary: First part for the Hash Tables section
> 
> Initial Comment:
> Introduction 
> 
> Hash Tables are a powerful data structure, associating
> keys with values in a very efficient way. Hash Tables
> are often preferred over association lists whenever
> performance is an issue, but they introduce a little
> overhead that makes assoc lists better if there are
> only a few key-value pairs to maintain.
> 
> Creating a Hash Table 
> 
> Hash Tables are created using the function
> MAKE-HASH-TABLE. It has no required argument. Its most
> used optional keyword argument is :TEST, specifying the
> function used to test the equality of keys. 
> 
> Getting a value from a Hash Table 
> 
> The function GETHASH takes two required arguments: a
> key and a hash table. It returns two values: the value
> corresponding to the key in the hash table (or NIL if
> not found), and a boolean indicating whether the key
> was found in the table. That second value is necessary
> since NIL is a valid value in a key-value pair, so
> getting NIL as first value from GETHASH does not
> necessarily mean that the key was not found in the
> table.
> 
> 
> ----------------------------------------------------------------------
> 
> You can respond by visiting: 
> http://sourceforge.net/tracker/?func=detail&atid=447472&aid=538888&group_id=46815
> 
> _______________________________________________
> cl-cookbook-contrib mailing list
> cl-...@li...
> https://lists.sourceforge.net/lists/listinfo/cl-cookbook-contrib
> 

-- 

Dr. Edmund Weitz
Hamburg
Germany

The Common Lisp Cookbook
<http://cl-cookbook.sourceforge.net/>

[cl-cookbook-contrib] [ cl-cookbook-Bugs-538880 ] First part for the Hash Tables section

[<no...@so...>]

Bugs item #538880, was opened at 2002-04-03 18:56
You can respond by visiting: 
http://sourceforge.net/tracker/?func=detail&atid=447472&aid=538880&group_id=46815

Category: None
Group: None
Status: Open
Resolution: None
Priority: 5
Submitted By: Nobody/Anonymous (nobody)
Assigned to: Nobody/Anonymous (nobody)
Summary: First part for the Hash Tables section

Initial Comment:
Introduction

Hash Tables are a powerful data structure, associating
keys with values in a very efficient way. Hash Tables
are preferred over association lists whenever
performance is an issue and there are more than just a
few key-value pairs to maintain.

Creating a Hash Table

Hash Tables are created using the function
MAKE-HASH-TABLE. It has no required argument. Its most
used optional keyword argument is :TEST, specifying the
function used to test the equality of keys.

Getting a value from a Hash Table

The function GETHASH takes two required arguments: a
key and a hash table. It returns two values: the value
corresponding to the key in the hash table (or NIL if
not found), and a boolean indicating whether the key
was found in the table. That second value is necessary
since NIL is a valid value in a key-value pair, so
getting NIL as first value from GETHASH does not
necessarily mean that the key was not found in the
table.


----------------------------------------------------------------------

Comment By: Matthieu Villeneuve (mvilleneuve)
Date: 2002-04-03 19:08

Message:
Logged In: YES 
user_id=504831

Please disregard this one, submitted a bit too early. Refer
to #538888 instead.

----------------------------------------------------------------------

You can respond by visiting: 
http://sourceforge.net/tracker/?func=detail&atid=447472&aid=538880&group_id=46815