mirror of
https://github.com/bolero-MURAKAMI/Sprout
synced 2025-08-03 12:49:50 +00:00
fix implementation
This commit is contained in:
parent
84508d6a6c
commit
f26032dce8
33 changed files with 81 additions and 79 deletions
|
@ -9,8 +9,8 @@
|
|||
#include <sprout/string.hpp>
|
||||
#include <sprout/uuid/uuid.hpp>
|
||||
#include <sprout/uuid/detail/table.hpp>
|
||||
#include HDR_ALGORITHM_SSCRISK_CEL_OR_SPROUT
|
||||
#include <sprout/iterator/operation.hpp>
|
||||
#include <sprout/algorithm/find.hpp>
|
||||
|
||||
namespace sprout {
|
||||
namespace uuids {
|
||||
|
@ -54,7 +54,7 @@ namespace sprout {
|
|||
return value_at(
|
||||
sprout::distance(
|
||||
sprout::uuids::detail::digits<Elem>::table.begin(),
|
||||
NS_SSCRISK_CEL_OR_SPROUT::find(
|
||||
sprout::find(
|
||||
sprout::uuids::detail::digits<Elem>::table.begin(),
|
||||
sprout::uuids::detail::digits<Elem>::table.end(),
|
||||
c
|
||||
|
|
|
@ -9,7 +9,8 @@
|
|||
#include <sprout/config.hpp>
|
||||
#include <sprout/iterator/operation.hpp>
|
||||
#include <sprout/iterator/reverse_iterator.hpp>
|
||||
#include HDR_ALGORITHM_SSCRISK_CEL_OR_SPROUT
|
||||
#include <sprout/algorithm/equal.hpp>
|
||||
#include <sprout/algorithm/lexicographical_compare.hpp>
|
||||
#if SPROUT_USE_INDEX_ITERATOR_IMPLEMENTATION
|
||||
# include <sprout/iterator/index_iterator.hpp>
|
||||
#endif
|
||||
|
@ -233,7 +234,7 @@ namespace sprout {
|
|||
//
|
||||
inline SPROUT_CONSTEXPR bool
|
||||
operator==(sprout::uuids::uuid const& lhs, sprout::uuids::uuid const& rhs) {
|
||||
return NS_SSCRISK_CEL_OR_SPROUT::equal(lhs.begin(), lhs.end(), rhs.begin());
|
||||
return sprout::equal(lhs.begin(), lhs.end(), rhs.begin());
|
||||
}
|
||||
inline SPROUT_CONSTEXPR bool
|
||||
operator!=(sprout::uuids::uuid const& lhs, sprout::uuids::uuid const& rhs) {
|
||||
|
@ -241,7 +242,7 @@ namespace sprout {
|
|||
}
|
||||
inline SPROUT_CONSTEXPR bool
|
||||
operator<(sprout::uuids::uuid const& lhs, sprout::uuids::uuid const& rhs) {
|
||||
return NS_SSCRISK_CEL_OR_SPROUT::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(), rhs.end());
|
||||
return sprout::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(), rhs.end());
|
||||
}
|
||||
inline SPROUT_CONSTEXPR bool
|
||||
operator>(sprout::uuids::uuid const& lhs, sprout::uuids::uuid const& rhs) {
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue