hashcomp.h

/*
 * InspIRCd -- Internet Relay Chat Daemon
 *
 *   Copyright (C) 2011 Adam <[email protected]>
 *   Copyright (C) 2009 Daniel De Graaf <[email protected]>
 *   Copyright (C) 2007, 2009 Dennis Friis <[email protected]>
 *   Copyright (C) 2005-2009 Craig Edwards <[email protected]>
 *   Copyright (C) 2007-2008 Robin Burchell <[email protected]>
 *   Copyright (C) 2008 Pippijn van Steenhoven <[email protected]>
 *
 * This file is part of InspIRCd.  InspIRCd is free software: you can
 * redistribute it and/or modify it under the terms of the GNU General Public
 * License as published by the Free Software Foundation, version 2.
 *
 * This program is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
 * FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more
 * details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 
 
#ifndef HASHCOMP_H
#define HASHCOMP_H
 
#include <cstring>
#include <string>
#include <vector>
#include <deque>
#include <map>
#include <set>
#include "hash_map.h"
 
/*******************************************************
 * This file contains classes and templates that deal
 * with the comparison and hashing of 'irc strings'.
 * An 'irc string' is a string which compares in a
 * case insensitive manner, and as per RFC 1459 will
 * treat [ identical to {, ] identical to }, and \
 * as identical to |.
 *
 * Our hashing functions are designed  to accept
 * std::string and compare/hash them as type irc::string
 * by converting them internally. This makes them
 * backwards compatible with other code which is not
 * aware of irc::string.
 *******************************************************/
 
CoreExport extern unsigned const char *national_case_insensitive_map;
 
CoreExport extern unsigned const char rfc_case_insensitive_map[256];
 
CoreExport extern unsigned const char ascii_case_insensitive_map[256];
 
CoreExport extern unsigned const char rfc_case_sensitive_map[256];
 
template<typename T> const T& SearchAndReplace(T& text, const T& pattern, const T& replace)
{
        T replacement;
        if ((!pattern.empty()) && (!text.empty()))
        {
                for (std::string::size_type n = 0; n != text.length(); ++n)
                {
                        if (text.length() >= pattern.length() && text.substr(n, pattern.length()) == pattern)
                        {
                                /* Found the pattern in the text, replace it, and advance */
                                replacement.append(replace);
                                n = n + pattern.length() - 1;
                        }
                        else
                        {
                                replacement += text[n];
                        }
                }
        }
        text = replacement;
        return text;
}
 
namespace irc
{
 
        struct CoreExport StrHashComp
        {
                bool operator()(const std::string& s1, const std::string& s2) const;
        };
 
        struct irc_char_traits : std::char_traits<char> {
 
                static bool eq(char c1st, char c2nd);
 
                static bool ne(char c1st, char c2nd);
 
                static bool lt(char c1st, char c2nd);
 
                static CoreExport int compare(const char* str1, const char* str2, size_t n);
 
                static CoreExport const char* find(const char* s1, int  n, char c);
        };
 
        CoreExport std::string hex(const unsigned char *raw, size_t rawsz);
 
        typedef std::basic_string<char, irc_char_traits, std::allocator<char> > string;
 
        class CoreExport stringjoiner
        {
         private:
 
                std::string joined;
 
         public:
 
                stringjoiner(const std::string &seperator, const std::vector<std::string> &sequence, int begin, int end);
 
                stringjoiner(const std::string &seperator, const std::deque<std::string> &sequence, int begin, int end);
 
                stringjoiner(const std::string &seperator, const char* const* sequence, int begin, int end);
 
                std::string& GetJoined();
        };
 
        class CoreExport modestacker
        {
         private:
                std::deque<std::string> sequence;
 
                bool adding;
         public:
 
                modestacker(bool add);
 
                void Push(char modeletter, const std::string &parameter);
 
                void Push(char modeletter);
 
                void PushPlus();
 
                void PushMinus();
 
                int GetStackedLine(std::vector<std::string> &result, int max_line_size = 360);
 
                int GetStackedLine(std::deque<std::string> &result, int max_line_size = 360) {
                        std::vector<std::string> r;
                        int n = GetStackedLine(r, max_line_size);
                        result.clear();
                        result.insert(result.end(), r.begin(), r.end());
                        return n;
                }
        };
 
        class CoreExport tokenstream
        {
         private:
 
                std::string tokens;
 
                std::string::iterator last_starting_position;
 
                std::string::iterator n;
 
                bool last_pushed;
         public:
 
                tokenstream(const std::string &source);
 
                ~tokenstream();
 
                bool GetToken(std::string &token);
 
                bool GetToken(irc::string &token);
 
                bool GetToken(int &token);
 
                bool GetToken(long &token);
        };
 
        class CoreExport sepstream
        {
         private:
                std::string tokens;
                std::string::iterator last_starting_position;
                std::string::iterator n;
                char sep;
         public:
                sepstream(const std::string &source, char seperator);
 
