### **4.1 Spark Pi**

Test the Spark installation by running the following compute intensive example, which calculates pi by “throwing darts” at a circle. The program generates points in the unit square ((0,0) to (1,1)) and counts how many points fall within the unit circle within the square. The result approximates pi.

   */
  public double max() {
    checkState(count != 0);
    return max;
  }

  double sumOfSquaresOfDeltas() {
    return sumOfSquaresOfDeltas;
  }

  /**
   * Calculates the new value for the accumulated mean when a value is added, in the case where at
   * least one of the previous mean and the value is non-finite.
   */

            fileIdField.setAccessible(true);
            byte[] actualFileId = (byte[]) fileIdField.get(request);
            assertArrayEquals(expectedFileId, actualFileId);

            // Verify outputBufferLength is calculated correctly
            Field outputBufferLengthField = Smb2QueryInfoRequest.class.getDeclaredField("outputBufferLength");
            outputBufferLengthField.setAccessible(true);

        if (rem == 0) {
            return size;
        }
        if (rem < 0) {
            rem = 8 + rem;
        }
        return size + 8 - rem;
    }

    /**
     * Calculates padding needed to align to 8-byte boundary from header start.
     *
     * @param dstIndex the current destination index
     * @return number of padding bytes needed
     */

		Description:    "Requests specifying Server Side Encryption with Customer provided keys must provide the client calculated MD5 of the secret key.",
		HTTPStatusCode: http.StatusBadRequest,
	},
	ErrSSECustomerKeyMD5Mismatch: {
		Code:           "InvalidArgument",
		Description:    "The calculated MD5 hash of the key did not match the hash that was provided.",
		HTTPStatusCode: http.StatusBadRequest,
	},

                    response.getSuccessfulShards(), response.getFailedShards());
        }
        return response.getStatus().getStatus();
    }

    /**
     * Calculates the memory size of a document data map.
     * This is useful for monitoring memory usage during indexing operations.
     *
     * @param dataMap the document data as a map of field names to values

      this.comparator = comparator;
      this.size = calculateSize(inputList, comparator);
    }

    /**
     * The number of permutations with repeated elements is calculated as follows:
     *
     * <ul>
     *   <li>For an empty list, it is 1 (base case).
     *   <li>When r numbers are added to a list of n-r elements, the number of permutations is

        SMBUtil.writeInt4(8, buffer, bufferIndex + 4);

        response = spy(response);
        when(response.getHeaderStart()).thenReturn(headerStart);

        // Write FileInternalInfo data at calculated offset (headerStart + bufferOffset)
        SMBUtil.writeInt8(0xFEDCBA9876543210L, buffer, headerStart + 300);

        int result = response.readBytesWireFormat(buffer, bufferIndex);

        } catch (final Exception ex) {
            if (LogStream.level > 0) {
                ex.printStackTrace(log);
            }
        }
        return key;
    }

    /**
     * Calculates the effective user session key.
     *
     * @param challenge The server challenge.
     * @param dest The destination array in which the user session key will be
     * placed.

            getUserSessionKey(tc, chlng, key, 0);
        } catch (Exception ex) {
            log.error("Failed to get session key", ex);
        }
        return key;
    }

    /**
     * Calculates the effective user session key.
     *
     * @param tc
     *            context to use
     * @param chlng
     *            The server challenge.
     * @param dest