C++ dictionary_hash函数代码示例

OStack程序员社区-中国程序员成长平台 › 门户 › 编程› C++›C++教程

原作者: [db:作者] 来自: [db:来源] 收藏邀请

本文整理汇总了C++中dictionary_hash函数的典型用法代码示例。如果您正苦于以下问题：C++ dictionary_hash函数的具体用法？C++ dictionary_hash怎么用？C++ dictionary_hash使用的例子？那么恭喜您, 这里精选的函数代码示例或许可以为您提供帮助。

在下文中一共展示了dictionary_hash函数的14个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于我们的系统推荐出更棒的C++代码示例。

示例1: dictionary_set

/*--------------------------------------------------------------------------*/
int dictionary_set(dictionary * d, char * key, char * val)
{
	int			i ;
	unsigned	hash ;

	if (d==NULL || key==NULL) return -1 ;

	/* Compute hash for this key */
	hash = dictionary_hash(key) ;
	/* Find if value is already in dictionary */
	if (d->n>0) {
		for (i=0 ; i<d->size ; i++) {
	    if (d->key[i]==NULL)
		continue ;
			if (hash==d->hash[i]) { /* Same hash value */
				if (!strcmp(key, d->key[i])) {	 /* Same key */
					/* Found a value: modify and return */
					if (d->val[i]!=NULL)
						free(d->val[i]);
		    d->val[i] = val ? xstrdup(val) : NULL ;
		    /* Value has been modified: return */
					return 0 ;
				}
			}
		}
	}
	/* Add a new value */
	/* See if dictionary needs to grow */
	if (d->n==d->size) {

		/* Reached maximum size: reallocate dictionary */
		d->val  = (char **)mem_double(d->val,  d->size * sizeof(char*)) ;
		d->key  = (char **)mem_double(d->key,  d->size * sizeof(char*)) ;
		d->hash = (unsigned int *)mem_double(d->hash, d->size * sizeof(unsigned)) ;
	if ((d->val==NULL) || (d->key==NULL) || (d->hash==NULL)) {
	    /* Cannot grow dictionary */
	    return -1 ;
	}
		/* Double size */
		d->size *= 2 ;
	}

    /* Insert key in the first empty slot */
    for (i=0 ; i<d->size ; i++) {
	if (d->key[i]==NULL) {
	    /* Add key here */
	    break ;
	}
    }
	/* Copy key */
	d->key[i]  = xstrdup(key);
    d->val[i]  = val ? xstrdup(val) : NULL ;
	d->hash[i] = hash;
	d->n ++ ;
	return 0 ;
}

开发者ID:jesseweigert，项目名称:waas，代码行数:57，代码来源:dictionary.cpp

示例2: dictionary_unset

/*--------------------------------------------------------------------------*/
void dictionary_unset(dictionary* d, const char* key)
{
    unsigned    hash ;
    size_t      i ;

    if (key == NULL)
    {
        return;
    }

    hash = dictionary_hash(key);

    for (i=0 ; i<(size_t)d->size ; i++)
    {
        if (d->key[i]==NULL)
        {
            continue ;
        }

        /* Compare hash */
        if (hash==d->hash[i])
        {
            /* Compare string, to avoid hash collisions */
            if (!strcmp(key, d->key[i]))
            {
                /* Found key */
                break ;
            }
        }
    }

    if (i>=(size_t)d->size)
        /* Key not found */
    {
        return ;
    }

    free(d->key[i]);
    d->key[i] = NULL ;

    if (d->val[i]!=NULL)
    {
        free(d->val[i]);
        d->val[i] = NULL ;
    }

    d->hash[i] = 0 ;
    d->n -- ;
    return ;
}

开发者ID:freeeyes，项目名称:PSS，代码行数:51，代码来源:dictionary.c

示例3: dictionary_getbufsize

int dictionary_getbufsize(dictionary * d, char * key)
{
	unsigned	hash ;
	int			i ;
	hash = dictionary_hash(key);
	for (i=0 ; i<d->size ; i++) {
        	if (d->key[i]==NULL)
            		continue ;
        	/* Compare hash */ 
		if (hash==d->hash[i]) {
            		/* Compare string, to avoid hash collisions */ 
            		if (!strcmp(key, d->key[i])) {
				return d->bufsize[i] ;
	    		}
		}
	}
	return 0 ;
}

