mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2024-11-14 10:39:05 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

add string::find_first_not_of, find_last_not_of

Browse source
This commit is contained in:
bolero-MURAKAMI 2012-10-08 22:14:42 +09:00
parent 9dd1fefa59
commit dd8eaffba5
2 changed files with 123 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

18
libs/string/test/string.cpp
View file

@ -167,6 +167,24 @@ namespace testspr {
TESTSPR_BOTH_ASSERT(str1.find_last_of("rabrab", decltype(str1)::npos, 3) == 5); TESTSPR_BOTH_ASSERT(str1.find_last_of("rabrab", decltype(str1)::npos, 3) == 5);
TESTSPR_BOTH_ASSERT(str1.find_last_of('r') == 5); TESTSPR_BOTH_ASSERT(str1.find_last_of('r') == 5);
// find_first_not_of
TESTSPR_BOTH_ASSERT(str1.find_first_not_of(str1) == decltype(str1)::npos);
TESTSPR_BOTH_ASSERT(str1.find_first_not_of(to_string("foo")) == 3);
TESTSPR_BOTH_ASSERT(str1.find_first_not_of(str1.c_str()) == decltype(str1)::npos);
TESTSPR_BOTH_ASSERT(str1.find_first_not_of("foo") == 3);
TESTSPR_BOTH_ASSERT(str1.find_first_not_of(str1.c_str(), 0, 10) == decltype(str1)::npos);
TESTSPR_BOTH_ASSERT(str1.find_first_not_of("foofoo", 0, 3) == 3);
TESTSPR_BOTH_ASSERT(str1.find_first_not_of('f') == 1);
// find_last_not_of
TESTSPR_BOTH_ASSERT(str1.find_last_not_of(str1) == decltype(str1)::npos);
TESTSPR_BOTH_ASSERT(str1.find_last_not_of(to_string("4321")) == 5);
TESTSPR_BOTH_ASSERT(str1.find_last_not_of(str1.c_str()) == decltype(str1)::npos);
TESTSPR_BOTH_ASSERT(str1.find_last_not_of("4321") == 5);
TESTSPR_BOTH_ASSERT(str1.find_last_not_of(str1.c_str(), decltype(str1)::npos, 10) == decltype(str1)::npos);
TESTSPR_BOTH_ASSERT(str1.find_last_not_of("43214321", decltype(str1)::npos, 4) == 5);
TESTSPR_BOTH_ASSERT(str1.find_last_not_of('4') == 8);
// substr // substr
{ {
SPROUT_STATIC_CONSTEXPR auto str3 = str1.substr(); SPROUT_STATIC_CONSTEXPR auto str3 = str1.substr();

107
sprout/string/string.hpp
View file

@ -110,14 +110,46 @@ namespace sprout {
static SPROUT_CONSTEXPR size_type static SPROUT_CONSTEXPR size_type
find_last_of_impl_2(const_iterator data, size_type len, ConstIterator s, size_type pos, size_type n) { find_last_of_impl_2(const_iterator data, size_type len, ConstIterator s, size_type pos, size_type n) {
return traits_helper_type::is_found(traits_helper_type::find(s, n, data[len]), s + n) ? len return traits_helper_type::is_found(traits_helper_type::find(s, n, data[len]), s + n) ? len
: len != 0 ? find_last_of_impl_2(data, len - 1, s, pos, n) : len ? find_last_of_impl_2(data, len - 1, s, pos, n)
: npos : npos
; ;
} }
template<typename ConstIterator> template<typename ConstIterator>
static SPROUT_CONSTEXPR size_type static SPROUT_CONSTEXPR size_type
find_last_of_impl_1(const_iterator data, size_type len, ConstIterator s, size_type pos, size_type n) { find_last_of_impl_1(const_iterator data, size_type len, ConstIterator s, size_type pos, size_type n) {
return len && n ? find_last_of_impl_2(data, len - 1 > pos ? pos : len, s, pos, n) return len && n ? find_last_of_impl_2(data, len - 1 > pos ? pos : len - 1, s, pos, n)
: npos
;
}
template<typename ConstIterator>
static SPROUT_CONSTEXPR size_type
find_first_not_of_impl_1(const_iterator data, size_type len, ConstIterator s, size_type pos, size_type n) {
return pos < len
? !traits_helper_type::is_found(traits_helper_type::find(s, n, data[pos]), s + n)
? pos
: find_first_not_of_impl_1(data, len, s, pos + 1, n)
: npos
;
}
template<typename ConstIterator>
static SPROUT_CONSTEXPR size_type
find_last_not_of_impl_2(const_iterator data, size_type len, ConstIterator s, size_type pos, size_type n) {
return !traits_helper_type::is_found(traits_helper_type::find(s, n, data[len]), s + n) ? len
: len ? find_last_not_of_impl_2(data, len - 1, s, pos, n)
: npos
;
}
template<typename ConstIterator>
static SPROUT_CONSTEXPR size_type
find_last_not_of_impl_1(const_iterator data, size_type len, ConstIterator s, size_type pos, size_type n) {
return len ? find_last_not_of_impl_2(data, len - 1 > pos ? pos : len - 1, s, pos, n)
: npos
;
}
static SPROUT_CONSTEXPR size_type
find_last_not_of_c_impl(const_iterator data, size_type len, value_type c, size_type pos) {
return !traits_type::eq(data[len], c) ? len
: len ? find_last_not_of_c_impl(data, len - 1, c, pos)
: npos : npos
; ;
} }
@ -468,6 +500,45 @@ namespace sprout {
find_last_of(value_type c, size_type pos = npos) const { find_last_of(value_type c, size_type pos = npos) const {
return rfind(c, pos); return rfind(c, pos);
} }
SPROUT_CONSTEXPR size_type
find_first_not_of(basic_string const& str, size_type pos = 0) const SPROUT_NOEXCEPT {
return find_first_not_of_impl_1(begin(), len, str.begin(), pos, str.size());
}
SPROUT_CONSTEXPR size_type
find_first_not_of(value_type const* s, size_type pos, size_type n) const {
return find_first_not_of_impl_1(begin(), len, s, pos, n);
}
SPROUT_CONSTEXPR size_type
find_first_not_of(value_type const* s, size_type pos = 0) const {
return find_first_not_of(s, pos, traits_type::length(s));
}
SPROUT_CONSTEXPR size_type
find_first_not_of(value_type c, size_type pos = 0) const {
return pos < len
? !traits_type::eq(elems[pos], c)
? pos
: find_first_not_of(c, pos + 1)
: npos
;
}
SPROUT_CONSTEXPR size_type
find_last_not_of(basic_string const& str, size_type pos = npos) const SPROUT_NOEXCEPT {
return find_last_not_of_impl_1(begin(), len, str.begin(), pos, str.size());
}
SPROUT_CONSTEXPR size_type
find_last_not_of(value_type const* s, size_type pos, size_type n) const {
return find_last_not_of_impl_1(begin(), len, s, pos, n);
}
SPROUT_CONSTEXPR size_type
find_last_not_of(value_type const* s, size_type pos = npos) const {
return find_last_not_of(s, pos, traits_type::length(s));
}
SPROUT_CONSTEXPR size_type
find_last_not_of(value_type c, size_type pos = npos) const {
return len ? find_last_not_of_c_impl(begin(), len - 1 > pos ? pos : len - 1, c, pos)
: npos
;
}
SPROUT_CONSTEXPR basic_string SPROUT_CONSTEXPR basic_string
substr(size_type pos = 0, size_type n = npos) const { substr(size_type pos = 0, size_type n = npos) const {
return !(size() < pos) return !(size() < pos)
@ -634,6 +705,38 @@ namespace sprout {
return find_last_of(s, pos, traits_type::length(s)); return find_last_of(s, pos, traits_type::length(s));
} }
template<typename ConstIterator> template<typename ConstIterator>
SPROUT_CONSTEXPR typename std::enable_if<
sprout::is_index_iterator<ConstIterator>::value,
size_type
>::type
find_first_not_of(ConstIterator s, size_type pos, size_type n) const {
return find_first_not_of_impl_1(begin(), len, s, pos, n);
}
template<typename ConstIterator>
SPROUT_CONSTEXPR typename std::enable_if<
sprout::is_index_iterator<ConstIterator>::value,
size_type
>::type
find_first_not_of(ConstIterator s, size_type pos = 0) const {
return find_first_not_of_impl_1(s, pos, traits_type::length(s));
}
template<typename ConstIterator>
SPROUT_CONSTEXPR typename std::enable_if<
sprout::is_index_iterator<ConstIterator>::value,
size_type
>::type
find_last_not_of(ConstIterator s, size_type pos, size_type n) const {
return find_last_not_of_impl_1(begin(), len, s, pos, n);
}
template<typename ConstIterator>
SPROUT_CONSTEXPR typename std::enable_if<
sprout::is_index_iterator<ConstIterator>::value,
size_type
>::type
find_last_not_of(ConstIterator s, size_type pos = npos) const {
return find_last_not_of_impl_1(s, pos, traits_type::length(s));
}
template<typename ConstIterator>
SPROUT_CONSTEXPR typename std::enable_if< SPROUT_CONSTEXPR typename std::enable_if<
sprout::is_index_iterator<ConstIterator>::value, sprout::is_index_iterator<ConstIterator>::value,
int int