diff options
author | Ivan Blinkov <ivan@blinkov.ru> | 2022-02-10 16:47:10 +0300 |
---|---|---|
committer | Daniil Cherednik <dcherednik@yandex-team.ru> | 2022-02-10 16:47:10 +0300 |
commit | 1aeb9a455974457866f78722ad98114bafc84e8a (patch) | |
tree | e4340eaf1668684d83a0a58c36947c5def5350ad /contrib/libs/hyperscan/src/rose/rose_build_lookaround.h | |
parent | bd5ef432f5cfb1e18851381329d94665a4c22470 (diff) | |
download | ydb-1aeb9a455974457866f78722ad98114bafc84e8a.tar.gz |
Restoring authorship annotation for Ivan Blinkov <ivan@blinkov.ru>. Commit 1 of 2.
Diffstat (limited to 'contrib/libs/hyperscan/src/rose/rose_build_lookaround.h')
-rw-r--r-- | contrib/libs/hyperscan/src/rose/rose_build_lookaround.h | 38 |
1 files changed, 19 insertions, 19 deletions
diff --git a/contrib/libs/hyperscan/src/rose/rose_build_lookaround.h b/contrib/libs/hyperscan/src/rose/rose_build_lookaround.h index 70d4217ccc..d1984f5b4a 100644 --- a/contrib/libs/hyperscan/src/rose/rose_build_lookaround.h +++ b/contrib/libs/hyperscan/src/rose/rose_build_lookaround.h @@ -1,5 +1,5 @@ /* - * Copyright (c) 2015-2017, Intel Corporation + * Copyright (c) 2015-2017, Intel Corporation * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are met: @@ -33,13 +33,13 @@ #define ROSE_ROSE_BUILD_LOOKAROUND_H #include "rose_graph.h" -#include "util/hash.h" +#include "util/hash.h" #include <vector> -/** \brief Max path number for multi-path lookaround. */ -#define MAX_LOOKAROUND_PATHS 8 - +/** \brief Max path number for multi-path lookaround. */ +#define MAX_LOOKAROUND_PATHS 8 + namespace ue2 { class CharReach; @@ -48,7 +48,7 @@ class RoseBuildImpl; /** \brief Lookaround entry prototype, describing the reachability at a given * distance from the end of a role match. */ struct LookEntry { - LookEntry() : offset(0) {} + LookEntry() : offset(0) {} LookEntry(s8 offset_in, const CharReach &reach_in) : offset(offset_in), reach(reach_in) {} s8 offset; //!< offset from role match location. @@ -60,7 +60,7 @@ struct LookEntry { }; void findLookaroundMasks(const RoseBuildImpl &tbi, const RoseVertex v, - std::vector<LookEntry> &look_more); + std::vector<LookEntry> &look_more); /** * \brief If possible, render the prefix of the given vertex as a lookaround. @@ -69,22 +69,22 @@ void findLookaroundMasks(const RoseBuildImpl &tbi, const RoseVertex v, * it can be satisfied with a lookaround alone. */ bool makeLeftfixLookaround(const RoseBuildImpl &build, const RoseVertex v, - std::vector<std::vector<LookEntry>> &lookaround); + std::vector<std::vector<LookEntry>> &lookaround); void mergeLookaround(std::vector<LookEntry> &lookaround, const std::vector<LookEntry> &more_lookaround); } // namespace ue2 -namespace std { - -template<> -struct hash<ue2::LookEntry> { - size_t operator()(const ue2::LookEntry &l) const { - return ue2::hash_all(l.offset, l.reach); - } -}; - -} // namespace std - +namespace std { + +template<> +struct hash<ue2::LookEntry> { + size_t operator()(const ue2::LookEntry &l) const { + return ue2::hash_all(l.offset, l.reach); + } +}; + +} // namespace std + #endif // ROSE_ROSE_BUILD_LOOKAROUND_H |