Search Options

Results per page
Sort
Preferred Languages
Advance

Results 581 - 590 of 1,496 for maka (0.04 sec)

  1. internal/lock/lock_windows_test.go

    package lock
    
    import (
    	"strings"
    	"testing"
    )
    
    func TestFixLongPath(t *testing.T) {
    	// 248 is long enough to trigger the longer-than-248 checks in
    	// fixLongPath, but short enough not to make a path component
    	// longer than 255, which is illegal on Windows. (which
    	// doesn't really matter anyway, since this is purely a string
    	// function we're testing, and it's not actually being used to
    	// do a system call)
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Oct 18 18:08:15 UTC 2023
    - 2.2K bytes
    - Viewed (0)
  2. compat/maven-compat/src/test/java/org/apache/maven/project/inheritance/t01/ProjectInheritanceTest.java

    import org.junit.jupiter.api.Test;
    
    import static org.junit.jupiter.api.Assertions.assertEquals;
    
    /**
     * A test which demonstrates maven's recursive inheritance where
     * we are testing to make sure that elements stated in a model are
     * not clobbered by the same elements elsewhere in the lineage.
     *
     */
    @Deprecated
    class ProjectInheritanceTest extends AbstractProjectInheritanceTestCase {
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 3.5K bytes
    - Viewed (0)
  3. guava/src/com/google/common/collect/Hashing.java

        // Get the recommended table size.
        // Round down to the nearest power of 2.
        expectedEntries = max(expectedEntries, 2);
        int tableSize = Integer.highestOneBit(expectedEntries);
        // Check to make sure that we will not exceed the maximum load factor.
        if (expectedEntries > (int) (loadFactor * tableSize)) {
          tableSize <<= 1;
          return (tableSize > 0) ? tableSize : MAX_TABLE_SIZE;
        }
        return tableSize;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 20:24:49 UTC 2024
    - 2.5K bytes
    - Viewed (0)
  4. istioctl/pkg/writer/envoy/configdump/ecds.go

    	if c.configDump == nil {
    		return nil, fmt.Errorf("config writer has not been primed")
    	}
    
    	dump, err := c.configDump.GetEcdsConfigDump()
    	if err != nil {
    		return nil, err
    	}
    
    	ecds := make([]*core.TypedExtensionConfig, 0, len(dump.EcdsFilters))
    	for _, config := range dump.GetEcdsFilters() {
    		c := &core.TypedExtensionConfig{}
    		err := config.GetEcdsFilter().UnmarshalTo(c)
    		if err != nil {
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Sat Jan 14 02:41:27 UTC 2023
    - 2.6K bytes
    - Viewed (0)
  5. doc/go_mem.html

    and not yet overwritten.
    These implementation constraints make Go more like Java or JavaScript,
    in that most races have a limited number of outcomes,
    and less like C and C++, where the meaning of any program with a race
    is entirely undefined, and the compiler may do anything at all.
    Go's approach aims to make errant programs more reliable and easier to debug,
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Mon Mar 04 15:54:42 UTC 2024
    - 26.6K bytes
    - Viewed (0)
  6. internal/hash/checksum.go

    			continue
    		}
    
    		if len(res) == 0 {
    			res = make([]map[string]string, parts)
    		}
    		b = b[n:]
    		for part := 0; part < int(parts); part++ {
    			if len(b) < length {
    				break
    			}
    			// Read part checksum
    			cs := base64.StdEncoding.EncodeToString(b[:length])
    			b = b[length:]
    			if res[part] == nil {
    				res[part] = make(map[string]string, 1)
    			}
    			res[part][typ.String()] = cs
    		}
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Sep 19 12:59:07 UTC 2024
    - 12.7K bytes
    - Viewed (0)
  7. cmd/mrf_gen_test.go

    	v := PartialOperation{}
    	b.ReportAllocs()
    	b.ResetTimer()
    	for i := 0; i < b.N; i++ {
    		v.MarshalMsg(nil)
    	}
    }
    
    func BenchmarkAppendMsgPartialOperation(b *testing.B) {
    	v := PartialOperation{}
    	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])
    	}
    }
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Aug 13 22:26:05 UTC 2024
    - 2.4K bytes
    - Viewed (0)
  8. cmd/tier_gen_test.go

    	v := TierConfigMgr{}
    	b.ReportAllocs()
    	b.ResetTimer()
    	for i := 0; i < b.N; i++ {
    		v.MarshalMsg(nil)
    	}
    }
    
    func BenchmarkAppendMsgTierConfigMgr(b *testing.B) {
    	v := TierConfigMgr{}
    	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])
    	}
    }
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Apr 23 18:58:53 UTC 2021
    - 2.3K bytes
    - Viewed (0)
  9. cmd/metacache-set_gen_test.go

    	v := listPathOptions{}
    	b.ReportAllocs()
    	b.ResetTimer()
    	for i := 0; i < b.N; i++ {
    		v.MarshalMsg(nil)
    	}
    }
    
    func BenchmarkAppendMsglistPathOptions(b *testing.B) {
    	v := listPathOptions{}
    	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])
    	}
    }
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Feb 19 22:54:46 UTC 2024
    - 2.4K bytes
    - Viewed (0)
  10. cmd/metacache-walk_gen_test.go

    	v := WalkDirOptions{}
    	b.ReportAllocs()
    	b.ResetTimer()
    	for i := 0; i < b.N; i++ {
    		v.MarshalMsg(nil)
    	}
    }
    
    func BenchmarkAppendMsgWalkDirOptions(b *testing.B) {
    	v := WalkDirOptions{}
    	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])
    	}
    }
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Nov 21 01:09:35 UTC 2023
    - 2.3K bytes
    - Viewed (0)
Back to top