Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
Is there a hashmap library in C?
1,972 views
Skip to first unread message
endysun
Apr 19, 2008, 9:56:32 AM4/19/08
to
not C++.
Thanks.
Christof Meerwald
Apr 19, 2008, 1:12:19 PM4/19/08
to
On Sat, 19 Apr 2008 06:56:32 -0700 (PDT), endysun wrote:
> not C++.
> not C++.
glib, see http://library.gnome.org/devel/glib/stable/glib-Hash-Tables.html
Christof
--
http://cmeerw.org sip:cmeerw at cmeerw.org
mailto:cmeerw at cmeerw.org xmpp:cmeerw at cmeerw.org
pww19...@gmail.com
Apr 1, 2015, 9:35:41 PM4/1/15
to
在 2008年4月19日星期六 UTC+8下午9:56:32，endysun写道：
> not C++.
>
> Thanks.
The core of the core of the big data solutions -- Map
Download:
https://sourceforge.net/projects/pwwhashmap/files
> not C++.
>
> Thanks.
The core of the core of the big data solutions -- Map
Download:
https://sourceforge.net/projects/pwwhashmap/files
Marcin Załęczny
Apr 5, 2015, 12:34:36 PM4/5/15
to
W dniu 02.04.2015 o 03:35, pww19...@gmail.com pisze:
Take also a look at glib (http://en.wikipedia.org/wiki/GLib).
The component you need is GHashTable:
https://developer.gnome.org/glib/stable/glib-Hash-Tables.html
The component you need is GHashTable:
https://developer.gnome.org/glib/stable/glib-Hash-Tables.html
Wenwei Peng
May 5, 2015, 4:30:05 AM5/5/15
to
Work to do a good job, must first sharpen his tools.
Hi
My English is not good and if there is a syntax error, Keep the jokes clean please!
Welcome to my space:
http://sourceforge.net/p/pwwhashmap/discussion/general/
Title: The core of the core of the big data solutions -- Map
Author: pengwenwei
Email: wenwei19710430
Language: c++
Platform: Windows, linux
Technology: Perfect hash algorithm
Level: Advanced
Description: Map algorithm with high performance
Section MFC c++ map stl
SubSection c++ algorithm
License: (GPLv3)
Download demo project - 1070 Kb
Download source - 1070 Kb
Introduction:
For the c++ program, map is used everywhere.And bottleneck of program performance is often the performance of map.Especially in the case of large data,and the business association closely and unable to realize the data distribution and parallel processing condition.So the performance of map becomes the key technology.
In the work experience with telecommunications industry and the information security industry, I was dealing with the big bottom data,especially the most complex information security industry data,all can't do without map.
For example, IP table, MAC table, telephone number list, domain name resolution table, ID number table query, the Trojan horse virus characteristic code of cloud killing etc..
The map of STL library using binary chop, its has the worst performance.Google Hash map has the optimal performance and memory at present, but it has repeated collision probability.Now the big data rarely use a collision probability map,especially relating to fees, can't be wrong.
Now I put my algorithms out here,there are three kinds of map,after the build is Hash map.We can test the comparison,my algorithm has the zero probability of collision,but its performance is also better than the hash algorithm, even its ordinary performance has no much difference with Google.
My algorithm is perfect hash algorithm,its key index and the principle of compression algorithm is out of the ordinary,the most important is a completely different structure,so the key index compression is fundamentally different.The most direct benefit for program is that for the original map need ten servers for solutions but now I only need one server.
Declare: the code can not be used for commercial purposes, if for commercial applications,you can contact me with QQ 75293192.
Download:
https://sourceforge.net/projects/pwwhashmap/files
Background to this article that may be useful such as an introduction to the basic ideas presented:
http://blog.csdn.net/chixinmuzi/article/details/1727195
Development Manual:
Three different map algorithm, used in different application scenarios.
1,memMap: Based on memory No hard disk consumption.
2,diskMap: Based on the hard disk No memory consumption.
3,hashMap: No delete function, but the best performance.
memMap and diskMap can turn to hashMap by memMap2HashMap and diskMap2HashMap.
In addition,Provide Google HashMap for comparative test.
Algorithm of Google,the performance is not good, but also has the collision probability .
Hi
My English is not good and if there is a syntax error, Keep the jokes clean please!
Welcome to my space:
http://sourceforge.net/p/pwwhashmap/discussion/general/
Title: The core of the core of the big data solutions -- Map
Author: pengwenwei
Email: wenwei19710430
Language: c++
Platform: Windows, linux
Technology: Perfect hash algorithm
Level: Advanced
Description: Map algorithm with high performance
Section MFC c++ map stl
SubSection c++ algorithm
License: (GPLv3)
Download demo project - 1070 Kb
Download source - 1070 Kb
Introduction:
For the c++ program, map is used everywhere.And bottleneck of program performance is often the performance of map.Especially in the case of large data,and the business association closely and unable to realize the data distribution and parallel processing condition.So the performance of map becomes the key technology.
In the work experience with telecommunications industry and the information security industry, I was dealing with the big bottom data,especially the most complex information security industry data,all can't do without map.
For example, IP table, MAC table, telephone number list, domain name resolution table, ID number table query, the Trojan horse virus characteristic code of cloud killing etc..
The map of STL library using binary chop, its has the worst performance.Google Hash map has the optimal performance and memory at present, but it has repeated collision probability.Now the big data rarely use a collision probability map,especially relating to fees, can't be wrong.
Now I put my algorithms out here,there are three kinds of map,after the build is Hash map.We can test the comparison,my algorithm has the zero probability of collision,but its performance is also better than the hash algorithm, even its ordinary performance has no much difference with Google.
My algorithm is perfect hash algorithm,its key index and the principle of compression algorithm is out of the ordinary,the most important is a completely different structure,so the key index compression is fundamentally different.The most direct benefit for program is that for the original map need ten servers for solutions but now I only need one server.
Declare: the code can not be used for commercial purposes, if for commercial applications,you can contact me with QQ 75293192.
Download:
https://sourceforge.net/projects/pwwhashmap/files
Background to this article that may be useful such as an introduction to the basic ideas presented:
http://blog.csdn.net/chixinmuzi/article/details/1727195
Development Manual:
Three different map algorithm, used in different application scenarios.
1,memMap: Based on memory No hard disk consumption.
2,diskMap: Based on the hard disk No memory consumption.
3,hashMap: No delete function, but the best performance.
memMap and diskMap can turn to hashMap by memMap2HashMap and diskMap2HashMap.
In addition,Provide Google HashMap for comparative test.
Algorithm of Google,the performance is not good, but also has the collision probability .
l...@ansync.com
Mar 7, 2018, 6:28:44 PM3/7/18
to
On Saturday, April 19, 2008 at 6:56:32 AM UTC-7, endysun wrote:
> not C++.
>
> Thanks.
I like the Judy arrays stuff, personally. There's also Uthash and Glib.
> not C++.
>
> Thanks.
I like the Judy arrays stuff, personally. There's also Uthash and Glib.
0 new messages