Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 391 - 400 of 404 for 12 (0.03 seconds)

  1. src/archive/tar/writer_test.go

    				},
    			}, nil},
    			testClose{nil},
    		},
    	}, {
    		// Craft a theoretically valid PAX archive with global headers.
    		// The GNU and BSD tar tools do not parse these the same way.
    		//
    		// BSD tar v3.1.2 parses and ignores all global headers;
    		// the behavior is verified by researching the source code.
    		//
    		//	$ bsdtar -tvf pax-global-records.tar
    		//	----------  0 0      0           0 Dec 31  1969 file1
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Mon Dec 15 16:34:13 GMT 2025
    - 40.2K bytes
    - Click Count (0)
  2. cmd/site-replication-metrics_gen.go

    	o = bts
    	return
    }
    
    // Msgsize returns an upper bound estimate of the number of bytes occupied by the serialized message
    func (z *SRMetricsSummary) Msgsize() (s int) {
    	s = 1 + 14 + z.ActiveWorkers.Msgsize() + 12 + msgp.Int64Size + 13 + msgp.Int64Size + 7 + z.Queued.Msgsize() + 8 + z.Proxied.Msgsize() + 8 + msgp.MapHeaderSize
    	if z.Metrics != nil {
    		for za0001, za0002 := range z.Metrics {
    			_ = za0002
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 40.3K bytes
    - Click Count (0)
  3. cmd/admin-handlers.go

    	// Verify if we can employ autotune without running out of capacity,
    	// if we do run out of capacity, make sure to turn-off autotuning
    	// in such situations.
    	if autotune {
    		newConcurrent := concurrent + (concurrent+1)/2
    		autoTunedCapacityNeeded := uint64(newConcurrent * size)
    		if capacity < autoTunedCapacityNeeded {
    			// Turn-off auto-tuning if next possible concurrency would reach beyond disk capacity.
    			return true, false, ""
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 99.7K bytes
    - Click Count (0)
  4. LICENSE

      Nothing in this License shall be construed as excluding or limiting
    any implied license or other defenses to infringement that may
    otherwise be available to you under applicable patent law.
    
      12. No Surrender of Others' Freedom.
    
      If conditions are imposed on you (whether by court order, agreement or
    otherwise) that contradict the conditions of this License, they do not
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Apr 23 18:58:53 GMT 2021
    - 33.7K bytes
    - Click Count (0)
  5. .teamcity/test-buckets.json

              "code-quality",
              "maven"
            ],
            "parallelizationMethod": {
              "name": "TestDistribution"
            }
          }
        ]
      },
      {
        "testCoverageUuid": 12,
        "buckets": [
          {
            "subprojects": [
              "dependency-management"
            ],
            "parallelizationMethod": {
              "name": "TestDistribution"
            }
          },
    Created: Wed Dec 31 11:36:14 GMT 2025
    - Last Modified: Fri Aug 01 00:23:04 GMT 2025
    - 119.4K bytes
    - Click Count (0)
  6. cmd/testdata/xl-meta-merge.zip

    ‘öFkZPmA_eTܪIpqrBIºUISTñ FI`ãwdV +c@ò;Ö9Fkxxgi\_†à)[x_sKrS âž_SR]ÅýòyiZp˜¤·wAºûy`¼NqËB€V\mˆrKÎpiUsñh^†w__ì ê 05ê‹az‰ tÑ÷ôÕ7jsœ¢qnªK÷4sJDmt¸[Gt©z· JªñNneåP¾~NowGsX `Aan^¼sTÜY¾—_X ‘¢µI~Xs^°¸.mqò ² ò ï@ªBz{}Õmp TßtlgZk²mx„À¬»ÆPsIT¢o}yrû(}¼ / ¢rxpZª—1‘²“2”¸ 𠍡‚¸šŠ olH ~sM¸Iò¨SWV`¾|be¼~ñs@¨å\CnwX^SqjI. m{{ˆgqn S_mˆv\e††p[_EïT†Ü]ªAp}}@}¼hÇåckH_²ˆßHjwu~¼ þþmyTÕ°Šedfˆær{yM}¦^P}¾y¥VVMXNqªñb²zPK² QZ ]evBqd ÂЫ+M¼7=òŽq\EñêAsTXKoÜæA]ing<ã>U„µŸ‡M{kXiTûn~CªDoQn¾¼}ßgd¨ãu„BpE¦?il ‰ ~[wln :ey2þå_e_sò&PyTE„Vñ7jº²)aïª1>kMV¨ßÏûTIª...
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Mar 08 17:50:48 GMT 2024
    - 30.2K bytes
    - Click Count (0)
  7. cmd/xl-storage-format-v2.go

    	if err != nil {
    		return fmt.Errorf("xlMetaV2.Load %w", err)
    	}
    	var allMeta []byte
    	switch major {
    	case 1:
    		switch minor {
    		case 0:
    			allMeta = buf
    		case 1, 2:
    			v, buf, err := msgp.ReadBytesZC(buf)
    			if err != nil {
    				return fmt.Errorf("xlMetaV2.Load version(%d), bufLen(%d) %w", minor, len(buf), err)
    			}
    			if minor >= 2 {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 65.6K bytes
    - Click Count (1)
  8. tensorflow/c/c_api.h

    // corresponding entry in the `dims` array must be -1.
    //
    // This does not overwrite the existing shape associated with `output`,
    // but merges the input shape with the existing shape.  For example,
    // setting a shape of [-1, 2] with an existing shape [2, -1] would set
    // a final shape of [2, 2] based on shape merging semantics.
    //
    // Returns an error into `status` if:
    //   * `output` is not in `graph`.
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Thu Oct 26 21:08:15 GMT 2023
    - 82.3K bytes
    - Click Count (0)
  9. cmd/data-usage-cache_gen.go

    func (z *dataUsageCacheInfo) Msgsize() (s int) {
    	s = 1 + 5 + msgp.StringPrefixSize + len(z.Name) + 10 + msgp.Uint32Size + 11 + msgp.TimeSize + 12 + msgp.BoolSize
    	return
    }
    
    // DecodeMsg implements msgp.Decodable
    func (z *dataUsageCacheV2) DecodeMsg(dc *msgp.Reader) (err error) {
    	var field []byte
    	_ = field
    	var zb0001 uint32
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 85.5K bytes
    - Click Count (0)
  10. RELEASE.md

        their input and output keys silently ignored and rewritten to 'inputs' and
        'outputs'. If a model was exported with different names before 1.2, and is
        now served with tensorflow/serving, it will accept requests using 'inputs'
        and 'outputs'. Starting at 1.2, such a model will accept the keys specified
        during export. Therefore, inference requests using 'inputs' and 'outputs'
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Tue Oct 28 22:27:41 GMT 2025
    - 740.4K bytes
    - Click Count (3)
Back to Top