TF_Status* status);

// Returns the shape of the Tensor referenced by `output` in `graph`
// into `dims`. `dims` must be an array large enough to hold `num_dims`
// entries (e.g., the return value of TF_GraphGetTensorNumDims).
//
// If the number of dimensions in the shape is unknown or the shape is

		// Setting maxKeys to negative value (15-16).
		{"empty-bucket", "", "", "", -1, ListObjectsInfo{}, nil, true},
		{"empty-bucket", "", "", "", 1, ListObjectsInfo{}, nil, true},
		// Setting maxKeys to a very large value (17).
		{"empty-bucket", "", "", "", 111100000, ListObjectsInfo{}, nil, true},
		// Testing for all 10 objects in the bucket (18).
		{"test-bucket-list-object", "", "", "", 10, resultCases[0], nil, true},

                    Smb2SessionSetupResponse sessResponse = request.getResponse();
                    if (e.getNtStatus() == NtStatus.NT_STATUS_INVALID_PARAMETER) {
                        // a relatively large range of samba versions has a bug causing
                        // an invalid parameter error when a SPNEGO MIC is in place and auth fails
                        throw new SmbAuthException("Login failed", e);

   * is {@code 60}, and the concurrency level is {@code 8}, then eight segments are created, each
   * having a hash table of size eight. Providing a large enough estimate at construction time
   * avoids the need for expensive resizing operations later, but setting this value unnecessarily
   * high wastes memory.
   *

  }

  public void testCapacityForNegativeSizeFails() {
    assertThrows(IllegalArgumentException.class, () -> Maps.capacity(-1));
  }

  /**
   * Tests that nHMWES makes hash maps large enough that adding the expected number of elements
   * won't cause a rehash.
   *
   * <p>As of jdk7u40, HashMap has an empty-map optimization. The argument to new HashMap(int) is

	if b1 != b {
		t.Error("NewReaderSize did not detect underlying Reader")
	}
	// Does it wrap if existing buffer is too small?
	b2 := NewReaderSize(b, 2*BufSize)
	if b2 == b {
		t.Error("NewReaderSize did not enlarge buffer")
	}
}

func TestNewWriterSizeIdempotent(t *testing.T) {
	const BufSize = 1000
	b := NewWriterSize(new(bytes.Buffer), BufSize)
	// Does it recognize itself?
	b1 := NewWriterSize(b, BufSize)

  TF_TString* data = static_cast<TF_TString*>(TF_TensorData(t));
  for (int i = 0; i < batch_size; ++i) {
    TF_TString_Init(&data[i]);
    // The following input string length is large enough to make sure that
    // copy to tstring in large mode.
    std::string source =
        "This is the " + std::to_string(i + 1) + "th. data element\n";
    TF_TString_Copy(&data[i], source.c_str(), source.length());
  }

                    logger.warn("Failed to write cache: sessionId={}, responseData={}", sessionId, responseData, e);
                }
            } else {
                logger.debug("Content size is too large({} > {}): {}", responseData.getContentLength(),
                        fessConfig.getCrawlerDocumentCacheMaxSizeAsInteger(), responseData.getUrl());
            }
        }
        // digest

labels.doc_score=Score :
labels.development_mode_warning=Fess s'exécute en mode développement. Veuillez installer OpenSearch séparément dans un environnement de production.
labels.eol_error=Le système que vous utilisez n'est plus pris en charge. Veuillez vous référer à la page du cycle de vie du support produit et effectuer une mise à niveau.
labels.tooltip_search_view=Écran de recherche
labels.tooltip_run_crawler=Exécuter le robot d'exploration

		maxMemoryBytes -= int64(len(name))
		maxMemoryBytes -= mapEntryOverhead
		if maxMemoryBytes < 0 {
			// We can't actually take this path, since nextPart would already have
			// rejected the MIME headers for being too large. Check anyway.
			apiErr := errorCodes.ToAPIErr(ErrMalformedPOSTRequest)
			apiErr.Description = fmt.Sprintf("%s (%v)", apiErr.Description, multipart.ErrMessageTooLarge)
			writeErrorResponse(ctx, w, apiErr, r.URL)