[#31] Add transform and search_all

[SoluMilken]

• search_all: Recursively search the substring that matches the given regular expression pattern. Meanwhile, collect the start and end positions of the matched substring.

• transform: Transform the string according to the provided annotations. A pair of annotations contains the forward and backward part. An annotation has format (start position, end position, substring). This method would extract the substring based on the positions provided by forward annotation and replace it with the substring provided by backward annotation.

[stegben]

Please provide a detailed description of this PR. Ain't nobody got time for guessing what you try to do

[absolutelyNoWarranty]

forward_annotations and backward_annotations are 1-to-1 mapping?

[SoluMilken]

forward_annotations and backward_annotations are 1-to-1 mapping? YES
forward and backward annotations should contain the same number of annotation with the format (int, int ,str).

[SoluMilken]

Def: An annotation is a tuple contains two integers and a string. Two integers indicate the start and end positions of string to be transformed. The string in this repo must be the same as that original_string[start: end].

[SoluMilken]

I hope that this method (annotation) can be used in "list of string" for recording the process of transformation by only changing the last part.

[absolutelyNoWarranty]

transform should check that forward/backward are valid

• list must be same lengths
• forward annotations must actually be present in the input when present
• len of b-a must be same len as chunk
• no overlaps

[stegben]

what does the regex mean?

[SoluMilken]

開頭 抓\s 和 0個或1個隨便的字元
結尾 也如此