Lines Matching defs:subsequent
190 // Algorithm: compare each entry n to all subsequent entries in
191 // the list: if any subsequent entry matches or widens entry n,
192 // remove entry n. If any subsequent entries narrow entry n, remove
193 // the subsequent entries.
198 /* compare current to subsequent elements */
200 GeneralNameInterface subsequent = getGeneralNameInterface(j);
201 switch (current.constrains(subsequent)) {
210 /* subsequent narrows current */
211 /* remove narrower name (subsequent) */
213 j--; /* continue check with new subsequent */
216 /* subsequent widens current */
225 } /* end of this pass of subsequent elements */
