>Does any one know how, the find method actually works, and the
>associated running time?
The Pattern is compiled into a state machine. At each state, the
engine looks at what character came in, and choses the next state.
Pattern does not compile it all the way to byte code. The state
machine is interpreted.
Speaking loosely, you could in principle imagine each state being a
method with giant SWITCH statement that categories the input, and
decides if we have a match so far, and the state to carry on next at,
or a failure, in which case the controlling engine will backtrack.