AvlNode() {
      this.elem = null;
      this.elemCount = 1;
    }

    // For discussion of pred() and succ(), see the comment on the pred and succ fields.

    private AvlNode<E> pred() {
      return requireNonNull(pred);
    }

    private AvlNode<E> succ() {
      return requireNonNull(succ);
    }

    int count(Comparator<? super E> comparator, @ParametricNullness E e) {

    private void succeedsInValueSet(
        @Nullable ValueEntry<K, V> pred, @Nullable ValueEntry<K, V> succ) {
      if (pred == null) {
        firstEntry = succ;
      } else {
        pred.successorInValueSet = succ;
      }
      if (succ == null) {
        lastEntry = pred;
      } else {
        succ.predecessorInValueSet = pred;
      }
    }

    private void succeedsInValueSet(
        @Nullable ValueEntry<K, V> pred, @Nullable ValueEntry<K, V> succ) {
      if (pred == null) {
        firstEntry = succ;
      } else {
        pred.successorInValueSet = succ;
      }
      if (succ == null) {
        lastEntry = pred;
      } else {
        succ.predecessorInValueSet = pred;
      }
    }

        return; // give up if someone is calling complete
      }
      Waiter succ;
      while (curr != null) {
        succ = curr.next;
        if (curr.thread != null) { // we aren't unlinking this node, update pred.
          pred = curr;
        } else if (pred != null) { // We are unlinking this node and it has a predecessor.
          pred.next = succ;

                    }
                    final String dunc = loc.handleDFSReferral(dr, rpath);
                    if (request != null) {
                        request.setPath(dunc);
                    }
                    return loc;
                }

                // fallthrough to normal handling

bị
bởi
cả
các
cái
cần
càng
chỉ
chiếc
cho
chứ
chưa
chuyện
có
có thể
cứ
của
cùng
cũng
đã
đang
đây
để
đến nỗi
đều
điều
do
đó
được
dưới
gì
khi
không
là
lại
lên
lúc
mà
mỗi
một cách
này
nên
nếu
ngay
nhiều
như
nhưng
những
nơi
nữa
phải
qua
ra
rằng
rằng
rất
rất
rồi
sau
sẽ

            }
            String dunc = unc.substring(dr.pathConsumed);
            if (dunc.equals("")) {
                dunc = "\\";
            }
            if (!dr.path.equals("")) {
                dunc = "\\" + dr.path + dunc;
            }

            unc = dunc;
            if (request != null && request.path != null && request.path.endsWith("\\") && !dunc.endsWith("\\")) {
                dunc += "\\";

        when(dr.getPath()).thenReturn("dfs/path");
        when(dr.getPathConsumed()).thenReturn(2); // consume leading \\ from UNC

        String newUnc = l.handleDFSReferral(dr, "\\req\\");
        // dunc is "\\" + path + remaining  - note: path may not have leading backslashes
        assertTrue(newUnc.contains("dfs/path") || newUnc.contains("dfs\\path"));
        assertEquals(dr, l.getDfsReferral());

and even Stigand, the patriotic archbishop of Canterbury, found
it advisable--"'

  `Found WHAT?' said the Duck.

  `Found IT,' the Mouse replied rather crossly:  `of course you
know what "it" means.'

  `I know what "it" means well enough, when I find a thing,' said
the Duck:  `it's generally a frog or a worm.  The question is,
what did the archbishop find?'

and even Stigand, the patriotic archbishop of Canterbury, found
it advisable--"'

  `Found WHAT?' said the Duck.

  `Found IT,' the Mouse replied rather crossly:  `of course you
know what "it" means.'

  `I know what "it" means well enough, when I find a thing,' said
the Duck:  `it's generally a frog or a worm.  The question is,
what did the archbishop find?'