/** * Clears the path */ public void clear() { segments.clear(); resetState(); }
/** * Sets the element at index */ public void set(int index, String x) { segments.set(index, x); resetState(); }
/** * Appends the string segments to the end of this */ public void append(List<String> x) { segments.addAll(x); resetState(); }
/** * Clears the path */ public void clear() { segments.clear(); resetState(); }
/** * Removes the element at index */ public void remove(int index) { segments.remove(index); resetState(); }
/** * Sets the element at index */ public void set(int index, String x) { segments.set(index, x); resetState(); }
/** * Appends the string segments to the end of this */ public void append(List<String> x) { segments.addAll(x); resetState(); }
/** * Sets the element at index */ public void set(int index, String x) { segments.set(index, x); resetState(); }
/** * Removes the element at index */ public void remove(int index) { segments.remove(index); resetState(); }
/** * Removes the element at index */ public void remove(int index) { segments.remove(index); resetState(); }
/** * Appends the string segments to the end of this */ public void append(List<String> x) { segments.addAll(x); resetState(); }
/** * Clears the path */ public void clear() { segments.clear(); resetState(); }
/** * Appends p to the end of this */ public void append(PathRep p) { append(p.segments); resetState(); }
/** * Appends p to the end of this */ public void append(PathRep p) { append(p.segments); resetState(); }
/** * Appends p to the end of this */ public void append(PathRep p) { append(p.segments); resetState(); }
/** * Removes 'from' elements from the beginning */ public void shiftLeft(final int from) { if (from > 0) { int n = segments.size(); if (from >= n) { segments.clear(); } else { int iFrom = from; int k = n - iFrom; int to = 0; for (int i = 0; i < k; i++) { segments.set(to++, segments.get(iFrom++)); } k = n - k; for (int i = 0; i < k; i++) { segments.remove(--n); } } resetState(); } }
/** * Removes 'from' elements from the beginning */ public void shiftLeft(final int from) { if (from > 0) { int n = segments.size(); if (from >= n) { segments.clear(); } else { int iFrom = from; int k = n - iFrom; int to = 0; for (int i = 0; i < k; i++) { segments.set(to++, segments.get(iFrom++)); } k = n - k; for (int i = 0; i < k; i++) { segments.remove(--n); } } resetState(); } }
/** * Removes 'from' elements from the beginning */ public void shiftLeft(final int from) { if (from > 0) { int n = segments.size(); if (from >= n) { segments.clear(); } else { int iFrom = from; int k = n - iFrom; int to = 0; for (int i = 0; i < k; i++) { segments.set(to++, segments.get(iFrom++)); } k = n - k; for (int i = 0; i < k; i++) { segments.remove(--n); } } resetState(); } }