public inbox for glibc-bugs@sourceware.org
help / color / mirror / Atom feed
* [Bug manual/2510] New: Possible minor typos
@ 2006-04-04  9:52 matt at mundell dot ukfsn dot org
  2006-04-04  9:59 ` [Bug manual/2510] " matt at mundell dot ukfsn dot org
                   ` (2 more replies)
  0 siblings, 3 replies; 4+ messages in thread
From: matt at mundell dot ukfsn dot org @ 2006-04-04  9:52 UTC (permalink / raw)
  To: glibc-bugs

>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.

-- 
           Summary: Possible minor typos
           Product: glibc
           Version: unspecified
            Status: NEW
          Severity: minor
          Priority: P3
         Component: manual
        AssignedTo: roland at gnu dot org
        ReportedBy: matt at mundell dot ukfsn dot org
                CC: glibc-bugs at sources dot redhat dot com


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.


^ permalink raw reply	[flat|nested] 4+ messages in thread
end of thread, other threads:[~2006-10-12  5:28 UTC | newest]

Thread overview: 4+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2006-04-04  9:52 [Bug manual/2510] New: Possible minor typos matt at mundell dot ukfsn dot org
2006-04-04  9:59 ` [Bug manual/2510] " matt at mundell dot ukfsn dot org
2006-10-12  5:26 ` cvs-commit at gcc dot gnu dot org
2006-10-12  5:28 ` aj at suse dot de

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).