Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 84 for len (0.02 seconds)

  1. src/bytes/bytes.go

    	}
    
    	var n int
    	if len(sep) > 0 {
    		if len(sep) >= maxInt/(len(s)-1) {
    			panic("bytes: Join output length overflow")
    		}
    		n += len(sep) * (len(s) - 1)
    	}
    	for _, v := range s {
    		if len(v) > maxInt-n {
    			panic("bytes: Join output length overflow")
    		}
    		n += len(v)
    	}
    
    	b := bytealg.MakeNoZero(n)[:n:n]
    	bp := copy(b, s[0])
    	for _, v := range s[1:] {
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Mar 12 17:56:55 GMT 2026
    - 36.3K bytes
    - Click Count (0)
  2. scripts/doc_parsing_utils.py

        modified_text: list[str] = text.copy()
    
        if len(header_permalinks) != len(original_header_permalinks):
            raise ValueError(
                "Number of headers with permalinks does not match the number in the "
                "original document "
                f"({len(header_permalinks)} vs {len(original_header_permalinks)})"
            )
    
        for header_no in range(len(header_permalinks)):
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 17:37:41 GMT 2026
    - 23.5K bytes
    - Click Count (0)
  3. tests/helper_test.go

    					"Number")
    			}
    		}
    	})
    
    	t.Run("Pets", func(t *testing.T) {
    		if len(user.Pets) != len(expect.Pets) {
    			t.Fatalf("pets should equal, expect: %v, got %v", len(expect.Pets), len(user.Pets))
    		}
    
    		sort.Slice(user.Pets, func(i, j int) bool {
    			return user.Pets[i].ID > user.Pets[j].ID
    		})
    
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Sat Mar 21 11:27:38 GMT 2026
    - 8.6K bytes
    - Click Count (0)
  4. src/cmd/asm/internal/asm/endtoend_test.go

    		// giving the absolute form.
    		if len(f) > 0 && strings.Contains(printed, "(PC)") {
    			index := len(f) - 1
    			suf := "(PC)"
    			for !strings.HasSuffix(f[index], suf) {
    				index--
    				suf = "(PC),"
    			}
    			str := f[index]
    			n, err := strconv.Atoi(str[:len(str)-len(suf)])
    			if err == nil {
    				f[index] = fmt.Sprintf("%d%s", seq+n, suf)
    			}
    		}
    
    		if len(f) == 1 {
    			printed = f[0]
    		} else {
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Mar 20 17:02:17 GMT 2026
    - 12.6K bytes
    - Click Count (0)
  5. android/guava/src/com/google/common/hash/Murmur3_32HashFunction.java

      @Override
      public HashCode hashBytes(byte[] input, int off, int len) {
        checkPositionIndexes(off, off + len, input.length);
        int h1 = seed;
        int i;
        for (i = 0; i + CHUNK_SIZE <= len; i += CHUNK_SIZE) {
          int k1 = mixK1(getIntLittleEndian(input, off + i));
          h1 = mixH1(h1, k1);
        }
    
        int k1 = 0;
        for (int shift = 0; i < len; i++, shift += 8) {
          k1 ^= toUnsignedInt(input[off + i]) << shift;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 19 18:53:45 GMT 2026
    - 11.8K bytes
    - Click Count (0)
  6. utils/utils.go

    }
    
    func callerFrame(skip int) runtime.Frame {
    	pcs := [13]uintptr{}
    	// skip is caller-path sensitive and should be selected by each public helper.
    	len := runtime.Callers(skip, pcs[:])
    	frames := runtime.CallersFrames(pcs[:len])
    	for i := 0; i < len; i++ {
    		// second return value is "more", not "ok"
    		frame, _ := frames.Next()
    		if (!strings.HasPrefix(frame.File, gormSourceDir) ||
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Sat Mar 21 11:35:55 GMT 2026
    - 4.9K bytes
    - Click Count (0)
  7. src/bytes/bytes_test.go

    		a[i] = byte(17 * i)
    		b_init[i] = byte(23*i + 100)
    	}
    
    	for len := 0; len <= size; len++ {
    		for x := 0; x <= size-len; x++ {
    			for y := 0; y <= size-len; y++ {
    				copy(b, b_init)
    				copy(b[y:y+len], a[x:x+len])
    				if !Equal(a[x:x+len], b[y:y+len]) || !Equal(b[y:y+len], a[x:x+len]) {
    					t.Errorf("Equal(%d, %d, %d) = false", len, x, y)
    				}
    			}
    		}
    	}
    }
    
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Wed Mar 11 03:07:05 GMT 2026
    - 62.9K bytes
    - Click Count (0)
  8. tests/test_sse.py

        ]
        assert len(data_lines) == 3
    
    
    def test_dict_items(client: TestClient):
        response = client.get("/items/stream-dict")
        assert response.status_code == 200
        data_lines = [
            line for line in response.text.strip().split("\n") if line.startswith("data: ")
        ]
        assert len(data_lines) == 3
        assert '"name"' in data_lines[0]
    
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Sun Mar 01 09:21:52 GMT 2026
    - 9.8K bytes
    - Click Count (0)
  9. callbacks.go

    	return cs.processors["raw"]
    }
    
    func (p *processor) Execute(db *DB) *DB {
    	// call scopes
    	for len(db.Statement.scopes) > 0 {
    		db = db.executeScopes()
    	}
    
    	var (
    		curTime           = time.Now()
    		stmt              = db.Statement
    		resetBuildClauses bool
    	)
    
    	if len(stmt.BuildClauses) == 0 {
    		stmt.BuildClauses = p.Clauses
    		resetBuildClauses = true
    	}
    
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Sat Mar 21 11:26:07 GMT 2026
    - 8.8K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/io/ByteStreams.java

      // (You know that it's either going to read len bytes or stop at EOF.)
      public static int read(InputStream in, byte[] b, int off, int len) throws IOException {
        checkNotNull(in);
        checkNotNull(b);
        if (len < 0) {
          throw new IndexOutOfBoundsException(String.format("len (%s) cannot be negative", len));
        }
        checkPositionIndexes(off, off + len, b.length);
        int total = 0;
        while (total < len) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 23 21:06:42 GMT 2026
    - 31.1K bytes
    - Click Count (0)
Back to Top