Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 7 of 7 for merging (0.09 seconds)

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

  1. src/main/webapp/css/bootstrap.min.css.map

    ol-12 {\n  flex: 0 0 auto;\n  width: 100%;\n}\n\n.offset-1 {\n  margin-left: 8.33333333%;\n}\n\n.offset-2 {\n  margin-left: 16.66666667%;\n}\n\n.offset-3 {\n  margin-left: 25%;\n}\n\n.offset-4 {\n  margin-left: 33.33333333%;\n}\n\n.offset-5 {\n  margin-left: 41.66666667%;\n}\n\n.offset-6 {\n  margin-left: 50%;\n}\n\n.offset-7 {\n  margin-left: 58.33333333%;\n}\n\n.offset-8 {\n  margin-left: 66.66666667%;\n}\n\n.offset-9 {\n  margin-left: 75%;\n}\n\n.offset-10 {\n  margin-left: 83.33333333%;\n}\n\n.offset-11...
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sun Jan 12 06:14:02 GMT 2025
    - 575.5K bytes
    - Click Count (0)
  2. RELEASE.md

    *   `Estimator.export_savedmodel()` now includes all valid serving signatures
        that can be constructed from the Serving Input Receiver and all available
        ExportOutputs. For instance, a classifier may provide regression- and
        prediction-flavored outputs, in addition to the classification-flavored one.
        Building signatures from these allows TF Serving to honor requests using the
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Mon Mar 30 18:31:38 GMT 2026
    - 746.5K bytes
    - Click Count (3)
  3. src/main/java/org/codelibs/fess/mylasta/direction/FessConfig.java

         * The value is, e.g. 5000 <br>
         * comment: Commit margin time (ms) for webfs in the indexer.
         * @return The value of found property. (NotNull: if not found, exception but basically no way)
         */
        String getIndexerWebfsCommitMarginTime();
    
        /**
         * Get the value for the key 'indexer.webfs.commit.margin.time' as {@link Integer}. <br>
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Mar 28 06:59:19 GMT 2026
    - 576.9K bytes
    - Click Count (2)
  4. src/main/webapp/css/admin/bootstrap.min.css.map

    -ms-flex-order: 12;\n  order: 12;\n}\n\n.offset-1 {\n  margin-left: 8.333333%;\n}\n\n.offset-2 {\n  margin-left: 16.666667%;\n}\n\n.offset-3 {\n  margin-left: 25%;\n}\n\n.offset-4 {\n  margin-left: 33.333333%;\n}\n\n.offset-5 {\n  margin-left: 41.666667%;\n}\n\n.offset-6 {\n  margin-left: 50%;\n}\n\n.offset-7 {\n  margin-left: 58.333333%;\n}\n\n.offset-8 {\n  margin-left: 66.666667%;\n}\n\n.offset-9 {\n  margin-left: 75%;\n}\n\n.offset-10 {\n  margin-left: 83.333333%;\n}\n\n.offset-11 {\n  margin-left:...
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Oct 26 01:49:09 GMT 2024
    - 639.3K bytes
    - Click Count (1)
  5. okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt

    2F9F          ; mapped                 ; 8F9B          # 3.0  KANGXI RADICAL BITTER
    2FA0          ; mapped                 ; 8FB0          # 3.0  KANGXI RADICAL MORNING
    2FA1          ; mapped                 ; 8FB5          # 3.0  KANGXI RADICAL WALK
    2FA2          ; mapped                 ; 9091          # 3.0  KANGXI RADICAL CITY
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Sat Feb 10 11:25:47 GMT 2024
    - 854.1K bytes
    - Click Count (0)
  6. lib/fips140/v1.26.0.zip

    (xLimbs[i] ^ dLimbs[i])) xLimbs[i], carry = bits.Add(l, l, carry) dLimbs[i], borrow = bits.Sub(xLimbs[i], mLimbs[i], borrow) } // Like in maybeSubtractModulus, we need the subtraction if either it // didn't underflow (meaning 2x + b > m) or if computing 2x + b // overflowed (meaning 2x + b > 2^_W*n > m). needSubtraction = not(choice(borrow)) | choice(carry) } return x.assign(needSubtraction, d) } // Mod calculates out = x mod m. // // This works regardless how large the value of x is. // // The output...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Jan 08 17:58:32 GMT 2026
    - 660.3K bytes
    - Click Count (0)
  7. lib/fips140/v1.0.0-c2097c7c.zip

    (xLimbs[i] ^ dLimbs[i])) xLimbs[i], carry = bits.Add(l, l, carry) dLimbs[i], borrow = bits.Sub(xLimbs[i], mLimbs[i], borrow) } // Like in maybeSubtractModulus, we need the subtraction if either it // didn't underflow (meaning 2x + b > m) or if computing 2x + b // overflowed (meaning 2x + b > 2^_W*n > m). needSubtraction = not(choice(borrow)) | choice(carry) } return x.assign(needSubtraction, d) } // Mod calculates out = x mod m. // // This works regardless how large the value of x is. // // The output...
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
Back to Top