Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 10 for ReadFrom (0.05 sec)

  1. src/archive/tar/writer_test.go

    					}
    				case testReadFrom:
    					f := &testFile{ops: tf.ops}
    					got, err := tw.readFrom(f)
    					if _, ok := err.(testError); ok {
    						t.Errorf("test %d, ReadFrom(): %v", i, err)
    					} else if got != tf.wantCnt || !equalError(err, tf.wantErr) {
    						t.Errorf("test %d, ReadFrom() = (%d, %v), want (%d, %v)", i, got, err, tf.wantCnt, tf.wantErr)
    					}
    					if len(f.ops) > 0 {
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon Feb 03 16:38:43 UTC 2025
    - 39.8K bytes
    - Viewed (0)
  2. src/bytes/buffer.go

    }
    
    // MinRead is the minimum slice size passed to a [Buffer.Read] call by
    // [Buffer.ReadFrom]. As long as the [Buffer] has at least MinRead bytes beyond
    // what is required to hold the contents of r, [Buffer.ReadFrom] will not grow the
    // underlying buffer.
    const MinRead = 512
    
    // ReadFrom reads data from r until EOF and appends it to the buffer, growing
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon May 19 17:38:56 UTC 2025
    - 16K bytes
    - Viewed (0)
  3. src/archive/tar/writer.go

    	if err != nil && err != ErrWriteTooLong {
    		tw.err = err
    	}
    	return n, err
    }
    
    // readFrom populates the content of the current file by reading from r.
    // The bytes read must match the number of remaining bytes in the current file.
    //
    // If the current file is sparse and r is an io.ReadSeeker,
    // then readFrom uses Seek to skip past holes defined in Header.SparseHoles,
    // assuming that skipped regions are all NULs.
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon Feb 03 16:38:43 UTC 2025
    - 19.7K bytes
    - Viewed (0)
  4. src/bufio/bufio.go

    	n := copy(b.buf[b.n:], s)
    	b.n += n
    	nn += n
    	return nn, nil
    }
    
    // ReadFrom implements [io.ReaderFrom]. If the underlying writer
    // supports the ReadFrom method, this calls the underlying ReadFrom.
    // If there is buffered data and an underlying ReadFrom, this fills
    // the buffer and writes it before calling ReadFrom.
    func (b *Writer) ReadFrom(r io.Reader) (n int64, err error) {
    	if b.err != nil {
    		return 0, b.err
    	}
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Sep 03 14:04:47 UTC 2025
    - 22K bytes
    - Viewed (0)
  5. src/bytes/buffer_test.go

    func TestReadFromPanicReader(t *testing.T) {
    
    	// First verify non-panic behaviour
    	var buf Buffer
    	i, err := buf.ReadFrom(panicReader{})
    	if err != nil {
    		t.Fatal(err)
    	}
    	if i != 0 {
    		t.Fatalf("unexpected return from bytes.ReadFrom (1): got: %d, want %d", i, 0)
    	}
    	check(t, "TestReadFromPanicReader (1)", &buf, "")
    
    	// Confirm that when Reader panics, the empty buffer remains empty
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon May 19 16:13:04 UTC 2025
    - 18.6K bytes
    - Viewed (0)
  6. guava/src/com/google/common/math/PairedStats.java

            "Expected PairedStats.BYTES = %s, got %s",
            BYTES,
            byteArray.length);
        ByteBuffer buffer = ByteBuffer.wrap(byteArray).order(ByteOrder.LITTLE_ENDIAN);
        Stats xStats = Stats.readFrom(buffer);
        Stats yStats = Stats.readFrom(buffer);
        double sumOfProductsOfDeltas = buffer.getDouble();
        return new PairedStats(xStats, yStats, sumOfProductsOfDeltas);
      }
    
      private static final long serialVersionUID = 0;
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue Jul 08 18:32:10 UTC 2025
    - 12.6K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/hash/BloomFilter.java

     * has not actually been put in the {@code BloomFilter}.
     *
     * <p>Bloom filters are serializable. They also support a more compact serial representation via the
     * {@link #writeTo} and {@link #readFrom} methods. Both serialized forms will continue to be
     * supported by future versions of this library. However, serial forms generated by newer versions
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Aug 31 13:15:26 UTC 2025
    - 26.9K bytes
    - Viewed (0)
  8. guava/src/com/google/common/math/Stats.java

        checkNotNull(byteArray);
        checkArgument(
            byteArray.length == BYTES,
            "Expected Stats.BYTES = %s remaining , got %s",
            BYTES,
            byteArray.length);
        return readFrom(ByteBuffer.wrap(byteArray).order(ByteOrder.LITTLE_ENDIAN));
      }
    
      /**
       * Creates a Stats instance from the byte representation read from the given {@link ByteBuffer}.
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue Jul 08 18:32:10 UTC 2025
    - 24.8K bytes
    - Viewed (0)
  9. android/guava-tests/test/com/google/common/hash/BloomFilterTest.java

          bf.put(Ints.toByteArray(i));
        }
    
        ByteArrayOutputStream out = new ByteArrayOutputStream();
        bf.writeTo(out);
    
        BloomFilter<byte[]> read =
            BloomFilter.readFrom(new ByteArrayInputStream(out.toByteArray()), funnel);
        assertThat(read).isEqualTo(bf);
        assertThat(read.expectedFpp()).isGreaterThan(0);
      }
    
      /**
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 22K bytes
    - Viewed (0)
  10. guava-tests/test/com/google/common/hash/BloomFilterTest.java

          bf.put(Ints.toByteArray(i));
        }
    
        ByteArrayOutputStream out = new ByteArrayOutputStream();
        bf.writeTo(out);
    
        BloomFilter<byte[]> read =
            BloomFilter.readFrom(new ByteArrayInputStream(out.toByteArray()), funnel);
        assertThat(read).isEqualTo(bf);
        assertThat(read.expectedFpp()).isGreaterThan(0);
      }
    
      /**
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 22K bytes
    - Viewed (0)
Back to top