Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 51 - 60 of 77 for Ask (0.09 seconds)

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

  1. src/main/java/org/codelibs/fess/chat/ChatClient.java

                }
    
                if (intentResult.getIntent() == ChatIntent.UNCLEAR) {
                    // Unclear intent - generate answer with empty documents to ask for clarification
                    final LlmChatResponse llmResponse = llmClientManager.generateAnswer(userMessage, Collections.emptyList(), history);
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 21 06:04:58 GMT 2026
    - 56.6K bytes
    - Click Count (0)
  2. src/main/java/jcifs/smb1/smb1/SmbTransport.java

        //        MsrpcDfsRootEnum rpc;
        //        DcerpcHandle handle = null;
        //
        //        /* Procedure:
        //         * Lookup a DC in the target domain
        //         * Ask the DC for a referral for the domain (e.g. "\example.com")
        //         * Do NetrDfsEnumEx on the server returned in the referral to
        //         * get roots in target domain
        //         */
        //
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 31.8K bytes
    - Click Count (0)
  3. docs/en/docs/deployment/concepts.md

    On the other hand, if you have 2 servers and you are using **100% of their CPU and RAM**, at some point one process will ask for more memory, and the server will have to use the disk as "memory" (which can be thousands of times slower), or even **crash**. Or one process might need to do some computation and would have to wait until the CPU is free again.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 18.5K bytes
    - Click Count (1)
  4. apache-maven/src/main/appended-resources/licenses/CDDL+GPLv2-with-classpath-exception.txt

    want it, that you can change the software or use pieces of it in new
    free programs; and that you know you can do these things.
    
    To protect your rights, we need to make restrictions that forbid anyone
    to deny you these rights or to ask you to surrender the rights. These
    restrictions translate to certain responsibilities for you if you
    distribute copies of the software, or if you modify it.
    
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Fri May 17 19:14:22 GMT 2024
    - 38.5K bytes
    - Click Count (0)
  5. cmd/erasure-metadata.go

    				fmt.Fprint(h, meta.TransitionStatus)
    				fmt.Fprint(h, meta.TransitionTier)
    				fmt.Fprint(h, meta.TransitionedObjName)
    				fmt.Fprint(h, meta.TransitionVersionID)
    			}
    
    			// If metadata says encrypted, ask for it in quorum.
    			if etyp, ok := crypto.IsEncrypted(meta.Metadata); ok {
    				fmt.Fprint(h, etyp)
    			}
    
    			// If compressed, look for compressed FileInfo only
    			if meta.IsCompressed() {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 21.3K bytes
    - Click Count (0)
  6. cmd/erasure-server-pool.go

    			return pinfo, z.poolsWithObject(poolObjInfos, opts), nil
    		}
    
    		if isErrReadQuorum(pinfo.Err) && !opts.MetadataChg {
    			// read quorum is returned when the object is visibly
    			// present but its unreadable, we simply ask the writes to
    			// schedule to this pool instead. If there is no quorum
    			// it will fail anyways, however if there is quorum available
    			// with enough disks online but sufficiently inconsistent to
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 89.2K bytes
    - Click Count (0)
  7. src/bytes/buffer_test.go

    	for i := 0; i <= 5; i++ {
    		for j := i; j <= 5; j++ {
    			for k := 0; k <= 6; k++ {
    				// 0 <= i <= j <= 5; 0 <= k <= 6
    				// Check that if we start with a buffer
    				// of length j at offset i and ask for
    				// Next(k), we get the right bytes.
    				buf := NewBuffer(b[0:j])
    				n, _ := buf.Read(tmp[0:i])
    				if n != i {
    					t.Fatalf("Read %d returned %d", i, n)
    				}
    				bb := buf.Next(k)
    				want := k
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Nov 14 19:01:17 GMT 2025
    - 19.4K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/collect/Iterables.java

      // Methods only in Iterables, not in Iterators
    
      /**
       * Determines if the given iterable contains no elements.
       *
       * <p>There is no precise {@link Iterator} equivalent to this method, since one can only ask an
       * iterator whether it has any elements <i>remaining</i> (which one does using {@link
       * Iterator#hasNext}).
       *
       * <p><b>{@code Stream} equivalent:</b> {@code !stream.findAny().isPresent()}
       *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Sep 16 18:35:28 GMT 2025
    - 43.8K bytes
    - Click Count (0)
  9. cmd/endpoint.go

    		if runtime.GOOS == globalWindowsOSName {
    			if filepath.VolumeName(u.Path[1:]) != "" {
    				u.Path = u.Path[1:]
    			}
    		}
    	} else {
    		// Only check if the arg is an ip address and ask for scheme since its absent.
    		// localhost, example.com, any FQDN cannot be disambiguated from a regular file path such as
    		// /mnt/export1. So we go ahead and start the minio server in FS modes in these cases.
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 34.5K bytes
    - Click Count (0)
  10. docs/ru/docs/help-fastapi.md

    * Во многих случаях лучше понять **исходную проблему или кейс**, потому что может существовать способ решить её лучше, чем то, что пытаются сделать.
    
    ### Попросить закрыть { #ask-to-close }
    
    Если Вам ответили, велика вероятность, что Вы решили их проблему, поздравляю, **Вы — герой**! 🦸
    
    * Теперь, если проблема решена, можно попросить их:
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 17:56:20 GMT 2026
    - 20.6K bytes
    - Click Count (0)
Back to Top