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

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

85 |
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 |

86 |
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 |

87 |
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 |

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

89 |
.P |
.P |

158 |
.\" HREF |
.\" HREF |

159 |
\fBpcrepartial\fP |
\fBpcrepartial\fP |

160 |
.\" |
.\" |

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

162 |
matching. |
matching. |

163 |
. |
. |

164 |
. |
. |