Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 81 - 90 of 1,640 for Make (0.02 seconds)

  1. docs/distributed/iam-import-with-missing-entities.sh

    cp docs/distributed/samples/bootstrap-complete.ldif minio-iam-testing/ldap/50-bootstrap.ldif || exit 1
    cd ./minio-iam-testing
    make docker-images
    make docker-run
    cd -
    
    export MC_HOST_myminio="http://minioadmin:minioadmin@localhost:22000"
    export MC_HOST_myminio1="http://minioadmin:minioadmin@localhost:24000"
    
    # Start MinIO instance
    export CI=true
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Mon Nov 11 15:01:29 GMT 2024
    - 4.5K bytes
    - Click Count (1)
  2. cmd/erasure_test.go

    }
    
    func TestErasureEncodeDecode(t *testing.T) {
    	data := make([]byte, 256)
    	if _, err := io.ReadFull(rand.Reader, data); err != nil {
    		t.Fatalf("Failed to read random data: %v", err)
    	}
    	for i, test := range erasureEncodeDecodeTests {
    		buffer := make([]byte, len(data), 2*len(data))
    		copy(buffer, data)
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Wed Apr 09 14:28:39 GMT 2025
    - 4.8K bytes
    - Click Count (0)
  3. internal/event/rulesmap.go

    	rules := make(Rules)
    	rules.Add(pattern, targetID)
    
    	for _, eventName := range eventNames {
    		for _, name := range eventName.Expand() {
    			rulesMap[name] = rulesMap[name].Union(rules)
    		}
    	}
    }
    
    // Clone - returns copy of this rules map.
    func (rulesMap RulesMap) Clone() RulesMap {
    	rulesMapCopy := make(RulesMap)
    
    	for eventName, rules := range rulesMap {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Jun 01 21:59:40 GMT 2021
    - 2.6K bytes
    - Click Count (0)
  4. internal/logger/message/audit/entry.go

    	entry.ReqClaims = reqClaims
    	entry.ReqHost = r.Host
    	entry.ReqPath = r.URL.Path
    
    	q := r.URL.Query()
    	reqQuery := make(map[string]string, len(q))
    	for k, v := range q {
    		reqQuery[k] = strings.Join(v, ",")
    	}
    	entry.ReqQuery = reqQuery
    
    	reqHeader := make(map[string]string, len(r.Header))
    	for k, v := range r.Header {
    		reqHeader[k] = strings.Join(v, ",")
    	}
    	entry.ReqHeader = reqHeader
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 2.2K bytes
    - Click Count (0)
  5. cmd/data-scanner_test.go

    	obj := "obj-1"
    	// Simulate objects uploaded 30 hours ago
    	modTime := now.Add(-48 * time.Hour)
    	uuids := make([]uuid.UUID, 5)
    	for i := range uuids {
    		uuids[i] = uuid.UUID([16]byte{15: uint8(i + 1)})
    	}
    	fivs := make([]FileInfo, 5)
    	objInfos := make([]ObjectInfo, 5)
    	objRetentionMeta := make(map[string]string)
    	objRetentionMeta[strings.ToLower(xhttp.AmzObjectLockMode)] = string(objectlock.RetCompliance)
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 12K bytes
    - Click Count (0)
  6. guava-testlib/src/com/google/common/collect/testing/MinimalIterable.java

     * An implementation of {@code Iterable} which throws an exception on all invocations of the {@link
     * #iterator()} method after the first, and whose iterator is always unmodifiable.
     *
     * <p>The {@code Iterable} specification does not make it absolutely clear what should happen on a
     * second invocation, so implementors have made various choices, including:
     *
     * <ul>
     *   <li>returning the same iterator again
     *   <li>throwing an exception of some kind
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Dec 22 03:38:46 GMT 2024
    - 3.1K bytes
    - Click Count (0)
  7. internal/event/config.go

    	type filterRuleWrapper FilterRule
    	return e.EncodeElement(filterRuleWrapper(filter), start)
    }
    
    // UnmarshalXML - decodes XML data.
    func (filter *FilterRule) UnmarshalXML(d *xml.Decoder, start xml.StartElement) error {
    	// Make subtype to avoid recursive UnmarshalXML().
    	type filterRule FilterRule
    	rule := filterRule{}
    	if err := d.DecodeElement(&rule, &start); err != nil {
    		return err
    	}
    
    	if rule.Name != "prefix" && rule.Name != "suffix" {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 8.4K bytes
    - Click Count (0)
  8. cmd/admin-server-info.go

    	addr := globalLocalNodeName
    	if r != nil {
    		addr = r.Host
    	}
    	if globalIsDistErasure {
    		addr = globalLocalNodeName
    	}
    	poolNumbers := make(map[int]struct{})
    	network := make(map[string]string)
    	for _, ep := range endpointServerPools {
    		for _, endpoint := range ep.Endpoints {
    			if endpoint.IsLocal {
    				poolNumbers[endpoint.PoolIdx+1] = struct{}{}
    			}
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri May 24 23:05:23 GMT 2024
    - 4.9K bytes
    - Click Count (1)
  9. cmd/admin-handlers-idp-openid.go

    		writeErrorResponseJSON(ctx, w, errorCodes.ToAPIErrWithErr(ErrInvalidRequest, err), r.URL)
    		return
    	}
    
    	s := globalServerConfig.Clone()
    	roleArnMap := make(map[string]string)
    	// Map of configs to a map of users to their access keys
    	cfgToUsersMap := make(map[string]map[string]madmin.OpenIDUserAccessKeys)
    	configs, err := globalIAMSys.OpenIDConfig.GetConfigList(s)
    	if err != nil {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sat Sep 06 17:38:46 GMT 2025
    - 7.6K bytes
    - Click Count (0)
  10. cmd/erasure-object_test.go

    	if err != nil {
    		t.Fatal(err)
    	}
    
    	// Make 9 disks offline, which leaves less than quorum number of disks
    	// in a 16 disk Erasure setup. The original disks are 'replaced' with
    	// naughtyDisks that fail after 'f' successful StorageAPI method
    	// invocations, where f - [0,4)
    	for f := range 2 {
    		diskErrors := make(map[int]error)
    		for i := 0; i <= f; i++ {
    			diskErrors[i] = nil
    		}
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 38.3K bytes
    - Click Count (0)
Back to Top