Since strings behave in a similar fashion to lists, the programmer can use indices to replace the contents of a string. There are two methods to accomplish this.

Compiled regular expressions still performed comparatively well in Python, though. This method processed the 100,000 lines in 165 ms, about two times faster than string primitives in Python.

In the above example we’re using simple strings as our match targets, but more complex matches are possible. In fact, the chief use case for structural pattern matching is to match patterns of ...