Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 691 - 700 of 1,277 for Khan (0.03 seconds)

  1. architecture/standards/0008-use-nullaway.md

    Prefer rearranging the code to avoid the error, unless there is a provable performance penalty or a significant loss of code readability.
    Use `Objects.requireNonNull` statement or `Preconditions` rather than `assert` or `@SuppressWarning` annotation to suppress if possible.
    
    For gradual adoption, enable checks project-by-project.
    Do not rely on `@NullMarked` annotations.
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Thu Mar 05 12:39:41 GMT 2026
    - 4K bytes
    - Click Count (0)
  2. compat/maven-compat/src/main/java/org/apache/maven/artifact/resolver/DebugResolutionListener.java

            logger.debug(indent + artifact + " (not setting artifactScope to: " + ignoredScope + "; local artifactScope "
                    + artifact.getScope() + " wins)");
    
            // TODO better way than static? this might hide messages in a reactor
            if (!ignoredArtifacts.contains(artifact)) {
                logger.warn("\n\tArtifact " + artifact + " retains local artifactScope '" + artifact.getScope()
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Fri Jun 06 14:28:57 GMT 2025
    - 5.8K bytes
    - Click Count (0)
  3. internal/config/etcd/etcd.go

    		Encoding: "console",
    	}
    	cfg.Endpoints = etcdEndpoints
    	cfg.CoreDNSPath = env.Get(EnvEtcdCoreDNSPath, kvs.Get(CoreDNSPath))
    	// Default path prefix for all keys on etcd, other than CoreDNSPath.
    	cfg.PathPrefix = env.Get(EnvEtcdPathPrefix, kvs.Get(PathPrefix))
    	if etcdSecure {
    		cfg.TLS = &tls.Config{
    			RootCAs:                  rootCAs,
    			PreferServerCipherSuites: true,
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri May 16 14:27:42 GMT 2025
    - 5.2K bytes
    - Click Count (0)
  4. guava-tests/test/com/google/common/collect/ImmutableEnumMapTest.java

                new Function<AnEnum, AnEnum>() {
                  boolean used = false;
    
                  @Override
                  public AnEnum apply(AnEnum ae) {
                    checkState(!used, "should not be applied more than once");
                    used = true;
                    return ae;
                  }
                });
        ImmutableMap<AnEnum, AnEnum> copy = immutableEnumMap(map);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Dec 26 20:08:09 GMT 2025
    - 6.7K bytes
    - Click Count (0)
  5. docs/en/docs/tutorial/server-sent-events.md

    {* ../../docs_src/server_sent_events/tutorial001_py310.py ln[1:25] hl[10:12,23] *}
    
    /// tip
    
    As Pydantic will serialize it in the **Rust** side, you will get much higher **performance** than if you don't declare a return type.
    
    ///
    
    ### Non-async *path operation functions* { #non-async-path-operation-functions }
    
    You can also use regular `def` functions (without `async`), and use `yield` the same way.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 4.6K bytes
    - Click Count (0)
  6. docs/en/docs/tutorial/stream-json-lines.md

    /// tip
    
    As Pydantic will serialize it in the **Rust** side, you will get much higher **performance** than if you don't declare a return type.
    
    ///
    
    ### Non-async *path operation functions* { #non-async-path-operation-functions }
    
    You can also use regular `def` functions (without `async`), and use `yield` the same way.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 4.3K bytes
    - Click Count (0)
  7. build-tools-internal/src/main/java/org/elasticsearch/gradle/internal/NoticeTask.java

        public void generateNotice() throws IOException {
            StringBuilder output = new StringBuilder();
            output.append(readFileToString(inputFile, "UTF-8"));
            output.append("\n\n");
            // This is a map rather than a set so that the sort order is the 3rd
            // party component names, unaffected by the full path to the various files
            final Map<String, File> seen = new TreeMap<String, File>();
    Created: Wed Apr 08 16:19:15 GMT 2026
    - Last Modified: Tue Jun 01 09:19:30 GMT 2021
    - 6.9K bytes
    - Click Count (0)
  8. internal/event/target/elasticsearch.go

    type ElasticsearchTarget struct {
    	initOnce once.Init
    
    	id         event.TargetID
    	args       ElasticsearchArgs
    	client     esClient
    	store      store.Store[event.Event]
    	loggerOnce logger.LogOnce
    	quitCh     chan struct{}
    }
    
    // ID - returns target ID.
    func (target *ElasticsearchTarget) ID() event.TargetID {
    	return target.id
    }
    
    // Name - returns the Name of the target.
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 15K bytes
    - Click Count (0)
  9. guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt

      Just then her head struck against the roof of the hall:  in
    fact she was now more than nine feet high, and she at once took
    up the little golden key and hurried off to the garden door.
    
      Poor Alice!  It was as much as she could do, lying down on one
    side, to look through into the garden with one eye; but to get
    through was more hopeless than ever:  she sat down and began to
    cry again.
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Oct 29 21:35:03 GMT 2012
    - 145.2K bytes
    - Click Count (0)
  10. src/bytes/bytes.go

    		if haveFastIndex {
    			if j := bytealg.Index(s[i-last:], b[:n]); j >= 0 {
    				return i + j - last
    			}
    		} else {
    			// If bytealg.Index is not available a brute force search is
    			// ~1.5-3x faster than Rabin-Karp since n is small.
    			c0 := b[last]
    			c1 := b[last-1] // There are at least 2 chars to match
    		loop:
    			for ; i < len(s); i++ {
    				if s[i] == c0 && s[i-1] == c1 {
    					for k := 2; k < n; k++ {
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Mar 12 17:56:55 GMT 2026
    - 36.3K bytes
    - Click Count (0)
Back to Top