algorithmz 1.1.5

This is the corresponding implemenation of the python module of the same name.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29

/// Repeat string
///
/// Given two strings A and B, find the minimum number of times A has to be repeated such that B is a substring of the result. Return -1 if impossible.
///
/// # Examples
///
/// Basic usage:
/// ```
/// let result = algorithmz::string::repeat_string("abcd", "cdabcdab");
/// assert_eq!(result, 3);
/// ```
pub fn repeat_string(base: &str, target: &str) -> i32 {
    let mut repetition_count = 1;
    let mut repeated = base.to_string();

    let max_count = (target.len() / base.len()) + 2;

    while !repeated.contains(target) {
        repeated.push_str(base);

        if repetition_count > max_count as i32 {
            return -1;
        }

        repetition_count += 1;
    }

    repetition_count
}