Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1181 - 1190 of 4,666 for inT (0.06 seconds)

  1. internal/bpool/bpool.go

    type BytePoolCap struct {
    	c    chan []byte
    	w    int
    	wcap int
    }
    
    // NewBytePoolCap creates a new BytePool bounded to the given maxSize, with new
    // byte arrays sized based on width.
    func NewBytePoolCap(maxSize uint64, width int, capwidth int) (bp *BytePoolCap) {
    	if capwidth <= 0 {
    		panic("total buffer capacity must be provided")
    	}
    	if capwidth < 64 {
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 3K bytes
    - Click Count (0)
  2. src/test/java/jcifs/smb/compression/CompressionNegotiateContextTest.java

            // Encode first
            byte[] buffer = new byte[256];
            int encodedSize = context.encode(buffer, 0);
    
            // Create new context for decoding
            CompressionNegotiateContext decodedContext = new CompressionNegotiateContext();
            int decodedSize = decodedContext.decode(buffer, 0, encodedSize);
    
            assertEquals(encodedSize, decodedSize);
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sun Aug 31 08:00:57 GMT 2025
    - 5.6K bytes
    - Click Count (0)
  3. android/guava-tests/test/com/google/common/primitives/BytesTest.java

      public void testConcat_overflow_negative() {
        int dim1 = 1 << 16;
        int dim2 = 1 << 15;
        assertThat(dim1 * dim2).isLessThan(0);
        testConcatOverflow(dim1, dim2);
      }
    
      @GwtIncompatible // different overflow behavior; could probably be made to work by using ~~
      public void testConcat_overflow_nonNegative() {
        int dim1 = 1 << 16;
        int dim2 = 1 << 16;
        assertThat(dim1 * dim2).isAtLeast(0);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Mar 08 01:43:32 GMT 2026
    - 17.5K bytes
    - Click Count (0)
  4. tests/lru_test.go

    	lru := lru.NewLRU[string, int](10, nil, time.Hour)
    	lru.Add("key1", 1)
    	lru.Add("key1", 2)
    
    	if value, ok := lru.Get("key1"); !ok || value != 2 {
    		t.Errorf("Expected value to be updated to 2, got %v", value)
    	}
    }
    
    func TestLRU_Add_NewKey_AddsEntry(t *testing.T) {
    	lru := lru.NewLRU[string, int](10, nil, time.Hour)
    	lru.Add("key1", 1)
    
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Mon Sep 08 09:19:22 GMT 2025
    - 10.4K bytes
    - Click Count (0)
  5. internal/http/response-recorder.go

    	http.ResponseWriter
    	io.ReaderFrom
    	StatusCode int
    	// Log body of 4xx or 5xx responses
    	LogErrBody bool
    	// Log body of all responses
    	LogAllBody bool
    
    	ttfbHeader time.Duration
    	ttfbBody   time.Duration
    
    	StartTime time.Time
    	// number of bytes written
    	bytesWritten int
    	// number of bytes of response headers written
    	headerBytesWritten int
    	// Internal recording buffer
    	headers bytes.Buffer
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Mar 30 00:56:02 GMT 2025
    - 5.5K bytes
    - Click Count (0)
  6. src/main/java/jcifs/internal/smb2/persistent/DurableHandleV2Response.java

        private int flags;
    
        /**
         * Create a new durable handle V2 response
         */
        public DurableHandleV2Response() {
            // Will be populated during decode
        }
    
        @Override
        public byte[] getName() {
            return CONTEXT_NAME_BYTES;
        }
    
        @Override
        public int decode(byte[] buffer, int bufferIndex, int len) throws SMBProtocolDecodingException {
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 21 04:51:33 GMT 2025
    - 3K bytes
    - Click Count (0)
  7. src/bufio/bufio.go

    // on it.
    type Reader struct {
    	buf          []byte
    	rd           io.Reader // reader provided by the client
    	r, w         int       // buf read and write positions
    	err          error
    	lastByte     int // last byte read for UnreadByte; -1 means invalid
    	lastRuneSize int // size of last rune read for UnreadRune; -1 means invalid
    }
    
    const minReadBufferSize = 16
    const maxConsecutiveEmptyReads = 100
    
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Feb 06 17:28:40 GMT 2026
    - 22K bytes
    - Click Count (0)
  8. src/test/java/jcifs/smb1/smb1/Trans2GetDfsReferralTest.java

            int expected = level & 0xFFFF;
            assertEquals(expected, written);
        }
    
        // Helper method to extract string from buffer
        private String extractStringFromBuffer(byte[] buffer, int offset, int maxLen) {
            int end = offset;
            while (end < offset + maxLen && buffer[end] != 0) {
                end++;
            }
            return new String(buffer, offset, end - offset, StandardCharsets.UTF_8);
        }
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 5.6K bytes
    - Click Count (0)
  9. impl/maven-core/src/main/java/org/apache/maven/lifecycle/internal/concurrent/BuildStep.java

    import org.apache.maven.project.MavenProject;
    
    public class BuildStep {
        public static final int CREATED = 0;
        public static final int PLANNING = 1;
        public static final int SCHEDULED = 2;
        public static final int EXECUTED = 3;
        public static final int FAILED = 4;
        public static final int SKIPPED = 5;
    
        public static final String PLAN = "$plan$";
        public static final String SETUP = "$setup$";
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Wed Apr 30 16:21:08 GMT 2025
    - 4.9K bytes
    - Click Count (0)
  10. fess-crawler-opensearch/src/test/java/org/codelibs/fess/crawler/service/impl/OpenSearchUrlQueueServiceTest.java

        public void test_poll_concurrentAccessTx() throws Exception {
            final String sessionId = "poll_session4";
            final int numThreads = 5;
            final int itemsPerThread = 10;
            final List<OpenSearchUrlQueue> urlQueueList = new ArrayList<>();
    
            // Insert items
            for (int i = 1; i <= itemsPerThread * numThreads; i++) {
                final OpenSearchUrlQueue urlQueue = new OpenSearchUrlQueue();
    Created: Sun Apr 12 03:50:13 GMT 2026
    - Last Modified: Wed Jan 14 23:48:16 GMT 2026
    - 14.5K bytes
    - Click Count (0)
Back to Top