Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 11 - 20 of 33 for 2x (0.01 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. android/guava/src/com/google/common/collect/CompactHashing.java

       *
       * <p>For hashtable sizes less than or equal to 32, the returned power of 2 is 4x the current
       * hashtable size to reduce expensive rehashing. Otherwise the returned power of 2 is 2x the
       * current hashtable size.
       */
      static int newCapacity(int mask) {
        return ((mask < 32) ? 4 : 2) * (mask + 1);
      }
    
      /** Returns the hash prefix given the current mask. */
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Dec 26 20:08:09 GMT 2025
    - 7.1K bytes
    - Click Count (0)
  2. src/main/webapp/css/font-awesome.min.css

    .fa-rotate-180,:root .fa-rotate-270{-webkit-filter:none;filter:none}.fa-stack{display:inline-block;height:2em;line-height:2em;position:relative;vertical-align:middle;width:2.5em}.fa-stack-1x,.fa-stack-2x{left:0;position:absolute;text-align:center;width:100%}.fa-stack-1x{line-height:inherit}.fa-stack-2x{font-size:2em}.fa-inverse{color:#fff}.fa-500px:before{content:"\f26e"}.fa-accessible-icon:before{content:"\f368"}.fa-accusoft:before{content:"\f369"}.fa-acquisitions-incorporated:before{content:"\f6...
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Dec 14 21:22:25 GMT 2019
    - 55.8K bytes
    - Click Count (2)
  3. src/test/java/org/codelibs/fess/query/QueryFieldConfigSetBasedLookupTest.java

            assertTrue("Set-based lookup should be faster or comparable to array-based lookup for large datasets",
                    setDuration <= arrayDuration * 2); // Allow 2x margin for test stability
        }
    
        /**
         * Helper method to create a test FessConfig.
         */
        private FessConfig createTestFessConfig() {
            return new FessConfig.SimpleImpl() {
    
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Fri Mar 13 23:01:26 GMT 2026
    - 19.4K bytes
    - Click Count (0)
  4. misc/go_android_exec/main.go

    			// walking the tree and copying it piecewise. If the directory tree
    			// contains nested modules this could push a lot of unnecessary contents,
    			// but for the golang.org/x repos it seems to be significantly (~2x)
    			// faster than copying one file at a time (via filepath.WalkDir),
    			// apparently due to high latency in 'adb' commands.
    			if err := adb("push", modDir, deviceModDir); err != nil {
    				return 0, err
    			}
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Mon Aug 21 17:46:57 GMT 2023
    - 15.3K bytes
    - Click Count (0)
  5. src/test/java/jcifs/smb/SmbRandomAccessFileTest.java

            verify(raf, times(2)).write(any(byte[].class), anyInt(), eq(8)); // long and double
        }
    
        @Test
        @DisplayName("writeBytes(): writes string bytes; writeChars(): 2x length")
        void write_stringVariants() throws Exception {
            SmbRandomAccessFile raf = spy(newInstance("rw", false, true, false));
            doNothing().when(raf).write(any(byte[].class), anyInt(), anyInt());
    
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 18.1K bytes
    - Click Count (0)
  6. src/bytes/buffer.go

    	// we allocate buffers rounded up to the closest size class.
    	c := len(b) + n // ensure enough space for n elements
    	if c < 2*cap(b) {
    		// The growth rate has historically always been 2x. In the future,
    		// we could rely purely on append to determine the growth rate.
    		c = 2 * cap(b)
    	}
    	b2 := append([]byte(nil), make([]byte, c)...)
    	i := copy(b2, b)
    	return b2[:i]
    }
    
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Nov 14 19:01:17 GMT 2025
    - 16.5K bytes
    - Click Count (0)
  7. guava/src/com/google/common/collect/MinMaxPriorityQueue.java

          int newCapacity = calculateNewCapacity();
          Object[] newQueue = new Object[newCapacity];
          arraycopy(queue, 0, newQueue, 0, queue.length);
          queue = newQueue;
        }
      }
    
      /** Returns ~2x the old capacity if small; ~1.5x otherwise. */
      private int calculateNewCapacity() {
        int oldCapacity = queue.length;
        int newCapacity =
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 13:11:08 GMT 2026
    - 34K bytes
    - Click Count (0)
  8. src/bytes/buffer_test.go

    	b.Write(buf[0:1])
    	var cap0 int
    	for i := 0; i < 5<<10; i++ {
    		b.Write(buf)
    		b.Read(buf)
    		if i == 0 {
    			cap0 = b.Cap()
    		}
    	}
    	cap1 := b.Cap()
    	// (*Buffer).grow allows for 2x capacity slop before sliding,
    	// so set our error threshold at 3x.
    	if cap1 > cap0*3 {
    		t.Errorf("buffer cap = %d; too big (grew from %d)", cap1, cap0)
    	}
    }
    
    func BenchmarkWriteByte(b *testing.B) {
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Nov 14 19:01:17 GMT 2025
    - 19.4K bytes
    - Click Count (0)
  9. android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java

          int newCapacity = calculateNewCapacity();
          Object[] newQueue = new Object[newCapacity];
          arraycopy(queue, 0, newQueue, 0, queue.length);
          queue = newQueue;
        }
      }
    
      /** Returns ~2x the old capacity if small; ~1.5x otherwise. */
      private int calculateNewCapacity() {
        int oldCapacity = queue.length;
        int newCapacity =
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 13:11:08 GMT 2026
    - 34K bytes
    - Click Count (0)
  10. docs/features/events.md

    ![Events Diagram](../assets/images/events@2x.png)
    
    Here’s a [sample event listener](https://github.com/square/okhttp/blob/master/samples/guide/src/main/java/okhttp3/recipes/PrintEventsNonConcurrent.java) that prints each event with a timestamp.
    
    ```java
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Sun Mar 15 09:01:42 GMT 2026
    - 7.7K bytes
    - Click Count (0)
Back to Top