- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 2,449 for wsize (0.15 sec)
-
android/guava-tests/test/com/google/common/io/IoTestCase.java
} /** Returns a byte array of length size that has values 0 .. size - 1. */ static byte[] newPreFilledByteArray(int size) { return newPreFilledByteArray(0, size); } /** Returns a byte array of length size that has values offset .. offset + size - 1. */ static byte[] newPreFilledByteArray(int offset, int size) { byte[] array = new byte[size]; for (int i = 0; i < size; i++) { array[i] = (byte) (offset + i);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 5.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/DenseImmutableTable.java
this.values = array; this.rowKeyToIndex = Maps.indexMap(rowSpace); this.columnKeyToIndex = Maps.indexMap(columnSpace); rowCounts = new int[rowKeyToIndex.size()]; columnCounts = new int[columnKeyToIndex.size()]; int[] cellRowIndices = new int[cellList.size()]; int[] cellColumnIndices = new int[cellList.size()];
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Nov 30 21:54:06 GMT 2023 - 10K bytes - Viewed (0) -
tensorflow/c/experimental/filesystem/plugins/gcs/ram_file_block_cache.cc
size_t start = block_size_ * (offset / block_size_); size_t finish = block_size_ * ((offset + n) / block_size_); if (finish < offset + n) { finish += block_size_; } size_t total_bytes_transferred = 0; // Now iterate through the blocks, reading them one at a time. for (size_t pos = start; pos < finish; pos += block_size_) { Key key = std::make_pair(filename, pos);
C++ - Registered: Tue Apr 23 12:39:09 GMT 2024 - Last Modified: Thu Jul 16 01:39:09 GMT 2020 - 11.1K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/IteratorBenchmark.java
@Param({"0", "1", "16", "256", "4096", "65536"}) int size; // use concrete classes to remove any possible polymorphic overhead? Object[] array; ArrayList<Object> arrayList; LinkedList<Object> linkedList; @BeforeExperiment void setUp() { array = new Object[size]; arrayList = Lists.newArrayListWithCapacity(size); linkedList = Lists.newLinkedList();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.4K bytes - Viewed (0) -
internal/hash/reader.go
CalculatedSHA256: sha256Hex, } } if r.size >= 0 && size >= 0 && r.size != size { return nil, SizeMismatch{Want: r.size, Got: size} } r.checksum = MD5 r.contentSHA256 = SHA256 if r.size < 0 && size >= 0 { r.src = etag.Wrap(ioutil.HardLimitReader(r.src, size), r.src) r.size = size } if r.actualSize <= 0 && actualSize >= 0 { r.actualSize = actualSize
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Mon Sep 18 17:00:54 GMT 2023 - 10.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
for (int i = 0; i < expected.size(); i++) { actual.add(q.pollFirst()); } assertEquals(expected, actual); } public void testCorrectOrdering_smallHeapsPollFirst() { for (int size = 2; size < 16; size++) { for (int attempts = 0; attempts < size * (size - 1); attempts++) { ArrayList<Integer> elements = createOrderedList(size);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 36.1K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Striped.java
return ImmutableList.of(); } int[] stripes = new int[result.size()]; for (int i = 0; i < result.size(); i++) { stripes[i] = indexFor(result.get(i)); } Arrays.sort(stripes); // optimize for runs of identical stripes int previousStripe = stripes[0]; result.set(0, getAt(previousStripe)); for (int i = 1; i < result.size(); i++) { int currentStripe = stripes[i];
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 10 20:55:18 GMT 2023 - 20.3K bytes - Viewed (1) -
android/guava-tests/benchmark/com/google/common/math/LongMathBenchmark.java
private static final int[] exponents = new int[ARRAY_SIZE]; private static final int[] factorialArguments = new int[ARRAY_SIZE]; private static final int[][] binomialArguments = new int[ARRAY_SIZE][2]; private static final long[] positive = new long[ARRAY_SIZE]; private static final long[] nonnegative = new long[ARRAY_SIZE]; private static final long[] longs = new long[ARRAY_SIZE]; @BeforeExperiment void setUp() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/AtomicDoubleArrayTest.java
new NullPointerTester().testAllPublicInstanceMethods(new AtomicDoubleArray(1)); } /** constructor creates array of given size with all elements zero */ public void testConstructor() { AtomicDoubleArray aa = new AtomicDoubleArray(SIZE); for (int i = 0; i < SIZE; i++) { assertBitEquals(0.0, aa.get(i)); } } /** constructor with null array throws NPE */ public void testConstructor2NPE() {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 13 14:28:25 GMT 2024 - 14.5K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/io/ByteSourceAsCharSourceReadBenchmark.java
// come close. USING_DECODER_WITH_SIZE_HINT { @Override String read(ByteSource byteSource, Charset cs) throws IOException { Optional<Long> size = byteSource.sizeIfKnown(); // if we know the size and it fits in an int if (size.isPresent() && size.get().longValue() == size.get().intValue()) { // otherwise try to presize a StringBuilder
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 5.2K bytes - Viewed (0)