This is the mail archive of the glibc-bugs@sourceware.org mailing list for the glibc project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

[Bug manual/2510] Possible minor typos


------- Additional Comments From matt at mundell dot ukfsn dot org  2006-04-04 09:59 -------
Oh dear.  Here is the description again.

>From search.texi line 84:

> The mean runtime of this function is @code{*@var{nmemb}}/2.  This
> function should only be used elements often get added to or deleted from

       ... should only be used if elements...

> the array in which case it might not be useful to sort the array before
> searching.


>From search.texi line 250:

> The functions mentioned so far in this chapter are searching in a sorted

                                  ..this chapter are for searching...
                                  ..this chapter search in a sorted...

> or unsorted array.  There are other methods to organize information
> which later should be searched.  The costs of insert, delete and search
> differ.  One possible implementation is using hashing tables.
> The following functions are declared in the the header file @file{search.h}.
>
> @comment search.h
> @comment SVID
> @deftypefun int hcreate (size_t @var{nel})
> > The @code{hcreate} function creates a hashing table which can contain at
> least @var{nel} elements.  There is no possibility to grow this table so
> it is necessary to choose the value for @var{nel} wisely.  The used
> methods to implement this function might make it necessary to make the

Is this sentence correct?  Should it perhaps be "The method used to
implement this function..."?

> number of elements in the hashing table larger than the expected maximal
> number of elements.  Hashing tables usually work inefficient if they are

                                                ...inefficiently...

> filled 80% or more.  The constant access time guaranteed by hashing can
> only be achieved if few collisions exist.  See Knuth's ``The Art of
> Computer Programming, Part 3: Searching and Sorting'' for more
> information.

Thanks.

-- 


http://sourceware.org/bugzilla/show_bug.cgi?id=2510

------- You are receiving this mail because: -------
You are on the CC list for the bug, or are watching someone who is.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]