Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 61 - 68 of 68 for isdigit (0.07 seconds)

  1. fess-crawler/src/main/java/org/codelibs/fess/crawler/client/http/Hc5HttpClient.java

                return Date.from(instant);
            } catch (final DateTimeParseException e) {
                // Try fallback
            }
            // Fallback to custom pattern for non-standard formats (e.g., single-digit day)
            try {
                return DATE_FORMAT_HOLDER.get().parse(value);
            } catch (final ParseException e) {
                return null;
            }
        }
    
        /**
    Created: Sun Apr 12 03:50:13 GMT 2026
    - Last Modified: Sat Jan 31 12:23:29 GMT 2026
    - 62.2K bytes
    - Click Count (0)
  2. cmd/object-api-utils.go

    		// like an IP address.
    		isNotNumber := false
    		for i := range len(piece) {
    			switch {
    			case (piece[i] >= 'a' && piece[i] <= 'z' ||
    				piece[i] == '-'):
    				// Found a non-digit character, so
    				// this piece is not a number.
    				isNotNumber = true
    			case piece[i] >= '0' && piece[i] <= '9':
    				// Nothing to do.
    			default:
    				// Found invalid character.
    				return false
    			}
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Wed Jun 25 15:08:54 GMT 2025
    - 37.3K bytes
    - Click Count (0)
  3. src/main/java/org/codelibs/fess/mylasta/action/FessMessages.java

        public static final String ERRORS_password_no_lowercase = "{errors.password_no_lowercase}";
    
        /** The key of the message: Password must contain at least one digit. */
        public static final String ERRORS_password_no_digit = "{errors.password_no_digit}";
    
        /** The key of the message: Password must contain at least one special character. */
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 28 06:59:19 GMT 2026
    - 126.6K bytes
    - Click Count (0)
  4. src/main/resources/fess_config.properties

    # Require uppercase letters in password.
    password.require.uppercase=false
    
    # Require lowercase letters in password.
    password.require.lowercase=false
    
    # Require digits in password.
    password.require.digit=false
    
    # Require special characters in password.
    password.require.special.char=false
    
    
    # ----------------------------------------------------------
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 28 06:59:19 GMT 2026
    - 59.3K bytes
    - Click Count (0)
  5. src/main/java/org/codelibs/fess/mylasta/direction/FessConfig.java

        /**
         * Get the value for the key 'password.require.digit'. <br>
         * The value is, e.g. false <br>
         * comment: Require digits in password.
         * @return The value of found property. (NotNull: if not found, exception but basically no way)
         */
        String getPasswordRequireDigit();
    
        /**
         * Is the property for the key 'password.require.digit' true? <br>
         * The value is, e.g. false <br>
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 28 06:59:19 GMT 2026
    - 576.9K bytes
    - Click Count (2)
  6. doc/go_spec.html

    are in <a href="#Rune_literals">rune literals</a> (except that <code>\'</code> is illegal and
    <code>\"</code> is legal), with the same restrictions.
    The three-digit octal (<code>\</code><i>nnn</i>)
    and two-digit hexadecimal (<code>\x</code><i>nn</i>) escapes represent individual
    <i>bytes</i> of the resulting string; all other escapes represent
    the (possibly multi-byte) UTF-8 encoding of individual <i>characters</i>.
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Wed Apr 01 23:39:18 GMT 2026
    - 287.8K bytes
    - Click Count (1)
  7. lib/fips140/v1.0.0-c2097c7c.zip

    wanted to produce 2n-wide T, we would do // // for i := 0; i < n; i++ { // d := bLimbs[i] // T[n+i] = addMulVVW(T[i:n+i], aLimbs, d) // } // // where d is a digit of the multiplier, T[i:n+i] is the shifted // position of the product of that digit, and T[n+i] is the final carry. // Note that T[i] isn't modified after processing the i-th digit. // // Instead of running two loops, one for Step 1 and one for Steps 2–6, // the result of Step 1 is computed during the next loop. This is // possible because...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  8. lib/fips140/v1.26.0.zip

    wanted to produce 2n-wide T, we would do // // for i := 0; i < n; i++ { // d := bLimbs[i] // T[n+i] = addMulVVW(T[i:n+i], aLimbs, d) // } // // where d is a digit of the multiplier, T[i:n+i] is the shifted // position of the product of that digit, and T[n+i] is the final carry. // Note that T[i] isn't modified after processing the i-th digit. // // Instead of running two loops, one for Step 1 and one for Steps 2–6, // the result of Step 1 is computed during the next loop. This is // possible because...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Jan 08 17:58:32 GMT 2026
    - 660.3K bytes
    - Click Count (0)
Back to Top