Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 3 of 3 for relocated (0.06 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. RELEASE.md

            `tf.function`-local variable: during each execution of the
            `tf.function`, the variable will be created and then disposed, similar
            to a local (i.e. stack-allocated) variable in C/C++. Currently
            `experimental_enable_variable_lifting=False` only works on non-XLA
            devices (e.g. under `@tf.function(jit_compile=False)`).
    
    *   TF SavedModel:
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Tue Oct 28 22:27:41 GMT 2025
    - 740.4K bytes
    - Click Count (3)
  2. src/main/java/org/codelibs/fess/mylasta/direction/FessConfig.java

         * comment: Online help key for related query.
         * @return The value of found property. (NotNull: if not found, exception but basically no way)
         */
        String getOnlineHelpNameRelatedquery();
    
        /**
         * Get the value for the key 'online.help.name.relatedcontent'. <br>
         * The value is, e.g. relatedcontent <br>
         * comment: Online help key for related content.
    Created: Sat Dec 20 09:19:18 GMT 2025
    - Last Modified: Sat Dec 13 02:21:17 GMT 2025
    - 525.7K bytes
    - Click Count (2)
  3. lib/fips140/v1.0.0-c2097c7c.zip

    the size of m and overwritten. // //go:norace func (x *Nat) montgomeryMul(a *Nat, b *Nat, m *Modulus) *Nat { n := len(m.nat.limbs) mLimbs := m.nat.limbs[:n] aLimbs := a.limbs[:n] bLimbs := b.limbs[:n] switch n { default: // Attempt to use a stack-allocated backing array. T := make([]uint, 0, preallocLimbs*2) if cap(T) < n*2 { T = make([]uint, 0, n*2) } T = T[:n*2] // This loop implements Word-by-Word Montgomery Multiplication, as // described in Algorithm 4 (Fig. 3) of "Efficient Software // Implementations...
    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)
Back to Top