- Sort Score
- Num 10 results
- Language All
Results 1181 - 1190 of 1,390 for butter (0.06 seconds)
-
guava-testlib/src/com/google/common/testing/FreshValueGenerator.java
import java.lang.reflect.InvocationTargetException; import java.lang.reflect.Method; import java.lang.reflect.Type; import java.lang.reflect.TypeVariable; import java.math.BigDecimal; import java.math.BigInteger; import java.nio.Buffer; import java.nio.ByteBuffer; import java.nio.CharBuffer; import java.nio.DoubleBuffer; import java.nio.FloatBuffer; import java.nio.IntBuffer; import java.nio.LongBuffer; import java.nio.ShortBuffer;
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Mar 17 16:45:58 GMT 2026 - 28.7K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
* structure (to make it possible to throw ConcurrentModificationException in the iterator). Note * that we choose not to make this volatile, so we do less of a "best effort" to track such * errors, for better performance. */ private transient int metadata; /** The number of elements contained in the set. */ private transient int size; /** Constructs a new empty instance of {@code CompactHashSet}. */
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Jul 08 18:32:10 GMT 2025 - 23.9K bytes - Click Count (0) -
android/guava/src/com/google/common/primitives/ImmutableLongArray.java
* * <p><b>Performance note:</b> When feasible, {@code initialCapacity} should be the exact number * of values that will be added, if that knowledge is readily available. It is better to guess a * value slightly too high than slightly too low. If the value is not exact, the {@link * ImmutableLongArray} that is built will very likely occupy more memory than strictly necessary;Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Dec 12 14:49:24 GMT 2025 - 22K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/collect/ImmutableSetTest.java
verifyTableSize(100, 5, 8); verifyTableSize(100, 33, 64); verifyTableSize(60, 60, 128); verifyTableSize(120, 60, 256); // if the table is only double the necessary size, we don't bother resizing it verifyTableSize(180, 60, 128); // but if it's even bigger than double, we rebuild the table verifyTableSize(17, 17, 32); verifyTableSize(17, 16, 32); verifyTableSize(17, 15, 32); }
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Mar 13 13:01:07 GMT 2026 - 14.1K bytes - Click Count (0) -
internal/logger/target/kafka/kafka.go
return nil default: // log channel is full, do not wait and return // an error immediately to the caller atomic.AddInt64(&h.totalMessages, 1) atomic.AddInt64(&h.failedMessages, 1) return errors.New("log buffer full") } return nil } // SendFromStore - reads the log from store and sends it to kafka. func (h *Target) SendFromStore(key store.Key) (err error) { auditEntry, err := h.store.Get(key) if err != nil {
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 10.2K bytes - Click Count (0) -
src/test/java/jcifs/internal/smb2/create/Smb2CreateResponseTest.java
// Return just the base; caller is responsible for placing ctx at the correct absolute offset. // We will return a composite buffer from the test when building the full packet. // To keep this helper simple, return base and let the caller append/pad and inject ctx. return base; } /**Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 11.5K bytes - Click Count (0) -
internal/s3select/csv/reader.go
r.close = nil } r.recordsRead = len(r.current) if r.err == nil { r.err = io.EOF } return r.readCloser.Close() } // nextSplit will attempt to skip a number of bytes and // return the buffer until the next newline occurs. // The last block will be sent along with an io.EOF. func (r *Reader) nextSplit(skip int, dst []byte) ([]byte, error) { if cap(dst) < skip { dst = make([]byte, 0, skip+1024) }
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Tue May 27 15:19:03 GMT 2025 - 8.8K bytes - Click Count (0) -
src/main/java/jcifs/smb1/util/Hexdump.java
*/ public static final char[] HEX_DIGITS = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F' }; /** * Generate "hexdump" output of the buffer at src like the following: * * <pre> * 00000: 04 d2 29 00 00 01 00 00 00 00 00 01 20 45 47 46 |..)......... EGF| * 00010: 43 45 46 45 45 43 41 43 41 43 41 43 41 43 41 43 |CEFEECACACACACAC|Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 7.8K bytes - Click Count (0) -
docs/bucket/replication/DESIGN.md
delete marker replication and delete replication should match to avoid inconsistent picture between the clusters. It is not recommended to turn on asymmetric replication - for e.g. if three sites A,B,C are participating in replication, it would be better to avoid replication setups like A -> [B, C], B -> A. In this particular example, an object uploaded to A will be replicated to B,C. If replica metadata sync is turned on in site B, any metadata updates on a replica version made in B would reflect...
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Tue Aug 12 18:20:36 GMT 2025 - 14.7K bytes - Click Count (0) -
src/main/java/jcifs/pac/PacLogonInfo.java
private SID[] extraSids; private int userAccountControl; private int userFlags; /** * Constructs a PAC logon information object from raw PAC data. * @param data the raw PAC logon info buffer data * @throws PACDecodingException if the data is malformed or invalid */ public PacLogonInfo(final byte[] data) throws PACDecodingException { try {
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 14.3K bytes - Click Count (0)