ListenableFuture<Boolean> future2 =
        serializer.submit(blockingCallable::isRunning, directExecutor());

    // Wait for the first task to be started in the background. It will block until we explicitly
    // stop it.
    blockingCallable.waitForStart();

    // Give the second task a chance to (incorrectly) start up while the first task is running.
    assertThat(future2.isDone()).isFalse();

    protected int parameterOffset;
    /** Displacement of these parameter bytes from the start of the total parameter block */
    protected int parameterDisplacement;
    /** Offset from the start of the SMB header to the data bytes */
    protected int dataOffset;
    /** Displacement of these data bytes from the start of the total data block */
    protected int dataDisplacement;
    /** Number of setup words in this response */

	shuffledDisks := shuffleDisks(disks, distribution)
	// From the "distribution" above you can notice that:
	// 1st data block is in the 9th disk (i.e distribution index 8)
	// 2nd data block is in the 8th disk (i.e distribution index 7) and so on.
	if shuffledDisks[0] != disks[8] ||
		shuffledDisks[1] != disks[7] ||
		shuffledDisks[2] != disks[9] ||

						<div class="input-group-append">
							<span class="input-group-text">
								<i class="fa fa-lock fa-fw" aria-hidden="true"></i>
							</span>
						</div>
					</div>
					<div class="text-center">
						<button type="submit" name="changePassword"
							class="btn btn-primary btn-block"
							value="<la:message key="labels.login.update"/>">
							<i class="fa fa-pencil-alt" aria-hidden="true"></i>

     * Flag for resource groups in logon information.
     */
    int LOGON_RESOURCE_GROUPS = 0x200;

    /**
     * Kerberos salt type for MD5 checksums.
     */
    int MD5_KRB_SALT = 17;
    /**
     * MD5 block length in bytes.
     */
    int MD5_BLOCK_LENGTH = 64;

            // ignore
        }

        rateLimitHelper.cleanup();
        // After cleanup, the expired entry should be removed
        // Note: The actual expiration depends on the configured block duration
        assertTrue(rateLimitHelper.getBlockedIpCount() >= 0);
    }

	DataBlocks int `json:"data"`
	// ParityBlocks is the number of parity blocks for erasure-coding
	ParityBlocks int `json:"parity"`
	// BlockSize is the size of one erasure-coded block
	BlockSize int64 `json:"blockSize"`
	// Index is the index of the current disk
	Index int `json:"index"`
	// Distribution is the distribution of the data and parity blocks
	Distribution []int `json:"distribution"`

        return ktFile.viewProvider.document?.getLineNumber(startOffset)?.plus(1) ?: -1
    }

    private
    fun KtFile.forEachIncubatingDeclaration(block: (KtNamedDeclaration) -> Unit) {
        collectDescendantsOfType<KtNamedDeclaration>().filter { it.isIncubating }.forEach(block)
    }

    private
    val KtNamedDeclaration.isIncubating: Boolean
        get() = annotationEntries.any { it.shortName?.asString() == "Incubating" }

            parent.appendChild(detailsSection);

            Element title = document.createElement("title");
            detailsSection.appendChild(title);
            title.appendChild(document.createTextNode("Script block details"));

            for (BlockDoc blockDoc : classDoc.getClassBlocks()) {
                blockDetailRenderer.renderTo(blockDoc, detailsSection);
            }

rflow-y-auto{overflow-y:auto!important}.overflow-y-hidden{overflow-y:hidden!important}.overflow-y-visible{overflow-y:visible!important}.overflow-y-scroll{overflow-y:scroll!important}.d-inline{display:inline!important}.d-inline-block{display:inline-block!important}.d-block{display:block!important}.d-grid{display:grid!important}.d-inline-grid{display:inline-grid!important}.d-table{display:table!important}.d-table-row{display:table-row!important}.d-table-cell{display:table-cell!important}.d-flex{di...