"build-cache",
          "flow-services",
          "input-tracking",
          "internal-integ-testing",
          "model-core",
          "persistent-cache",
          "process-memory-services",
          "scala",
          "snapshots",
          "testing-base-infrastructure"
        ],
        "parallelizationMethod": {
          "name": "TestDistribution"
        }
      },

    `tf.raw_ops.DataFormatDimMap` which can cause uninitialized memory access,
    read outside bounds of arrays, data corruption and segmentation faults
    ([CVE-2020-26267](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2020-26267))
*   Fixes a crash caused by writing to read only memory region
    ([CVE-2020-26268](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2020-26268))

   *       and virtual memory, this is not a problem - because it is mapped read-only, the kernel
   *       can always page it to disk "for free". However, on systems where killing processes
   *       happens all the time in normal conditions (i.e., android) the OS must make a tradeoff

  // We could make this a Map<E, EndpointPair<N>>. It would make incidentNodes(edge) slightly
  // faster, but also make Networks consume 5 to 20+% (increasing with average degree) more memory.
  final MapIteratorCache<E, N> edgeToReferenceNode; // referenceNode == source if directed

  /** Constructs a graph with the properties specified in {@code builder}. */

    "path": "platforms/ide/problems-rendering",
    "unitTests": true,
    "functionalTests": false,
    "crossVersionTests": false
  },
  {
    "name": "process-memory-services",
    "path": "platforms/core-runtime/process-memory-services",
    "unitTests": true,
    "functionalTests": true,
    "crossVersionTests": false
  },
  {
    "name": "process-services",

      // Another variant of Double Checked Locking.
      //
      // We use two volatile reads. We could reduce this to one by
      // putting our fields into a holder class, but (at least on x86)
      // the extra memory consumption and indirection are more
      // expensive than the extra volatile reads.
      long nanos = expirationNanos;
      long now = System.nanoTime();
      if (nanos == 0 || now - nanos >= 0) {

      // Another variant of Double Checked Locking.
      //
      // We use two volatile reads. We could reduce this to one by
      // putting our fields into a holder class, but (at least on x86)
      // the extra memory consumption and indirection are more
      // expensive than the extra volatile reads.
      long nanos = expirationNanos;
      long now = System.nanoTime();
      if (nanos == 0 || now - nanos >= 0) {

  // this doc comment is a modified copy of the inherited doc comment,
  // without the reference to unlimited queues.
  /**
   * Returns the number of additional elements that this queue can ideally (in the absence of memory
   * or resource constraints) accept without blocking. This is always equal to the initial capacity
   * of this queue less the current {@code size} of this queue.
   *

            <option value="$PROJECT_DIR$/platforms/core-runtime/messaging" />
            <option value="$PROJECT_DIR$/platforms/core-runtime/native" />
            <option value="$PROJECT_DIR$/platforms/core-runtime/process-memory-services" />
            <option value="$PROJECT_DIR$/platforms/core-runtime/process-services" />
            <option value="$PROJECT_DIR$/platforms/core-runtime/process-services-api" />

  // this doc comment is a modified copy of the inherited doc comment,
  // without the reference to unlimited queues.
  /**
   * Returns the number of additional elements that this queue can ideally (in the absence of memory
   * or resource constraints) accept without blocking. This is always equal to the initial capacity
   * of this queue less the current {@code size} of this queue.
   *