- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for ln (0.32 sec)
-
src/main/java/org/codelibs/fess/es/user/allcommon/EsAbstractConditionBean.java
// General Helper // ============== protected String ln() { return DBFluteSystem.ln(); } protected void assertObjectNotNull(String variableName, Object value) { if (variableName == null) {
Java - Registered: Mon Apr 29 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 17.8K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleMath.java
* * <p>If the result of this method will be immediately rounded to an {@code int}, {@link * #log2(double, RoundingMode)} is faster. */ public static double log2(double x) { return log(x) / LN_2; // surprisingly within 1 ulp according to tests } /** * Returns the base 2 logarithm of a double value, rounded with the specified rounding mode to an * {@code int}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 18.9K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/es/config/allcommon/EsAbstractConditionBean.java
// General Helper // ============== protected String ln() { return DBFluteSystem.ln(); } protected void assertObjectNotNull(String variableName, Object value) { if (variableName == null) {
Java - Registered: Mon Apr 29 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 17.8K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/es/log/allcommon/EsAbstractConditionBean.java
// General Helper // ============== protected String ln() { return DBFluteSystem.ln(); } protected void assertObjectNotNull(String variableName, Object value) { if (variableName == null) {
Java - Registered: Mon Apr 29 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 17.8K bytes - Viewed (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
checkPositive("x", x); if (fitsInLong(x)) { return LongMath.log10(x.longValue(), mode); } int approxLog10 = (int) (log2(x, FLOOR) * LN_2 / LN_10); BigInteger approxPow = BigInteger.TEN.pow(approxLog10); int approxCmp = approxPow.compareTo(x); /* * We adjust approxLog10 and approxPow until they're equal to floor(log10(x)) and
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilter.java
* `numHashFunctions/bitSize`. So, after n insertions, expected bitCount is `bitSize * (1 - (1 - * numHashFunctions/bitSize)^n)`. Solving that for n, and approximating `ln x` as `x - 1` when x * is close to 1 (why?), gives the following formula. */ double fractionOfBitsSet = (double) bitCount / bitSize; return DoubleMath.roundToLong(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (0) -
android/guava/src/com/google/thirdparty/publicsuffix/PublicSuffixPatterns.java
ohdnert.&ed,hc,?letemirp:.ku,,m&edaid,ialcer.&ac,ku,su,??n&evueluk,woru,?paz,r&epolroov,o&pav,tnemele,??t&enraxa.1-se,ikcatsno.snur,?ululetoj,wcs.&gnilebaltrams,koobelacs,latemerab.&1-&rap-rf,sma-ln,?2-rap-rf,?rap-rf.&3s,cnf:.snoitcnuf,,etisbew-3s,mhw,s8k:.sedon,,tipkcoc,?s&8k,ecnatsni.&bup,virp,?ma-ln.&3s,etisbew-3s,mhw,s8k:.sedon,,tipkcoc,??waw-lp.&3s,etisbew-3s,s8k:.sedon,,tipkcoc,??xelpciffart,yawocne.ue,??za5cbgn--nx??e&1&53wlf--nx?7a1hbbgm--nx?ta3kg--nx??2a6a1b6b1i--nx?3ma0e1cvr--nx?418txh...
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Mar 21 21:04:43 GMT 2024 - 72.4K bytes - Viewed (1)