} else {
            entry = vertex;
        }

        MetadataTreeNode[] kids = node.getChildren();
        if (kids == null || kids.length < 1) {
            return;
        }

        for (int i = 0; i < kids.length; i++) {
            MetadataTreeNode n = kids[i];
            processTreeNodes(vertex, n, depth + 1, i);
        }
    }

        dstIndex += writeHeaderWireFormat(dst, dstIndex);
        dstIndex += writeAndXWireFormat(dst, dstIndex);
        this.length = dstIndex - start;

        if (this.digest != null) {
            this.digest.sign(dst, this.headerStart, this.length, this, this.getResponse());
        }

        return this.length;
    }

    /*
     * We overload this because we want readAndXWireFormat to

        SuggestItem[] mergedItems = writer.mergeItems(new SuggestItem[] { item1, item2 });

        assertNotNull(mergedItems);
        assertEquals(1, mergedItems.length);
        assertEquals(3, mergedItems[0].getDocFreq());
    }

    @Test
    public void test_mergeItemsWithDifferentTexts() throws Exception {
        String[][] readings1 = new String[1][];

     */
    @Override
    public void verifyMIC(byte[] data, byte[] mic) throws CIFSException {
        try {
            this.gssContext.verifyMIC(mic, 0, mic.length, data, 0, data.length, new MessageProp(false));
        } catch (GSSException e) {
            throw new CIFSException("Failed to verify MIC", e);
        }
    }

    /**
     * {@inheritDoc}
     *

  private static void testReverse(long[] input, long[] expectedOutput) {
    input = Arrays.copyOf(input, input.length);
    Longs.reverse(input);
    assertThat(input).isEqualTo(expectedOutput);
  }

  private static void testReverse(long[] input, int fromIndex, int toIndex, long[] expectedOutput) {
    input = Arrays.copyOf(input, input.length);
    Longs.reverse(input, fromIndex, toIndex);
    assertThat(input).isEqualTo(expectedOutput);
  }

    input = Arrays.copyOf(input, input.length);
    Shorts.reverse(input);
    assertThat(input).isEqualTo(expectedOutput);
  }

  private static void testReverse(
      short[] input, int fromIndex, int toIndex, short[] expectedOutput) {
    input = Arrays.copyOf(input, input.length);
    Shorts.reverse(input, fromIndex, toIndex);
    assertThat(input).isEqualTo(expectedOutput);

    long filter = 0;
    int size = chars.cardinality();
    boolean containsZero = chars.get(0);
    // Compute the hash table.
    char[] table = new char[chooseTableSize(size)];
    int mask = table.length - 1;
    for (int c = chars.nextSetBit(0); c != -1; c = chars.nextSetBit(c + 1)) {
      // Compute the filter at the same time.
      filter |= 1L << c;
      int index = smear(c) & mask;
      while (true) {

        // Context handle (20 bytes)
        if (contextHandle != null) {
            buf.writeOctetArray(contextHandle, 0, Math.min(contextHandle.length, 20));
            // Pad with zeros if context handle is shorter than 20 bytes
            for (int i = contextHandle.length; i < 20; i++) {
                buf.enc_ndr_small(0);
            }
        } else {
            // Write 20 zero bytes for null context handle

                case ' ':
                case '\t':
                case '\n':
                case '#':
                    for (i = 0; i < x && x == ext.length && buf[i] == ext[i]; i++) {

                    }
                    if (i == ext.length) {
                        return new String(type, 0, t, "ASCII");
                    }
                    if (ch == '#') {
                        state = ST_COMM;

        assertNotNull(stackTrace);
        assertTrue(stackTrace.length > 0);

        // Verify cause's stack trace is also available
        StackTraceElement[] causeStackTrace = exception.getCause().getStackTrace();
        assertNotNull(causeStackTrace);
        assertTrue(causeStackTrace.length > 0);
    }

    @Test
    public void test_toString() {
        // Test toString method