*
 * @author James Sexton
 * @param <N> Node parameter type
 */
abstract class AbstractBaseGraph<N> implements BaseGraph<N> {

  /**
   * Returns the number of edges in this graph; used to calculate the size of {@link Graph#edges()}.
   * This implementation requires O(|N|) time. Classes extending this one may manually keep track of
   * the number of edges as the graph is updated, and override this method for better performance.

	if len(endpoints) == 0 || setCount == 0 || setDriveCount == 0 {
		return nil, nil, errInvalidArgument
	}

	// prepare getElapsedTime() to calculate elapsed time since we started trying formatting disks.
	// All times are rounded to avoid showing milli, micro and nano seconds
	formatStartTime := time.Now().Round(time.Second)
	getElapsedTime := func() string {

        assertTrue(bytesRead > 0);
        assertEquals(action, notifyInfo.getAction());
        assertEquals(fileName, notifyInfo.getFileName());
    }

    @Test
    @DisplayName("Test decode correctly calculates bytes read")
    void testDecodeBytesReadCalculation() throws SMBProtocolDecodingException {
        String fileName = "test123.doc";

        try {
            return this.gssContext.getMIC(data, 0, data.length, new MessageProp(false));
        } catch (GSSException e) {
            throw new CIFSException("Failed to calculate MIC", e);
        }
    }

    /**
     * {@inheritDoc}
     *
     * @see jcifs.smb.SSPContext#verifyMIC(byte[], byte[])
     */
    @Override

     */
    private byte[] createMultipleNotificationsBuffer() throws Exception {
        ByteBuffer buffer = ByteBuffer.allocate(1024);
        buffer.order(ByteOrder.LITTLE_ENDIAN);

        // Calculate offsets (must be 4-byte aligned)
        String fileName1 = "file1.txt";
        String fileName2 = "file2.txt";
        String fileName3 = "file3.txt";

        byte[] fileNameBytes1 = fileName1.getBytes("UTF-16LE");

            params.getMarkerFile().set(markerFile);
        });
    }

    private Map<File, String> getProjectBuildDirs() {
        // while this is done in every project, it should be cheap to calculate
        Map<File, String> buildDirs = new HashMap<>();
        for (Project project : getProject().getRootProject().getAllprojects()) {
            buildDirs.put(project.getBuildDir(), project.getPath());
        }

    void testMaxDelayLimit() {
        // Given
        SmbOperationException.RetryPolicy policy = new SmbOperationException.RetryPolicy(10, 1000, 5000, 2.0, true);

        // When - Calculate delays for increasing attempts
        long delay1 = policy.getDelayMs(1);
        long delay2 = policy.getDelayMs(2);
        long delay3 = policy.getDelayMs(3);
        long delay4 = policy.getDelayMs(4);

var (
	errPartSizeZero  = errors.New("Part size cannot be zero")
	errPartSizeIndex = errors.New("Part index cannot be smaller than 1")
)

// calculatePartSizeFromIdx calculates the part size according to input index.
// returns error if totalSize is -1, partSize is 0, partIndex is 0.

	for i, info := range infos {
		// Check if one of the drives in the set is being healed.
		// this information is used by scanner to skip healing
		// this erasure set while it calculates the usage.
		if info.Error != "" || disks[i] == nil {
			continue
		}
		if info.Healing {
			healing++
			if inclHealing {
				healingDisks = append(healingDisks, disks[i])

        CIFSException ex = assertThrows(CIFSException.class, () -> ctx.calculateMIC(data));
        assertTrue(ex.getMessage().contains("Failed to calculate MIC"));
    }

    @Test
    @DisplayName("calculateMIC with null data throws NPE")
    void calculateMIC_nullData() {
        assertThrows(NullPointerException.class, () -> ctx.calculateMIC(null));
    }