Search Options

Results per page
Sort
Preferred Languages
Advance

Results 31 - 40 of 53 for flts (4.92 sec)

  1. src/crypto/internal/edwards25519/field/fe_generic.go

    	// according to the reduction identity and added to the lowest limb.
    	//
    	// The largest coefficient (r0) will be at most 111 bits, which guarantees
    	// that all carries are at most 111 - 51 = 60 bits, which fits in a uint64.
    	//
    	//     r0 = a0×b0 + 19×(a1×b4 + a2×b3 + a3×b2 + a4×b1)
    	//     r0 < 2⁵²×2⁵² + 19×(2⁵²×2⁵² + 2⁵²×2⁵² + 2⁵²×2⁵² + 2⁵²×2⁵²)
    	//     r0 < (1 + 19 × 4) × 2⁵² × 2⁵²
    	//     r0 < 2⁷ × 2⁵² × 2⁵²
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Sep 27 01:16:19 UTC 2023
    - 8.5K bytes
    - Viewed (0)
  2. src/go/internal/gcimporter/support.go

    	panic(fmt.Sprintf(format, args...))
    }
    
    // deltaNewFile is a magic line delta offset indicating a new file.
    // We use -64 because it is rare; see issue 20080 and CL 41619.
    // -64 is the smallest int that fits in a single byte as a varint.
    const deltaNewFile = -64
    
    // Synthesize a token.Pos
    type fakeFileSet struct {
    	fset  *token.FileSet
    	files map[string]*fileInfo
    }
    
    type fileInfo struct {
    	file     *token.File
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue May 07 20:08:23 UTC 2024
    - 4.1K bytes
    - Viewed (0)
  3. platforms/core-runtime/internal-instrumentation-processor/src/main/java/org/gradle/internal/instrumentation/processor/codegen/groovy/MatchesSignatureGeneratingSignatureTreeVisitor.java

                    CodeBlock.of("$2L == null || $1T.class.isAssignableFrom($2L)", entryChildType.box(), argExpr);
            // Vararg fits here, too:
            result.beginControlFlow("if ($L)", matchExpr);
            visit(child, childArgCount);
            result.endControlFlow();
        }
    
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Mon Oct 02 15:44:14 UTC 2023
    - 7.3K bytes
    - Viewed (0)
  4. tensorflow/compiler/mlir/tfr/python/op_reg_gen.py

      def visit_Constant(self, node):
        return node.value
    
      def visit_keyword(self, node):
        return node.arg, self.visit(node.value)
    
      def visit_List(self, node):
        return [self.visit(cst) for cst in node.elts]
    
      def visit_arguments(self, node):
        return [self.visit(arg) for arg in node.args]
    
      def visit_FunctionDef(self, node):
        # TODO(fengliuai): create one utility method to match different apis and
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Tue Sep 28 21:37:05 UTC 2021
    - 5K bytes
    - Viewed (0)
  5. src/go/types/exprstring.go

    	case *ast.FuncLit:
    		buf.WriteByte('(')
    		WriteExpr(buf, x.Type)
    		buf.WriteString(" literal)") // shortened
    
    	case *ast.CompositeLit:
    		WriteExpr(buf, x.Type)
    		buf.WriteByte('{')
    		if len(x.Elts) > 0 {
    			buf.WriteString("…")
    		}
    		buf.WriteByte('}')
    
    	case *ast.ParenExpr:
    		buf.WriteByte('(')
    		WriteExpr(buf, x.X)
    		buf.WriteByte(')')
    
    	case *ast.SelectorExpr:
    		WriteExpr(buf, x.X)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Feb 08 19:31:44 UTC 2024
    - 4.8K bytes
    - Viewed (0)
  6. bin/init.sh

    DOWNLOAD_COMMAND=""
    function set_download_command () {
      # Try curl.
      if command -v curl > /dev/null; then
        if curl --version | grep Protocols  | grep https > /dev/null; then
          DOWNLOAD_COMMAND="curl -fLSs --retry 5 --retry-delay 1 --retry-connrefused"
          return
        fi
        echo curl does not support https, will try wget for downloading files.
      else
        echo curl is not installed, will try wget for downloading files.
      fi
    Registered: Fri Jun 14 15:00:06 UTC 2024
    - Last Modified: Thu Jan 25 19:11:31 UTC 2024
    - 6.1K bytes
    - Viewed (0)
  7. platforms/software/dependency-management/src/integTest/groovy/org/gradle/integtests/resolve/transform/TransformLoggingIntegrationTest.groovy

                            println "files: " + artifacts.collect { it.file.name }
                        }
                    }
                }
    
                // NOTE: This is named "Red" so that the status message fits on one line
                abstract class Red extends Multiplier {
                    Red() {
                        super("red")
                    }
    
                    @Override
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Tue Oct 24 06:54:47 UTC 2023
    - 8.9K bytes
    - Viewed (0)
  8. src/net/http/http.go

    // TODO(bradfitz): move common stuff here. The other files have accumulated
    // generic http stuff in random places.
    
    // contextKey is a value for use with context.WithValue. It's used as
    // a pointer so it fits in an interface{} without allocation.
    type contextKey struct {
    	name string
    }
    
    func (k *contextKey) String() string { return "net/http context value " + k.name }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Jan 10 03:29:50 UTC 2024
    - 5.1K bytes
    - Viewed (0)
  9. src/strconv/itoa.go

    				// Avoid using r = a%b in addition to q = a/b
    				// since 64bit division and modulo operations
    				// are calculated by runtime functions on 32bit machines.
    				q := u / 1e9
    				us := uint(u - q*1e9) // u % 1e9 fits into a uint
    				for j := 4; j > 0; j-- {
    					is := us % 100 * 2
    					us /= 100
    					i -= 2
    					a[i+1] = smallsString[is+1]
    					a[i+0] = smallsString[is+0]
    				}
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Apr 04 14:21:28 UTC 2024
    - 5.3K bytes
    - Viewed (0)
  10. src/crypto/internal/boring/build-goboring.sh

    	test %rcx,%rcx
    	jne 1f
    
    	# save divisor
    	movq %rdx, %r8
    
    	# reduce top 64 bits mod divisor
    	movq %rsi, %rax
    	xorl %edx, %edx
    	divq %r8
    
    	# reduce full 128-bit mod divisor
    	# quotient fits in 64 bits because top 64 bits have been reduced < divisor.
    	# (even though we only care about the remainder, divq also computes
    	# the quotient, and it will trap if the quotient is too large.)
    	movq %rdi, %rax
    	divq %r8
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Jan 26 22:52:27 UTC 2024
    - 5.6K bytes
    - Viewed (0)
Back to top