Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 151 - 160 of 704 for Printf (0.06 seconds)

  1. samples/guide/src/main/java/okhttp3/recipes/PrintEventsNonConcurrent.java

          long nowNanos = System.nanoTime();
          if (name.equals("callStart")) {
            callStartNanos = nowNanos;
          }
          long elapsedNanos = nowNanos - callStartNanos;
          System.out.printf("%.3f %s%n", elapsedNanos / 1000000000d, name);
        }
    
        @Override public void callStart(Call call) {
          printEvent("callStart");
        }
    
        @Override public void proxySelectStart(Call call, HttpUrl url) {
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Sun Feb 16 23:20:49 GMT 2020
    - 5.3K bytes
    - Click Count (0)
  2. internal/s3select/jstream/README.md

    ```go
    f, _ := os.Open("input.json")
    decoder := jstream.NewDecoder(f, 1) // extract JSON values at a depth level of 1
    for mv := range decoder.Stream() {
      fmt.Printf("%v\n ", mv.Value)
    }
    ```
    
    output:
    ```
    map[desc:RGB colors:[red green blue]]
    map[desc:CMYK colors:[cyan magenta yellow black]]
    ```
    
    likewise, increasing depth level to `3` yields:
    ```
    red
    green
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Mon Sep 23 19:35:41 GMT 2024
    - 3.2K bytes
    - Click Count (0)
  3. docs/debugging/hash-set/main.go

    		}
    		for set, files := range distrib {
    			fmt.Println("Set:", set+1, "Objects:", len(files))
    			if !verbose {
    				continue
    			}
    			for _, s := range files {
    				fmt.Printf("\t%s\n", s)
    			}
    		}
    		os.Exit(0)
    	}
    
    	if object == "" {
    		log.Fatalln("object name is mandatory")
    	}
    
    	if shards != 0 {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Mon Sep 19 18:05:16 GMT 2022
    - 3.7K bytes
    - Click Count (0)
  4. internal/s3select/sql/parser_test.go

    	lex, err := sqlLexer.Lex(s)
    	if err != nil {
    		t.Fatal(err)
    	}
    	tokens, err := lexer.ConsumeAll(lex)
    	if err != nil {
    		t.Fatal(err)
    	}
    	// for i, t := range tokens {
    	// 	fmt.Printf("%d: %#v\n", i, t)
    	// }
    	if len(tokens) != 7 {
    		t.Fatalf("Expected 7 got %d", len(tokens))
    	}
    }
    
    func TestSelectWhere(t *testing.T) {
    	p := participle.MustBuild(
    		&Select{},
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Thu Jan 18 07:03:17 GMT 2024
    - 9.2K bytes
    - Click Count (0)
  5. src/test/java/jcifs/smb1/util/LogStreamTest.java

            LogStream logStream = LogStream.getInstance();
    
            // Test various PrintStream methods
            logStream.print("test");
            logStream.print(123);
            logStream.print(true);
            logStream.println();
            logStream.println("line");
            logStream.printf("formatted %d%n", 42);
            logStream.flush();
    
            String output = testOutput.toString();
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 8.3K bytes
    - Click Count (0)
  6. internal/s3select/sql/jsonpath.go

    // If the value should be considered flat (from wildcards) any array returned should be considered individual values.
    func jsonpathEval(p []*JSONPathElement, v any) (r any, flat bool, err error) {
    	// fmt.Printf("JPATHexpr: %v jsonobj: %v\n\n", p, v)
    	if len(p) == 0 || v == nil {
    		return v, false, nil
    	}
    
    	switch {
    	case p[0].Key != nil:
    		key := p[0].Key.keyString()
    
    		switch kvs := v.(type) {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 3.4K bytes
    - Click Count (0)
  7. cmd/erasure-coding.go

    				fmt.Fprintf(os.Stderr, "%v: error on self-test [d:%d,p:%d]: want %#v, got %#v\n", algo, conf[0], conf[1], a, b)
    				ok = false
    				continue
    			}
    			// Delete first shard and reconstruct...
    			first := encoded[0]
    			encoded[0] = nil
    			failOnErr(e.DecodeDataBlocks(encoded))
    			if a, b := first, encoded[0]; !bytes.Equal(a, b) {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 8.5K bytes
    - Click Count (0)
  8. internal/grid/connection.go

    }
    
    // String returns a string representation of the connection.
    func (c *Connection) String() string {
    	return fmt.Sprintf("%s->%s", c.Local, c.Remote)
    }
    
    // StringReverse returns a string representation of the reverse connection.
    func (c *Connection) StringReverse() string {
    	return fmt.Sprintf("%s->%s", c.Remote, c.Local)
    }
    
    // State is a connection state.
    type State uint32
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 46.9K bytes
    - Click Count (0)
  9. cmd/admin-heal-ops.go

    			errMsg = "The provided heal sequence path overlaps with an existing " +
    				fmt.Sprintf("heal path: %s", k)
    			return nil, errorCodes.ToAPIErr(ErrHealOverlappingPaths), errMsg
    		}
    	}
    
    	// Add heal state and start sequence
    	ahs.healSeqMap[hpath] = h
    
    	clientToken := h.clientToken
    	if globalIsDistErasure {
    		clientToken = fmt.Sprintf("%s%s%d", h.clientToken, getKeySeparator(), GetProxyEndpointLocalIndex(globalProxyEndpoints))
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 25.4K bytes
    - Click Count (0)
  10. cmd/admin-handlers_test.go

    	toUniqLock := func(entry madmin.LockEntry) string {
    		return fmt.Sprintf("%s/%s", entry.Resource, entry.ID)
    	}
    	return toUniqLock(b.LockEntries[i]) < toUniqLock(b.LockEntries[j])
    }
    
    func TestTopLockEntries(t *testing.T) {
    	locksHeld := make(map[string][]lockRequesterInfo)
    	var owners []string
    	for i := range 4 {
    		owners = append(owners, fmt.Sprintf("node-%d", i))
    	}
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 13.9K bytes
    - Click Count (1)
Back to Top