summaryrefslogtreecommitdiffstats
path: root/src/misc/hash
diff options
context:
space:
mode:
authorAlan Mishchenko <alanmi@berkeley.edu>2009-04-08 08:01:00 -0700
committerAlan Mishchenko <alanmi@berkeley.edu>2009-04-08 08:01:00 -0700
commitdf6fdd1dffd8ce83dfc4a7868ebdd25241f8f24b (patch)
treed320da2793b6d667ec661827c6efc0a9dd86504d /src/misc/hash
parente3e2918eb8a4750b9ce51de821ea6b58941fe65c (diff)
downloadabc-df6fdd1dffd8ce83dfc4a7868ebdd25241f8f24b.tar.gz
abc-df6fdd1dffd8ce83dfc4a7868ebdd25241f8f24b.tar.bz2
abc-df6fdd1dffd8ce83dfc4a7868ebdd25241f8f24b.zip
Version abc90408
Diffstat (limited to 'src/misc/hash')
-rw-r--r--src/misc/hash/hashFlt.h4
-rw-r--r--src/misc/hash/hashInt.h4
-rw-r--r--src/misc/hash/hashPtr.h4
3 files changed, 6 insertions, 6 deletions
diff --git a/src/misc/hash/hashFlt.h b/src/misc/hash/hashFlt.h
index 43b9dd7f..4b9951cb 100644
--- a/src/misc/hash/hashFlt.h
+++ b/src/misc/hash/hashFlt.h
@@ -309,7 +309,7 @@ static inline void Hash_FltFree( Hash_Flt_t *p ) {
int bin;
Hash_Flt_Entry_t *pEntry;
- // ABC_FREE bins
+ // free bins
for(bin = 0; bin < p->nBins; bin++) {
pEntry = p->pArray[bin];
while(pEntry) {
@@ -318,7 +318,7 @@ static inline void Hash_FltFree( Hash_Flt_t *p ) {
}
}
- // ABC_FREE hash
+ // free hash
ABC_FREE( p->pArray );
ABC_FREE( p );
}
diff --git a/src/misc/hash/hashInt.h b/src/misc/hash/hashInt.h
index 7993e562..f58a9fac 100644
--- a/src/misc/hash/hashInt.h
+++ b/src/misc/hash/hashInt.h
@@ -272,7 +272,7 @@ static inline void Hash_IntFree( Hash_Int_t *p ) {
int bin;
Hash_Int_Entry_t *pEntry, *pTemp;
- // ABC_FREE bins
+ // free bins
for(bin = 0; bin < p->nBins; bin++) {
pEntry = p->pArray[bin];
while(pEntry) {
@@ -282,7 +282,7 @@ static inline void Hash_IntFree( Hash_Int_t *p ) {
}
}
- // ABC_FREE hash
+ // free hash
ABC_FREE( p->pArray );
ABC_FREE( p );
}
diff --git a/src/misc/hash/hashPtr.h b/src/misc/hash/hashPtr.h
index 224e5c84..136250ee 100644
--- a/src/misc/hash/hashPtr.h
+++ b/src/misc/hash/hashPtr.h
@@ -310,7 +310,7 @@ static inline void Hash_PtrFree( Hash_Ptr_t *p ) {
int bin;
Hash_Ptr_Entry_t *pEntry;
- // ABC_FREE bins
+ // free bins
for(bin = 0; bin < p->nBins; bin++) {
pEntry = p->pArray[bin];
while(pEntry) {
@@ -319,7 +319,7 @@ static inline void Hash_PtrFree( Hash_Ptr_t *p ) {
}
}
- // ABC_FREE hash
+ // free hash
ABC_FREE( p->pArray );
ABC_FREE( p );
}