Lines Matching defs:path
1408 path = new Stack<ElemChanges>();
1460 ElemChanges ec = path.peek();
1466 while (path.size() > 1) {
1491 // pop the remaining path
1492 while (path.size() != 0) {
1532 // push the path
1542 // Build a copy of the original path.
1543 insertPath = new ElemChanges[path.size()];
1544 path.copyInto(insertPath);
1573 // pop the remaining path
1574 while (path.size() != 0) {
1584 // original path items that have a change.
1631 while (path.size() != 0) {
1636 while (path.size() != 0) {
1643 // push the path
1652 ElemChanges ec = path.peek();
1740 path.removeAllElements();
1776 if (path == null) {
1777 path = new Stack<ElemChanges>();
1779 path.removeAllElements();
1788 * the current path.
1796 path.push(ec);
1804 ElemChanges ec = path.peek();
1805 path.pop();
1808 } else if (! path.isEmpty()) {
1813 ec = path.peek();
1827 ElemChanges ec = path.peek();
1853 fracture(path.size() - 1);
1931 // update path for changes
1935 ElemChanges ec = path.peek();
2355 * Splits the bottommost leaf in <code>path</code>.
2360 ElemChanges ec = path.peek();
2385 ElemChanges ec = path.peek();
2469 transient Stack<ElemChanges> path;
2474 /** For insert, path to inserted elements. */