开发者ID:UAF-SuperDARN-OPS，项目名称:SuperDARN_agc，代码行数:18，代码来源:dictionary.c

示例4: Assert

/*--------------------------------------------------------------------------*/
void dictionary_unset
    (LPDICTIONARY lpDict,       // Ptr to workspace dictionary
     LPWCHAR      lpwKey)

{
    UINT hash;
    int  i;

    Assert (lpDict NE NULL);
    Assert (lpwKey NE NULL);

    // Hash the key
    hash = dictionary_hash (lpwKey);

    for (i = 0; i < lpDict->size; i++)
    if (lpDict->key[i] NE NULL)
    {
        /* Compare hash */
        if (hash EQ lpDict->hash[i])
        {
            /* Compare string, to avoid hash collisions */
            if (!lstrcmpW (lpwKey, lpDict->key[i]))
                /* Found key */
                break;
        } // End IF
    } // End FOR/IF

    if (i >= lpDict->size)
        /* Key not found */
        return;

    // Free the key
    free (lpDict->key[i]); lpDict->key[i] = NULL;

    // Free values if they were allocated
    if (lpDict->val[i] NE NULL)
    {
        free (lpDict->val[i]);
        lpDict->val[i] = NULL;
    } // End IF

    lpDict->hash[i] = 0;
    lpDict->n--;
} // End dictionary_unset

开发者ID:PlanetAPL，项目名称:nars2000，代码行数:45，代码来源:dictionary.c

示例5: dictionary_get

/*--------------------------------------------------------------------------*/
static const char * dictionary_get(dictionary * d, const char * key, const char * def)
{
    unsigned    hash ;
    int         i ;

    hash = dictionary_hash(key);
    for (i=0 ; i<d->size ; i++) {
        if (d->key==NULL)
            continue ;
        /* Compare hash */
        if (hash==d->hash[i]) {
            /* Compare string, to avoid hash collisions */
            if (!strcmp(key, d->key[i])) {
                return d->val[i] ;
            }
        }
    }
    return def ;
}

开发者ID:ennorehling，项目名称:iniparser_old，代码行数:20，代码来源:iniparser.c

示例6: dictionary_hash

static t_hash_element *dictionary_get_element(t_dictionary *self, char *key) {
    unsigned int key_hash = dictionary_hash(key, strlen(key));
    int index = key_hash % self->table_max_size;

    t_hash_element *element = self->elements[index];

    if (element == NULL) {
        return NULL;
    }

    do {

        if (element->hashcode == key_hash) {
            return element;
        }

    } while ((element = element->next) != NULL);

    return NULL;
}

开发者ID:agustinmodugno，项目名称:TP-SO，代码行数:20，代码来源:dictionary.c

示例7: dictionary_unset

/*--------------------------------------------------------------------------*/
static void
dictionary_unset (dictionary * d, char * key)
{
    unsigned    hash;
    int         i;

    hash = dictionary_hash (key);

    for (i = 0; i < d->size; i++)
    {
	if (!d->key[i])
	    continue;

	/* Compare hash */
	if (hash == d->hash[i])
      	{
	    /* Compare string, to avoid hash collisions */
	    if (!strcmp (key, d->key[i]))
	    {
		/* Found key */
		break;
	    }
	}
    }

    if (i >= d->size)
	/* Key not found */
	return;

    free (d->key[i]);

    d->key[i] = NULL;
    if (d->val[i])
    {
	free (d->val[i]);
	d->val[i] = NULL;
    }

    d->hash[i] = 0;
    d->n --;
}

开发者ID:bhull2010，项目名称:libcompizfusionconfig-packages，代码行数:42，代码来源:iniparser.c

示例8: iniparser_find_entry

int iniparser_find_entry(
	dictionary	*	ini,
	char		*	entry
)
{
	int		i ;
	int		hash ;
	int		found ;

	found = 0 ;
	hash = dictionary_hash(entry);
	for (i=0 ; i<ini->n ; i++) {
		if (hash==ini->hash[i]) {
			if (!strcmp(entry, ini->key[i])) {
				found = 1 ;
				break ;
			}
		}
	}
	return found ;
}

