Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 901 - 910 of 1,246 for border (0.57 seconds)

  1. src/main/resources/fess_label.properties

    labels.crudMode=Mode
    labels.errorCountMax=Max Error Count
    labels.errorCountMin=Min Error Count
    labels.facet=Facet
    labels.geo=Geo
    labels.groups=Groups
    labels.hash=Hash
    labels.maxSize=Max Size
    labels.order=Order
    labels.purgeSuggestSearchLogDay=Delete old suggest info
    labels.q=Query
    labels.roles=Roles
    labels.suggestSearchLog=Suggest Search Log
    labels.suggestWord=Suggest Word
    labels.targetLabel=Label
    labels.term=Term
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 28 11:54:13 GMT 2026
    - 48.9K bytes
    - Click Count (0)
  2. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/connection/RealRoutePlanner.kt

       * is sent unencrypted to the proxy server, so tunnels include only the minimum set of headers.
       * This avoids sending potentially sensitive data like HTTP cookies to the proxy unencrypted.
       *
       * In order to support preemptive authentication we pass a fake "Auth Failed" response to the
       * authenticator. This gives the authenticator the option to customize the CONNECT request. It can
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 12.1K bytes
    - Click Count (0)
  3. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/idn/IdnaMappingTable.kt

     *
     * @return the index of the match. If no match is found this is `(-1 - insertionPoint)`, where the
     *     inserting the element at `insertionPoint` will retain sorted order.
     */
    inline fun binarySearch(
      position: Int,
      limit: Int,
      compare: (Int) -> Int,
    ): Int {
      // Do the binary searching bit.
      var low = position
      var high = limit - 1
      while (low <= high) {
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 9K bytes
    - Click Count (0)
  4. android/guava/src/com/google/common/collect/ComparisonChain.java

       *
       * <p>This method is declared to accept any 2 {@code Comparable} objects, even if they are not <a
       * href="https://docs.oracle.com/javase/tutorial/collections/interfaces/order.html">mutually
       * comparable</a>. If you pass objects that are not mutually comparable, this method may throw an
       * exception. (The reason for this decision is lost to time, but the reason <i>might</i> be that
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 10.5K bytes
    - Click Count (0)
  5. src/test/java/jcifs/internal/smb2/Smb2ConstantsTest.java

                        "Dialect " + String.format("0x%04X", dialect) + " should be >= SMB 2.0.2");
            }
    
            @Test
            @DisplayName("Dialects should be in ascending order")
            void testDialectOrdering() {
                assertTrue(Smb2Constants.SMB2_DIALECT_0202 < Smb2Constants.SMB2_DIALECT_0210, "SMB 2.0.2 should be less than SMB 2.1");
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 14.1K bytes
    - Click Count (0)
  6. src/test/java/jcifs/http/NtlmHttpURLConnectionTest.java

                    when(conn.getHeaderField(entry.getKey())).thenReturn(entry.getValue().get(0));
                }
    
                // Mock by index - getHeaderField(int)
                // Index 0 is status line, then headers in order
                int index = 1;
                for (Map.Entry<String, List<String>> entry : headers.entrySet()) {
                    when(conn.getHeaderField(index++)).thenReturn(entry.getValue().get(0));
                }
            }
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 07:14:38 GMT 2025
    - 12.6K bytes
    - Click Count (0)
  7. internal/s3select/csv/reader.go

    	recordsRead  int                    // number of records read in current slice
    	input        chan *queueItem        // input for workers
    	queue        chan *queueItem        // output from workers in order
    	err          error                  // global error state, only touched by Reader.Read
    	bufferPool   bpool.Pool[[]byte]     // pool of []byte objects for input
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue May 27 15:19:03 GMT 2025
    - 8.8K bytes
    - Click Count (0)
  8. doc/go_spec.html

    m := map[int]int{a: 1, a: 2}  // m may be {2: 1} or {2: 2}: evaluation order between the two map assignments is not specified
    n := map[int]int{a: f()}      // n may be {2: 3} or {3: 3}: evaluation order between the key and the value is not specified
    </pre>
    
    <p>
    At package level, initialization dependencies override the left-to-right rule
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Wed Apr 01 23:39:18 GMT 2026
    - 287.8K bytes
    - Click Count (1)
  9. guava/src/com/google/common/collect/ComparisonChain.java

       *
       * <p>This method is declared to accept any 2 {@code Comparable} objects, even if they are not <a
       * href="https://docs.oracle.com/javase/tutorial/collections/interfaces/order.html">mutually
       * comparable</a>. If you pass objects that are not mutually comparable, this method may throw an
       * exception. (The reason for this decision is lost to time, but the reason <i>might</i> be that
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 11.1K bytes
    - Click Count (0)
  10. docs/de/docs/tutorial/path-params.md

    Sie können für Typdeklarationen auch `str`, `float`, `bool` und viele andere komplexe Datentypen verwenden.
    
    Mehrere davon werden wir in den nächsten Kapiteln erkunden.
    
    ## Die Reihenfolge ist wichtig { #order-matters }
    
    Wenn Sie *Pfadoperationen* erstellen, haben Sie manchmal einen fixen Pfad.
    
    Etwa `/users/me`, um Daten über den aktuellen Benutzer zu erhalten.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 17:58:09 GMT 2026
    - 10K bytes
    - Click Count (0)
Back to Top