Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1451 - 1460 of 2,189 for else_ (0.02 seconds)

  1. src/cmd/asm/internal/arch/loong64.go

    		a.Reg += ((arng_type & loong64.EXT_TYPE_MASK) << loong64.EXT_TYPE_SHIFT)
    		a.Reg += ((simd_type & loong64.EXT_SIMDTYPE_MASK) << loong64.EXT_SIMDTYPE_SHIFT)
    		a.Index = num
    	} else {
    		switch simd_type {
    		case loong64.LSX:
    			arng_type, ok = loong64LsxArngExtMap[ext]
    			if !ok {
    				return errors.New("Loong64 extension: invalid LSX arrangement type: " + ext)
    			}
    
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Aug 05 17:31:25 GMT 2025
    - 3.8K bytes
    - Click Count (0)
  2. build-logic-commons/basics/src/main/kotlin/gradlebuild/basics/transforms/Minify.kt

            if (classesFilter != null) {
                val nameWithoutExtension = Files.getNameWithoutExtension(fileName)
                minify(artifact.get().asFile, classesFilter, outputs.file("$nameWithoutExtension-min.jar"))
            } else {
                outputs.file(artifact)
            }
        }
    
        private
        fun extractArtifactName(fileName: String): String {
            return jarArtifactRegex.matchEntire(fileName)
                ?.groupValues
    Created: Wed Dec 31 11:36:14 GMT 2025
    - Last Modified: Thu Dec 18 11:46:45 GMT 2025
    - 4.9K bytes
    - Click Count (0)
  3. callbacks/helper.go

    				}
    			}
    
    			if _, ok := result[k]; !ok {
    				if v, ok := selectColumns[k]; (ok && v) || (!ok && !restricted) {
    					result[k] = make([]interface{}, len(mapValues))
    					columns = append(columns, k)
    				} else {
    					continue
    				}
    			}
    
    			result[k][idx] = v
    		}
    	}
    
    	sort.Strings(columns)
    	values.Values = make([][]interface{}, len(mapValues))
    	values.Columns = make([]clause.Column, len(columns))
    Created: Sun Dec 28 09:35:17 GMT 2025
    - Last Modified: Thu Apr 14 12:32:57 GMT 2022
    - 3.7K bytes
    - Click Count (0)
  4. src/main/java/jcifs/smb/SmbWatchHandleImpl.java

                    r.setCompletionFilter(this.filter);
                    r.setNotifyFlags(this.recursive ? Smb2ChangeNotifyRequest.SMB2_WATCH_TREE : 0);
                    req = r;
                } else {
                    if (!th.hasCapability(SmbConstants.CAP_NT_SMBS)) {
                        throw new SmbUnsupportedOperationException("Not supported without CAP_NT_SMBS");
                    }
    
                    /*
    Created: Sat Dec 20 13:44:44 GMT 2025
    - Last Modified: Thu Aug 14 07:14:38 GMT 2025
    - 4.5K bytes
    - Click Count (0)
  5. guava/src/com/google/common/hash/AbstractHasher.java

      @CanIgnoreReturnValue
      public Hasher putBytes(ByteBuffer b) {
        if (b.hasArray()) {
          putBytes(b.array(), b.arrayOffset() + b.position(), b.remaining());
          Java8Compatibility.position(b, b.limit());
        } else {
          for (int remaining = b.remaining(); remaining > 0; remaining--) {
            putByte(b.get());
          }
        }
        return this;
      }
    
      @Override
      @CanIgnoreReturnValue
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Sun Dec 22 03:38:46 GMT 2024
    - 3.5K bytes
    - Click Count (0)
  6. guava/src/com/google/common/collect/RegularImmutableSet.java

          return false;
        }
        for (int i = Hashing.smearedHash(target); ; i++) {
          i &= mask;
          Object candidate = table[i];
          if (candidate == null) {
            return false;
          } else if (candidate.equals(target)) {
            return true;
          }
        }
      }
    
      @Override
      public int size() {
        return elements.length;
      }
    
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Sep 22 21:07:18 GMT 2025
    - 3.8K bytes
    - Click Count (0)
  7. cmd/erasure-encode.go

    			continue
    		}
    		var n int
    		n, p.errs[i] = p.writers[i].Write(blocks[i])
    		if p.errs[i] == nil {
    			if n != len(blocks[i]) {
    				p.errs[i] = io.ErrShortWrite
    				p.writers[i] = nil
    			}
    		} else {
    			p.writers[i] = nil
    		}
    	}
    
    	// If nilCount >= p.writeQuorum, we return nil. This is because HealFile() uses
    	// CreateFile with p.writeQuorum=1 to accommodate healing of single disk.
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Wed May 15 00:11:04 GMT 2024
    - 2.9K bytes
    - Click Count (0)
  8. cmd/xl-storage_windows_test.go

    	for i, test := range testCases {
    		t.Run(fmt.Sprint(i), func(t *testing.T) {
    			err = fs.AppendFile(context.Background(), "voldir", test.objName, []byte("hello"))
    			if err != nil && test.pass {
    				t.Error(err)
    			} else if err == nil && !test.pass {
    				t.Error(err)
    			}
    			fs.Delete(context.Background(), "voldir", test.objName, DeleteOptions{
    				Recursive: false,
    				Immediate: false,
    			})
    		})
    	}
    }
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Wed Nov 29 06:35:16 GMT 2023
    - 2.8K bytes
    - Click Count (0)
  9. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http/BridgeInterceptor.kt

          val contentLength = body.contentLength()
          if (contentLength != -1L) {
            requestBuilder.header("Content-Length", contentLength.toString())
            requestBuilder.removeHeader("Transfer-Encoding")
          } else {
            requestBuilder.header("Transfer-Encoding", "chunked")
            requestBuilder.removeHeader("Content-Length")
          }
        }
    
        if (userRequest.header("Host") == null) {
    Created: Fri Dec 26 11:42:13 GMT 2025
    - Last Modified: Wed Mar 19 19:25:20 GMT 2025
    - 4.2K bytes
    - Click Count (0)
  10. android/guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java

      }
    
      /** Previous version of BigIntegerMath.factorial, kept for timing purposes. */
      private static BigInteger oldSlowFactorial(int n) {
        if (n <= 20) {
          return BigInteger.valueOf(LongMath.factorial(n));
        } else {
          int k = 20;
          return BigInteger.valueOf(LongMath.factorial(k)).multiply(oldSlowFactorial(k, n));
        }
      }
    
      /** Returns the product of {@code n1} exclusive through {@code n2} inclusive. */
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 3.5K bytes
    - Click Count (0)
Back to Top