// be imported into `graph`. `prefix` is copied and has no lifetime
// requirements.
TF_CAPI_EXPORT extern void TF_ImportGraphDefOptionsSetPrefix(
    TF_ImportGraphDefOptions* opts, const char* prefix);

// Set the execution device for nodes in `graph_def`.
// Only applies to nodes where a device was not already explicitly specified.
// `device` is copied and has no lifetime requirements.

   * set of size {@code m x n x p}, its actual memory consumption is much smaller. When the
   * cartesian set is constructed, the input sets are merely copied. Only as the resulting set is
   * iterated are the individual lists created, and these are not retained after iteration.
   *
   * @param sets the sets to choose elements from, in the order that the elements chosen from those

   * set of size {@code m x n x p}, its actual memory consumption is much smaller. When the
   * cartesian set is constructed, the input sets are merely copied. Only as the resulting set is
   * iterated are the individual lists created, and these are not retained after iteration.
   *
   * @param sets the sets to choose elements from, in the order that the elements chosen from those

  }

  /**
   * Copies an iterator's elements into an array. The iterator will be left exhausted: its {@code
   * hasNext()} method will return {@code false}.
   *
   * @param iterator the iterator to copy
   * @param type the type of the elements
   * @return a newly-allocated array into which all the elements of the iterator have been copied
   */
  @GwtIncompatible // Array.newInstance(Class, int)

  }

  /**
   * Copies an iterator's elements into an array. The iterator will be left exhausted: its {@code
   * hasNext()} method will return {@code false}.
   *
   * @param iterator the iterator to copy
   * @param type the type of the elements
   * @return a newly-allocated array into which all the elements of the iterator have been copied
   */
  @GwtIncompatible // Array.newInstance(Class, int)

  }

  // Verify that stack traces of func is copied to graph function library.
  ASSERT_NE(func_stack_traces, nullptr);
  EXPECT_EQ(func_stack_traces->size(), 4);
  EXPECT_EQ(func_stack_traces->at("neg")->ToString({}), kNegStackToString);
  EXPECT_EQ(func_stack_traces->at("feed")->ToString({}), kFeedStackToString);

  // Verify that stack traces of grad_func is copied to graph function library.

labels.chat_step_answer=Answer
labels.chat_input_hint=Press Enter to send, Shift+Enter for new line
labels.chat_send=Send message
labels.chat_retry=Retry
labels.chat_dismiss=Dismiss
labels.chat_copied=Copied!
labels.chat_copy_failed=Copy failed

labels.chat_filter=Filter
labels.chat_filter_search_placeholder=Search...
labels.chat_clear=Clear
labels.search_file_proxy_enabled=Search File Proxy

labels.chat_step_answer=Answer
labels.chat_input_hint=Press Enter to send, Shift+Enter for new line
labels.chat_send=Send message
labels.chat_retry=Retry
labels.chat_dismiss=Dismiss
labels.chat_copied=Copied!
labels.chat_copy_failed=Copy failed
labels.chat_filter=Filter
labels.chat_filter_search_placeholder=Search...
labels.chat_clear=Clear
labels.search_file_proxy_enabled=Search File Proxy

				success := true
				if err := r.ReplicateToTarget(ctx, api, c, result, retry); err != nil {
					if minio.ToErrorResponse(err).Code == "PreconditionFailed" {
						// pre-condition failed means we already have the object copied over.
						return
					}
					// object must be deleted concurrently, allow these failures but do not count them
					if isErrVersionNotFound(err) || isErrObjectNotFound(err) {
						return
					}

			if i == 3 && err != io.ErrUnexpectedEOF {
				t.Errorf("File[3] error = %v; want io.ErrUnexpectedEOF", err)
			}
			if err == nil && uint64(n) != f.UncompressedSize64 {
				t.Errorf("file %d: bad size: copied=%d; want=%d", i, n, f.UncompressedSize64)
			}
		}
		r.Close()
	}
}

// Verify that this particular malformed zip file is rejected.
func TestIssue10956(t *testing.T) {