Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 201 - 210 of 329 for reactor (0.06 seconds)

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

  1. src/main/resources/fess_label_pl.properties

    labels.fields=Pola
    labels.ex_q=Rozszerzone zapytanie
    labels.oldPassword=Bieżące hasło
    labels.newPassword=Nowe hasło
    labels.confirmNewPassword=Potwierdź nowe hasło
    
    labels.menu_system=System
    labels.menu_wizard=Kreator
    labels.menu_crawl_config=Ogólne
    labels.menu_scheduler_config=Harmonogram
    labels.menu_dashboard_config=Panel
    labels.menu_design=Projekt strony
    labels.menu_dict=Słownik
    labels.menu_data=Kopia zapasowa/Przywracanie
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 28 11:54:13 GMT 2026
    - 53.2K bytes
    - Click Count (0)
  2. fess-crawler-lasta/src/main/resources/crawler/extractor.xml

    				"application/vnd.ms-works",
    				"application/vnd.ms-wpl",
    				"application/vnd.ms-xpsdocument",
    				"application/vnd.mseq",
    				"application/vnd.msign",
    				"application/vnd.multiad.creator",
    				"application/vnd.multiad.creator.cif",
    				"application/vnd.music-niff",
    				"application/vnd.musician",
    				"application/vnd.muvee.style",
    				"application/vnd.ncd.control",
    				"application/vnd.ncd.reference",
    Created: Sun Apr 12 03:50:13 GMT 2026
    - Last Modified: Wed Feb 11 01:15:55 GMT 2026
    - 50.4K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/collect/LinkedHashMultimap.java

      public Collection<V> values() {
        return super.values();
      }
    
      @VisibleForTesting
      @WeakOuter
      final class ValueSet extends Sets.ImprovedAbstractSet<V> {
        /*
         * We currently use a fixed load factor of 1.0, a bit higher than normal to reduce memory
         * consumption.
         */
    
        @ParametricNullness private final K key;
        @VisibleForTesting @Nullable ValueEntry<K, V>[] hashTable;
        private int size = 0;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Dec 26 20:08:09 GMT 2025
    - 19.2K bytes
    - Click Count (0)
  4. guava/src/com/google/common/collect/LinkedHashMultimap.java

      public Collection<V> values() {
        return super.values();
      }
    
      @VisibleForTesting
      @WeakOuter
      final class ValueSet extends Sets.ImprovedAbstractSet<V> {
        /*
         * We currently use a fixed load factor of 1.0, a bit higher than normal to reduce memory
         * consumption.
         */
    
        @ParametricNullness private final K key;
        @VisibleForTesting @Nullable ValueEntry<K, V>[] hashTable;
        private int size = 0;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Dec 26 20:08:09 GMT 2025
    - 20K bytes
    - Click Count (0)
  5. docs/ja/docs/environment-variables.md

    // これで環境変数を読み取れます
    
    Hello Wade Wilson from Python
    
    // その後は環境変数は存在しません
    $ python main.py
    
    Hello World from Python
    ```
    
    </div>
    
    /// tip | 豆知識
    
    詳しくは [The Twelve-Factor App: 設定](https://12factor.net/config) を参照してください。
    
    ///
    
    ## 型とバリデーション { #types-and-validation }
    
    これらの環境変数が扱えるのは**テキスト文字列**のみです。環境変数はPythonの外部にあり、他のプログラムやシステム全体(Linux、Windows、macOSなど異なるオペレーティングシステム間も)との互換性が必要になるためです。
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Mar 20 14:07:17 GMT 2026
    - 9.4K bytes
    - Click Count (0)
  6. docs/bigdata/README.md

    mapreduce.reduce.shuffle.input.buffer.percent=0.9 # Min % buffer in RAM
    mapreduce.reduce.shuffle.merge.percent=0.9 # Minimum % merges in RAM
    mapreduce.reduce.speculative=false # Disable speculation for reducing
    mapreduce.task.io.sort.factor=999 # Threshold before writing to disk
    mapreduce.task.sort.spill.percent=0.9 # Minimum % before spilling to disk
    ```
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Aug 12 18:20:36 GMT 2025
    - 14.7K bytes
    - Click Count (0)
  7. docs/LICENSE

              form), You must:
    
                a. retain the following if it is supplied by the Licensor
                   with the Licensed Material:
    
                     i. identification of the creator(s) of the Licensed
                        Material and any others designated to receive
                        attribution, in any reasonable manner requested by
                        the Licensor (including by pseudonym if
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Mon May 10 16:50:06 GMT 2021
    - 18.2K bytes
    - Click Count (0)
  8. docs/es/docs/index.md

    ## **Typer**, el FastAPI de las CLIs { #typer-the-fastapi-of-clis }
    
    <a href="https://typer.tiangolo.com"><img src="https://typer.tiangolo.com/img/logo-margin/logo-margin-vector.svg" style="width: 20%;"></a>
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:15:55 GMT 2026
    - 22.6K bytes
    - Click Count (0)
  9. docs/pt/docs/index.md

    ## **Typer**, o FastAPI das interfaces de linhas de comando { #typer-the-fastapi-of-clis }
    
    <a href="https://typer.tiangolo.com"><img src="https://typer.tiangolo.com/img/logo-margin/logo-margin-vector.svg" style="width: 20%;"></a>
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:20:43 GMT 2026
    - 22.7K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/collect/Collections2.java

         *
         * <ul>
         *   <li>For an empty list, it is 1 (base case).
         *   <li>When r numbers are added to a list of n-r elements, the number of permutations is
         *       increased by a factor of (n choose r).
         * </ul>
         */
        private static <E> int calculateSize(
            List<E> sortedInputList, Comparator<? super E> comparator) {
          int permutations = 1;
          int n = 1;
          int r = 1;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sat Aug 09 01:14:59 GMT 2025
    - 22.6K bytes
    - Click Count (0)
Back to Top