return new Promise(resolve => setTimeout(resolve, time));
    }

    /**
     * Converts line data objects into line elements.
     *
     * @param {Object[]} lineData - Dynamically loaded lines.
     * @param {Object} line - Line data object.
     * @returns {Element[]} - Array of line elements.
     */
    lineDataToElements(lineData) {
        return lineData.map(line => {

import org.jspecify.annotations.Nullable;

/**
 * A Bloom filter for instances of {@code T}. A Bloom filter offers an approximate containment test
 * with one-sided error: if it claims that an element is contained in it, this might be in error,
 * but if it claims that an element is <i>not</i> contained in it, then this is definitely true.
 *
 * <p>If you are unfamiliar with Bloom filters, this nice <a

        StackTraceElement[] stack = Thread.currentThread().getStackTrace();
        for (StackTraceElement element : stack) {
            String className = element.getClassName();
            if (className.startsWith("jcifs.smb") && !className.contains("Exception")) {
                return element.getMethodName();
            }
        }
        return "unknown";
    }

        if (log.isDebugEnabled() && holder.allocationStackTrace != null) {
            StringBuilder sb = new StringBuilder("Allocation stack trace:\n");
            for (StackTraceElement element : holder.allocationStackTrace) {
                sb.append("\tat ").append(element).append("\n");
            }
            log.debug(sb.toString());
        }
    }

    /**
     * Report a confirmed resource leak
     */

  /*
   * We are currently considering the elements in buffer in the range [0, bufferSize) as candidates
   * for the top k elements. Whenever the buffer is filled, we quickselect the top k elements to the
   * range [0, k) and ignore the remaining elements.
   */
  private final @Nullable T[] buffer;
  private int bufferSize;

  /**
   * The largest of the lowest k elements we've seen so far relative to this comparator. If

	// Move vector element to scalar.
	XVMOVQ		X0, X31.W[7]    // 1fdcff76
	XVMOVQ		X1, X29.W[0]    // 3dc0ff76
	XVMOVQ		X3, X28.V[3]    // 7cecff76
	XVMOVQ		X4, X27.V[0]    // 9be0ff76
	XVMOVQ		X31.W[7], X0    // e0df0377
	XVMOVQ		X29.W[0], X1    // a1c30377
	XVMOVQ		X28.V[3], X8    // 88ef0377
	XVMOVQ		X27.V[0], X9    // 69e30377

	//Move vector element to vector.
	VMOVQ		V1.B[3], V9.B16 // 298cf772

        }
    }

    /**
     * Validate array size before allocation
     *
     * @param size array size to allocate
     * @param elementSize size of each element
     * @param maxElements maximum allowed elements
     * @throws SmbException if allocation would be too large
     */
    public void validateArrayAllocation(int size, int elementSize, int maxElements) throws SmbException {

        StackTraceElement[] stackTrace = exception.getStackTrace();
        assertNotNull(stackTrace);
        assertTrue(stackTrace.length > 0);

        // First element should be from this test class
        StackTraceElement firstElement = stackTrace[0];
        assertEquals(this.getClass().getName(), firstElement.getClassName());

	a := make([][]byte, len(spans))
	for i, span := range spans {
		a[i] = s[span.start:span.end:span.end]
	}

	return a
}

// Join concatenates the elements of s to create a new byte slice. The separator
// sep is placed between elements in the resulting slice.
func Join(s [][]byte, sep []byte) []byte {
	if len(s) == 0 {
		return []byte{}
	}
	if len(s) == 1 {
		// Just return a copy.

             */

            try {
                final SmbFile[] l = listFiles("*", ATTR_DIRECTORY | ATTR_HIDDEN | ATTR_SYSTEM, null, null);
                for (final SmbFile element : l) {
                    element.delete();
                }
            } catch (final SmbException se) {
                /* Oracle FilesOnline version 9.0.4 doesn't send '.' and '..' so