- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 13 for shorter (0.38 seconds)
-
src/main/java/jcifs/smb/SmbSessionImpl.java
setNetbiosName(ctx.getNetbiosName()); byte[] sk = ctx.getSigningKey(); if (sk != null) { // session key is truncated to 16 bytes, right padded with 0 if shorter byte[] key = new byte[16]; System.arraycopy(sk, 0, key, 0, Math.min(16, sk.length)); this.sessionKey = key; }
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sun Aug 31 08:00:57 GMT 2025 - 68.9K bytes - Click Count (0) -
cmd/xl-storage-format-v2.go
wantMax := min(want+msgp.Uint32Size, size) if err := readMore(wantMax); err != nil { return nil, err } if int64(len(buf)) < want { return nil, fmt.Errorf("buffer shorter than expected (buflen: %d, want: %d): %w", len(buf), want, errFileCorrupt) } tmp = buf[want:] _, after, err := msgp.ReadUint32Bytes(tmp) if err != nil {
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 65.6K bytes - Click Count (1) -
android/guava/src/com/google/common/collect/ImmutableSortedMap.java
/** * Returns a builder that creates immutable sorted maps whose keys are ordered by their natural * ordering. The sorted maps use {@link Ordering#natural()} as the comparator. */ public static <K extends Comparable<?>, V> Builder<K, V> naturalOrder() { return new Builder<>(Ordering.natural()); } /** * Returns a builder that creates immutable sorted maps with an explicit comparator. If theCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Jan 08 18:10:02 GMT 2026 - 54.7K bytes - Click Count (0) -
src/test/java/jcifs/dcerpc/msrpc/lsarpcTest.java
(int) (int) (short) 'd', (int) (int) (short) 'e', (int) (short) 'f', (int) (short) 'g', (int) (short) 'h', (int) (short) 'i', (int) (short) 'j', (int) (short) 'k', (int) (short) 'l', (int) (short) 'm', (int) (short) 'n', (int) (short) 'o', (int) (short) 'p', (int) (short) 'q', (int) (short) 'r');Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 60.8K bytes - Click Count (0) -
src/main/resources/fess_label_en.properties
labels.chat_error_timeout=The request timed out. Please try again. labels.chat_error_context_length_exceeded=The message is too long to process. Please shorten it and try again. labels.chat_error_model_not_found=The AI model was not found. Please contact the administrator. labels.chat_error_invalid_response=Received an invalid response from the AI service. Please try again.
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Mar 28 11:54:13 GMT 2026 - 48.9K bytes - Click Count (0) -
src/main/webapp/js/admin/plugins/daterangepicker/daterangepicker.js
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Oct 26 01:49:09 GMT 2024 - 64.8K bytes - Click Count (0) -
src/main/resources/fess_label.properties
labels.chat_error_timeout=The request timed out. Please try again. labels.chat_error_context_length_exceeded=The message is too long to process. Please shorten it and try again. labels.chat_error_model_not_found=The AI model was not found. Please contact the administrator. labels.chat_error_invalid_response=Received an invalid response from the AI service. Please try again.
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Mar 28 11:54:13 GMT 2026 - 48.9K bytes - Click Count (0) -
src/test/java/jcifs/smb/SmbFileIntegrationTest.java
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 30 05:58:03 GMT 2025 - 56K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/Iterators.java
MergingIterator( Iterable<? extends Iterator<? extends T>> iterators, Comparator<? super T> itemComparator) { // A comparator that's used by the heap, allowing the heap // to be sorted based on the top of each iterator, with insertion order as tiebreaker Comparator<IndexedIterator<T>> heapComparator = (o1, o2) -> ComparisonChain.start()Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Sep 16 12:42:11 GMT 2025 - 51.4K bytes - Click Count (0) -
guava/src/com/google/common/collect/Iterators.java
MergingIterator( Iterable<? extends Iterator<? extends T>> iterators, Comparator<? super T> itemComparator) { // A comparator that's used by the heap, allowing the heap // to be sorted based on the top of each iterator, with insertion order as tiebreaker Comparator<IndexedIterator<T>> heapComparator = (o1, o2) -> ComparisonChain.start()Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Sep 16 12:42:11 GMT 2025 - 51.4K bytes - Click Count (0)