Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 411 - 420 of 2,446 for stort (0.06 seconds)

  1. src/main/webapp/WEB-INF/orig/view/search.jsp

    				data-bs-toggle="collapse"> <c:if test="${empty sort}">
    						<la:message key="labels.searchoptions_score" />
    					</c:if> <c:if test="${sort=='score.desc'}">
    						<la:message key="labels.searchoptions_score" />
    					</c:if> <c:if test="${sort=='filename.asc'}">
    						<la:message key="labels.search_result_sort_filename_asc" />
    					</c:if> <c:if test="${sort=='filename.desc'}">
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Mon Feb 23 08:03:44 GMT 2026
    - 6.7K bytes
    - Click Count (0)
  2. src/main/webapp/WEB-INF/view/search.jsp

    				data-bs-toggle="collapse"> <c:if test="${empty sort}">
    						<la:message key="labels.searchoptions_score" />
    					</c:if> <c:if test="${sort=='score.desc'}">
    						<la:message key="labels.searchoptions_score" />
    					</c:if> <c:if test="${sort=='filename.asc'}">
    						<la:message key="labels.search_result_sort_filename_asc" />
    					</c:if> <c:if test="${sort=='filename.desc'}">
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Thu Nov 13 05:54:52 GMT 2025
    - 6.7K bytes
    - Click Count (0)
  3. src/main/java/jcifs/smb1/smb1/SmbComOpenAndX.java

            }
    
            return dstIndex - start;
        }
    
        @Override
        int writeBytesWireFormat(final byte[] dst, int dstIndex) {
            final int start = dstIndex;
    
            if (useUnicode) {
                dst[dstIndex] = (byte) '\0';
                dstIndex++;
            }
            dstIndex += writeString(path, dst, dstIndex);
    
            return dstIndex - start;
        }
    
        @Override
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 07:14:38 GMT 2025
    - 5.6K bytes
    - Click Count (0)
  4. cmd/copy-part-range.go

    	if err != nil {
    		return nil, err
    	}
    	if hrange.IsSuffixLength || hrange.Start < 0 || hrange.End < 0 {
    		return nil, errInvalidRange
    	}
    	return hrange, nil
    }
    
    // checkCopyPartRangeWithSize adds more check to the range string in case of
    // copy object part. This API requires having specific start and end  range values
    // e.g. 'bytes=3-10'. Other use cases will be rejected.
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Jun 18 03:27:04 GMT 2021
    - 2.5K bytes
    - Click Count (0)
  5. docs/fr/docs/tutorial/query-params.md

    Dans ce cas, si vous allez sur :
    
    ```
    http://127.0.0.1:8000/items/foo?short=1
    ```
    
    ou
    
    ```
    http://127.0.0.1:8000/items/foo?short=True
    ```
    
    ou
    
    ```
    http://127.0.0.1:8000/items/foo?short=true
    ```
    
    ou
    
    ```
    http://127.0.0.1:8000/items/foo?short=on
    ```
    
    ou
    
    ```
    http://127.0.0.1:8000/items/foo?short=yes
    ```
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:37:13 GMT 2026
    - 5.3K bytes
    - Click Count (0)
  6. docs/batch-jobs/README.md

    ## Batch Jobs via Commandline
    [mc](http://github.com/minio/mc) provides 'mc batch' command to create, start and manage submitted jobs.
    
    ```
    NAME:
      mc batch - manage batch jobs
    
    USAGE:
      mc batch COMMAND [COMMAND FLAGS | -h] [ARGUMENTS...]
    
    COMMANDS:
      generate  generate a new batch job definition
      start     start a new batch job
      list, ls  list all current batch jobs
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Thu Oct 06 06:00:43 GMT 2022
    - 4.8K bytes
    - Click Count (0)
  7. src/main/java/jcifs/netbios/SessionRequestPacket.java

            final int start = dstIndex;
            dstIndex += this.calledName.writeWireFormat(dst, dstIndex);
            dstIndex += this.callingName.writeWireFormat(dst, dstIndex);
            return dstIndex - start;
        }
    
        @Override
        int readTrailerWireFormat(final InputStream in, final byte[] buffer, int bufferIndex) throws IOException {
            final int start = bufferIndex;
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 2.7K bytes
    - Click Count (0)
  8. src/main/java/jcifs/dcerpc/UnicodeString.java

            final int zt = zterm ? 1 : 0;
    
            this.length = this.maximum_length = (short) ((len + zt) * 2);
            this.buffer = new short[len + zt];
    
            int i;
            for (i = 0; i < len; i++) {
                this.buffer[i] = (short) str.charAt(i);
            }
            if (zterm) {
                this.buffer[i] = (short) 0;
            }
        }
    
        @Override
        public String toString() {
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sat Aug 16 01:32:48 GMT 2025
    - 2.7K bytes
    - Click Count (0)
  9. src/test/java/jcifs/smb/CriticalPerformanceTest.java

                            // Simulate the atomic byte tracking operation
                            long start = System.nanoTime();
                            mockBytesEncrypted.addAndGet(1024); // Simulate 1KB message
                            long end = System.nanoTime();
    
                            totalTime.addAndGet(end - start);
                            operations.incrementAndGet();
                        }
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sun Aug 31 08:00:57 GMT 2025
    - 15.3K bytes
    - Click Count (0)
  10. tests/helper_test.go

    		if len(user.Pets) != len(expect.Pets) {
    			t.Fatalf("pets should equal, expect: %v, got %v", len(expect.Pets), len(user.Pets))
    		}
    
    		sort.Slice(user.Pets, func(i, j int) bool {
    			return user.Pets[i].ID > user.Pets[j].ID
    		})
    
    		sort.Slice(expect.Pets, func(i, j int) bool {
    			return expect.Pets[i].ID > expect.Pets[j].ID
    		})
    
    		for idx, pet := range user.Pets {
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Sat Mar 21 11:27:38 GMT 2026
    - 8.6K bytes
    - Click Count (0)
Back to Top