Search Options

Results per page
Sort
Preferred Languages
Advance

Results 761 - 770 of 1,464 for NUMBER (0.43 sec)

  1. internal/ringbuffer/ring_buffer.go

    		if r.err == io.EOF {
    			if r.w == r.r && !r.isFull {
    				return io.EOF
    			}
    			return nil
    		}
    		return r.err
    	}
    	return nil
    }
    
    // Read reads up to len(p) bytes into p. It returns the number of bytes read (0 <= n <= len(p)) and any error encountered.
    // Even if Read returns n < len(p), it may use all of p as scratch space during the call.
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Sep 28 20:59:21 UTC 2025
    - 13.3K bytes
    - Viewed (0)
  2. src/main/webapp/WEB-INF/view/admin/keymatch/admin_keymatch_edit.jsp

                                        <div class="form-inline col-sm-9">
                                            <la:errors property="maxSize"/>
                                            <input type="number" name="maxSize" id="maxSize"
                                                   value="${f:h(maxSize)}" class="form-control"
                                                   min="0" max="10000000">
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Thu Nov 13 05:54:52 UTC 2025
    - 6K bytes
    - Viewed (0)
  3. okhttp-sse/src/main/kotlin/okhttp3/sse/internal/ServerSentEventReader.kt

          data: String,
        )
    
        fun onRetryChange(timeMs: Long)
      }
    
      /**
       * Process the next event. This will result in a single call to [Callback.onEvent] *unless* the
       * data section was empty. Any number of calls to [Callback.onRetryChange] may occur while
       * processing an event.
       *
       * @return false when EOF is reached
       */
      @Throws(IOException::class)
      fun processNextEvent(): Boolean {
        var id = lastId
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Fri Oct 03 07:51:20 UTC 2025
    - 4.3K bytes
    - Viewed (0)
  4. guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java

          for (int i = n1 + 1; i <= n2; i++) {
            result *= i;
          }
          return BigInteger.valueOf(result);
        }
    
        /*
         * We want each multiplication to have both sides with approximately the same number of digits.
         * Currently, we just divide the range in half.
         */
        int mid = (n1 + n2) >>> 1;
        return oldSlowFactorial(n1, mid).multiply(oldSlowFactorial(mid, n2));
      }
    
      @Benchmark
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 3.5K bytes
    - Viewed (0)
  5. src/main/java/jcifs/dcerpc/DcerpcBind.java

            buf.enc_ndr_small(1); /* num context items */
            buf.enc_ndr_small(0); /* reserved */
            buf.enc_ndr_short(0); /* reserved2 */
            buf.enc_ndr_short(0); /* context id */
            buf.enc_ndr_small(1); /* number of items */
            buf.enc_ndr_small(0); /* reserved */
            this.binding.getUuid().encode(buf);
            buf.enc_ndr_short(this.binding.getMajor());
            buf.enc_ndr_short(this.binding.getMinor());
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 3.6K bytes
    - Viewed (0)
  6. src/main/java/jcifs/internal/smb1/trans/TransPeekNamedPipeResponse.java

         *
         * @param config the SMB configuration
         */
        public TransPeekNamedPipeResponse(final Configuration config) {
            super(config);
        }
    
        /**
         * Gets the number of bytes available to read from the named pipe.
         *
         * @return the available
         */
        public final int getAvailable() {
            return this.available;
        }
    
        @Override
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 3.3K bytes
    - Viewed (0)
  7. src/main/java/jcifs/smb1/dcerpc/DcerpcBind.java

            buf.enc_ndr_small(1); /* num context items */
            buf.enc_ndr_small(0); /* reserved */
            buf.enc_ndr_short(0); /* reserved2 */
            buf.enc_ndr_short(0); /* context id */
            buf.enc_ndr_small(1); /* number of items */
            buf.enc_ndr_small(0); /* reserved */
            binding.uuid.encode(buf);
            buf.enc_ndr_short(binding.major);
            buf.enc_ndr_short(binding.minor);
            DCERPC_UUID_SYNTAX_NDR.encode(buf);
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 3.5K bytes
    - Viewed (0)
  8. src/main/webapp/WEB-INF/view/common/help.jsp

    		<pre>content_length:[1000 TO 10000]</pre>
    		If you want to exclude the upper and lower bounds, use "{}".
    	</dd>
    	<dt>Boost</dt>
    	<dd>
    		To boost a term use the "^" symbol with a boost factor (a number) at
    		the end of the term you are searching.
    		<pre>Fess^100</pre>
    	</dd>
    	<dt>Fuzzy</dt>
    	<dd>
    		To do a fuzzy search use the "~" symbol at the end of a single word
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Mon Feb 26 14:01:31 UTC 2018
    - 2.4K bytes
    - Viewed (0)
  9. tests/test_union_body_discriminator_annotated.py

                                    "title": "Pet Type",
                                    "default": "dog",
                                },
                                "barks": {"type": "number", "title": "Barks"},
                            },
                            "type": "object",
                            "required": ["barks"],
                            "title": "Dog",
                        },
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Sat Dec 20 15:55:38 UTC 2025
    - 7.7K bytes
    - Viewed (0)
  10. src/test/java/jcifs/internal/dtyp/SecurityInfoTest.java

                    assertTrue(value <= 0xFFFF, "Constant " + field.getName() + " value seems unusually large");
                }
            }
        }
    
        /**
         * Helper method to check if a number is a power of two
         */
        private boolean isPowerOfTwo(int n) {
            return n > 0 && (n & (n - 1)) == 0;
        }
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 07:14:38 UTC 2025
    - 7.5K bytes
    - Viewed (0)
Back to top