Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 531 - 540 of 741 for Number (0.04 seconds)

  1. internal/bucket/replication/replication_test.go

    		if err != nil {
    			t.Fatalf("Got unexpected error: %v", err)
    		}
    		got := cfg.FilterActionableRules(ObjectOpts{Name: tc.prefix})
    		if len(got) != len(tc.ExpectedRules) {
    			t.Fatalf("Expected matching number of actionable rules: `%v`, got: `%v`", tc.ExpectedRules, got)
    		}
    		for i := range got {
    			if got[i].Destination.ARN != tc.ExpectedRules[i].Destination.ARN || got[i].Priority != tc.ExpectedRules[i].Priority {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 32.4K bytes
    - Click Count (0)
  2. cmd/bucket-metadata-sys.go

    type BucketMetadataSys struct {
    	objAPI ObjectLayer
    
    	sync.RWMutex
    	initialized bool
    	group       *singleflight.Group
    	metadataMap map[string]BucketMetadata
    }
    
    // Count returns number of bucket metadata map entries.
    func (sys *BucketMetadataSys) Count() int {
    	sys.RLock()
    	defer sys.RUnlock()
    
    	return len(sys.metadataMap)
    }
    
    // Remove bucket metadata from memory.
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 20.4K bytes
    - Click Count (0)
  3. cmd/bucket-targets.go

    	defaultHealthCheckReloadDuration = 30 * time.Minute
    )
    
    type arnTarget struct {
    	Client      *TargetClient
    	lastRefresh time.Time
    }
    
    // arnErrs represents number of errors seen for a ARN and if update is in progress
    // to refresh remote targets from bucket metadata.
    type arnErrs struct {
    	count            int64
    	updateInProgress bool
    	bucket           string
    }
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 20.9K bytes
    - Click Count (0)
  4. RELEASE.md

    *   Fixes a number of `CHECK`-failures in `MapStage`
        ([CVE-2022-21734](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2022-21734))
    *   Fixes a division by zero in `FractionalMaxPool`
        ([CVE-2022-21735](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2022-21735))
    *   Fixes a number of `CHECK`-fails when building invalid/overflowing tensor
        shapes
    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)
  5. LICENSE

      Each version is given a distinguishing version number.  If the
    Program specifies that a certain numbered version of the GNU Affero General
    Public License "or any later version" applies to it, you have the
    option of following the terms and conditions either of that numbered
    version or of any later version published by the Free Software
    Foundation.  If the Program does not specify a version number of the
    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)
  6. internal/grid/muxclient.go

    			}
    			m.addErrorNonBlockingClose(errResp, context.Cause(m.ctx))
    			return
    		case <-pingTimer:
    			errState = !m.doPing(errResp)
    		}
    	}
    }
    
    // checkSeq will check if sequence number is correct and increment it by 1.
    func (m *muxClient) checkSeq(seq uint32) (ok bool) {
    	if seq != m.RecvSeq {
    		if debugPrint {
    			fmt.Printf("MuxID: %d client, expected sequence %d, got %d\n", m.MuxID, m.RecvSeq, seq)
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 15.9K bytes
    - Click Count (0)
  7. src/bufio/scan_test.go

    			break
    		}
    	}
    	if got, want := scanner.Err(), ErrBadReadCount; got != want {
    		t.Errorf("scanner.Err: got %v, want %v", got, want)
    	}
    }
    
    // largeReader returns an invalid count that is larger than the number
    // of bytes requested.
    type largeReader struct{}
    
    func (largeReader) Read(p []byte) (int, error) {
    	return len(p) + 1, nil
    }
    
    // Test that the scanner doesn't panic and returns ErrBadReadCount
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Fri Sep 22 16:22:42 GMT 2023
    - 14.3K bytes
    - Click Count (0)
  8. tensorflow/c/c_api_experimental.cc

      DCHECK(index >= 0 && index < shape_list->num_items);
      TF_ShapeAndType& shape = shape_list->items[index];
      DCHECK(shape.dims == nullptr) << "Shape at " << index << " is already set!";
      DCHECK(num_dims >= 0) << "Number of dimensions cannot be negative!";
      shape.num_dims = num_dims;
      shape.dims = new int64_t[num_dims];
      memcpy(shape.dims, dims, sizeof(int64_t) * num_dims);
    }
    
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Sat Oct 04 05:55:32 GMT 2025
    - 29.4K bytes
    - Click Count (0)
  9. docs/zh-hant/docs/async.md

    要讓 `await` 運作,它必須位於支持非同步功能的函式內。為此,只需使用 `async def` 宣告函式:
    
    ```Python hl_lines="1"
    async def get_burgers(number: int):
        # Do some asynchronous stuff to create the burgers
        return burgers
    ```
    
    ...而不是 `def`:
    
    ```Python hl_lines="2"
    # This is not asynchronous
    def get_sequential_burgers(number: int):
        # Do some sequential stuff to create the burgers
        return burgers
    ```
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sun Aug 31 09:56:21 GMT 2025
    - 21.1K bytes
    - Click Count (0)
  10. docs/zh/docs/async.md

    要使 `await` 工作,它必须位于支持这种异步机制的函数内。因此,只需使用 `async def` 声明它:
    
    ```Python hl_lines="1"
    async def get_burgers(number: int):
        # Do some asynchronous stuff to create the burgers
        return burgers
    ```
    
    ...而不是 `def`:
    
    ```Python hl_lines="2"
    # This is not asynchronous
    def get_sequential_burgers(number: int):
        # Do some sequential stuff to create the burgers
        return burgers
    ```
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sun Aug 31 09:56:21 GMT 2025
    - 21.5K bytes
    - Click Count (0)
Back to Top