Search Options

Results per page
Sort
Preferred Languages
Advance

Results 431 - 433 of 433 for hasTest (1.52 sec)

  1. api/maven-api-model/src/main/mdo/maven.mdo

                reportSetMap = new java.util.LinkedHashMap<String, ReportSet>();
                if (getReportSets() != null) {
                    for (java.util.Iterator<ReportSet> i = getReportSets().iterator(); i.hasNext(); ) {
                        ReportSet reportSet = (ReportSet) i.next();
                        reportSetMap.put(reportSet.getId(), reportSet);
                    }
                }
            }
    
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Thu Aug 07 14:32:16 UTC 2025
    - 132.7K bytes
    - Viewed (0)
  2. lib/fips140/v1.0.0.zip

    get from R to 2^(_W * n) R mod m (aka from one to R in // the Montgomery domain, meaning we can use Montgomery multiplication now). // We could do that by doubling _W * n times, or with a square-and-double // chain log2(_W * n) long. Turns out the fastest thing is to start out with // doublings, and switch to square-and-double once the exponent is large // enough to justify the cost of the multiplications. // The threshold is selected experimentally as a linear function of n. threshold := n / 4 //...
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Jan 29 15:10:35 UTC 2025
    - 635K bytes
    - Viewed (0)
  3. RELEASE.md

    * Introducing `tf.types.experimental.AtomicFunction` as the fastest way to perform TF computations in Python.
    
        * Can be accessed through `inference_fn` property of `ConcreteFunction`s
        * Does not support gradients.
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Mon Aug 18 20:54:38 UTC 2025
    - 740K bytes
    - Viewed (1)
Back to top