Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 141 - 150 of 797 for CBytes (0.2 seconds)

  1. src/main/java/jcifs/smb1/smb1/NtlmPasswordAuthentication.java

        /**
         * Creates the NTLM2 response for the supplied information.
         *
         * @param nTOWFv1 the NTOWFv1 hash
         * @param serverChallenge the server challenge bytes
         * @param clientChallenge the client challenge bytes
         * @return the NTLM2 response bytes
         */
        public static byte[] getNTLM2Response(final byte[] nTOWFv1, final byte[] serverChallenge, final byte[] clientChallenge) {
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 26.7K bytes
    - Click Count (0)
  2. src/test/java/jcifs/smb1/smb1/Trans2SetFileInformationTest.java

        }
    
        @Test
        void testWriteDataWireFormat() {
            // Given
            // writeInt8 writes 8 bytes but needs to access dst[dstIndex+7]
            // Total bytes written: 8+8+8+8+2+6=40
            // But writeInt8 at position 34 needs to access position 34+7=41
            // So we need at least 42 bytes in the array
            byte[] dst = new byte[42];
    
            // When
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 3.3K bytes
    - Click Count (0)
  3. tests/scanner_valuer_test.go

    	}
    	return nil
    }
    
    type StringsSlice []string
    
    func (l StringsSlice) Value() (driver.Value, error) {
    	bytes, err := json.Marshal(l)
    	return string(bytes), err
    }
    
    func (l *StringsSlice) Scan(input interface{}) error {
    	switch value := input.(type) {
    	case string:
    		return json.Unmarshal([]byte(value), l)
    	case []byte:
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Wed Jun 07 07:02:07 GMT 2023
    - 10.6K bytes
    - Click Count (0)
  4. guava-tests/test/com/google/common/hash/MessageDigestHashFunctionTest.java

            HashCode.fromBytes(digest.digest(input)), ALGORITHMS.get(algorithmName).hashBytes(input));
        for (int bytes = 4; bytes <= digest.getDigestLength(); bytes++) {
          assertEquals(
              HashCode.fromBytes(Arrays.copyOf(digest.digest(input), bytes)),
              new MessageDigestHashFunction(algorithmName, bytes, algorithmName).hashBytes(input));
        }
        int maxSize = digest.getDigestLength();
        assertThrows(
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 19 18:53:45 GMT 2026
    - 4.9K bytes
    - Click Count (0)
  5. src/bufio/bufio.go

    func (b *Reader) readErr() error {
    	err := b.err
    	b.err = nil
    	return err
    }
    
    // Peek returns the next n bytes without advancing the reader. The bytes stop
    // being valid at the next read call. If necessary, Peek will read more bytes
    // into the buffer in order to make n bytes available. If Peek returns fewer
    // than n bytes, it also returns an error explaining why the read is short.
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Feb 06 17:28:40 GMT 2026
    - 22K bytes
    - Click Count (0)
  6. src/test/java/jcifs/internal/smb1/trans2/Trans2SetFileInformationTest.java

            // Should report 26 bytes written (20 from encode + 6 increment)
            assertEquals(26, written);
    
            // Check that padding bytes are zeros
            // The implementation writes 8 bytes with writeInt8 but only increments by 6
            // This means bytes 20-27 will be zero (8 bytes written by writeInt8)
            for (int i = 20; i < 28; i++) {
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 17.8K bytes
    - Click Count (0)
  7. src/test/java/jcifs/netbios/NodeStatusResponseTest.java

            String name = "TEST            ";
            System.arraycopy(name.getBytes("US-ASCII"), 0, src, srcIndex + 13, 16);
            src[srcIndex + 28] = 0x00; // hex code
            src[srcIndex + 29] = 0x04; // flags
            // MAC address (6 bytes)
            byte[] mac = new byte[6];
            System.arraycopy(mac, 0, src, srcIndex + 31, 6);
            // Stats (6 bytes)
            byte[] stats = new byte[6];
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 07:14:38 GMT 2025
    - 19.3K bytes
    - Click Count (0)
  8. internal/ioutil/hardlimitreader.go

    var ErrOverread = errors.New("input provided more bytes than specified")
    
    // HardLimitReader returns a Reader that reads from r
    // but returns an error if the source provides more data than allowed.
    // This means the source *will* be overread unless EOF is returned prior.
    // The underlying implementation is a *HardLimitedReader.
    // This will ensure that at most n bytes are returned and EOF is reached.
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 2K bytes
    - Click Count (0)
  9. docs/debugging/xl-meta/main.go

    							}
    
    							var buf bytes.Buffer
    							if err := rs.Join(&buf, splitFilled, m.size); err == nil {
    								m.filled = buf.Bytes()
    							}
    							buf = bytes.Buffer{}
    							if err := rs.Join(&buf, splitData, m.size); err == nil {
    								m.mapped = buf.Bytes()
    							}
    							for i, v := range m.filled {
    								if v == 0 {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 40.4K bytes
    - Click Count (0)
  10. src/main/java/jcifs/dcerpc/ndr/NdrBuffer.java

         */
        public void setLength(final int length) {
            this.deferred.length = length;
        }
    
        /**
         * Advances the buffer index by the specified number of bytes.
         *
         * @param n the number of bytes to advance
         */
        public void advance(final int n) {
            this.index += n;
            if (this.index - this.start > this.deferred.length) {
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 10.7K bytes
    - Click Count (0)
Back to Top