Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 251 - 255 of 255 for Healing (0.08 seconds)

  1. src/cmd/asm/internal/asm/testdata/riscv64.s

    	VSMULVV		V1, V2, V3			// d781209e
    	VSMULVV		V1, V2, V0, V3			// d781209c
    	VSMULVX		X10, V2, V3			// d741259e
    	VSMULVX		X10, V2, V0, V3			// d741259c
    
    	// 31.12.4: Vector Single-Width Scaling Shift Instructions
    	VSSRLVV		V1, V2, V3			// d78120aa
    	VSSRLVV		V1, V2, V0, V3			// d78120a8
    	VSSRLVX		X10, V2, V3			// d74125aa
    	VSSRLVX		X10, V2, V0, V3			// d74125a8
    	VSSRLVI		$15, V2, V3			// d7b127aa
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Nov 13 12:17:37 GMT 2025
    - 73.7K bytes
    - Click Count (0)
  2. lib/fips140/v1.1.0-rc1.zip

    (xLimbs[i] ^ dLimbs[i])) xLimbs[i], carry = bits.Add(l, l, carry) dLimbs[i], borrow = bits.Sub(xLimbs[i], mLimbs[i], borrow) } // Like in maybeSubtractModulus, we need the subtraction if either it // didn't underflow (meaning 2x + b > m) or if computing 2x + b // overflowed (meaning 2x + b > 2^_W*n > m). needSubtraction = not(choice(borrow)) | choice(carry) } return x.assign(needSubtraction, d) } // Mod calculates out = x mod m. // // This works regardless how large the value of x is. // // The output...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
  3. cmd/object-handlers.go

    	}
    	return false
    }
    
    // CopyObjectHandler - Copy Object
    // ----------
    // This implementation of the PUT operation adds an object to a bucket
    // while reading the object from another source.
    // Notice: The S3 client can send secret keys in headers for encryption related jobs,
    // the handler should ensure to remove these keys before sending them to the object layer.
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 120.6K bytes
    - Click Count (0)
  4. lib/fips140/v1.0.0-c2097c7c.zip

    (xLimbs[i] ^ dLimbs[i])) xLimbs[i], carry = bits.Add(l, l, carry) dLimbs[i], borrow = bits.Sub(xLimbs[i], mLimbs[i], borrow) } // Like in maybeSubtractModulus, we need the subtraction if either it // didn't underflow (meaning 2x + b > m) or if computing 2x + b // overflowed (meaning 2x + b > 2^_W*n > m). needSubtraction = not(choice(borrow)) | choice(carry) } return x.assign(needSubtraction, d) } // Mod calculates out = x mod m. // // This works regardless how large the value of x is. // // The output...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  5. cmd/server_test.go

    	c.Assert(err, nil)
    	// executing the HTTP request.
    	response, err = s.client.Do(request)
    	c.Assert(err, nil)
    	// validating the response status code.
    	c.Assert(response.StatusCode, http.StatusOK)
    	// reading the response body.
    	// response body is expected to have the copied content of the first uploaded object.
    	object, err := io.ReadAll(response.Body)
    	c.Assert(err, nil)
    	c.Assert(string(object), "hello world")
    }
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 118.1K bytes
    - Click Count (0)
Back to Top