Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 10 for branching (0.08 sec)

  1. android/guava/src/com/google/common/base/Ascii.java

          char c1 = s1.charAt(i);
          char c2 = s2.charAt(i);
          if (c1 == c2) {
            continue;
          }
          int alphaIndex = getAlphaIndex(c1);
          // This was also benchmarked using '&' to avoid branching (but always evaluate the rhs),
          // however this showed no obvious improvement.
          if (alphaIndex < 26 && alphaIndex == getAlphaIndex(c2)) {
            continue;
          }
          return false;
        }
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Aug 02 13:50:22 UTC 2024
    - 21.7K bytes
    - Viewed (0)
  2. guava/src/com/google/common/base/Ascii.java

          char c1 = s1.charAt(i);
          char c2 = s2.charAt(i);
          if (c1 == c2) {
            continue;
          }
          int alphaIndex = getAlphaIndex(c1);
          // This was also benchmarked using '&' to avoid branching (but always evaluate the rhs),
          // however this showed no obvious improvement.
          if (alphaIndex < 26 && alphaIndex == getAlphaIndex(c2)) {
            continue;
          }
          return false;
        }
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Aug 02 13:50:22 UTC 2024
    - 21.7K bytes
    - Viewed (0)
  3. guava/src/com/google/common/math/LongMath.java

          // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b).
          // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two.
    
          // We bend over backwards to avoid branching, adapting a technique from
          // http://graphics.stanford.edu/~seander/bithacks.html#IntegerMinOrMax
    
          long delta = a - b; // can't overflow, since a and b are nonnegative
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 09 16:39:37 UTC 2024
    - 45.2K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/math/LongMath.java

          // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b).
          // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two.
    
          // We bend over backwards to avoid branching, adapting a technique from
          // http://graphics.stanford.edu/~seander/bithacks.html#IntegerMinOrMax
    
          long delta = a - b; // can't overflow, since a and b are nonnegative
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 09 16:39:37 UTC 2024
    - 45.2K bytes
    - Viewed (0)
  5. src/main/java/jcifs/smb1/smb1/AndXServerMessageBlock.java

             * the 'received' member of the response object will not
             * be set to true indicating the send and sendTransaction
             * methods that the next part should be sent. This is a
             * very indirect and simple batching control mechanism.
             */
    
            if( andx == null || USE_BATCHING == false ||
                                    batchLevel >= getBatchLimit( andx.command )) {
                andxCommand = (byte)0xFF;
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Fri Mar 22 21:10:40 UTC 2019
    - 11.3K bytes
    - Viewed (0)
  6. src/main/java/jcifs/internal/smb1/AndXServerMessageBlock.java

             * the 'received' member of the response object will not
             * be set to true indicating the send and sendTransaction
             * methods that the next part should be sent. This is a
             * very indirect and simple batching control mechanism.
             */
    
            if ( this.andx == null || !getConfig().isUseBatching() || this.batchLevel >= getBatchLimit(getConfig(), (byte) this.andx.getCommand()) ) {
                this.andxCommand = (byte) 0xFF;
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Mon Nov 28 10:56:27 UTC 2022
    - 14.3K bytes
    - Viewed (0)
  7. docs/tr/docs/alternatives.md

    Sonrasında ise projenin odağı değişti.
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 20 19:20:23 UTC 2024
    - 28.8K bytes
    - Viewed (0)
  8. src/main/java/jcifs/Configuration.java

        boolean isForceUnicode ();
    
    
        /**
         * 
         * Property <tt>jcifs.smb.client.useBatching</tt> (boolean, default false)
         * 
         * @return whether to enable support for SMB1 AndX command batching
         */
        boolean isUseBatching ();
    
    
        /**
         * 
         * Property <tt>jcifs.smb.client.nativeOs</tt> (string, default <tt>os.name</tt>)
         * 
         * @return OS string to report
         */
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Thu Jan 05 13:06:39 UTC 2023
    - 18K bytes
    - Viewed (0)
  9. internal/logger/target/http/http.go

    				// there is something in the log queue
    				// process it first, even if we tickered
    				// first, or we have not received any events
    				// yet, still wait on it.
    				continue
    			}
    
    			// If we are doing batching, we should wait
    			// at least for a second, before sending.
    			// Even if there is nothing in the queue.
    			if h.batchSize > 1 && time.Since(lastBatchProcess) < time.Second {
    				continue
    			}
    		}
    
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Sep 11 22:20:42 UTC 2024
    - 15.6K bytes
    - Viewed (0)
  10. okhttp/src/main/kotlin/okhttp3/internal/http2/Http2Stream.kt

        var finished: Boolean = false,
      ) : Sink {
        /**
         * Buffer of outgoing data. This batches writes of small writes into this sink as larges frames
         * written to the outgoing connection. Batching saves the (small) framing overhead.
         */
        private val sendBuffer = Buffer()
    
        /** Trailers to send at the end of the stream. */
        var trailers: Headers? = null
    
        var closed: Boolean = false
    
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Sat Apr 20 17:03:43 UTC 2024
    - 23.2K bytes
    - Viewed (0)
Back to top