                virtual ~sepstream();
 
                virtual bool GetToken(std::string &token);
 
                virtual const std::string GetRemaining();
 
                virtual bool StreamEnd();
        };
 
        class CoreExport commasepstream : public sepstream
        {
         public:
                commasepstream(const std::string &source) : sepstream(source, ',')
                {
                }
        };
 
        class CoreExport spacesepstream : public sepstream
        {
         public:
                spacesepstream(const std::string &source) : sepstream(source, ' ')
                {
                }
        };
 
        class CoreExport portparser
        {
         private:
 
                commasepstream sep;
 
                long in_range;
 
                long range_begin;
 
                long range_end;
 
                bool overlapped;
 
                std::set<long> overlap_set;
 
                bool Overlaps(long val);
         public:
 
                portparser(const std::string &source, bool allow_overlapped = true);
 
                long GetToken();
        };
 
        CoreExport const char* Spacify(const char* n);
 
        struct hash
        {
                size_t CoreExport operator()(const irc::string &s) const;
        };
}
 
/* Define operators for using >> and << with irc::string to an ostream on an istream. */
/* This was endless fun. No. Really. */
/* It was also the first core change Ommeh made, if anyone cares */
 
inline std::ostream& operator<<(std::ostream &os, const irc::string &str) { return os << str.c_str(); }
 
inline std::istream& operator>>(std::istream &is, irc::string &str)
{
        std::string tmp;
        is >> tmp;
        str = tmp.c_str();
        return is;
}
 
/* Define operators for + and == with irc::string to std::string for easy assignment
 * and comparison
 *
 * Operator +
 */
inline std::string operator+ (std::string& leftval, irc::string& rightval)
{
        return leftval + std::string(rightval.c_str());
}
 
/* Define operators for + and == with irc::string to std::string for easy assignment
 * and comparison
 *
 * Operator +
 */
inline irc::string operator+ (irc::string& leftval, std::string& rightval)
{
        return leftval + irc::string(rightval.c_str());
}
 
/* Define operators for + and == with irc::string to std::string for easy assignment
 * and comparison
 *
 * Operator ==
 */
inline bool operator== (const std::string& leftval, const irc::string& rightval)
{
        return (leftval.c_str() == rightval);
}
 
/* Define operators for + and == with irc::string to std::string for easy assignment
 * and comparison
 *
 * Operator ==
 */
inline bool operator== (const irc::string& leftval, const std::string& rightval)
{
        return (leftval == rightval.c_str());
}
 
/* Define operators != for irc::string to std::string for easy comparison
 */
inline bool operator!= (const irc::string& leftval, const std::string& rightval)
{
        return !(leftval == rightval.c_str());
}
 
/* Define operators != for std::string to irc::string for easy comparison
 */
inline bool operator!= (const std::string& leftval, const irc::string& rightval)
{
        return !(leftval.c_str() == rightval);
}
 
inline std::string assign(const irc::string &other) { return other.c_str(); }
 
inline irc::string assign(const std::string &other) { return other.c_str(); }
 
inline std::string& trim(std::string &str)
{
        std::string::size_type start = str.find_first_not_of(" ");
        std::string::size_type end = str.find_last_not_of(" ");
        if (start == std::string::npos || end == std::string::npos)
                str = "";
        else
                str = str.substr(start, end-start+1);
 
        return str;
}
 
BEGIN_HASHMAP_NAMESPACE
 
#if defined(_WIN32) && !defined(HAS_TR1_UNORDERED)
        template<> class CoreExport hash_compare<irc::string, std::less<irc::string> >
        {
        public:
                enum { bucket_size = 4, min_buckets = 8 }; /* Got these numbers from the CRT source, if anyone wants to change them feel free. */
 
                bool operator()(const irc::string & s1, const irc::string & s2) const
                {
                        if(s1.length() != s2.length()) return true;
                        return (irc::irc_char_traits::compare(s1.c_str(), s2.c_str(), (size_t)s1.length()) < 0);
                }
 
                size_t operator()(const irc::string & s) const;
        };
 
        template<> class CoreExport hash_compare<std::string, std::less<std::string> >
        {
        public:
                enum { bucket_size = 4, min_buckets = 8 }; /* Again, from the CRT source */
 
                bool operator()(const std::string & s1, const std::string & s2) const
                {
                        if(s1.length() != s2.length()) return true;
                        return (irc::irc_char_traits::compare(s1.c_str(), s2.c_str(), (size_t)s1.length()) < 0);
                }
 
                size_t operator()(const std::string & s) const;
        };
#else
 
        /* XXX FIXME: Implement a hash function overriding std::string's that works with TR1! */
 
#ifdef HASHMAP_DEPRECATED
        struct insensitive
#else
        CoreExport template<> struct hash<std::string>
#endif
        {
                size_t CoreExport operator()(const std::string &s) const;
        };
 
#endif
 
        void strlower(char *n);
 
END_HASHMAP_NAMESPACE
 
#endif