开发者ID:belen-albeza，项目名称:edivc，代码行数:21，代码来源:mainparse.c

示例9: output

/*--------------------------------------------------------------------------*/
LPWCHAR dictionary_get
    (LPDICTIONARY lpDict,       // Ptr to workspace dictionary
     LPWCHAR      lpwKey,
     LPWCHAR      lpwDef,
     LPINT        lpIndex)      // Ptr to index on output (may be NULL)

{
    UINT hash;
    int  i;

    Assert (lpDict NE NULL);

    // If it's valid, ...
    if (lpIndex NE NULL)
        // Initialize it
        *lpIndex = -1;

    // Hash the key
    hash = dictionary_hash (lpwKey);

    for (i = 0; i < lpDict->size; i++)
    if (lpDict->key[i] NE NULL)
    {
        /* Compare hash */
        if (hash EQ lpDict->hash[i])
        {
            /* Compare string, to avoid hash collisions */
            if (!lstrcmpW (lpwKey, lpDict->key[i]))
            {
                if (lpIndex NE NULL)
                    *lpIndex = i;

                return lpDict->val[i];
            } // End IF
        } // End IF
    } // End FOR/IF

    return lpwDef;
} // End dictionary_get

开发者ID:PlanetAPL，项目名称:nars2000，代码行数:40，代码来源:dictionary.c

示例10: main


