Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 91 - 100 of 822 for caractere (0.06 seconds)

  1. src/main/java/org/codelibs/fess/query/QueryCommand.java

            }
            return new DefaultQueryBuilder(boolQuery);
        }
    
        /**
         * Builds a match phrase query, with special handling for single CJK characters.
         * For single CJK characters in title or content fields, uses prefix query instead.
         * @param f The field name.
         * @param text The text to search for.
         * @return The appropriate query builder.
         */
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sun Nov 23 11:39:05 GMT 2025
    - 11.6K bytes
    - Click Count (0)
  2. android/guava-tests/test/com/google/common/graph/TraverserTest.java

        private final SuccessorsFunction<Character> delegate;
        final Multiset<Character> requestedNodes = HashMultiset.create();
    
        RequestSavingGraph(SuccessorsFunction<Character> delegate) {
          this.delegate = checkNotNull(delegate);
        }
    
        @Override
        public Iterable<? extends Character> successors(Character node) {
          requestedNodes.add(node);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Sep 30 17:09:51 GMT 2025
    - 47.4K bytes
    - Click Count (0)
  3. docs/en/docs/js/termynal.js

         * @param {number} options.typeDelay - Delay between each typed character, in ms.
         * @param {number} options.lineDelay - Delay between each line, in ms.
         * @param {number} options.progressLength - Number of characters displayed as progress bar.
         * @param {string} options.progressChar – Character to use for progress bar, defaults to █.
    	 * @param {number} options.progressPercent - Max percent of progress.
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Sun Aug 31 10:32:57 GMT 2025
    - 9.3K bytes
    - Click Count (0)
  4. src/archive/tar/strconv.go

    // license that can be found in the LICENSE file.
    
    package tar
    
    import (
    	"bytes"
    	"fmt"
    	"strconv"
    	"strings"
    	"time"
    )
    
    // hasNUL reports whether the NUL character exists within s.
    func hasNUL(s string) bool {
    	return strings.Contains(s, "\x00")
    }
    
    // isASCII reports whether the input is an ASCII C-style string.
    func isASCII(s string) bool {
    	for _, c := range s {
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Tue Dec 30 15:28:53 GMT 2025
    - 9.1K bytes
    - Click Count (0)
  5. okhttp-idna-mapping-table/src/main/kotlin/okhttp3/internal/idn/SimpleIdnaMappingTable.kt

     *
     * This implementation is optimized for readability over efficiency.
     *
     * This implements non-transitional processing by preserving deviation characters.
     *
     * This implementation's STD3 rules are configured to `UseSTD3ASCIIRules=false`. This is
     * permissive and permits the `_` character.
     *
     * [mapping table]: https://www.unicode.org/reports/tr46/#IDNA_Mapping_Table
     * [mapping step]: https://www.unicode.org/reports/tr46/#ProcessingStepMap
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 6.9K bytes
    - Click Count (0)
  6. docs/en/docs/tutorial/stream-json-lines.md

    /// info
    
    The important point is that your app will be able to produce each line in turn, while the client consumes the previous lines.
    
    ///
    
    /// note | Technical Details
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 4.3K bytes
    - Click Count (0)
  7. guava-tests/test/com/google/common/hash/HashTestUtils.java

        return (char)
            (Character.MIN_LOW_SURROGATE
                + random.nextInt(Character.MAX_LOW_SURROGATE - Character.MIN_LOW_SURROGATE + 1));
      }
    
      static char randomHighSurrogate(Random random) {
        return (char)
            (Character.MIN_HIGH_SURROGATE
                + random.nextInt(Character.MAX_HIGH_SURROGATE - Character.MIN_HIGH_SURROGATE + 1));
      }
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Oct 28 18:19:59 GMT 2025
    - 25.6K bytes
    - Click Count (0)
  8. src/main/java/jcifs/smb1/dcerpc/UUID.java

     * This class provides methods for UUID string parsing and binary conversion.
     */
    public class UUID extends rpc.uuid_t {
    
        /**
         * Convert hexadecimal characters to binary integer
         *
         * @param arr the character array containing hex digits
         * @param offset the starting position in the array
         * @param length the number of hex digits to convert
         * @return the integer value of the hex digits
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 5.1K bytes
    - Click Count (0)
  9. guava/src/com/google/common/collect/Lists.java

       * modification operations, but reflects any changes to the underlying character sequence.
       *
       * @param sequence the character sequence to view as a {@code List} of characters
       * @return an {@code List<Character>} view of the character sequence
       * @since 7.0
       */
      public static List<Character> charactersOf(CharSequence sequence) {
        return new CharSequenceAsList(checkNotNull(sequence));
      }
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Feb 23 16:38:09 GMT 2026
    - 42.5K bytes
    - Click Count (0)
  10. android/guava-tests/test/com/google/common/io/FilesSimplifyPathTest.java

        // Inputs are /b/c/<every possible 10-character string of characters "a./">
        // Expected outputs are from realpath -s.
        doExtensiveTest("testdata/simplifypathwithabsoluteprefixtests.txt");
      }
    
      public void testExtensiveNoPrefix() throws IOException {
        /*
         * Inputs are <every possible 10-character string of characters "a./">
         *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 12 17:47:10 GMT 2026
    - 11.9K bytes
    - Click Count (0)
Back to Top