Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 612 for Hong (0.03 seconds)

  1. RELEASE.md

    Husum, harumitsu.nobuta, Henry Spivey, hsm207, Jekyll Song, Jerome, Jiongyan
    Zhang, jjsjann123, John Sungjin Park, Johnson145, JoshVarty, Julian Wolff, Jun
    Wang, June-One, Kamil Sindi, Kb Sriram, Kdavis-Mozilla, Kenji, lazypanda1,
    Liang-Chi Hsieh, Loo Rong Jie, Mahesh Bhosale, MandarJKulkarni, ManHyuk, Marcus
    Ong, Marshal Hayes, Martin Pool, matthieudelaro, mdfaijul, mholzel, Michael
    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)
  2. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http2/Http2Connection.kt

       * To differentiate the two cases we ping the server when a stream times out. If the overall
       * connection is fine the ping will receive a pong; otherwise it won't.
       *
       * The deadline to respond to this ping attempts to limit the cost of being wrong. If it is too
       * long, streams created while we await the pong will reuse broken connections and inevitably
       * fail. If it is too short, slow connections will be marked as failed and extra TCP and TLS
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 31.9K bytes
    - Click Count (0)
  3. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/ws/WebSocketWriter.kt

    class WebSocketWriter(
      private val isClient: Boolean,
      val sink: BufferedSink,
      val random: Random,
      private val perMessageDeflate: Boolean,
      private val noContextTakeover: Boolean,
      private val minimumDeflateSize: Long,
    ) : Closeable {
      /** This holds outbound data for compression and masking. */
      private val messageBuffer = Buffer()
    
      /** The [Buffer] of [sink]. Write to this and then flush/emit [sink]. */
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 6K bytes
    - Click Count (0)
  4. okhttp/src/commonJvmAndroid/kotlin/okhttp3/OkHttpClient.kt

      /**
       * Minimum outbound web socket message size (in bytes) that will be compressed.
       * The default is 1024 bytes.
       */
      @get:JvmName("minWebSocketMessageToCompress")
      val minWebSocketMessageToCompress: Long = builder.minWebSocketMessageToCompress
    
      internal val routeDatabase: RouteDatabase = builder.routeDatabase ?: RouteDatabase()
      internal val taskRunner: TaskRunner = builder.taskRunner ?: TaskRunner.INSTANCE
    
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Feb 03 22:17:59 GMT 2026
    - 51.5K bytes
    - Click Count (0)
  5. src/test/java/org/codelibs/fess/mylasta/direction/sponsor/FessTimeResourceProviderTest.java

        @Test
        public void test_getTimeAdjustTimeMillisAsLong_values() {
            Long[] testValues = { 0L, 1L, -1L, 1000L, -1000L, 60000L, -60000L, 3600000L, -3600000L, Long.MAX_VALUE, Long.MIN_VALUE };
    
            for (Long value : testValues) {
                FessConfig testConfig = new FessConfig.SimpleImpl() {
                    private static final long serialVersionUID = 1L;
    
                    @Override
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Fri Mar 13 23:01:26 GMT 2026
    - 17.8K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/hash/Murmur3_128HashFunction.java

        protected void process(ByteBuffer bb) {
          long k1 = bb.getLong();
          long k2 = bb.getLong();
          bmix64(k1, k2);
          length += CHUNK_SIZE;
        }
    
        private void bmix64(long k1, long k2) {
          h1 ^= mixK1(k1);
    
          h1 = Long.rotateLeft(h1, 27);
          h1 += h2;
          h1 = h1 * 5 + 0x52dce729;
    
          h2 ^= mixK2(k2);
    
          h2 = Long.rotateLeft(h2, 31);
          h2 += h1;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 19 18:53:45 GMT 2026
    - 5.8K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/hash/BloomFilterStrategies.java

         */
        public static long[] toPlainArray(AtomicLongArray atomicLongArray) {
          long[] array = new long[atomicLongArray.length()];
          for (int i = 0; i < array.length; ++i) {
            array[i] = atomicLongArray.get(i);
          }
          return array;
        }
    
        /** Number of bits */
        long bitSize() {
          return (long) data.length() * Long.SIZE;
        }
    
        /**
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 19 18:53:45 GMT 2026
    - 10.7K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/hash/LittleEndianByteArray.java

          @Override
          public long getLongLittleEndian(byte[] array, int offset) {
            long bigEndian = theUnsafe.getLong(array, (long) offset + BYTE_ARRAY_BASE_OFFSET);
            // The hardware is big-endian, so we need to reverse the order of the bytes.
            return Long.reverseBytes(bigEndian);
          }
    
          @Override
          public void putLongLittleEndian(byte[] array, int offset, long value) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Apr 01 17:27:13 GMT 2026
    - 10.1K bytes
    - Click Count (0)
  9. guava-tests/test/com/google/common/primitives/LongsTest.java

        testRotate(new long[] {1}, -2, new long[] {1});
        testRotate(new long[] {1}, -1, new long[] {1});
        testRotate(new long[] {1}, 0, new long[] {1});
        testRotate(new long[] {1}, 1, new long[] {1});
        testRotate(new long[] {1}, 2, new long[] {1});
    
        testRotate(new long[] {1, 2}, -3, new long[] {2, 1});
        testRotate(new long[] {1, 2}, -1, new long[] {2, 1});
        testRotate(new long[] {1, 2}, -2, new long[] {1, 2});
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 17 16:45:58 GMT 2026
    - 28.8K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/math/LongMath.java

                + Long.numberOfLeadingZeros(~a)
                + Long.numberOfLeadingZeros(b)
                + Long.numberOfLeadingZeros(~b);
        if (leadingZeros > Long.SIZE + 1) {
          return a * b;
        }
        // the return value if we will overflow (which we calculate by overflowing a long :) )
        long limit = Long.MAX_VALUE + ((a ^ b) >>> (Long.SIZE - 1));
        if (leadingZeros < Long.SIZE | (a < 0 & b == Long.MIN_VALUE)) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 09 23:01:02 GMT 2026
    - 46.8K bytes
    - Click Count (0)
Back to Top