Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 291 - 300 of 1,301 for jake (0.03 seconds)

  1. .teamcity/src/main/kotlin/model/BucketExtensions.kt

        }
    }
    
    /**
     * Determine the number of buckets for the first element in the list
     * when it needs to be split into several smaller pieces.
     *
     * The basic idea is:
     * 1. Make sure the rest elements has at least one bucket.
     * 2. Make sure the "roughSizeOfEachBucket" for the rest elements is smaller than the current "roughSizeOfEachBucket".
     */
    private fun <T> determineBucketNumberForLargeElment(
        largestElementSize: Int,
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Wed Feb 12 09:12:03 GMT 2025
    - 5.7K bytes
    - Click Count (0)
  2. cmd/tier_gen.go

    		case "Tiers":
    			var zb0002 uint32
    			zb0002, err = dc.ReadMapHeader()
    			if err != nil {
    				err = msgp.WrapError(err, "Tiers")
    				return
    			}
    			if z.Tiers == nil {
    				z.Tiers = make(map[string]madmin.TierConfig, zb0002)
    			} else if len(z.Tiers) > 0 {
    				clear(z.Tiers)
    			}
    			for zb0002 > 0 {
    				zb0002--
    				var za0001 string
    				za0001, err = dc.ReadString()
    				if err != nil {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 3.9K bytes
    - Click Count (0)
  3. docs/debugging/hash-set/main.go

    // in the slices returned.
    func hashOrder(key string, cardinality int) []int {
    	if cardinality <= 0 {
    		// Returns an empty int slice for cardinality < 0.
    		return nil
    	}
    
    	nums := make([]int, cardinality)
    	keyCrc := crc32.Checksum([]byte(key), crc32.IEEETable)
    
    	start := int(keyCrc % uint32(cardinality))
    	for i := 1; i <= cardinality; i++ {
    		nums[i-1] = 1 + ((start + i) % cardinality)
    	}
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Mon Sep 19 18:05:16 GMT 2022
    - 3.7K bytes
    - Click Count (0)
  4. internal/s3select/sql/utils.go

    package sql
    
    import (
    	"fmt"
    	"strings"
    )
    
    // String functions
    
    // String - returns the JSONPath representation
    func (e *JSONPath) String() string {
    	if len(e.pathString) == 0 {
    		parts := make([]string, len(e.PathExpr)+1)
    		parts[0] = e.BaseKey.String()
    		for i, pe := range e.PathExpr {
    			parts[i+1] = pe.String()
    		}
    		e.pathString = strings.Join(parts, "")
    	}
    	return e.pathString
    }
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Wed Nov 10 16:12:50 GMT 2021
    - 3.6K bytes
    - Click Count (0)
  5. ci/official/containers/ml_build/README.md

    /tensorflow/tools/tf_sig_build_dockerfiles/. However, since
    hermetic CUDA and hermetic Python is now available for Tensorflow, a lot of the
    requirements installed on the original container can be removed to reduce the
    footprint of the container and make it more reusable across different ML
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Tue Sep 24 20:45:58 GMT 2024
    - 416 bytes
    - Click Count (0)
  6. docs/en/docs/_llm-test.md

    The tests:
    
    ## Code snippets { #code-snippets }
    
    //// tab | Test
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 11K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/graph/StandardNetwork.java

      private final ElementOrder<N> nodeOrder;
      private final ElementOrder<E> edgeOrder;
    
      final MapIteratorCache<N, NetworkConnections<N, E>> nodeConnections;
    
      // We could make this a Map<E, EndpointPair<N>>. It would make incidentNodes(edge) slightly
      // faster, but also make Networks consume 5 to 20+% (increasing with average degree) more memory.
      final MapIteratorCache<E, N> edgeToReferenceNode; // referenceNode == source if directed
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Apr 02 14:49:41 GMT 2026
    - 6.9K bytes
    - Click Count (0)
  8. cmd/xl-storage-format-v1_gen_test.go

    	v := ChecksumInfo{}
    	b.ReportAllocs()
    	b.ResetTimer()
    	for i := 0; i < b.N; i++ {
    		v.MarshalMsg(nil)
    	}
    }
    
    func BenchmarkAppendMsgChecksumInfo(b *testing.B) {
    	v := ChecksumInfo{}
    	bts := make([]byte, 0, v.Msgsize())
    	bts, _ = v.MarshalMsg(bts[0:0])
    	b.SetBytes(int64(len(bts)))
    	b.ReportAllocs()
    	b.ResetTimer()
    	for i := 0; i < b.N; i++ {
    		bts, _ = v.MarshalMsg(bts[0:0])
    	}
    }
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 13.2K bytes
    - Click Count (0)
  9. docs/en/docs/how-to/conditional-openapi.md

    If you want to secure your API, there are several better things you can do, for example:
    
    * Make sure you have well defined Pydantic models for your request bodies and responses.
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 2.4K bytes
    - Click Count (0)
  10. docs/en/docs/how-to/migrate-from-pydantic-v1-to-pydantic-v2.md

    You can read it to understand better what has changed.
    
    ## Tests { #tests }
    
    Make sure you have [tests](../tutorial/testing.md) for your app and you run them on continuous integration (CI).
    
    This way, you can do the upgrade and make sure everything is still working as expected.
    
    ## `bump-pydantic` { #bump-pydantic }
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 5.4K bytes
    - Click Count (0)
Back to Top