- html - 出于某种原因,IE8 对我的 Sass 文件中继承的 html5 CSS 不友好?
- JMeter 在响应断言中使用 span 标签的问题
- html - 在 :hover and :active? 上具有不同效果的 CSS 动画
- html - 相对于居中的 html 内容固定的 CSS 重复背景?
在此哈希例程中:1.) 我能够添加字符串。2.) 我可以查看我添加的字符串。3.) 当我尝试添加重复的字符串时,它会抛出一个错误,指出该字符串已存在。4.)但是,当我尝试删除哈希表中已存在的相同字符串时, 然后lookup_routine调用哈希函数来获取索引。此时,它会抛出一个与已添加的哈希索引不同的哈希索引。因此,我的删除例程失败了?
我能够理解为什么对于相同的字符串,哈希函数每次计算不同的索引(而相同的逻辑在 View 哈希表例程中起作用)?有人可以帮助我吗?
$ ./a
Press 1 to add an element to the hashtable
Press 2 to delete an element from the hashtable
Press 3 to search the hashtable
Press 4 to view the hashtable
Press 5 to exit
Please enter your choice: 1
Please enter the string :gaura
enters in add_string
DEBUG purpose in hash function:
str passed = gaura
Hashval returned in hash func= 1
hashval = 1
enters in lookup_string
str in lookup_string = gaura
DEBUG purpose in hash function:
str passed = gaura
Hashval returned in hash func= 1
hashval = 1
DEBUG ERROR :element not found in lookup string
DEBUG Purpose
NULL
Inserting...
DEBUG1 : enters here
hashval = 1
String added successfully
Press 1 to add an element to the hashtable
Press 2 to delete an element from the hashtable
Press 3 to search the hashtable
Press 4 to view the hashtable
Press 5 to exit
Please enter your choice: 1
Please enter the string :ayu
enters in add_string
DEBUG purpose in hash function:
str passed = ayu
Hashval returned in hash func= 1
hashval = 1
enters in lookup_string
str in lookup_string = ayu
DEBUG purpose in hash function:
str passed = ayu
Hashval returned in hash func= 1
hashval = 1
returns NULL in lookup_string
DEBUG Purpose
NULL
Inserting...
DEBUG2 : enters here
hashval = 1
String added successfully
Press 1 to add an element to the hashtable
Press 2 to delete an element from the hashtable
Press 3 to search the hashtable
Press 4 to view the hashtable
Press 5 to exit
Please enter your choice: 1
Please enter the string :gaurava
enters in add_string
DEBUG purpose in hash function:
str passed = gaurava
Hashval returned in hash func= 7
hashval = 7
enters in lookup_string
str in lookup_string = gaurava
DEBUG purpose in hash function:
str passed = gaurava
Hashval returned in hash func= 7
hashval = 7
DEBUG ERROR :element not found in lookup string
DEBUG Purpose
NULL
Inserting...
DEBUG1 : enters here
hashval = 7
String added successfully
Press 1 to add an element to the hashtable
Press 2 to delete an element from the hashtable
Press 3 to search the hashtable
Press 4 to view the hashtable
Press 5 to exit
Please enter your choice: 4
Index : i = 1 String = gaura ayu
Index : i = 7 String = gaurava
Press 1 to add an element to the hashtable
Press 2 to delete an element from the hashtable
Press 3 to search the hashtable
Press 4 to view the hashtable
Press 5 to exit
Please enter your choice: 2
Please enter the string you want to delete :gaura
String entered = gaura
enters in delete_string
DEBUG purpose in hash function:
str passed = gaura
Hashval returned in hash func= 0
hashval = 0
enters in lookup_string
str in lookup_string = gaura
DEBUG purpose in hash function:
str passed = gaura
Hashval returned in hash func= 0
hashval = 0
DEBUG ERROR :element not found in lookup string
DEBUG Purpose
Item not present. So, cannot be deleted
Item found in list: Deletion failed
Press 1 to add an element to the hashtable
Press 2 to delete an element from the hashtable
Press 3 to search the hashtable
Press 4 to view the hashtable
Press 5 to exit
Please enter your choice:
==============================================================
我的例程粘贴如下:
#include<stdio.h>
#include<string.h>
struct list
{
char *string;
struct list *next;
};
struct hash_table
{
int size; /* the size of the table */
struct list **table; /* the table elements */
};
struct hash_table * hashtable = NULL;
struct hash_table *create_hash_table(int size)
{
struct hash_table *new_table;
int i;
if (size<1) return NULL; /* invalid size for table */
/* Attempt to allocate memory for the table structure */
if ((new_table = malloc(sizeof(struct hash_table))) == NULL) {
return NULL;
}
/* Attempt to allocate memory for the table itself */
if ((new_table->table = malloc(sizeof(struct list *) * size)) == NULL) {
return NULL;
}
/* Initialize the elements of the table */
for(i=0; i<size; i++)
new_table->table[i] = '\0';
/* Set the table's size */
new_table->size = size;
return new_table;
}
unsigned int hash(struct hash_table *hashtable, char *str)
{
printf("\n DEBUG purpose in hash function:\n");
printf("\n str passed = %s", str);
unsigned int hashval = 0;
int i = 0;
for(; *str != '\0'; str++)
{
hashval += str[i];
i++;
}
hashval = hashval % 10;
printf("\n Hashval returned in hash func= %d", hashval);
return hashval;
}
struct list *lookup_string(struct hash_table *hashtable, char *str)
{
printf("\n enters in lookup_string \n");
printf("\n str in lookup_string = %s",str);
struct list * new_list;
unsigned int hashval = hash(hashtable, str);
printf("\n hashval = %d \n", hashval);
if(hashtable->table[hashval] == NULL)
{
printf("\n DEBUG ERROR :element not found in lookup string \n");
return NULL;
}
/* Go to the correct list based on the hash value and see if str is
* in the list. If it is, return return a pointer to the list element.
* If it isn't, the item isn't in the table, so return NULL.
*/
for(new_list = hashtable->table[hashval]; new_list != NULL;new_list = new_list->next)
{
if (strcmp(str, new_list->string) == 0)
return new_list;
}
printf("\n returns NULL in lookup_string \n");
return NULL;
}
int add_string(struct hash_table *hashtable, char *str)
{
printf("\n enters in add_string \n");
struct list *new_list;
struct list *current_list;
unsigned int hashval = hash(hashtable, str);
printf("\n hashval = %d", hashval);
/* Attempt to allocate memory for list */
if ((new_list = malloc(sizeof(struct list))) == NULL)
{
printf("\n enters here \n");
return 1;
}
/* Does item already exist? */
current_list = lookup_string(hashtable, str);
if (current_list == NULL)
{
printf("\n DEBUG Purpose \n");
printf("\n NULL \n");
}
/* item already exists, don't insert it again. */
if (current_list != NULL)
{
printf("\n Item already present...\n");
return 2;
}
/* Insert into list */
printf("\n Inserting...\n");
new_list->string = strdup(str);
new_list->next = NULL;
//new_list->next = hashtable->table[hashval];
if(hashtable->table[hashval] == NULL)
{
printf("\n DEBUG1 : enters here \n");
printf("\n hashval = %d", hashval);
hashtable->table[hashval] = new_list;
}
else
{
printf("\n DEBUG2 : enters here \n");
printf("\n hashval = %d", hashval);
struct list * temp_list = hashtable->table[hashval];
while(temp_list->next!=NULL)
temp_list = temp_list->next;
temp_list->next = new_list;
// hashtable->table[hashval] = new_list;
}
return 0;
}
int delete_string(struct hash_table *hashtable, char *str)
{
printf("\n enters in delete_string \n");
struct list *new_list;
struct list *current_list;
unsigned int hashval = hash(hashtable, str);
printf("\n hashval = %d", hashval);
/* Does item already exist? */
current_list = lookup_string(hashtable, str);
if (current_list == NULL)
{
printf("\n DEBUG Purpose \n");
printf("\n Item not present. So, cannot be deleted \n");
return 1;
}
/* item exists, delete it. */
if (current_list != NULL)
{
struct list * temp = hashtable->table[hashval];
if(strcmp(temp->string,str) == 0)
{
if(temp->next == NULL)
{
hashtable->table[hashval] = NULL;
free(temp);
}
else
{
hashtable->table[hashval] = temp->next;
free(temp);
}
}
else
{
struct list * temp1;
while(temp->next != NULL)
{
temp1 = temp;
if(strcmp(temp->string, str) == 0)
{
break;
}
else
{
temp = temp->next;
}
}
if(temp->next == NULL)
{
temp1->next = NULL;
free(temp);
}
else
{
temp1->next = temp->next;
free(temp);
}
}
}
return 0;
}
void free_table(struct hash_table *hashtable)
{
int i;
struct list *new_list, *temp_list;
if (hashtable==NULL) return;
/* Free the memory for every item in the table, including the
* strings themselves.
*/
for(i=0; i<hashtable->size; i++) {
new_list = hashtable->table[i];
while(new_list!=NULL) {
temp_list = new_list;
new_list = new_list->next;
free(temp_list->string);
free(temp_list);
}
}
/* Free the table itself */
free(hashtable->table);
free(hashtable);
}
void view_hashtable(struct hash_table * hashtable)
{
int i = 0;
if(hashtable == NULL)
return;
for(i =0; i < hashtable->size; i++)
{
if((hashtable->table[i] == 0) || (strcmp(hashtable->table[i]->string, "*") == 0))
{
continue;
}
printf(" Index : i = %d\t String = %s",i, hashtable->table[i]->string);
struct list * temp = hashtable->table[i]->next;
while(temp != NULL)
{
printf("\t %s",temp->string);
temp = temp->next;
}
printf("\n");
}
}
int main()
{
hashtable = create_hash_table(10);
if(hashtable == NULL)
{
printf("\n Memory allocation failure during creation of hash table \n");
return 0;
}
int flag = 1;
while(flag)
{
int choice;
printf("\n Press 1 to add an element to the hashtable\n");
printf("\n Press 2 to delete an element from the hashtable\n");
printf("\n Press 3 to search the hashtable\n"); printf("\n Press 4 to view the hashtable\n"); printf("\n Press 5 to exit \n");
printf("\n Please enter your choice: ");
scanf("%d",&choice);
if(choice == 5)
flag = 0;
else if(choice == 1)
{
char str[20];
printf("\n Please enter the string :");
scanf("%s",&str);
int i;
i = add_string(hashtable,str);
if(i == 1)
{
printf("\n Memory allocation failure:Choice 1 \n");
return 0;
}
else if(i == 2)
{
printf("\n String already prsent in hash table : Couldnot add it again\n");
return 0;
}
else
{
printf("\n String added successfully \n");
}
}
else if(choice == 2)
{
int i;
struct list * temp_list;
char str[20];
printf("\n Please enter the string you want to delete :");
scanf("%s",&str);
printf("\n String entered = %s", str);
i = delete_string(hashtable,str);
if(i == 0)
{
printf("\n Item found in list: Deletion success \n");
}
else
printf("\n Item found in list: Deletion failed \n");
}
else if(choice == 3)
{
struct list * temp_list;
char str[20];
printf("\n Please enter the string :");
scanf("%s",&str);
temp_list = lookup_string(hashtable,str);
if(!temp_list)
{
printf("\n Item not found in list: Deletion failed \n");
return 0;
}
printf("\n Item found: Present in Hash Table \n");
}
else if(choice == 4)
{
view_hashtable(hashtable);
}
else if(choice == 5)
{
printf("\n Exiting ....");
return 0;
}
else
printf("\n Invalid choice:");
};
free_table(hashtable);
return 0;
}
最佳答案
您的哈希函数运行到字符串末尾,只需执行例如
for(; *str != '\0'; str++)
{
hashval += *str;
}
关于c - 我有一个行为奇怪的 C 哈希例程,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/2855397/
#include using namespace std; class C{ private: int value; public: C(){ value = 0;
这个问题已经有答案了: What is the difference between char a[] = ?string?; and char *p = ?string?;? (8 个回答) 已关闭
关闭。此题需要details or clarity 。目前不接受答案。 想要改进这个问题吗?通过 editing this post 添加详细信息并澄清问题. 已关闭 7 年前。 此帖子已于 8 个月
除了调试之外,是否有任何针对 c、c++ 或 c# 的测试工具,其工作原理类似于将独立函数复制粘贴到某个文本框,然后在其他文本框中输入参数? 最佳答案 也许您会考虑单元测试。我推荐你谷歌测试和谷歌模拟
我想在第二台显示器中移动一个窗口 (HWND)。问题是我尝试了很多方法,例如将分辨率加倍或输入负值,但它永远无法将窗口放在我的第二台显示器上。 关于如何在 C/C++/c# 中执行此操作的任何线索 最
我正在寻找 C/C++/C## 中不同类型 DES 的现有实现。我的运行平台是Windows XP/Vista/7。 我正在尝试编写一个 C# 程序,它将使用 DES 算法进行加密和解密。我需要一些实
很难说出这里要问什么。这个问题模棱两可、含糊不清、不完整、过于宽泛或夸夸其谈,无法以目前的形式得到合理的回答。如需帮助澄清此问题以便重新打开,visit the help center . 关闭 1
有没有办法强制将另一个 窗口置于顶部? 不是应用程序的窗口,而是另一个已经在系统上运行的窗口。 (Windows, C/C++/C#) 最佳答案 SetWindowPos(that_window_ha
假设您可以在 C/C++ 或 Csharp 之间做出选择,并且您打算在 Windows 和 Linux 服务器上运行同一服务器的多个实例,那么构建套接字服务器应用程序的最明智选择是什么? 最佳答案 如
你们能告诉我它们之间的区别吗? 顺便问一下,有什么叫C++库或C库的吗? 最佳答案 C++ 标准库 和 C 标准库 是 C++ 和 C 标准定义的库,提供给 C++ 和 C 程序使用。那是那些词的共同
下面的测试代码,我将输出信息放在注释中。我使用的是 gcc 4.8.5 和 Centos 7.2。 #include #include class C { public:
很难说出这里问的是什么。这个问题是含糊的、模糊的、不完整的、过于宽泛的或修辞性的,无法以目前的形式得到合理的回答。如需帮助澄清此问题以便重新打开它,visit the help center 。 已关
我的客户将使用名为 annoucement 的结构/类与客户通信。我想我会用 C++ 编写服务器。会有很多不同的类继承annoucement。我的问题是通过网络将这些类发送给客户端 我想也许我应该使用
我在 C# 中有以下函数: public Matrix ConcatDescriptors(IList> descriptors) { int cols = descriptors[0].Co
我有一个项目要编写一个函数来对某些数据执行某些操作。我可以用 C/C++ 编写代码,但我不想与雇主共享该函数的代码。相反,我只想让他有权在他自己的代码中调用该函数。是否可以?我想到了这两种方法 - 在
我使用的是编写糟糕的第 3 方 (C/C++) Api。我从托管代码(C++/CLI)中使用它。有时会出现“访问冲突错误”。这使整个应用程序崩溃。我知道我无法处理这些错误[如果指针访问非法内存位置等,
关闭。这个问题不符合Stack Overflow guidelines .它目前不接受答案。 我们不允许提问寻求书籍、工具、软件库等的推荐。您可以编辑问题,以便用事实和引用来回答。 关闭 7 年前。
已关闭。此问题不符合Stack Overflow guidelines 。目前不接受答案。 要求我们推荐或查找工具、库或最喜欢的场外资源的问题对于 Stack Overflow 来说是偏离主题的,因为
我有一些 C 代码,将使用 P/Invoke 从 C# 调用。我正在尝试为这个 C 函数定义一个 C# 等效项。 SomeData* DoSomething(); struct SomeData {
这个问题已经有答案了: Why are these constructs using pre and post-increment undefined behavior? (14 个回答) 已关闭 6
我是一名优秀的程序员,十分优秀!