- Sort Score
- Result 10 results
- Languages All
Results 251 - 260 of 1,032 for cend (0.08 sec)
-
internal/event/target/amqp.go
if err := ch.Confirm(false); err != nil { ch.Close() return nil, nil, err } return ch, confirms, nil } return ch, nil, nil } // send - sends an event to the AMQP091. func (target *AMQPTarget) send(eventData event.Event, ch *amqp091.Channel, confirms chan amqp091.Confirmation) error { objectName, err := url.QueryUnescape(eventData.S3.Object.Key) if err != nil { return err }
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Sep 06 23:06:30 UTC 2024 - 10K bytes - Viewed (0) -
internal/grid/README.md
Returning any error will also cancel the stream remotely. CAREFUL: When utilizing two-way communication, it is important to ensure that the remote handler is not blocked on a send. If the remote handler is blocked on a send, and the client is trying to send without the remote receiving, the operation would become deadlocked if the channels are full. ### Typed handlers
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Jan 18 07:03:17 UTC 2024 - 9.4K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/http/CallServerInterceptor.kt
invokeStartEvent = false } if (responseBuilder == null) { if (requestBody.isDuplex()) { // Prepare a duplex body so that the application can send a request body later. exchange.flushRequest() val bufferedRequestBody = exchange.createRequestBody(request, true).buffer() requestBody.writeTo(bufferedRequestBody) } else {
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 6.3K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* substituted. Also, implementations of {@code hashCode} tend to be poor-quality, in part because * they end up depending on <i>other</i> existing poor-quality {@code hashCode} implementations, * including those in many JDK classes. * * <p>{@code Object.hashCode} implementations tend to be very fast, but have weak collision
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue May 25 18:22:59 UTC 2021 - 10.9K bytes - Viewed (0) -
guava/src/com/google/common/hash/HashFunction.java
* substituted. Also, implementations of {@code hashCode} tend to be poor-quality, in part because * they end up depending on <i>other</i> existing poor-quality {@code hashCode} implementations, * including those in many JDK classes. * * <p>{@code Object.hashCode} implementations tend to be very fast, but have weak collision
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue May 25 18:22:59 UTC 2021 - 10.9K bytes - Viewed (0) -
guava/src/com/google/common/net/InetAddresses.java
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:26:48 UTC 2024 - 47.1K bytes - Viewed (0) -
.zenodo.json
{ "description": "TensorFlow is an end-to-end open source platform for machine learning. It has a comprehensive, flexible ecosystem of tools, libraries, and community resources that lets researchers push the state-of-the-art in ML and developers easily build and deploy ML-powered applications.", "license": "Apache-2.0", "title": "TensorFlow", "upload_type": "software", "creators": [ { "name": "TensorFlow Developers" }
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Tue May 18 19:19:25 UTC 2021 - 741 bytes - Viewed (0) -
internal/ringbuffer/ring_buffer.go
w int // next position to write isFull bool err error block bool mu sync.Mutex wg sync.WaitGroup readCond *sync.Cond // Signaled when data has been read. writeCond *sync.Cond // Signaled when data has been written. } // New returns a new RingBuffer whose buffer has the given size. func New(size int) *RingBuffer { return &RingBuffer{ buf: make([]byte, size),
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Wed May 15 00:11:04 UTC 2024 - 13.3K bytes - Viewed (0) -
tensorflow/c/eager/gradient_checker.cc
namespace gradients { using namespace std; // ================== Helper functions ================= // Fills data with values [start,end) with given step size. void Range(vector<int32_t>* data, int32_t start, int32_t end, int32_t step = 1) { for (int32_t i = start; i < end; i += step) { (*data)[i] = i; } } // Fills out_dims with the dimensions of the given tensor.
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Sat Oct 12 05:11:17 UTC 2024 - 7.3K bytes - Viewed (0) -
docs/en/docs/virtual-environments.md
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sat Aug 24 03:16:23 UTC 2024 - 21.7K bytes - Viewed (0)