Context Triggered Piecewise Hash Computation Using 'ssdeep'
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 

58 lines
1.5 KiB

/*
ffuzzy++ : C++ implementation of fast fuzzy hashing
strings/terminators.hpp
Terminator characters
Copyright (C) 2014 Tsukasa OI <floss_ssdeep@irq.a4lg.com>
Permission to use, copy, modify, and/or distribute this software for
any purpose with or without fee is hereby granted, provided that the
above copyright notice and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#ifndef FFUZZYPP_STRINGS_TERMINATORS_HPP
#define FFUZZYPP_STRINGS_TERMINATORS_HPP
namespace ffuzzy {
namespace strings {
template <char...> class terminators;
template <>
class terminators<>
{
private:
terminators(void) = delete;
terminators(const terminators&) = delete;
public:
static bool isterm(char ch) noexcept
{
return !ch;
}
};
template <char c, char... rem>
class terminators<c, rem...>
{
private:
terminators(void) = delete;
terminators(const terminators&) = delete;
public:
static bool isterm(char ch) noexcept
{
return terminators<rem...>::isterm(ch) || ch == c;
}
};
}}
#endif