- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 3,007 for int8 (0.01 sec)
-
tensorflow/c/c_api_function.cc
const TF_Graph* fn_body, const char* fn_name, int ninputs, const TF_Output* inputs, std::vector<OutputTensor>* input_tensors, std::unordered_map<const Node*, std::vector<int>>* input_nodes) TF_EXCLUSIVE_LOCKS_REQUIRED(fn_body->mu) { input_tensors->reserve(ninputs); for (int i = 0; i < ninputs; ++i) { Node* node = inputs[i].oper ? &inputs[i].oper->node : nullptr; int idx = inputs[i].index;
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Sat Oct 12 16:27:48 UTC 2024 - 13.7K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/ImmutableLongArray.java
} private void ensureRoomFor(int numberToAdd) { int newCount = count + numberToAdd; // TODO(kevinb): check overflow now? if (newCount > array.length) { array = Arrays.copyOf(array, expandedCapacity(array.length, newCount)); } } // Unfortunately this is pasted from ImmutableCollection.Builder. private static int expandedCapacity(int oldCapacity, int minCapacity) { if (minCapacity < 0) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 22K bytes - Viewed (0) -
src/main/java/jcifs/internal/smb1/SMB1SigningDigest.java
} } /** * * {@inheritDoc} * * @see jcifs.internal.SMBSigningDigest#verify(byte[], int, int, int, jcifs.internal.CommonServerMessageBlock) */ @Override public boolean verify(final byte[] data, final int offset, final int l, final int extraPad, final CommonServerMessageBlock m) { final ServerMessageBlock msg = (ServerMessageBlock) m;
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 11.9K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/StripedBenchmark.java
@Override Striped<Lock> get(int stripes) { return new Striped.LargeLazyStriped<>(stripes, LOCK_SUPPLIER); } }; abstract Striped<Lock> get(int stripes); } private Striped<Lock> striped; private int[] stripes; private List<Integer> bulkGetSet; @BeforeExperiment void setUp() { this.striped = impl.get(numStripes); stripes = new int[numStripes];
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 4K bytes - Viewed (0) -
api/go1.7.txt
pkg go/doc, type Example struct, Unordered bool pkg io, const SeekCurrent = 1 pkg io, const SeekCurrent ideal-int pkg io, const SeekEnd = 2 pkg io, const SeekEnd ideal-int pkg io, const SeekStart = 0 pkg io, const SeekStart ideal-int pkg math/big, method (*Float) GobDecode([]uint8) error pkg math/big, method (*Float) GobEncode() ([]uint8, error) pkg net, method (*Dialer) DialContext(context.Context, string, string) (Conn, error)
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Tue Jun 28 15:08:11 UTC 2016 - 13.6K bytes - Viewed (0) -
src/main/java/org/codelibs/core/nio/ChannelUtil.java
} } /** * Reads the contents of the file channel into a byte buffer. * * @param channel * The file channel. Must not be {@literal null}. * @param buffer * The byte buffer. Must not be {@literal null}. * @return The number of bytes read. */ public static int read(final FileChannel channel, final ByteBuffer buffer) {
Registered: Fri Sep 05 20:58:11 UTC 2025 - Last Modified: Thu Jul 31 08:16:49 UTC 2025 - 5.6K bytes - Viewed (0) -
guava/src/com/google/common/hash/Murmur3_32HashFunction.java
} @Override public int hashCode() { return getClass().hashCode() ^ seed; } @Override public HashCode hashInt(int input) { int k1 = mixK1(input); int h1 = mixH1(seed, k1); return fmix(h1, Ints.BYTES); } @Override public HashCode hashLong(long input) { int low = (int) input; int high = (int) (input >>> 32); int k1 = mixK1(low);
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Apr 14 16:36:11 UTC 2025 - 11.8K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Chars.java
* @since 32.0.0 */ public static void rotate(char[] array, int distance, int fromIndex, int toIndex) { // See Ints.rotate for more details about possible algorithms here. checkNotNull(array); checkPositionIndexes(fromIndex, toIndex, array.length); if (array.length <= 1) { return; } int length = toIndex - fromIndex;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 24.2K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java
@Benchmark int factorial(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += BigIntegerMath.factorial(factorials[j]).intValue(); } return tmp; } @Benchmark int binomial(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & 0xffff; tmp += BigIntegerMath.binomial(factorials[j], binomials[j]).intValue();
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 3.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java
@CanIgnoreReturnValue // pushed down from class to method @Override public int drainTo(Collection<? super E> c, int maxElements) { if (c == null) throw new NullPointerException(); if (c == this) throw new IllegalArgumentException(); if (maxElements <= 0) return 0; Monitor monitor = this.monitor; monitor.enter(); try { int n = 0; E e; while (n < maxElements && (e = q.poll()) != null) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue May 13 18:46:00 UTC 2025 - 18.9K bytes - Viewed (0)