Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1301 - 1310 of 1,381 for needn (0.02 seconds)

  1. guava/src/com/google/common/collect/AbstractMapBasedMultimap.java

      }
    
      /*
       * TODO(kevinb): should we copy this javadoc to each concrete class, so that
       * classes like LinkedHashMultimap that need to say something different are
       * still able to {@inheritDoc} all the way from Multimap?
       */
    
      @Override
      Multiset<K> createKeys() {
        return new Multimaps.Keys<K, V>(this);
      }
    
      /**
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Nov 17 22:50:48 GMT 2025
    - 48.4K bytes
    - Click Count (0)
  2. src/cmd/asm/internal/asm/asm.go

    	var flag = int64(0)
    	if len(operands) == 3 {
    		flag = p.evalInteger("TEXT", operands[1])
    		next++
    	}
    
    	// Issue an error if we see a function defined as ABIInternal
    	// without NOSPLIT. In ABIInternal, obj needs to know the function
    	// signature in order to construct the morestack path, so this
    	// currently isn't supported for asm functions.
    	if nameAddr.Sym.ABI() == obj.ABIInternal && flag&obj.NOSPLIT == 0 {
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Mar 20 17:02:17 GMT 2026
    - 27.5K bytes
    - Click Count (0)
  3. cmd/metacache-set.go

    			return entries.len() < o.Limit
    		})
    		if (err != nil && errors.Is(err, io.EOF)) || pastPrefix || r.nextEOF() {
    			return entries, io.EOF
    		}
    		return entries, err
    	}
    
    	// We should not need to filter more.
    	return r.readN(o.Limit, o.InclDeleted, o.IncludeDirectories, o.Versioned, o.Prefix)
    }
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 30.7K bytes
    - Click Count (0)
  4. src/archive/tar/reader.go

    	for {
    		for i := 0; i < s.maxEntries(); i++ {
    			// This termination condition is identical to GNU and BSD tar.
    			if s.entry(i).offset()[0] == 0x00 {
    				break // Don't return, need to process extended headers (even if empty)
    			}
    			offset := p.parseNumeric(s.entry(i).offset())
    			length := p.parseNumeric(s.entry(i).length())
    			if p.err != nil {
    				return nil, p.err
    			}
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Tue Oct 07 19:46:36 GMT 2025
    - 26.9K bytes
    - Click Count (0)
  5. tensorflow/c/eager/c_api.cc

        return nullptr;
      }
      std::vector<int64_t> dimvec(num_dims);
      for (int i = 0; i < num_dims; ++i) {
        dimvec[i] = static_cast<int64_t>(dims[i]);
      }
    
      // TODO(apassos) do we need to wrap the deallocator here to make sure to sync
      // the device?
      TF_ManagedBuffer* buf =
          new TF_ManagedBuffer(data, len, deallocator, deallocator_arg,
                               /*owns_memory=*/false);
    
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Fri Nov 07 05:55:21 GMT 2025
    - 43.9K bytes
    - Click Count (0)
  6. cmd/admin-handlers.go

    	durationStr := r.Form.Get(peerRESTDuration)
    	duration, err := time.ParseDuration(durationStr)
    	if err != nil {
    		duration = globalNetPerfMinDuration
    	}
    
    	if duration < globalNetPerfMinDuration {
    		// We need sample size of minimum 10 secs.
    		duration = globalNetPerfMinDuration
    	}
    
    	duration = duration.Round(time.Second)
    
    	results, err := globalSiteReplicationSys.Netperf(ctx, duration)
    	if err != nil {
    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)
  7. guava-tests/test/com/google/common/collect/IterablesTest.java

        assertThat(Iterables.getLast(iterable, "qux")).isEqualTo("bar");
      }
    
      /**
       * {@link ArrayList} extension that forbids the use of {@link Collection#iterator} for tests that
       * need to prove that it isn't called.
       */
      private static class DiesOnIteratorArrayList extends ArrayList<String> {
        /**
         * @throws UnsupportedOperationException all the time
         */
        @Override
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Mar 13 13:01:07 GMT 2026
    - 47.5K bytes
    - Click Count (0)
  8. src/cmd/asm/internal/asm/parse.go

    			if scale != 0 {
    				p.errorf("expected simple register reference")
    			}
    			a.Type = obj.TYPE_REG
    			a.Reg = r1
    			if r2 != 0 {
    				// Form is R1:R2. It is on RHS and the second register
    				// needs to go into the LHS.
    				panic("cannot happen (Addr.Reg2)")
    			}
    		}
    		// fmt.Printf("REG %s\n", obj.Dconv(&emptyProg, 0, a))
    		p.expectOperandEnd()
    		return
    	}
    
    	// Constant.
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Tue Feb 17 19:57:47 GMT 2026
    - 37.3K bytes
    - Click Count (0)
  9. okhttp/src/jvmTest/kotlin/okhttp3/URLConnectionTest.kt

          when (expected) {
            is SSLException, is TlsFatalAlert -> {}
    
            else -> {
              throw expected
            }
          }
        }
      }
    
      // TODO(jwilson): tests below this marker need to be migrated to OkHttp's request/response API.
      @Test
      fun connectViaHttpsWithSSLFallback() {
        platform.assumeNotBouncyCastle()
    
        server.useHttps(handshakeCertificates.sslSocketFactory())
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 133.3K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java

     *       locks---to each of the acquired locks, an edge from the soon-to-be-acquired lock is either
     *       verified or created.
     *   <li>If a new edge needs to be created, the outgoing edges of the acquired locks are traversed
     *       to check for a cycle that reaches the lock to be acquired. If no cycle is detected, a new
     *       "safe" edge is created.
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Apr 01 17:27:13 GMT 2026
    - 36K bytes
    - Click Count (0)
Back to Top