* using a {@code LinkedHashSet} instead, at the cost of increased memory footprint, to get
   * deterministic iteration behavior.
   *
   * <p>This method is just a small convenience, either for {@code newHashSet(}{@link Arrays#asList
   * asList}{@code (...))}, or for creating an empty set then calling {@link Collections#addAll}.

              $(location @local_config_def_file_filter//:def_file_filter) \\
              --input $(location :tensorflow_def_file) \\
              --output $@
          """,
        "//conditions:default": "touch $@",  # Just a placeholder for Unix platforms
    }),
    tools = ["@local_config_def_file_filter//:def_file_filter"],
    visibility = ["//visibility:public"],
)

        assertEquals(2, sidArray.sids.length);
        assertNotNull(sidArray.sids[0]);
        assertNotNull(sidArray.sids[1]);
        // Cannot verify decode on non-mock objects - they are created by decode
        // Just verify they were created
        assertNotNull(sidArray.sids[0]);
        assertNotNull(sidArray.sids[1]);
    }

    @Test
    void testLsarSidArrayDecodeNullSids() throws NdrException {

  //    (hypothetical) unsafe read by our caller. Note: adding 'volatile' does not fix this issue,
  //    it would just add an edge such that if done() observed non-null, then it would also
  //    definitely observe all earlier writes, but we still have no guarantee that done() would see
  //    the initial write (just stronger guarantees if it does).
  //
  // See: http://cs.oswego.edu/pipermail/concurrency-interest/2015-January/013800.html

      },
      "french_elision": {
        "type":         "elision",
        "articles_case": true,
        "articles": [
          "l", "m", "t", "qu", "n", "s",
          "j", "d", "c", "jusqu", "quoiqu",
          "lorsqu", "puisqu"
        ]
      },
      "french_stop": {
        "type":       "stop",
        "stopwords":  "_french_"
      },
      "french_keywords": {

      },
      "french_elision": {
        "type":         "elision",
        "articles_case": true,
        "articles": [
          "l", "m", "t", "qu", "n", "s",
          "j", "d", "c", "jusqu", "quoiqu",
          "lorsqu", "puisqu"
        ]
      },
      "french_stop": {
        "type":       "stop",
        "stopwords":  "_french_"
      },
      "french_keywords": {

import com.google.errorprone.annotations.InlineMeValidationDisabled;
import java.util.Arrays;
import java.util.BitSet;

/**
 * Determines a true or false value for any Java {@code char} value, just as {@link Predicate} does
 * for any {@link Object}. Also offers basic text processing methods based on this function.
 * Implementations are strongly encouraged to be side-effect-free and immutable.
 *

	json := jsoniter.ConfigCompatibleWithStandardLibrary
	var doc PolicyDoc
	err := json.Unmarshal(data, &doc)
	if err != nil {
		err2 := json.Unmarshal(data, &doc.Policy)
		if err2 != nil {
			// Just return the first error.
			return err
		}
		d.Policy = doc.Policy
		return nil
	}
	*d = doc
	return nil
}

// key options
type options struct {
	ttl int64 // expiry in seconds
}

      },
      "french_elision": {
        "type":         "elision",
        "articles_case": true,
        "articles": [
          "l", "m", "t", "qu", "n", "s",
          "j", "d", "c", "jusqu", "quoiqu",
          "lorsqu", "puisqu"
        ]
      },
      "french_stop": {
        "type":       "stop",
        "stopwords":  "_french_"
      },
      "french_keywords": {

		for obj := range objInfoCh {
			oi := toObjectInfo(r.Source.Bucket, obj.Key, obj)
			if !minioSrc {
				// Check if metadata filter was requested and it is expected to have
				// all user metadata or just storageClass. If its only storageClass
				// List() already returns relevant information for filter to be applied.
				if isMetadata && !isStorageClassOnly {