Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 62 for sounds (0.18 sec)

  1. maven-core/src/site/resources/design/2.1-lifecycle-refactor.graffle

    project}AllowLabelDropfalseC{89, 78}{205, 78}StylestrokeHeadArrow.4285709857940674Tail.5Bounds{{155, 53.596}, {118, 14}}ClassShapedGraphicFi.04239773377776146Rot{\rtf1\mac\ansicpg10000\cocoartf824\cocoasubrtf410 {\fonttbl\f0\fswiss\fcharset77 Helvetica;} {\colortbl;\red255\green255\blue255;} \pard\tx560\tx1120\tx1680\tx2240\tx2800\tx3360\tx3920\tx4480\tx5040\tx5600\tx6160\tx6720\qc\pardirnatural \f0\fs24 \cf0 constructBuildPlan()}Bounds{{205.5, 74}, {17, 208}}ClassShapedGraphicHF{1, 0.5}{1, -0.5}{-0.470589, 0.149038}{-0.5,...
    Registered: Wed Jun 12 09:55:16 UTC 2024
    - Last Modified: Sat Mar 11 17:19:02 UTC 2017
    - 96.7K bytes
    - Viewed (0)
  2. test/fixedbugs/issue30116.out

                  slice[-9876543210:9876543210] runtime error: slice bounds out of range [:9876543210] with capacity 3
                          slice[-1:-9876543210] runtime error: slice bounds out of range [:-9876543210]
                                   slice[-1:-1] runtime error: slice bounds out of range [:-1]
                                    slice[-1:0] runtime error: slice bounds out of range [-1:]
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 18 17:33:38 UTC 2019
    - 53.8K bytes
    - Viewed (0)
  3. guava/src/com/google/common/reflect/TypeToken.java

      }
    
      private static Bounds every(Type[] bounds) {
        // Every bound must match. On any false, result is false.
        return new Bounds(bounds, false);
      }
    
      private static Bounds any(Type[] bounds) {
        // Any bound matches. On any true, result is true.
        return new Bounds(bounds, true);
      }
    
      private static class Bounds {
        private final Type[] bounds;
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Mon Jun 26 21:02:13 UTC 2023
    - 53.6K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/reflect/TypeToken.java

      }
    
      private static Bounds every(Type[] bounds) {
        // Every bound must match. On any false, result is false.
        return new Bounds(bounds, false);
      }
    
      private static Bounds any(Type[] bounds) {
        // Any bound matches. On any true, result is true.
        return new Bounds(bounds, true);
      }
    
      private static class Bounds {
        private final Type[] bounds;
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Mon Jun 26 21:02:13 UTC 2023
    - 53.6K bytes
    - Viewed (0)
  5. src/cmd/compile/internal/ssa/prove.go

    //
    // By far, the most common redundant pair are generated by bounds checking.
    // For example for the code:
    //
    //	a[i] = 4
    //	foo(a[i])
    //
    // The compiler will generate the following code:
    //
    //	if i >= len(a) {
    //	    panic("not in bounds")
    //	}
    //	a[i] = 4
    //	if i >= len(a) {
    //	    panic("not in bounds")
    //	}
    //	foo(a[i])
    //
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 04 17:30:21 UTC 2024
    - 48.9K bytes
    - Viewed (0)
  6. src/index/suffixarray/sais2.go

    		if x > 0 {
    			x--
    			saX = sa[x] // TODO bounds check
    			c = text[saX]
    			b = bucket[c] - 1
    			bucket[c] = b
    		}
    	}
    }
    
    func induceL_8_64(text []byte, sa, freq, bucket []int64) {
    	// Initialize positions for left side of character buckets.
    	bucketMin_8_64(text, freq, bucket)
    	bucket = bucket[:256] // eliminate bounds check for bucket[cB] below
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 18 23:57:18 UTC 2024
    - 52.3K bytes
    - Viewed (0)
  7. subprojects/core/src/main/java/org/gradle/groovy/scripts/internal/GradleResolveVisitor.java

                ClassNode classNode = type.getType();
                String name = type.getName();
                ClassNode[] bounds = type.getUpperBounds();
                if (bounds != null) {
                    boolean nameAdded = false;
                    for (ClassNode upperBound : bounds) {
                        if (!nameAdded && upperBound != null || !resolve(classNode)) {
                            genericParameterNames.put(name, type);
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Fri Jan 26 14:58:23 UTC 2024
    - 67.6K bytes
    - Viewed (0)
  8. src/runtime/mheap.go

    	iter := &span.specials
    	found := false
    	for {
    		s := *iter
    		if s == nil {
    			break
    		}
    		if offset == uintptr(s.offset) && kind == s.kind {
    			found = true
    			break
    		}
    		if offset < uintptr(s.offset) || (offset == uintptr(s.offset) && kind < s.kind) {
    			break
    		}
    		iter = &s.next
    	}
    	return iter, found
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 22 22:31:00 UTC 2024
    - 78K bytes
    - Viewed (0)
  9. src/crypto/internal/nistec/fiat/p384_fiat64.go

    //
    // Bounds: [[0x0 ~> 0xffffffffffffffff], [0x0 ~> 0xffffffffffffffff], [0x0 ~> 0xffffffffffffffff], [0x0 ~> 0xffffffffffffffff], [0x0 ~> 0xffffffffffffffff], [0x0 ~> 0xffffffffffffffff]]
    type p384MontgomeryDomainFieldElement [6]uint64
    
    // The type p384NonMontgomeryDomainFieldElement is a field element NOT in the Montgomery domain.
    //
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 05 21:53:03 UTC 2022
    - 90.8K bytes
    - Viewed (0)
  10. src/runtime/pprof/pprof_test.go

    			// loop-i goroutine should be present in the profile too.
    			counts := make(map[string]int)
    			for _, s := range p.Sample {
    				label := s.Label[t.Name()+"-loop-i"]
    				if len(label) > 0 {
    					counts[label[0]]++
    				}
    			}
    			for j, max := 0, len(counts)-1; j <= max; j++ {
    				n := counts[fmt.Sprint(j)]
    				if n == 1 || (n == 2 && j == max) {
    					continue
    				}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 18:42:28 UTC 2024
    - 68.8K bytes
    - Viewed (0)
Back to top