Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 879 for Fill (0.14 sec)

  1. src/bufio/bufio.go

    }
    
    var errNegativeRead = errors.New("bufio: reader returned negative count from Read")
    
    // fill reads a new chunk into the buffer.
    func (b *Reader) fill() {
    	// Slide existing data to beginning.
    	if b.r > 0 {
    		copy(b.buf, b.buf[b.r:b.w])
    		b.w -= b.r
    		b.r = 0
    	}
    
    	if b.w >= len(b.buf) {
    		panic("bufio: tried to fill full buffer")
    	}
    
    	// Read new data: try a limited number of times.
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Thu Oct 12 14:39:08 GMT 2023
    - 21.8K bytes
    - Viewed (0)
  2. src/bytes/buffer_test.go

    			t.Errorf(testname+" (fill 2): m == %d, expected %d", m, len(fus))
    		}
    		if err != nil {
    			t.Errorf(testname+" (fill 3): err should always be nil, found err == %s", err)
    		}
    		s += fus
    		check(t, testname+" (fill 4)", buf, s)
    	}
    	return s
    }
    
    // Fill buf through n writes of byte slice fub.
    // The initial contents of buf corresponds to the string s;
    // the result is the final contents of buf returned as a string.
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Fri Apr 26 13:31:36 GMT 2024
    - 18.6K bytes
    - Viewed (0)
  3. internal/bpool/bpool_test.go

    // the Free Software Foundation, either version 3 of the License, or
    // (at your option) any later version.
    //
    // This program is distributed in the hope that it will be useful
    // but WITHOUT ANY WARRANTY; without even the implied warranty of
    // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    // GNU Affero General Public License for more details.
    //
    Go
    - Registered: Sun Apr 28 19:28:10 GMT 2024
    - Last Modified: Tue Jan 30 19:13:27 GMT 2024
    - 2.6K bytes
    - Viewed (0)
  4. src/bufio/bufio_test.go

    		{
    			name: "fill error, discard less",
    			r: newScriptedReader(func(p []byte) (n int, err error) {
    				if len(p) < 5 {
    					panic("unexpected small read")
    				}
    				return 5, errors.New("5-then-error")
    			}),
    			n:            4,
    			want:         4,
    			wantErr:      nil,
    			wantBuffered: 1,
    		},
    		{
    			name: "fill error, discard equal",
    Go
    - Registered: Tue Apr 30 11:13:12 GMT 2024
    - Last Modified: Fri Feb 10 18:56:01 GMT 2023
    - 51.5K bytes
    - Viewed (0)
  5. internal/grid/muxserver.go

    		go func(inbound chan []byte) {
    			wg.Wait()
    			defer xioutil.SafeClose(handlerIn)
    			m.handleInbound(c, inbound, handlerIn)
    		}(m.inbound)
    	}
    	// Fill outbound block.
    	// Each token represents a message that can be sent to the client without blocking.
    	// The client will refill the tokens as they confirm delivery of the messages.
    	for i := 0; i < outboundCap; i++ {
    		m.outBlock <- struct{}{}
    	}
    
    	// Handler goroutine.
    Go
    - Registered: Sun Apr 21 19:28:08 GMT 2024
    - Last Modified: Thu Apr 04 12:04:40 GMT 2024
    - 9.1K bytes
    - Viewed (0)
  6. cmd/erasure-multipart.go

    // the Free Software Foundation, either version 3 of the License, or
    // (at your option) any later version.
    //
    // This program is distributed in the hope that it will be useful
    // but WITHOUT ANY WARRANTY; without even the implied warranty of
    // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    // GNU Affero General Public License for more details.
    //
    Go
    - Registered: Sun Apr 28 19:28:10 GMT 2024
    - Last Modified: Sun Apr 28 17:53:50 GMT 2024
    - 43K bytes
    - Viewed (0)
  7. cmd/erasure-decode.go

    		readerToBuf:   r2b,
    		stashBuffer:   b,
    	}
    }
    
    // Done will release any resources used by the parallelReader.
    func (p *parallelReader) Done() {
    	if p.stashBuffer != nil {
    		globalBytePoolCap.Load().Put(p.stashBuffer)
    		p.stashBuffer = nil
    	}
    }
    
    // preferReaders can mark readers as preferred.
    // These will be chosen before others.
    func (p *parallelReader) preferReaders(prefer []bool) {
    Go
    - Registered: Sun Apr 28 19:28:10 GMT 2024
    - Last Modified: Fri Apr 19 16:44:59 GMT 2024
    - 9.4K bytes
    - Viewed (0)
  8. internal/amztime/iso8601_time.go

    // the Free Software Foundation, either version 3 of the License, or
    // (at your option) any later version.
    //
    // This program is distributed in the hope that it will be useful
    // but WITHOUT ANY WARRANTY; without even the implied warranty of
    // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    // GNU Affero General Public License for more details.
    //
    Go
    - Registered: Sun Apr 28 19:28:10 GMT 2024
    - Last Modified: Mon Jan 16 23:38:33 GMT 2023
    - 1.9K bytes
    - Viewed (0)
  9. tests/create_test.go

    	if result.RowsAffected != int64(len(users)) {
    		t.Errorf("affected rows should be %v, but got %v", len(users), result.RowsAffected)
    	}
    
    	for _, user := range users {
    		if user.ID == 0 {
    			t.Fatalf("failed to fill user's ID, got %v", user.ID)
    		} else {
    			var newUser User
    			if err := DB.Where("id = ?", user.ID).Preload(clause.Associations).First(&newUser).Error; err != nil {
    				t.Fatalf("errors happened when query: %v", err)
    Go
    - Registered: Sun Apr 28 09:35:09 GMT 2024
    - Last Modified: Tue Mar 19 03:50:28 GMT 2024
    - 26.4K bytes
    - Viewed (0)
  10. internal/grid/grid_test.go

    // the Free Software Foundation, either version 3 of the License, or
    // (at your option) any later version.
    //
    // This program is distributed in the hope that it will be useful
    // but WITHOUT ANY WARRANTY; without even the implied warranty of
    // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    // GNU Affero General Public License for more details.
    //
    Go
    - Registered: Sun Apr 21 19:28:08 GMT 2024
    - Last Modified: Thu Feb 08 18:15:27 GMT 2024
    - 30.1K bytes
    - Viewed (0)
Back to top