/* - mode: c; c-basic-offset: 2; indent-tabs-mode: nil; -*- * vim:expandtab:shiftwidth=2:tabstop=2:smarttab: * * Copyright (C) 2010 Brian Aker * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are met: * * * Redistributions of source code must retain the above copyright notice, * this list of conditions and the following disclaimer. * * Redistributions in binary form must reproduce the above copyright notice, * this list of conditions and the following disclaimer in the documentation * and/or other materials provided with the distribution. * * Neither the name of Patrick Galbraith nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF * THE POSSIBILITY OF SUCH DAMAGE. */ /* Some sections of this code came from the Boost examples. */ #pragma once #include #include #include #include #include #include #include namespace drizzled { namespace util { namespace string { typedef boost::shared_ptr shared_ptr; typedef boost::shared_ptr const_shared_ptr; typedef std::vector vector; } struct insensitive_equal_to : std::binary_function { bool operator()(std::string const& x, std::string const& y) const { return boost::algorithm::iequals(x, y); } }; struct insensitive_hash : std::unary_function { std::size_t operator()(std::string const& x) const { std::size_t seed = 0; BOOST_FOREACH(std::string::const_reference it, x) boost::hash_combine(seed, std::toupper(it)); return seed; } }; struct sensitive_hash : std::unary_function< std::vector, std::size_t> { std::size_t operator()(std::vector const& x) const { std::size_t seed = 0; BOOST_FOREACH(std::vector::const_reference it, x) boost::hash_combine(seed, it); return seed; } }; } /* namespace util */ } /* namespace drizzled */