Search Options

Results per page
Sort
Preferred Languages
Advance

Results 101 - 110 of 531 for flen (0.02 sec)

  1. misc/ios/detect.go

    	}
    	return bytes.TrimSpace(out), nil
    }
    
    func getLines(cmd *exec.Cmd) [][]byte {
    	out := output(cmd)
    	lines := bytes.Split(out, []byte("\n"))
    	// Skip the empty line at the end.
    	if len(lines[len(lines)-1]) == 0 {
    		lines = lines[:len(lines)-1]
    	}
    	return lines
    }
    
    func output(cmd *exec.Cmd) []byte {
    	out, err := cmd.Output()
    	if err != nil {
    		fmt.Println(strings.Join(cmd.Args, "\n"))
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Thu Oct 19 23:33:30 UTC 2023
    - 3.2K bytes
    - Viewed (0)
  2. src/bufio/bufio_test.go

    	var texts [31]string
    	str := ""
    	all := ""
    	for i := 0; i < len(texts)-1; i++ {
    		texts[i] = str + "\n"
    		all += texts[i]
    		str += string(rune(i%26 + 'a'))
    	}
    	texts[len(texts)-1] = all
    
    	for h := 0; h < len(texts); h++ {
    		text := texts[h]
    		for i := 0; i < len(readMakers); i++ {
    			for j := 0; j < len(bufreaders); j++ {
    				for k := 0; k < len(bufsizes); k++ {
    					readmaker := readMakers[i]
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Fri Feb 07 01:08:54 UTC 2025
    - 51.6K bytes
    - Viewed (0)
  3. cmd/metacache-walk.go

    			if entry == "" {
    				continue
    			}
    			meta := metaCacheEntry{name: pathJoinBuf(sb, current, entry)}
    
    			// If directory entry on stack before this, pop it now.
    			for len(dirStack) > 0 && dirStack[len(dirStack)-1] < meta.name {
    				pop := dirStack[len(dirStack)-1]
    				select {
    				case <-ctx.Done():
    					return ctx.Err()
    				case out <- metaCacheEntry{name: pop}:
    				}
    				if opts.Recursive {
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Mon May 26 07:06:43 UTC 2025
    - 12.6K bytes
    - Viewed (0)
  4. src/bufio/bufio.go

    		return nil, ErrNegativeCount
    	}
    
    	b.lastByte = -1
    	b.lastRuneSize = -1
    
    	for b.w-b.r < n && b.w-b.r < len(b.buf) && b.err == nil {
    		b.fill() // b.w-b.r < len(b.buf) => buffer is not full
    	}
    
    	if n > len(b.buf) {
    		return b.buf[b.r:b.w], ErrBufferFull
    	}
    
    	// 0 <= n <= len(b.buf)
    	var err error
    	if avail := b.w - b.r; avail < n {
    		// not enough data in buffer
    		n = avail
    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/main/java/jcifs/smb1/dcerpc/ndr/NdrBuffer.java

            align(4);
            int i = index;
            final int len = s.length();
            Encdec.enc_uint32le(len + 1, buf, i);
            i += 4;
            Encdec.enc_uint32le(0, buf, i);
            i += 4;
            Encdec.enc_uint32le(len + 1, buf, i);
            i += 4;
            try {
                System.arraycopy(s.getBytes("UTF-16LE"), 0, buf, i, len * 2);
            } catch (final UnsupportedEncodingException uee) {}
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 10.4K bytes
    - Viewed (0)
  6. src/bufio/net_test.go

    	n, err := io.Copy(clientConn, r)
    	if err != nil {
    		t.Fatal(err)
    	}
    
    	if n != int64(len(data)) {
    		t.Errorf("io.Copy returned %d, want %d", n, len(data))
    	}
    
    	clientConn.Close()
    	tot := <-ch
    
    	if tot != len(data) {
    		t.Errorf("server read %d, want %d", tot, len(data))
    	}
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Fri Feb 07 19:37:07 UTC 2025
    - 1.9K bytes
    - Viewed (0)
  7. src/main/java/jcifs/smb1/netbios/SocketInputStream.java

            return read(b, 0, b.length);
        }
    
        /* This method will not return until len bytes have been read
         * or the stream has been closed.
         */
    
        @Override
        public synchronized int read(final byte[] b, int off, int len) throws IOException {
            if (len == 0) {
                return 0;
            }
            int tot = 0;
    
            while (true) {
                while (bip > 0) {
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 07:14:38 UTC 2025
    - 3.3K bytes
    - Viewed (0)
  8. src/main/java/jcifs/smb1/smb1/NtlmContext.java

                final int id = Encdec.dec_uint16le(type2token, ri);
                final int len = Encdec.dec_uint16le(type2token, ri + 2);
                ri += 4;
                if (id == 0 || ri + len > type2token.length) {
                    break;
                }
                if (id == id0) {
                    try {
                        return new String(type2token, ri, len, SmbConstants.UNI_ENCODING);
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 7K bytes
    - Viewed (0)
  9. cmd/object-api-utils.go

    	if isMinioMetaBucketName(bucket) {
    		return true
    	}
    	if len(bucket) < 3 || len(bucket) > 63 {
    		return false
    	}
    
    	// Split on dot and check each piece conforms to rules.
    	allNumbers := true
    	pieces := strings.Split(bucket, dnsDelimiter)
    	for _, piece := range pieces {
    		if len(piece) == 0 || piece[0] == '-' ||
    			piece[len(piece)-1] == '-' {
    			// Current piece has 0-length or starts or
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Wed Jun 25 15:08:54 UTC 2025
    - 37.3K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/hash/AbstractNonStreamingHashFunction.java

      }
    
      @Override
      public HashCode hashUnencodedChars(CharSequence input) {
        int len = input.length();
        ByteBuffer buffer = ByteBuffer.allocate(len * 2).order(ByteOrder.LITTLE_ENDIAN);
        for (int i = 0; i < len; i++) {
          buffer.putChar(input.charAt(i));
        }
        return hashBytes(buffer.array());
      }
    
      @Override
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Dec 21 03:10:51 UTC 2024
    - 3.8K bytes
    - Viewed (0)
Back to top