// and a source of randomness. If random is nil the default PRNG of the
// system (crypto/rand) is used.
func GenerateKey(extKey []byte, random io.Reader) (key ObjectKey) {
	if random == nil {
		random = rand.Reader
	}
	if len(extKey) != 32 { // safety check
		logger.CriticalIf(context.Background(), errors.New("crypto: invalid key length"))
	}
	var nonce [32]byte
	if _, err := io.ReadFull(random, nonce[:]); err != nil {

     * @param bypass whether to bypass MAC signing
     * @throws SmbException if MD5 algorithm is not available
     */
    public SigningDigest(final byte[] macSigningKey, final boolean bypass) throws SmbException {
        try {
            digest = MessageDigest.getInstance("MD5");
        } catch (final NoSuchAlgorithmException ex) {
            if (LogStream.level > 0) {
                ex.printStackTrace(log);
            }

                    }
                } else if (request.isForceUpdate()) {
                    update = true;
                } else if (localCopyLastModified != null && !policy.checkOutOfDate(localCopyLastModified)) {
                    update = false;

                    if (getLogger().isDebugEnabled()) {
                        getLogger()

    }

    /**
     * Checks if a previous page exists.
     *
     * @return true if previous page exists, false otherwise
     */
    public boolean isExistPrePage() {
        return existPrePage;
    }

    /**
     * Sets the flag indicating if a previous page exists.
     *
     * @param existPrePage true if previous page exists, false otherwise
     */

            Object data = trace.getData();
            if (data instanceof CollectStepData collectStepData) {
                collectStepTrace = collectStepData;
            } else if (data instanceof ArtifactDescriptorRequest artifactDescriptorRequestData) {
                artifactDescriptorRequest = artifactDescriptorRequestData;
            } else if (data instanceof ArtifactRequest artifactRequestData) {

			var dexp DelMarkerExpiration
			var fail bool
			err := xml.Unmarshal([]byte(test.xml), &dexp)
			if test.err == nil {
				if err != nil {
					fail = true
				}
			} else {
				if err == nil {
					fail = true
				}
				if test.err.Error() != err.Error() {
					fail = true
				}
			}
			if fail {
				t.Fatalf("Expected %v but got %v", test.err, err)
			}
		})
	}

            case 2:
                if (ch == '[') {
                    String server = str.substring(mark, si).trim();
                    if (server.length() == 0) {
                        // this can also be a v6 address within brackets, look ahead required
                        final int nexts = str.indexOf('[', si + 1);
                        final int nexte = str.indexOf(']', si);

  }

  /**
   * Returns an immutable map containing the same entries as {@code map}. If {@code map} somehow
   * contains entries with duplicate keys (for example, if it is a {@code SortedMap} whose
   * comparator is not <i>consistent with equals</i>), the results of this method are undefined.
   *
   * <p><b>Note:</b> Despite what the method name suggests, if {@code map} is an {@code
   * ImmutableClassToInstanceMap}, no copy will actually be performed.

		select {
		case refreshResult := <-ch:
			if refreshResult.offline {
				continue
			}
			if refreshResult.refreshed {
				lockRefreshed++
			} else {
				lockNotFound++
			}
			if lockRefreshed >= quorum || lockNotFound > len(restClnts)-quorum {
				done = true
			}
		case <-ctx.Done():
			// Refreshing is canceled
			return false, ctx.Err()
		}
		if done {
			break
		}
	}

                Item lastItem = get(i);

                if (lastItem.isNull()) {
                    if (i == size() - 1 || get(i + 1).getType() == STRING_ITEM) {
                        remove(i);
                    } else if (get(i + 1).getType() == LIST_ITEM) {
                        Item item = ((ListItem) get(i + 1)).get(0);
                        if (item.getType() == COMBINATION_ITEM || item.getType() == STRING_ITEM) {