From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 6546 invoked by alias); 4 Apr 2006 09:52:52 -0000 Received: (qmail 6530 invoked by uid 48); 4 Apr 2006 09:52:49 -0000 Date: Tue, 04 Apr 2006 09:52:00 -0000 From: "matt at mundell dot ukfsn dot org" To: glibc-bugs@sources.redhat.com Message-ID: <20060404095248.2510.matt@mundell.ukfsn.org> Reply-To: sourceware-bugzilla@sourceware.org Subject: [Bug manual/2510] New: Possible minor typos X-Bugzilla-Reason: CC Mailing-List: contact glibc-bugs-help@sourceware.org; run by ezmlm Precedence: bulk List-Subscribe: List-Post: List-Help: , Sender: glibc-bugs-owner@sourceware.org X-SW-Source: 2006-04/txt/msg00055.txt.bz2 List-Id: >>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.