public inbox for glibc-bugs@sourceware.org
help / color / mirror / Atom feed
From: "matt at mundell dot ukfsn dot org" <sourceware-bugzilla@sourceware.org>
To: glibc-bugs@sources.redhat.com
Subject: [Bug manual/2510] Possible minor typos
Date: Tue, 04 Apr 2006 09:59:00 -0000	[thread overview]
Message-ID: <20060404095901.8247.qmail@sourceware.org> (raw)
In-Reply-To: <20060404095248.2510.matt@mundell.ukfsn.org>


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


  reply	other threads:[~2006-04-04  9:59 UTC|newest]

Thread overview: 4+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2006-04-04  9:52 [Bug manual/2510] New: " matt at mundell dot ukfsn dot org
2006-04-04  9:59 ` matt at mundell dot ukfsn dot org [this message]
2006-10-12  5:26 ` [Bug manual/2510] " cvs-commit at gcc dot gnu dot org
2006-10-12  5:28 ` aj at suse dot de

Reply instructions:

You may reply publicly to this message via plain-text email
using any one of the following methods:

* Save the following mbox file, import it into your mail client,
  and reply-to-all from there: mbox

  Avoid top-posting and favor interleaved quoting:
  https://en.wikipedia.org/wiki/Posting_style#Interleaved_style

* Reply using the --to, --cc, and --in-reply-to
  switches of git-send-email(1):

  git send-email \
    --in-reply-to=20060404095901.8247.qmail@sourceware.org \
    --to=sourceware-bugzilla@sourceware.org \
    --cc=glibc-bugs@sources.redhat.com \
    /path/to/YOUR_REPLY

  https://kernel.org/pub/software/scm/git/docs/git-send-email.html

* If your mail client supports setting the In-Reply-To header
  via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line before the message body.
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).