1 /* +------------------------------------+
2 * | Inspire Internet Relay Chat Daemon |
3 * +------------------------------------+
5 * InspIRCd is copyright (C) 2002-2006 ChatSpike-Dev.
7 * <brain@chatspike.net>
8 * <Craig@chatspike.net>
10 * Written by Craig Edwards, Craig McLure, and others.
11 * This program is free but copyrighted software; see
12 * the file COPYING for details.
14 * ---------------------------------------------------
19 #include "inspircd_config.h"
23 #include "helperfuncs.h"
25 #include <ext/hash_map>
31 #define nspace __gnu_cxx
36 // from helperfuncs.cpp
37 extern const char lowermap[255];
39 /******************************************************
41 * The hash functions of InspIRCd are the centrepoint
42 * of the entire system. If these functions are
43 * inefficient or wasteful, the whole program suffers
44 * as a result. A lot of C programmers in the ircd
45 * scene spend a lot of time debating (arguing) about
46 * the best way to write hash functions to hash irc
47 * nicknames, channels etc.
48 * We are lucky as C++ developers as hash_map does
49 * a lot of this for us. It does intellegent memory
50 * requests, bucketing, search functions, insertion
51 * and deletion etc. All we have to do is write some
52 * overloaded comparison and hash value operators which
53 * cause it to act in an irc-like way. The features we
54 * add to the standard hash_map are:
56 * Case insensitivity: The hash_map will be case
59 * Scandanavian Comparisons: The characters [, ], \ will
60 * be considered the lowercase of {, } and |.
62 * This file also contains hashing methods for hashing
63 * in_addr structs, we use this if we want to cache IP
66 ******************************************************/
70 size_t nspace::hash<in_addr>::operator()(const struct in_addr &a) const
73 memcpy(&q,&a,sizeof(size_t));
77 size_t nspace::hash<string>::operator()(const string &s) const
80 static struct hash<const char *> strhash;
81 strlcpy(a,s.c_str(),MAXBUF);
86 bool irc::StrHashComp::operator()(const std::string& s1, const std::string& s2) const
88 irc::string a = s1.c_str();
89 irc::string b = s2.c_str();
93 bool irc::InAddr_HashComp::operator()(const in_addr &s1, const in_addr &s2) const
95 return (s1.s_addr == s1.s_addr);
98 /******************************************************
100 * This is the implementation of our special irc::string
101 * class which is a case-insensitive equivalent to
102 * std::string which is not only case-insensitive but
103 * can also do scandanavian comparisons, e.g. { = [, etc.
105 * This class depends on the global 'lowermap' which is
106 * initialized at startup by inspircd.cpp, and contains
107 * the 'scandanavian' casemappings for fast irc compare.
109 ******************************************************/
111 bool irc::irc_char_traits::eq(char c1st, char c2nd)
113 return lowermap[(unsigned)c1st] == lowermap[(unsigned)c2nd];
116 bool irc::irc_char_traits::ne(char c1st, char c2nd)
118 return lowermap[(unsigned)c1st] != lowermap[(unsigned)c2nd];
121 bool irc::irc_char_traits::lt(char c1st, char c2nd)
123 return lowermap[(unsigned)c1st] < lowermap[(unsigned)c2nd];
126 int irc::irc_char_traits::compare(const char* str1, const char* str2, size_t n)
128 for(unsigned int i = 0; i < n; i++)
130 if(lowermap[(unsigned)*str1] > lowermap[(unsigned)*str2])
133 if(lowermap[(unsigned)*str1] < lowermap[(unsigned)*str2])
136 if(*str1 == 0 || *str2 == 0)
145 const char* irc::irc_char_traits::find(const char* s1, int n, char c)
147 while(n-- > 0 && lowermap[(unsigned)*s1] != lowermap[(unsigned)c])
152 /* See hashcomp.h if you care about these... */
153 std::ostream& operator<<(std::ostream &os, const irc::string &str)
155 return os << str.c_str();
158 std::istream& operator>>(std::istream &is, irc::string &str)