Search Options

Results per page
Sort
Preferred Languages
Advance

Results 171 - 180 of 1,162 for Tool (0.66 sec)

  1. LICENSE

    running a program using the Library is not restricted, and output from
    such a program is covered only if its contents constitute a work based
    on the Library (independent of the use of the Library in a tool for
    writing it).  Whether that is true depends on what the Library does
    and what the program that uses the Library does.
    
      1. You may copy and distribute verbatim copies of the Library's
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Mon Jan 18 20:25:38 UTC 2016
    - 25.8K bytes
    - Viewed (0)
  2. tests/association_generics_test.go

    		t.Fatalf("failed to find updated user: %v", err)
    	}
    
    	if len(updatedUser.Pets) != 2 {
    		t.Fatalf("expected 2 pets, got %d", len(updatedUser.Pets))
    	}
    
    	petNames := make(map[string]bool)
    	for _, pet := range updatedUser.Pets {
    		petNames[pet.Name] = true
    	}
    
    	if !petNames["original-pet"] {
    		t.Error("original pet not found")
    	}
    
    	if !petNames["new-pet"] {
    Registered: Sun Dec 28 09:35:17 UTC 2025
    - Last Modified: Fri Sep 12 05:42:26 UTC 2025
    - 37.9K bytes
    - Viewed (0)
  3. compat/maven-embedder/src/main/java/org/apache/maven/cli/MavenCli.java

                    slf4jLogger.debug("  included '{}'", file);
    
                    jars.add(file);
                }
            }
    
            return jars;
        }
    
        //
        // This should probably be a separate tool and not be baked into Maven.
        //
        private void encryption(CliRequest cliRequest) throws Exception {
            if (cliRequest.commandLine.hasOption(CLIManager.ENCRYPT_MASTER_PASSWORD)) {
    Registered: Sun Dec 28 03:35:09 UTC 2025
    - Last Modified: Mon Oct 27 13:24:03 UTC 2025
    - 78.1K bytes
    - Viewed (0)
  4. cmd/erasure-server-pool.go

    	for _, pool := range pools {
    		if opts.SkipDecommissioned && z.IsSuspended(pool.Index) {
    			continue
    		}
    		// Skip object if it's from pools participating in a rebalance operation.
    		if opts.SkipRebalancing && z.IsPoolRebalancing(pool.Index) {
    			continue
    		}
    		if isErrReadQuorum(pool.Err) || pool.Err == nil {
    			errs = append(errs, poolErrs{Err: pool.Err, Index: pool.Index})
    		}
    	}
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Sep 28 20:59:21 UTC 2025
    - 89.2K bytes
    - Viewed (0)
  5. cmd/erasure-server-pool-decom.go

    	for idx, pool := range pools {
    		specifiedPools[pool.endpoints.CmdLine] = idx
    	}
    
    	var update bool
    	// Check if specified pools need to be removed from decommissioned pool.
    	for k := range specifiedPools {
    		pi, ok := rememberedPools[k]
    		if !ok {
    			// we do not have the pool anymore that we previously remembered, since all
    			// the CLI checks out we can allow updates since we are mostly adding a pool here.
    			update = true
    		}
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Sep 28 20:59:21 UTC 2025
    - 42.2K bytes
    - Viewed (1)
  6. cmd/erasure-server-pool-decom_test.go

    			name:           "Invalid-Decom-Pending-Pool-Removal",
    			expectedErr:    false,
    			expectedUpdate: true,
    		},
    		{
    			meta:           nmeta1,
    			pools:          reducedPools,
    			name:           "Correct-Decom-Pool-Removed",
    			expectedErr:    false,
    			expectedUpdate: true,
    		},
    		{
    			meta:           poolMeta{}, // no-pool info available fresh setup.
    			pools:          pools,
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 4.8K bytes
    - Viewed (0)
  7. internal/bpool/pool.go

    package bpool
    
    import "sync"
    
    // Pool is a single type sync.Pool with a few extra properties:
    // If New is not set Get may return the zero value of T.
    type Pool[T any] struct {
    	New func() T
    	p   sync.Pool
    }
    
    // Get will retuen a new T
    func (p *Pool[T]) Get() T {
    	v, ok := p.p.Get().(T)
    	if ok {
    		return v
    	}
    	if p.New == nil {
    		var t T
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Tue Feb 18 16:25:55 UTC 2025
    - 1.2K bytes
    - Viewed (0)
  8. schema/pool.go

    package schema
    
    import (
    	"reflect"
    	"sync"
    )
    
    // sync pools
    var (
    	normalPool      sync.Map
    	poolInitializer = func(reflectType reflect.Type) FieldNewValuePool {
    		v, _ := normalPool.LoadOrStore(reflectType, &sync.Pool{
    			New: func() interface{} {
    				return reflect.New(reflectType).Interface()
    			},
    		})
    		return v.(FieldNewValuePool)
    	}
    Registered: Sun Dec 28 09:35:17 UTC 2025
    - Last Modified: Mon Apr 11 13:37:44 UTC 2022
    - 345 bytes
    - Viewed (0)
  9. cmd/metacache-server-pool.go

    	// Use ID as the object name...
    	o.pool = z.getAvailablePoolIdx(ctx, minioMetaBucket, o.ID, 10<<20)
    	if o.pool < 0 {
    		// No space or similar, don't persist the listing.
    		o.pool = 0
    		o.Create = false
    		o.ID = ""
    		o.Transient = true
    		return entries, errDiskFull
    	}
    	o.set = z.serverPools[o.pool].getHashedSetIndex(o.ID)
    	saver := z.serverPools[o.pool].sets[o.set]
    
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Sep 28 20:59:21 UTC 2025
    - 12.9K bytes
    - Viewed (0)
  10. cmd/erasure-server-pool-rebalance.go

    )
    
    //go:generate msgp -file $GOFILE -unexported
    
    // rebalanceStats contains per-pool rebalance statistics like number of objects,
    // versions and bytes rebalanced out of a pool
    type rebalanceStats struct {
    	InitFreeSpace uint64 `json:"initFreeSpace" msg:"ifs"` // Pool free space at the start of rebalance
    	InitCapacity  uint64 `json:"initCapacity" msg:"ic"`   // Pool capacity at the start of rebalance
    
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Sep 28 20:59:21 UTC 2025
    - 28.7K bytes
    - Viewed (0)
Back to top