- Sort Score
- Result 10 results
- Languages All
Results 571 - 580 of 1,143 for append (0.04 sec)
-
src/test/java/jcifs/internal/dfs/DfsReferralRequestBufferTest.java
void testSizeWithVeryLongPath() { StringBuilder pathBuilder = new StringBuilder("\\\\server\\share"); for (int i = 0; i < 100; i++) { pathBuilder.append("\\segment").append(i); } String path = pathBuilder.toString(); buffer = new DfsReferralRequestBuffer(path, 3); int expectedSize = 4 + 2 * path.length();
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 17.5K bytes - Viewed (0) -
src/main/java/jcifs/internal/dfs/DfsReferralDataImpl.java
} } @Override public DfsReferralDataImpl next() { return this.next; } /** * Append another referral to this referral chain * * @param dr the referral to append */ @Override public void append(final DfsReferralDataInternal dr) { final DfsReferralDataImpl dri = (DfsReferralDataImpl) dr; dri.next = this.next;Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 11.7K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/app/web/search/SearchAction.java
Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Thu Aug 07 03:06:29 UTC 2025 - 14K bytes - Viewed (0) -
compat/maven-compat/src/test/java/org/apache/maven/artifact/AbstractArtifactComponentTestCase.java
private static String printHexBinary(byte[] data) { StringBuilder r = new StringBuilder(data.length * 2); for (byte b : data) { r.append(HEX_CODE[(b >> 4) & 0xF]); r.append(HEX_CODE[(b & 0xF)]); } return r.toString(); }Registered: Sun Dec 28 03:35:09 UTC 2025 - Last Modified: Fri Oct 10 09:40:15 UTC 2025 - 13.8K bytes - Viewed (0) -
src/main/java/org/codelibs/core/text/DecimalFormatUtil.java
Registered: Sat Dec 20 08:55:33 UTC 2025 - Last Modified: Thu Jul 31 08:16:49 UTC 2025 - 2.5K bytes - Viewed (0) -
tests/callbacks_test.go
) func assertCallbacks(v interface{}, fnames []string) (result bool, msg string) { var ( got []string funcs = reflect.ValueOf(v).Elem().FieldByName("fns") ) for i := 0; i < funcs.Len(); i++ { got = append(got, getFuncName(funcs.Index(i))) } return fmt.Sprint(got) == fmt.Sprint(fnames), fmt.Sprintf("expects %v, got %v", fnames, got) } func getFuncName(fc interface{}) string { reflectValue, ok := fc.(reflect.Value)
Registered: Sun Dec 28 09:35:17 UTC 2025 - Last Modified: Tue Mar 26 03:33:36 UTC 2024 - 7.2K bytes - Viewed (0) -
okhttp-idna-mapping-table/src/main/kotlin/okhttp3/internal/idn/GenerateIdnaMappingTableCode.kt
for (codePoint in ******@****.***ints()) { when (codePoint) { in 0..0x20, '"'.code, '$'.code, '\\'.code, 'ยท'.code, 127, -> append(String.format("\\u%04x", codePoint)) else -> appendCodePoint(codePoint) } }
Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Wed Mar 19 19:25:20 UTC 2025 - 2.8K bytes - Viewed (1) -
internal/config/dns/dns_path.go
func msgPath(s, prefix string) string { l := dns.SplitDomainName(s) for i, j := 0, len(l)-1; i < j; i, j = i+1, j-1 { l[i], l[j] = l[j], l[i] } return path.Join(append([]string{etcdPathSeparator + prefix + etcdPathSeparator}, l...)...) } // dnsJoin joins labels to form a fully qualified domain name. If the last label is // the root label it is ignored. Not other syntax checks are performed.
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Thu Aug 28 17:31:12 UTC 2025 - 1.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedInts.java
} // For pre-sizing a builder, just get the right order of magnitude StringBuilder builder = new StringBuilder(array.length * 5); builder.append(toString(array[0])); for (int i = 1; i < array.length; i++) { builder.append(separator).append(toString(array[i])); } return builder.toString(); } /** * Returns a comparator that compares two arrays of unsigned {@code int} values <aRegistered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sun Feb 09 16:22:33 UTC 2025 - 13.8K bytes - Viewed (0) -
src/archive/tar/writer_test.go
for len(sa) > 0 && len(sb) > 0 { if sa[0] == sb[0] { ss = append(ss, identity+sa[0]) } else { ss = append(ss, uniqueA+sa[0]) ss = append(ss, uniqueB+sb[0]) } sa, sb = sa[1:], sb[1:] } for len(sa) > 0 { ss = append(ss, uniqueA+sa[0]) sa = sa[1:] } for len(sb) > 0 { ss = append(ss, uniqueB+sb[0]) sb = sb[1:] } return strings.Join(ss, "\n") }
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Mon Dec 15 16:34:13 UTC 2025 - 40.2K bytes - Viewed (0)