Search Options

Results per page
Sort
Preferred Languages
Advance

Results 221 - 230 of 269 for Harper (0.03 sec)

  1. src/bytes/buffer_test.go

    package bytes_test
    
    import (
    	. "bytes"
    	"fmt"
    	"internal/testenv"
    	"io"
    	"math/rand"
    	"strconv"
    	"testing"
    	"unicode/utf8"
    )
    
    const N = 10000       // make this bigger for a larger (and slower) test
    var testString string // test data for write tests
    var testBytes []byte  // test data; same as testString but as a slice.
    
    type negativeReader struct{}
    
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Mon May 19 16:13:04 UTC 2025
    - 18.6K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/collect/CompactHashMap.java

     *
     * <p>Unlike {@code java.util.HashMap}, iteration is only proportional to the actual {@code size()},
     * which is optimal, and <i>not</i> the size of the internal hashtable, which could be much larger
     * than {@code size()}. Furthermore, this structure places significantly reduced load on the garbage
     * collector by only using a constant number of internal objects.
     *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 35.7K bytes
    - Viewed (0)
  3. src/test/java/org/codelibs/fess/helper/QueryHelperTest.java

    import org.codelibs.fess.query.QueryProcessor;
    import org.codelibs.fess.query.TermQueryCommand;
    import org.codelibs.fess.query.TermRangeQueryCommand;
    import org.codelibs.fess.query.WildcardQueryCommand;
    import org.codelibs.fess.query.parser.QueryParser;
    import org.codelibs.fess.unit.UnitFessTestCase;
    import org.codelibs.fess.util.ComponentUtil;
    import org.dbflute.util.DfTypeUtil;
    import org.opensearch.index.query.BoolQueryBuilder;
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Aug 07 03:06:29 UTC 2025
    - 52.6K bytes
    - Viewed (0)
  4. docs/ko/docs/tutorial/sql-databases.md

    /// tip | 팁
    
    다른 SQL 또는 NoSQL 데이터베이스 라이브러리를 사용할 수도 있습니다 (일부는 <abbr title="객체 관계 매퍼(Object Relational Mapper), SQL 테이블을 나타내는 클래스를 제공하고 테이블의 행을 인스턴스로 표현하는 라이브러리를 지칭하는 용어">"ORM"</abbr>이라고도 불립니다), FastAPI는 특정 라이브러리의 사용을 강요하지 않습니다. 😎
    
    ///
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Tue Dec 24 16:14:29 UTC 2024
    - 18K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/collect/MapMakerInternalMap.java

        }
    
        @Override
        public @Nullable E getNext() {
          return null;
        }
      }
    
      /** Marker interface for {@link InternalEntry} implementations for strong values. */
      interface StrongValueEntry<K, V, E extends InternalEntry<K, V, E>>
          extends InternalEntry<K, V, E> {}
    
      /** Marker interface for {@link InternalEntry} implementations for weak values. */
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 90K bytes
    - Viewed (0)
  6. src/main/java/org/codelibs/fess/opensearch/client/SearchEngineClient.java

        protected void insertBulkData(final FessConfig fessConfig, final String configIndex, final String dataPath) {
            try {
                final BulkRequestBuilder builder = client.prepareBulk();
                final ObjectMapper mapper = new ObjectMapper();
                final String userIndex = fessConfig.getIndexUserIndex() + ".user";
                Arrays.stream(FileUtil.readUTF8(dataPath).split("\n"))
                        .map(line -> line//
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sun Aug 31 08:19:00 UTC 2025
    - 121.9K bytes
    - Viewed (0)
  7. okhttp/src/jvmTest/kotlin/okhttp3/internal/http2/HpackTest.kt

        assertThat(hpackReader!!.getAndResetHeaderList()).isEqualTo(headerBlock)
      }
    
      /**
       * HPACK has a max header table size, which can be smaller than the max header message. Ensure the
       * larger header content is not lost.
       */
      @Test
      fun tooLargeToHPackIsStillEmitted() {
        bytesIn.writeByte(0x21) // Dynamic table size update (size = 1).
        bytesIn.writeByte(0x00) // Literal indexed
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Wed Mar 19 19:25:20 UTC 2025
    - 38.6K bytes
    - Viewed (0)
  8. src/bufio/bufio.go

    // into the buffer in order to make n bytes available. If Peek returns fewer
    // than n bytes, it also returns an error explaining why the read is short.
    // The error is [ErrBufferFull] if n is larger than b's buffer size.
    //
    // Calling Peek prevents a [Reader.UnreadByte] or [Reader.UnreadRune] call from succeeding
    // until the next read operation.
    func (b *Reader) Peek(n int) ([]byte, error) {
    	if n < 0 {
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Sep 03 14:04:47 UTC 2025
    - 22K bytes
    - Viewed (0)
  9. guava/src/com/google/common/math/LongMath.java

       * Returns {@code false} if {@code n} is zero, one, or a composite number (one which <i>can</i> be
       * factored into smaller positive integers).
       *
       * <p>To test larger numbers, use {@link BigInteger#isProbablePrime}.
       *
       * @throws IllegalArgumentException if {@code n} is negative
       * @since 20.0
       */
      @GwtIncompatible // TODO
      public static boolean isPrime(long n) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Fri Aug 29 16:20:07 UTC 2025
    - 46.8K bytes
    - Viewed (0)
  10. src/main/java/jcifs/smb/SmbSessionImpl.java

         *
         * @param address the address to check
         * @return true if witness service is available
         */
        private boolean isWitnessServiceAvailable(InetAddress address) {
            // RPC endpoint mapper port and connection timeout
            final int RPC_ENDPOINT_PORT = 135;
            final int RPC_CONNECT_TIMEOUT_MS = 5000;
    
            try (Socket socket = new Socket()) {
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Sun Aug 31 08:00:57 UTC 2025
    - 68.9K bytes
    - Viewed (0)
Back to top