Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 921 - 930 of 1,015 for Appendf (0.09 seconds)

  1. cmd/bucket-lifecycle.go

    	defer es.mu.Unlock()
    	var workers []chan expiryOp
    	if v := es.workers.Load(); v != nil {
    		// Copy to new array.
    		workers = append(workers, *v...)
    	}
    
    	if n == len(workers) || n < 1 {
    		return
    	}
    
    	for len(workers) < n {
    		input := make(chan expiryOp, 10000)
    		workers = append(workers, input)
    		go es.Worker(input)
    		es.stats.workers.Add(1)
    	}
    
    	for len(workers) > n {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 33.7K bytes
    - Click Count (0)
  2. internal/s3select/csv/reader_contrib_test.go

    	for i, c := range cases {
    		t.Run(c.file, func(t *testing.T) {
    			var err error
    			var record sql.Record
    			var result bytes.Buffer
    			input := openTestFile(t, c.file)
    			// Get above block size.
    			input = append(input, input...)
    			args := ReaderArgs{
    				FileHeaderInfo:             use,
    				RecordDelimiter:            c.recordDelimiter,
    				FieldDelimiter:             c.fieldDelimiter,
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 38.4K bytes
    - Click Count (0)
  3. tests/generics_test.go

    		},
    	}
    
    	ctx := context.Background()
    	db := gorm.G[User](DB)
    	db.CreateInBatches(ctx, &users, 100)
    
    	var userIDs []uint
    	for _, user := range users {
    		userIDs = append(userIDs, user.ID)
    	}
    
    	users2, err := db.Joins(clause.LeftJoin.Association("Manager"), nil).
    		Joins(clause.LeftJoin.Association("Manager.Company"), nil).
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Tue Dec 30 08:11:14 GMT 2025
    - 34.9K bytes
    - Click Count (0)
  4. src/archive/zip/reader_test.go

    				if err != nil {
    					if !test.wantErr {
    						t.Errorf("%s: %v", path, err)
    					}
    					sawErr = true
    					return nil
    				}
    				files = append(files, path)
    				return nil
    			})
    			if err != nil {
    				t.Errorf("fs.WalkDir error: %v", err)
    			}
    			if test.wantErr && !sawErr {
    				t.Error("succeeded but want error")
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Jan 15 18:35:56 GMT 2026
    - 57.9K bytes
    - Click Count (0)
  5. build-logic/documentation/src/main/groovy/gradlebuild/docs/dsl/docbook/JavadocConverter.java

                tagValue = new StringBuilder();
            }
    
            @Override
            public void onText(String text) {
                if (tagValue != null) {
                    tagValue.append(text);
                    return;
                }
    
                if (!handlerStack.isEmpty()) {
                    handlerStack.getFirst().onText(text);
                    return;
                }
    
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Wed May 21 06:20:45 GMT 2025
    - 29.3K bytes
    - Click Count (0)
  6. lib/fips140/v1.26.0.zip

    func (d *Digest) AppendBinary(b []byte) ([]byte, error) { switch d.dsbyte { case dsbyteSHA3: b = append(b, magicSHA3...) case dsbyteShake: b = append(b, magicShake...) case dsbyteCShake: b = append(b, magicCShake...) case dsbyteKeccak: b = append(b, magicKeccak...) default: panic("unknown dsbyte") } // rate is at most 168, and n is at most rate. b = append(b, byte(d.rate)) b = append(b, d.a[:]...) b = append(b, byte(d.n), byte(d.state)) return b, nil } func (d *Digest) UnmarshalBinary(b []byte) error...
    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)
  7. cmd/xl-storage_test.go

    	}
    
    	testCases := []struct {
    		fileName    string
    		expectedErr error
    	}{
    		{"myobject", nil},
    		{"path/to/my/object", nil},
    		// TestXLStorage to append to previously created file.
    		{"myobject", nil},
    		// TestXLStorage to use same path of previously created file.
    		{"path/to/my/testobject", nil},
    		// TestXLStorage to use object is a directory now.
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 66K bytes
    - Click Count (0)
  8. internal/grid/connection.go

    			if len(c.outQueue) == 0 {
    				// Yield to allow more messages to fill.
    				runtime.Gosched()
    			}
    			if len(c.outQueue) > 0 {
    				queue = append(queue, toSend)
    				queueSize += len(toSend)
    				continue
    			}
    		}
    		c.outMessages.Add(int64(len(queue) + 1))
    		if c.outgoingBytes != nil {
    			c.outgoingBytes(int64(len(toSend) + queueSize))
    		}
    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/data-usage-cache.go

    	add = func(path dataUsageHash) {
    		e, ok := d.Cache[path.Key()]
    		if !ok {
    			return
    		}
    		if len(e.Children) == 0 {
    			return
    		}
    		sz := d.sizeRecursive(path.Key())
    		leaves = append(leaves, struct {
    			objects uint64
    			path    dataUsageHash
    		}{objects: sz.Objects, path: path})
    		for ch := range e.Children {
    			add(dataUsageHash(ch))
    		}
    	}
    
    	// Add path recursively.
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 34.7K bytes
    - Click Count (0)
  10. internal/ringbuffer/ring_buffer_test.go

    	}
    	if n != 16 {
    		t.Fatalf("expect write 16 bytes but got %d", n)
    	}
    	if rb.Free() != 0 {
    		t.Fatalf("expect free 0 bytes but got %d. r.w=%d, r.r=%d", rb.Free(), rb.w, rb.r)
    	}
    	if !bytes.Equal(append(buf, rb.Bytes(nil)...), []byte(strings.Repeat("abcd", 16)+strings.Repeat("1234", 4))) {
    		t.Fatalf("expect 16 abcd and 4 1234 but got %s. r.w=%d, r.r=%d", rb.Bytes(nil), rb.w, rb.r)
    	}
    }
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 26.7K bytes
    - Click Count (0)
Back to Top