106 |
no more unterminated paths. At this point, terminated paths represent the |
no more unterminated paths. At this point, terminated paths represent the |

107 |
different matching possibilities (if there are none, the match has failed). |
different matching possibilities (if there are none, the match has failed). |

108 |
Thus, if there is more than one possible match, this algorithm finds all of |
Thus, if there is more than one possible match, this algorithm finds all of |

109 |
them, and in particular, it finds the longest. The matches are returned in |
them, and in particular, it finds the longest. The matches are returned in |

110 |
decreasing order of length. There is an option to stop the algorithm after the |
decreasing order of length. There is an option to stop the algorithm after the |

111 |
first match (which is necessarily the shortest) is found. |
first match (which is necessarily the shortest) is found. |

112 |
</P> |
</P> |

190 |
algorithm (<b>pcre_exec()</b>), by retaining partially matched substrings, it is |
algorithm (<b>pcre_exec()</b>), by retaining partially matched substrings, it is |

191 |
more complicated. The |
more complicated. The |

192 |
<a href="pcrepartial.html"><b>pcrepartial</b></a> |
<a href="pcrepartial.html"><b>pcrepartial</b></a> |

193 |
documentation gives details of partial matching and discusses multi-segment |
documentation gives details of partial matching and discusses multi-segment |

194 |
matching. |
matching. |

195 |
</P> |
</P> |

196 |
<br><a name="SEC6" href="#TOC1">DISADVANTAGES OF THE ALTERNATIVE ALGORITHM</a><br> |
<br><a name="SEC6" href="#TOC1">DISADVANTAGES OF THE ALTERNATIVE ALGORITHM</a><br> |