On Fri, Aug 07, 2009 at 11:06:12AM +0200, Chris Lalancette wrote: > Signed-off-by: Chris Lalancette <clalance(a)redhat.com&gt; > --- > src/hash.c | 2 +- > 1 files changed, 1 insertions(+), 1 deletions(-) > > diff --git a/src/hash.c b/src/hash.c > index bde3a0b..9308c0c 100644 > --- a/src/hash.c > +++ b/src/hash.c > @@ -141,7 +141,7 @@ virHashGrow(virHashTablePtr table, int size) > } > table->size = size; > > - /* If the two loops are merged, there would be situations where > + /* If the two loops are merged, there would be situations where > * a new entry needs to allocated and data copied into it from > * the main table. So instead, we run through the array twice, first > * copying all the elements in the main array (where we can't get ACK