Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 795895
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 14, 20262026-05-14T22:33:11+00:00 2026-05-14T22:33:11+00:00

I need to create a hash table that has a key as a string,

  • 0

I need to create a hash table that has a key as a string, and value as an int. I cannot use STL containers on my target. Is there a suitable hash table class for this purpose?

  • 1 1 Answer
  • 1 View
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-14T22:33:12+00:00Added an answer on May 14, 2026 at 10:33 pm

    Here’s a quick a dirty C hash I just wrote. Compiles, but untested locally. Still, the idea is there for you to run with it as needed. The performance of this is completely dependant upon the keyToHash function. My version will not be high performance, but again demonstrates how to do it.

    
    static const int kMaxKeyLength = 31;
    static const int kMaxKeyStringLength = kMaxKeyLength + 1;
    
    struct HashEntry
    {
      int value;
      char key[kMaxKeyLength];
    };
    
    static const char kEmptyHash[2] = "";
    
    static const int kHashPowerofTwo = 10;
    static const int kHashSize = 1 &lt&lt kHashPowerofTwo;
    static const int kHashMask = kHashSize - 1;
    
    static const int kSmallPrimeNumber = 7;
    
    static HashEntry hashTable[kHashSize];
    
    int keyToHash(const char key[])
    {
      assert(strlen(key) &lt kMaxKeyLength);
    
      int hashValue = 0;
      for(int i=0; &lt strlen(key); i++)
      {
        hashValue += key[i];
      }
    
      return hashValue;
    }
    
    bool hashAdd(const char key[], const int value)
    {
      int hashValue = keyToHash(key);
    
      int hashFullSentinal = 0;
      while(strcmp(hashTable[hashValue & kHashMask].key, kEmptyHash))
      {
        hashValue += kSmallPrimeNumber;
    
        if(hashFullSentinal++ &gt= (kHashSize - 1))
        {
          return false;
        }
      }
    
      strcpy(hashTable[hashValue & kHashMask].key, key);
      hashTable[hashValue & kHashMask].value = value;
    
      return true;
    }   
    
    bool hashFind(const char key[], int *value)
    {
      int hashValue = keyToHash(key);
    
      while(strcmp(hashTable[hashValue & kHashMask].key, kEmptyHash))
      {
        if(!strcmp(hashTable[hashValue & kHashMask].key, key))
        {
          *value = hashTable[hashValue & kHashMask].value;
          return true;
        }
      }
    
      return false;
    }
    
    bool hashRemove(const char key[])
    {
      int hashValue = keyToHash(key);
    
      while(strcmp(hashTable[hashValue & kHashMask].key, kEmptyHash))
      {
        if(!strcmp(hashTable[hashValue & kHashMask].key, key))
        {
          hashTable[hashValue & kHashMask].value = 0;
          hashTable[hashValue & kHashMask].key[0] = 0;
          return true;
        }
      }
    
      return false;
    }
    
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.