Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 21 - 30 of 136 for oops (0.03 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. RELEASE.md

    * Add ops to `tensorflow.raw_ops` that were missing.
    
    * `tf.CheckpointOptions`
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Tue Oct 28 22:27:41 GMT 2025
    - 740.4K bytes
    - Click Count (3)
  2. src/archive/tar/tar_test.go

    // on it must match the list of operations in ops.
    type testFile struct {
    	ops fileOps
    	pos int64
    }
    
    func (f *testFile) Read(b []byte) (int, error) {
    	if len(b) == 0 {
    		return 0, nil
    	}
    	if len(f.ops) == 0 {
    		return 0, io.EOF
    	}
    	s, ok := f.ops[0].(string)
    	if !ok {
    		return 0, errors.New("unexpected Read operation")
    	}
    
    	n := copy(b, s)
    	if len(s) > n {
    		f.ops[0] = s[n:]
    	} else {
    		f.ops = f.ops[1:]
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Jul 25 00:25:45 GMT 2024
    - 23.9K bytes
    - Click Count (0)
  3. guava/src/com/google/common/graph/ValueGraph.java

      /**
       * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently,
       * the number of times an edge touches {@code node}).
       *
       * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}.
       *
       * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of
       * self-loops incident to {@code node}).
       *
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 16K bytes
    - Click Count (0)
  4. android/guava/src/com/google/common/graph/Graph.java

      /**
       * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently,
       * the number of times an edge touches {@code node}).
       *
       * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}.
       *
       * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of
       * self-loops incident to {@code node}).
       *
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 13.6K bytes
    - Click Count (0)
  5. guava/src/com/google/common/graph/Graph.java

      /**
       * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently,
       * the number of times an edge touches {@code node}).
       *
       * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}.
       *
       * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of
       * self-loops incident to {@code node}).
       *
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 13.6K bytes
    - Click Count (0)
  6. internal/dsync/dsync_test.go

    	}
    }
    
    // Borrowed from mutex_test.go
    func HammerMutex(m *DRWMutex, loops int, cdone chan bool) {
    	for range loops {
    		m.Lock(id, source)
    		m.Unlock(context.Background())
    	}
    	cdone <- true
    }
    
    // Borrowed from mutex_test.go
    func TestMutex(t *testing.T) {
    	loops := 200
    	if testing.Short() {
    		loops = 5
    	}
    	c := make(chan bool)
    	m := NewDRWMutex(ds, "test")
    	for range 10 {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 10.8K bytes
    - Click Count (0)
  7. generics.go

    	v := &g[T]{
    		db:  db,
    		ops: make([]op, 0, 5),
    	}
    
    	if len(opts) > 0 {
    		v.ops = append(v.ops, func(db *DB) *DB {
    			return db.Clauses(opts...)
    		})
    	}
    
    	v.createG = &createG[T]{
    		chainG: chainG[T]{
    			execG: execG[T]{g: v},
    		},
    	}
    	return v
    }
    
    type g[T any] struct {
    	*createG[T]
    	db  *DB
    	ops []op
    }
    
    Created: Sun Dec 28 09:35:17 GMT 2025
    - Last Modified: Sun Nov 02 14:09:18 GMT 2025
    - 25.9K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/graph/ArchetypeGraph.java

      /**
       * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently,
       * the number of times an edge touches {@code node}).
       *
       * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}.
       *
       * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of
       * self-loops incident to {@code node}).
       *
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Tue Nov 11 17:11:16 GMT 2025
    - 7.5K bytes
    - Click Count (0)
  9. cmd/xl-storage-format-v2.go

    				consistent = false
    				continue
    			}
    			ver := vers[0]
    			if len(tops) == 0 {
    				consistent = true
    				topSig = ver.header
    			} else {
    				consistent = consistent && ver.header == topSig
    			}
    			tops = append(tops, vers[0])
    		}
    
    		// Check if done...
    		if len(tops) < quorum {
    			// We couldn't gather enough for quorum
    			break
    		}
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 65.6K bytes
    - Click Count (1)
  10. android/guava/src/com/google/common/graph/NetworkBuilder.java

     * user-defined properties.
     *
     * <p>A {@code Network} built by this class has the following default properties:
     *
     * <ul>
     *   <li>does not allow parallel edges
     *   <li>does not allow self-loops
     *   <li>orders {@link Network#nodes()} and {@link Network#edges()} in the order in which the
     *       elements were added (insertion order)
     * </ul>
     *
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 7.4K bytes
    - Click Count (0)
Back to Top