- Sort Score
- Num 10 results
- Language All
Results 311 - 320 of 327 for modifications (0.17 seconds)
-
guava/src/com/google/common/collect/Ordering.java
return this.<E>reverse().leastOf(iterator, k); } /** * Returns a <b>mutable</b> list containing {@code elements} sorted by this ordering; use this * only when the resulting list may need further modification, or may contain {@code null}. The * input is not modified. The returned list is serializable and has random access. * * <p>Unlike {@link Sets#newTreeSet(Iterable)}, this method does not discard elements that are
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Feb 23 19:19:10 GMT 2026 - 39.4K bytes - Click Count (0) -
tensorflow/c/c_api.cc
} status->status = graph->graph.UpdateEdge(&new_src.oper->node, new_src.index, &dst.oper->node, dst.index); if (TF_GetCode(status) == TF_OK) { // This modification only updates the destination node for // the purposes of running this graph in a session. Thus, we don't // record the source node as being modified. RecordMutation(graph, *dst.oper, "updating input tensor");
Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Sat Oct 04 05:55:32 GMT 2025 - 102.4K bytes - Click Count (0) -
guava-tests/test/com/google/common/collect/IteratorsTest.java
assertTrue(cycle.hasNext()); cycle.remove(); assertEquals(emptyList(), iterable); assertFalse(cycle.hasNext()); } /** An Iterable whose Iterator is rigorous in checking for concurrent modification. */ private static final class PickyIterable<E> implements Iterable<E> { final List<E> elements; int modCount = 0; PickyIterable(E... elements) {
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Mar 13 13:01:07 GMT 2026 - 57.3K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/collect/IteratorsTest.java
assertTrue(cycle.hasNext()); cycle.remove(); assertEquals(emptyList(), iterable); assertFalse(cycle.hasNext()); } /** An Iterable whose Iterator is rigorous in checking for concurrent modification. */ private static final class PickyIterable<E> implements Iterable<E> { final List<E> elements; int modCount = 0; PickyIterable(E... elements) {
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Mar 13 13:01:07 GMT 2026 - 57.3K bytes - Click Count (0) -
lib/fips140/v1.26.0.zip
become // set{En,De}cryptKeyAsm. I also split setEncryptKeyAsm in two parts // and a new session was created (doEncryptKeyAsm). This was necessary to // avoid arguments overwriting when setDecryptKeyAsm calls setEncryptKeyAsm. // There were other modifications as well but kept the same functionality. #include "textflag.h" // For expandKeyAsm #define INP R3 #define BITS R4 #define OUTENC R5 // Pointer to next expanded encrypt key #define PTR R6 #define CNT R7 #define ROUNDS R8 #define OUTDEC R9 // Pointer...Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0) -
cmd/server_test.go
response, err = s.client.Do(request) c.Assert(err, nil) // verify the status of the HTTP response. c.Assert(response.StatusCode, http.StatusOK) // retrieve the info of last modification time of the object from the response header. lastModified := response.Header.Get("Last-Modified") // Parse it into time.Time structure. t, err := time.Parse(http.TimeFormat, lastModified) c.Assert(err, nil)
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 118.1K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
become // set{En,De}cryptKeyAsm. I also split setEncryptKeyAsm in two parts // and a new session was created (doEncryptKeyAsm). This was necessary to // avoid arguments overwriting when setDecryptKeyAsm calls setEncryptKeyAsm. // There were other modifications as well but kept the same functionality. #include "textflag.h" // For expandKeyAsm #define INP R3 #define BITS R4 #define OUTENC R5 // Pointer to next expanded encrypt key #define PTR R6 #define CNT R7 #define ROUNDS R8 #define OUTDEC R9 // Pointer...Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0) -
cmd/iam.go
// memberships cache. If the specified group does not exist in // storage, it is removed from in-memory maps as well - this // simplifies the implementation for group removal. This is called // only via IAM notifications. func (sys *IAMSys) LoadGroup(ctx context.Context, objAPI ObjectLayer, group string) error { if !sys.Initialized() { return errServerNotInitialized } return sys.store.GroupNotificationHandler(ctx, group)
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Wed Oct 15 17:00:45 GMT 2025 - 76.5K bytes - Click Count (0) -
cmd/admin-handlers.go
cancel() } } domain := globalDomainNames services := madmin.Services{ LDAP: ldap, Logger: log, Audit: audit, Notifications: notifyTarget, } { ctx2, cancel := context.WithTimeout(ctx, operationTimeout) services.KMSStatus = fetchKMSStatus(ctx2) cancel() } return madmin.InfoMessage{
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 99.7K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/Multimaps.java
} i++; /* * The cast is safe because of the containsKey check in hasNext(). (That means it's * unsafe under concurrent modification, but all bets are off then, anyway.) */ return uncheckedCastNullableTToT(map.get(key)); } @Override public void remove() {Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Feb 23 19:19:10 GMT 2026 - 86K bytes - Click Count (0)