From a61705dd95d166bbddce6f5e6b64ab63c77f7f69 Mon Sep 17 00:00:00 2001 From: Greg Hurrell Date: Tue, 2 Oct 2012 21:58:36 -0700 Subject: [PATCH] Fix (cosmetic) typos in dict.h --- src/dict.h | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/src/dict.h b/src/dict.h index f480ae53..3a311f17 100644 --- a/src/dict.h +++ b/src/dict.h @@ -1,11 +1,11 @@ /* Hash Tables Implementation. * - * This file implements in memory hash tables with insert/del/replace/find/ - * get-random-element operations. Hash tables will auto resize if needed + * This file implements in-memory hash tables with insert/del/replace/find/ + * get-random-element operations. Hash tables will auto-resize if needed * tables of power of two in size are used, collisions are handled by * chaining. See the source code for more information... :) * - * Copyright (c) 2006-2010, Salvatore Sanfilippo + * Copyright (c) 2006-2012, Salvatore Sanfilippo * All rights reserved. * * Redistribution and use in source and binary forms, with or without @@ -80,7 +80,7 @@ typedef struct dict { int iterators; /* number of iterators currently running */ } dict; -/* If safe is set to 1 this is a safe iteartor, that means, you can call +/* If safe is set to 1 this is a safe iterator, that means, you can call * dictAdd, dictFind, and other functions against the dictionary even while * iterating. Otherwise it is a non safe iterator, and only dictNext() * should be called while iterating. */ -- 2.47.2