mirror of
https://github.com/neogeek23/drawshare.git
synced 2026-02-04 11:08:21 +00:00
53 lines
1.7 KiB
Python
53 lines
1.7 KiB
Python
__author__ = "Romilly Cocking"
|
|
__copyright__ = "Copyright 2011 hamcrest.org"
|
|
__license__ = "BSD, see License.txt"
|
|
|
|
from hamcrest.core.base_matcher import BaseMatcher
|
|
from hamcrest.core.helpers.hasmethod import hasmethod
|
|
|
|
import six
|
|
|
|
class StringContainsInOrder(BaseMatcher):
|
|
|
|
def __init__(self, *substrings):
|
|
for substring in substrings:
|
|
if not isinstance(substring, six.string_types):
|
|
raise TypeError(self.__class__.__name__
|
|
+ ' requires string arguments')
|
|
self.substrings = substrings
|
|
|
|
def _matches(self, item):
|
|
if not hasmethod(item, 'find'):
|
|
return False
|
|
from_index = 0
|
|
for substring in self.substrings:
|
|
from_index = item.find(substring, from_index)
|
|
if from_index == -1:
|
|
return False
|
|
return True
|
|
|
|
def describe_to(self, description):
|
|
description.append_list('a string containing ', ', ', ' in order',
|
|
self.substrings)
|
|
|
|
|
|
def string_contains_in_order(*substrings):
|
|
"""Matches if object is a string containing a given list of substrings in
|
|
relative order.
|
|
|
|
:param string1,...: A comma-separated list of strings.
|
|
|
|
This matcher first checks whether the evaluated object is a string. If so,
|
|
it checks whether it contains a given list of strings, in relative order to
|
|
each other. The searches are performed starting from the beginning of the
|
|
evaluated string.
|
|
|
|
Example::
|
|
|
|
string_contains_in_order("bc", "fg", "jkl")
|
|
|
|
will match "abcdefghijklm".
|
|
|
|
"""
|
|
return StringContainsInOrder(*substrings)
|