Search Options

Results per page
Sort
Preferred Languages
Advance

Results 181 - 190 of 488 for previous (1.74 sec)

  1. src/main/java/org/codelibs/fess/app/web/search/SearchAction.java

                        session.setAttribute(Constants.RESULTS_PER_PAGE, form.num);
                    }
                });
            }
            return doSearch(form);
        }
    
        /**
         * The previous page.
         * @param form The search form.
         * @return The HTML response.
         */
        @Execute
        public HtmlResponse prev(final SearchForm form) {
            return doMove(form, -1);
        }
    
        /**
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Thu Aug 07 03:06:29 UTC 2025
    - 14K bytes
    - Viewed (0)
  2. cmd/handler-api.go

    	}
    
    	if cap(t.requestsPool) != apiRequestsMaxPerNode {
    		// Only replace if needed.
    		// Existing requests will use the previous limit,
    		// but new requests will use the new limit.
    		// There will be a short overlap window,
    		// but this shouldn't last long.
    		t.requestsPool = make(chan struct{}, apiRequestsMaxPerNode)
    	}
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Sep 28 20:59:21 UTC 2025
    - 10.4K bytes
    - Viewed (0)
  3. internal/s3select/csv/reader.go

    	dst   chan [][]string // result of block decode
    	err   error           // any error encountered will be set here
    }
    
    // Read - reads single record.
    // Once Read is called the previous record should no longer be referenced.
    func (r *Reader) Read(dst sql.Record) (sql.Record, error) {
    	// If we have have any records left, return these before any error.
    	for len(r.current) <= r.recordsRead {
    		if r.err != nil {
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Tue May 27 15:19:03 UTC 2025
    - 8.8K bytes
    - Viewed (0)
  4. docs/features/interceptors.md

    `chain.proceed(request)` is a critical part of each interceptor’s implementation. This simple-looking method is where all the HTTP work happens, producing a response to satisfy the request. If `chain.proceed(request)` is being called more than once previous response bodies must be closed.
    
    Interceptors can be chained. Suppose you have both a compressing interceptor and a checksumming interceptor: you'll need to decide whether data is compressed and then checksummed, or checksummed and then compressed....
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Sun Feb 06 02:19:09 UTC 2022
    - 8.1K bytes
    - Viewed (0)
  5. src/main/java/jcifs/audit/SecurityAuditLogger.java

            }
    
            return currentCount <= maxEventsPerWindow;
        }
    
        private void cleanupOldRateLimitCounters(long currentWindow) {
            // Clean up counters from previous windows to prevent memory leaks
            rateLimitCounters.entrySet().removeIf(entry -> {
                String key = entry.getKey();
                int lastUnderscore = key.lastIndexOf('_');
                if (lastUnderscore > 0) {
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Sat Aug 30 05:58:03 UTC 2025
    - 26.6K bytes
    - Viewed (0)
  6. docs/en/docs/python-types.md

    But, sadly, you get nothing useful:
    
    <img src="/img/python-types/image01.png">
    
    ### Add types { #add-types }
    
    Let's modify a single line from the previous version.
    
    We will change exactly this fragment, the parameters of the function, from:
    
    ```Python
        first_name, last_name
    ```
    
    to:
    
    ```Python
        first_name: str, last_name: str
    ```
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Wed Dec 17 20:41:43 UTC 2025
    - 15.6K bytes
    - Viewed (0)
  7. src/test/java/jcifs/internal/smb2/lease/DirectoryCacheEntryTest.java

            assertTrue(entry.hasChanges());
    
            // Remove non-existent child - should not change state
            entry.removeChild("nonexistent.txt");
            assertTrue(entry.hasChanges()); // Still has changes from previous removal
        }
    
        @Test
        public void testGetChildren() {
            // Add multiple children
            entry.updateChild("file1.txt", 1024L, 1000L, false, 0x20, 500L, 800L);
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Sat Aug 23 01:47:47 UTC 2025
    - 8.4K bytes
    - Viewed (0)
  8. android/guava-testlib/test/com/google/common/collect/testing/MapTestSuiteBuilderTests.java

        AtomicBoolean setUpRan = new AtomicBoolean();
        Runnable setUp =
            new Runnable() {
              @Override
              public void run() {
                assertFalse("previous tearDown should have run before setUp", setUpRan.getAndSet(true));
              }
            };
        Runnable tearDown =
            new Runnable() {
              @Override
              public void run() {
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu May 22 16:18:11 UTC 2025
    - 11.4K bytes
    - Viewed (0)
  9. docs/en/docs/tutorial/extra-models.md

    # Extra Models { #extra-models }
    
    Continuing with the previous example, it will be common to have more than one related model.
    
    This is especially the case for user models, because:
    
    * The **input model** needs to be able to have a password.
    * The **output model** should not have a password.
    * The **database model** would probably need to have a hashed password.
    
    /// danger
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Sat Dec 20 15:55:38 UTC 2025
    - 6.9K bytes
    - Viewed (0)
  10. docs/en/docs/deployment/manually.md

    This is the basic idea. But you will probably want to take care of some additional things, like:
    
    * Security - HTTPS
    * Running on startup
    * Restarts
    * Replication (the number of processes running)
    * Memory
    * Previous steps before starting
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Sat Oct 11 17:48:49 UTC 2025
    - 6.9K bytes
    - Viewed (0)
Back to top