//.........这里部分代码省略.........
        }

        /* Change the file mode mask */
        umask(0);

        openlog ("notifmed", LOG_CONS | LOG_PID | LOG_NDELAY, LOG_LOCAL0);
        syslog (LOG_INFO, "Program started by user %d", getuid ());

        if (config_preceeds) {
                char * home = getenv("HOME");
                char * home_path_config = malloc(snprintf(NULL, 0, "%s/%s", home, ".notifmedrc") + 1);
                sprintf(home_path_config, "%s/%s", home, ".notifmedrc");

                if (file_exists(home_path_config)) {
                        dict = iniparser_load(home_path_config);
                } else if (file_exists("/etc/notifmed.rc")) {
                        dict = iniparser_load("/etc/notifmed.rc");
                        /* a config file could also be given as argument
                           } else if (file_exists()) {
                           dict = iniparser_load();*/
                } else {
                        syslog (LOG_INFO, "No configuration file found.");
                        syslog (LOG_INFO, "Using defaults:");
                        syslog (LOG_INFO, "    port = 5586 ; notification_timeout = 5");
                }

                if (!dict) {
                        syslog (LOG_ERR, "Dictionary configuration file problem.");
                        closelog();
                        exit(EXIT_FAILURE);
                }

                int i;
                unsigned int hh=dictionary_hash("server");
                for ( i=0 ; (i<dict->n) && (hh!=dict->hash[i]) ; i++);
                // No "server" section found
                if( i == dict->n ) {
                        syslog (LOG_INFO, "No server section found.");
                        syslog (LOG_INFO, "Using defaults:");
                        syslog (LOG_INFO, "    port = 5586 ; notification_timeout = 5");
                }

                for ( i++ ; ( i < dict->n ) && strncmp(dict->key[i],"server:",6) == 0 ; i++ ) {
                        if (strcmp(dict->key[i],"server:port") == 0) {
                                port = atoi(dict->val[i]);
                        } else if (strcmp(dict->key[i],"server:notification_timeout") == 0) {
                                notification_timeout = atoi(dict->val[i]);
                        }
                }
        }
        syslog (LOG_INFO, "Config found: port=%i - notification_timeout=%i", port, notification_timeout);

        /* Create a new SID for the child process */
        sid = setsid();
        if (sid < 0) {
                syslog (LOG_ERR, "Cannot create a new SID.");
                closelog();
                exit(EXIT_FAILURE);
        }

        // Preparing the network part
        sockfd = socket(AF_INET, SOCK_STREAM, 0);
        if (sockfd < 0) {
                syslog (LOG_ERR, "Cannot open the socket.");
                closelog();
                exit(EXIT_FAILURE);

开发者ID:gsacre，项目名称:notify_me，代码行数:67，代码来源:notifmed.c

示例11: dictionary_set

/*--------------------------------------------------------------------------*/
int dictionary_set(dictionary* d, const char* key, const char* val)
{
    size_t      i ;
    unsigned    hash ;

    if (d==NULL || key==NULL)
    {
        return -1 ;
    }

    /* Compute hash for this key */
    hash = dictionary_hash(key) ;

    /* Find if value is already in dictionary */
    if (d->n>0)
    {
        for (i=0 ; i<(size_t)d->size ; i++)
        {
            if (d->key[i]==NULL)
            {
                continue ;
            }

            if (hash==d->hash[i])   /* Same hash value */
            {
                if (!strcmp(key, d->key[i]))     /* Same key */
                {
                    /* Found a value: modify and return */
                    if (d->val[i]!=NULL)
                    {
                        free(d->val[i]);
                    }

                    d->val[i] = val ? xstrdup(val) : NULL ;
                    /* Value has been modified: return */
                    return 0 ;
                }
            }
        }
    }

    /* Add a new value */
    /* See if dictionary needs to grow */
    if (d->n==d->size)
    {

        /* Reached maximum size: reallocate dictionary */
        d->val  = (char** )mem_double(d->val,  d->size * sizeof *d->val) ;
        d->key  = (char** )mem_double(d->key,  d->size * sizeof *d->key) ;
        d->hash = (unsigned* )mem_double(d->hash, d->size * sizeof *d->hash) ;

        if ((d->val==NULL) || (d->key==NULL) || (d->hash==NULL))
        {
            /* Cannot grow dictionary */
            return -1 ;
        }

        /* Double size */
        d->size *= 2 ;
    }

    /* Insert key in the first empty slot. Start at d->n and wrap at
       d->size. Because d->n < d->size this will necessarily
       terminate. */
    for (i=d->n ; d->key[i] ; )
    {
        if(++i == (size_t)d->size)
        {
            i = 0;
        }
    }

    /* Copy key */
    d->key[i]  = xstrdup(key);
    d->val[i]  = val ? xstrdup(val) : NULL ;
    d->hash[i] = hash;
    d->n ++ ;
    return 0 ;
}

开发者ID:freeeyes，项目名称:PSS，代码行数:80，代码来源:dictionary.c

示例12: dictionary_set

/*--------------------------------------------------------------------------*/
dictionary_value* dictionary_set(dictionary * d, const char * key, char * val, int type, void* ptr,void (*cb)(void))
{
  int i;
  unsigned  hash;

  if (d==NULL || key==NULL)
    return NULL ;

  /* Compute hash for this key */
  hash = dictionary_hash(key) ;
  /* Find if value is already in dictionary */
  if (d->n>0) {
    for (i=0 ; i<d->size ; i++) {
      if (d->key[i]==NULL)
        continue ;
      if (hash==d->hash[i]) { /* Same hash value */
        if (!strcmp(key, d->key[i])) { /* Same key */
          /* Found a value: modify and return */
          if (d->values[i].val!=NULL)
            free(d->values[i].val);

          d->values[i].val  = (val != NULL) ? xstrdup(val) : NULL ;
          /* Value has been modified: return */
          return &d->values[i];
        }
      }
    }
  }

  /* Add a new value */
  /* See if dictionary needs to grow */
  if (d->n==d->size) {
    /* Reached maximum size: reallocate dictionary */
    d->values = (dictionary_value *)mem_double(d->values,  d->size * sizeof(dictionary_value*)) ;
    d->key    = (char **)mem_double(d->key,  d->size * sizeof(char*)) ;
    d->hash   = (unsigned int *)mem_double(d->hash, d->size * sizeof(unsigned)) ;
    if ((d->values==NULL) || (d->key==NULL) || (d->hash==NULL)) {
        /* Cannot grow dictionary */
        return NULL;
    }
    /* Double size */
    d->size *= 2 ;
  }

  /* Insert key in the first empty slot */
  for (i=0 ; i<d->size ; i++) {
    if (d->key[i]==NULL) {
        /* Add key here */
        break ;
    }
  }
  /* Copy key */
  d->key[i]         = xstrdup(key);
  d->values[i].val  = (val != NULL) ? xstrdup(val) : NULL;
  d->values[i].type = type;
  d->values[i].callback = NULL;
  d->values[i].rw = 0;
  d->values[i].scope = -1;
  d->values[i].ptr  = ptr;
  d->hash[i]        = hash;
  d->n ++ ;

  return &d->values[i] ;
}

开发者ID:AdamCDunlap，项目名称:hmc-robot-drivers，代码行数:65，代码来源:dictionary.c

示例13: dictionary_set

/*--------------------------------------------------------------------------*/
static void
dictionary_set (dictionary * d, char * key, char * val)
{
    int         i;
    unsigned    hash;

    if (!d || !key)
	return;

    /* Compute hash for this key */
    hash = dictionary_hash (key);

    /* Find if value is already in blackboard */
    if (d->n > 0)
    {
	for (i = 0; i < d->size; ++i)
	{
	    if (!d->key[i])
		continue;

	    if (hash == d->hash[i])
    	    {
		/* Same hash value */
	    	if (!strcmp (key, d->key[i]))
		{
		    /* Same key */
		    /* Found a value: modify and return */
		    if (d->val[i])
			free (d->val[i]);

		    d->val[i] = val ? strdup (val) : NULL;
		    /* Value has been modified: return */
		    return;
		}
	    }
	}
    }

    /* Add a new value */
    /* See if dictionary needs to grow */
    if (d->n == d->size)
    {
	/* Reached maximum size: reallocate blackboard */
	d->val  = (char **) mem_double (d->val,  d->size * sizeof (char*));
	d->key  = (char **) mem_double (d->key,  d->size * sizeof (char*));
	d->hash = (unsigned int *) mem_double (d->hash,
					       d->size * sizeof (unsigned));

	/* Double size */
	d->size *= 2;
    }

    /* Insert key in the first empty slot */
    for (i = 0; i < d->size; ++i)
    {
	if (!d->key[i])
	{
	    /* Add key here */
    	    break;
	}
    }

    /* Copy key */
    d->key[i]  = strdup (key);
    d->val[i]  = val ? strdup (val) : NULL;
    d->hash[i] = hash;
    ++d->n;
}

开发者ID:Jubei-Mitsuyoshi，项目名称:aaa-compiz，代码行数:69，代码来源:iniparser.c

示例14: Test_dictionary_hash

void Test_dictionary_hash(CuTest *tc)
{
    /* NULL test */
    CuAssertIntEquals(tc, 0, dictionary_hash(NULL));
}

开发者ID:DelusionalLogic，项目名称:iniparser，代码行数:5，代码来源:test_dictionary.c

注：本文中的dictionary_hash函数示例由纯净天空整理自Github/MSDocs等源码及文档管理平台，相关代码片段筛选自各路编程大神贡献的开源项目，源码版权归原作者所有，传播和使用请参考对应项目的License；未经允许，请勿转载。

鲜花

握手

雷人

路过

鸡蛋

该文章已有0人参与评论

请发表评论

全部评论

专题导读

More+

10-27 六六分期app的软件客服如何联系？(六六分期

11-06 可心卡盟:win10系统火狐flash插件崩溃怎么

11-06 亲亲特价:怎么删除回收站图标

11-06 济南大学虚拟社区:鲁大师节能降温的具体办

11-06 xlueops.exe:无线网络安装向导

11-06 女斗合众国:win7系统cf与主机连接不稳定怎

11-06 0xc000022-[cf烟雾头]cf怎么调烟雾头

11-06 qizideyouhuo:应用程序无法正常启动0xc0000

11-06 ipz-185:win7系统vcf文件怎么打开

11-06 傻哥蹦迪:win10系统s4怎么打开usb调试

11-06 八神浩树gtaste:回收站清空了怎么恢复

11-06 妖尾之黑色守护:win10系统电脑没有1440x900

11-06 校园至尊魔王小说:win7系统浏览网页时字体

11-06 女斗合众国:win10系统访问共享文件夹提示请

11-06 tokyo hot n0654:恢复win7系统默认字体一招

11-06 雨酷仙境:设置win7系统转移临时文件夹腾出

11-06 阿穆纳伊之杖:win7系统开始菜单在右边还原

11-06 tunespotting:win10系统火狐flash插件总是

11-06 甘尔葛分析师：计谋网站seo关键词暴涨有什

11-06 蔡贵霖: 计谋网站seo关键词暴涨有什么秘密

11-06 博益网首页:ao3网页版进入不了解决方法

11-06 漏斗子专栏: 网站数据分析小白易懂精华篇

11-06 见证双虹怎么做:win7系统开启telnet命令的

11-06 颾狐蝶蜋:系统资源不足无法完成请求的服务

11-06 国光中学校歌:提交网站到alexa查询详细步骤

11-06 西安有情天:静态网页和动态网页的区别

11-06 红木雅尚斋:外部链接构造对网站的好处

11-06 前官礼遇：防止域名劫持–增强域安全性的10

11-06 密传二转答案: 中文分词算法有哪些

11-06 金泉家园邮编:百度快照劫持的表现及应对方

C++ dictionary_new函数代码示例发布时间：2022-05-30

C++ dictionary_get函数代码示例发布时间：2022-05-30

剪的笔顺,诠释剪的笔画,认识剪的部首

1 六六分期app的软件客服如何联系？(六六分期

六六分期app的软件客服如何联系？不知道吗？加qq群【895510560】即可！标题：六六分期

阅读：19253|2023-10-27

2 可心卡盟:win10系统火狐flash插件崩溃怎么

今天小编告诉大家如何处理win10系统火狐flash插件总是崩溃的问题，可能很多用户都不知

阅读：10005|2022-11-06

3 亲亲特价:怎么删除回收站图标

今天小编告诉大家如何对win10系统删除桌面回收站图标进行设置，可能很多用户都不知道

阅读：8335|2022-11-06

4 济南大学虚拟社区:鲁大师节能降温的具体办

今天小编告诉大家如何对win10系统电脑设置节能降温的设置方法，想必大家都遇到过需要

阅读：8703|2022-11-06

5 xlueops.exe:无线网络安装向导

我们在使用xp系统的过程中,经常需要对xp系统无线网络安装向导设置进行设置，可能很多

阅读：8649|2022-11-06

6 女斗合众国:win7系统cf与主机连接不稳定怎

今天小编告诉大家如何处理win7系统玩cf老是与主机连接不稳定的问题，可能很多用户都不

阅读：9675|2022-11-06

7 0xc000022-[cf烟雾头]cf怎么调烟雾头

电脑对日常生活的重要性小编就不多说了，可是一旦碰到win7系统设置cf烟雾头的问题，很

阅读：8635|2022-11-06

8 qizideyouhuo:应用程序无法正常启动0xc0000

我们在日常使用电脑的时候，有的小伙伴们可能在打开应用的时候会遇见提示应用程序无法

阅读：8008|2022-11-06

9 ipz-185:win7系统vcf文件怎么打开

今天小编告诉大家如何对win7系统打开vcf文件进行设置，可能很多用户都不知道怎么对win

阅读：8671|2022-11-06

10 傻哥蹦迪:win10系统s4怎么打开usb调试

今天小编告诉大家如何对win10系统s4开启USB调试模式进行设置，可能很多用户都不知道怎

阅读：7542|2022-11-06

客服电话

电子邮件

C++ dictionary_hash函数代码示例

示例1: dictionary_set

示例2: dictionary_unset

示例3: dictionary_getbufsize

示例4: Assert

示例5: dictionary_get

示例6: dictionary_hash

示例7: dictionary_unset

示例8: iniparser_find_entry

示例9: output

示例10: main

示例11: dictionary_set

示例12: dictionary_set

示例13: dictionary_set

示例14: Test_dictionary_hash

请发表评论

全部评论

上一篇：

下一篇：

krishnaik06/Machine-Learning-in-90-days

armancodv/building-energy-model-matlab:

美元符号为什么是“$”

CVE-2022-1479

FGRibreau/import-tweets-to-mastodon: How

剪的笔顺,诠释剪的笔画,认识剪的部首

六六分期app的软件客服如何联系？(六六分期

florent37/ViewAnimator: A fluent Android

florent37/Shrine-MaterialDesign2: implem

CVE-2020-36276

SimpleSoftwareIO/simple-sms: Send and re

关于我们

产品与服务

解决方案

139-2527-9053