Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 431 - 440 of 1,359 for facile (0.04 seconds)

  1. src/main/java/org/codelibs/fess/app/service/ElevateWordService.java

                        logger.warn("Failed to read a suggest elevate word: {}", list, e);
                    }
                }
                elevateWordBhv.refresh();
            } catch (final IOException e) {
                logger.warn("Failed to read a suggest elevate word.", e);
            }
        }
    
        /**
         * Exports elevate words to a CSV file.
         * CSV format: SuggestWord, Reading, Permissions, Labels, Boost
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Fri Nov 28 16:29:12 GMT 2025
    - 18.3K bytes
    - Click Count (0)
  2. src/main/java/org/codelibs/fess/app/web/api/admin/boostdoc/ApiAdminBoostdocAction.java

                try {
                    boostDocumentRuleService.store(entity);
                } catch (final Exception e) {
                    logger.warn("Failed to process a request.", e);
                    throwValidationErrorApi(messages -> messages.addErrorsCrudFailedToCreateCrudTable(GLOBAL, buildThrowableMessage(e)));
                }
                return entity;
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Thu Aug 07 03:06:29 GMT 2025
    - 7.9K bytes
    - Click Count (0)
  3. src/main/java/org/codelibs/fess/helper/CrawlerLogHelper.java

                    if (logger.isDebugEnabled()) {
                        logger.debug("container was destroyed.");
                    }
                    return;
                }
                logger.warn("Failed to store failure url: url={}", urlQueue.getUrl(), e);
            }
    
            if (cae.isDebugEnabled()) {
                logger.debug("[{}] Crawling Access Exception: url={}", failureUrlId, urlQueue.getUrl(), cae);
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Fri Nov 28 16:29:12 GMT 2025
    - 8.3K bytes
    - Click Count (0)
  4. okhttp/src/jvmTest/kotlin/okhttp3/SocksProxy.kt

            }
          } catch (e: SocketException) {
            logger.info("$threadName done accepting connections: ${e.message}")
          } catch (e: IOException) {
            logger.log(Level.WARNING, "$threadName failed unexpectedly", e)
          } finally {
            for (socket in openSockets) {
              socket.closeQuietly()
            }
            Thread.currentThread().name = "SocksProxy"
          }
        }
      }
    
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 7.7K bytes
    - Click Count (0)
  5. src/main/java/jcifs/internal/smb2/multichannel/ChannelManager.java

            } catch (Exception e) {
                log.warn("Failed to establish replacement channel", e);
            }
        }
    
        /**
         * Create transport for given interfaces
         *
         * @param localInterface local interface
         * @param remoteInterface remote interface
         * @return created transport
         * @throws IOException if transport creation fails
         */
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 21 11:13:46 GMT 2025
    - 20K bytes
    - Click Count (0)
  6. src/test/java/org/codelibs/fess/util/FacetResponseTest.java

                String encoded = BaseEncoding.base64().encode(fieldName.getBytes(StandardCharsets.UTF_8));
                String decoded = new String(BaseEncoding.base64().decode(encoded), StandardCharsets.UTF_8);
                assertEquals("Failed for field: " + fieldName, fieldName, decoded);
            }
        }
    
        @Test
        public void test_complex_query_strings() {
            // Test various complex query strings
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Fri Mar 13 23:01:26 GMT 2026
    - 6.7K bytes
    - Click Count (0)
  7. src/main/java/org/codelibs/fess/ds/callback/FileListIndexUpdateCallbackImpl.java

    /**
     * Implementation of IndexUpdateCallback that handles file list index updates with concurrent processing.
     * This callback processes file events (create, modify, delete) and manages document indexing and deletion
     * operations in the search engine. It supports recursive crawling with configurable depth and access count limits.
     *
     * <p>The implementation uses an executor service for concurrent processing of file operations and maintains
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Fri Nov 28 16:29:12 GMT 2025
    - 29.7K bytes
    - Click Count (3)
  8. helm/minio/templates/_helper_create_user.txt

      return $?
    }
    
    # createUser ($policy)
    createUser() {
      POLICY=$1
      #check accessKey_and_secretKey_tmp file
      if [[ ! -f $MINIO_ACCESSKEY_SECRETKEY_TMP ]];then
        echo "credentials file does not exist"
        return 1
      fi
      if [[ $(cat $MINIO_ACCESSKEY_SECRETKEY_TMP|wc -l) -ne 2 ]];then
        echo "credentials file is invalid"
        rm -f $MINIO_ACCESSKEY_SECRETKEY_TMP
        return 1
      fi
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Dec 12 23:43:32 GMT 2023
    - 3.2K bytes
    - Click Count (0)
  9. src/cmd/asm/main.go

    			break
    		}
    	}
    	if ok && !*flags.SymABIs {
    		ctxt.NumberSyms()
    		obj.WriteObjFile(ctxt, buf)
    	}
    	if !ok || diag {
    		if failedFile != "" {
    			log.Printf("assembly of %s failed", failedFile)
    		} else {
    			log.Print("assembly failed")
    		}
    		buf.Close()
    		os.Remove(*flags.OutputFile)
    		os.Exit(1)
    	}
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Apr 02 17:07:18 GMT 2026
    - 3K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/cache/Striped64.java

       *
       * In part because Cells are relatively large, we avoid creating
       * them until they are needed.  When there is no contention, all
       * updates are made to the base field.  Upon first contention (a
       * failed CAS on base update), the table is initialized to size 2.
       * The table size is doubled upon further contention until
       * reaching the nearest power of two greater than or equal to the
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Jan 15 22:17:15 GMT 2025
    - 11.4K bytes
    - Click Count (0)
Back to Top