- Sort Score
- Result 10 results
- Languages All
Results 281 - 290 of 3,480 for tree (0.07 sec)
-
src/test/java/jcifs/tests/FileOperationsTest.java
f.createNewFile(); boolean renamed = false; try { f.renameTo(tgt, true); Assert.assertFalse("Should not be able to rename between trees", true); } catch ( SmbUnsupportedOperationException e ) { try ( SmbTreeHandle th = defaultShareRoot.getTreeHandle() ) {
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Thu Jan 05 13:17:59 UTC 2023 - 16.3K bytes - Viewed (0) -
fess-crawler/src/main/resources/org/codelibs/fess/crawler/mime/tika-mimetypes.xml
<match value="0x0006" type="little32" offset="16"/> </match> </magic> <sub-class-of type="application/x-berkeley-db;format=btree"/> </mime-type> <mime-type type="application/x-berkeley-db;format=btree;version=3"> <_comment>Berkeley DB Version 3 BTree Database</_comment> <magic priority="60"> <match value="0x00053162" type="host32" offset="12">
Registered: Sun Nov 10 03:50:12 UTC 2024 - Last Modified: Thu Sep 21 06:46:43 UTC 2023 - 298.5K bytes - Viewed (0) -
src/main/java/jcifs/netbios/NbtAddress.java
/* jcifs smb client library in Java * Copyright (C) 2000 "Michael B. Allen" <jcifs at samba dot org> * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful,
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Sun Jul 01 13:12:10 UTC 2018 - 15.2K bytes - Viewed (0) -
misc/cgo/gmp/gmp.go
} p := C.CString(s) defer C.free(unsafe.Pointer(p)) if C.mpz_set_str(&z.i[0], p, C.int(base)) < 0 { return os.ErrInvalid } return nil } // String returns the decimal representation of z. func (z *Int) String() string { if z == nil { return "nil" } z.doinit() p := C.mpz_get_str(nil, 10, &z.i[0]) s := C.GoString(p) C.free(unsafe.Pointer(p)) return s }
Registered: Tue Nov 05 11:13:11 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 9.5K bytes - Viewed (0) -
internal/s3select/message.go
if !writer.flushRecords() { quitFlag = true break } } } bufPool.Put(payload) } case <-recordStagingTicker.C: if !writer.flushRecords() { quitFlag = true } case <-keepAliveTicker.C: if !writer.write(continuationMessage) { quitFlag = true } case <-progressTickerC:
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Aug 30 15:26:43 UTC 2022 - 15.2K bytes - Viewed (0) -
internal/dsync/dsync_test.go
benchmarkMutex(b, false, false) } func BenchmarkMutexSlack(b *testing.B) { benchmarkMutex(b, true, false) } func BenchmarkMutexWork(b *testing.B) { benchmarkMutex(b, false, true) } func BenchmarkMutexWorkSlack(b *testing.B) { benchmarkMutex(b, true, true) } func BenchmarkMutexNoSpin(b *testing.B) { b.ResetTimer() b.ReportAllocs()
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Wed Jun 19 14:35:19 UTC 2024 - 11.1K bytes - Viewed (0) -
guava/src/com/google/common/base/Utf8.java
return isWellFormedSlowPath(bytes, i, end); } } return true; } private static boolean isWellFormedSlowPath(byte[] bytes, int off, int end) { int index = off; while (true) { int byte1; // Optimize for interior runs of ASCII bytes. do { if (index >= end) { return true; } } while ((byte1 = bytes[index++]) >= 0);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 17 13:00:28 UTC 2024 - 7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
for (int i = 0; i < 8; i++) { limiter.acquire(); // // #1 } stopwatch.sleepMillis(4500); // #2: back to cold state (warmup period + repay last acquire) for (int i = 0; i < 3; i++) { // only three steps, we're somewhere in the warmup period limiter.acquire(); // #3 } limiter.setRate(4.0); // double the rate! limiter.acquire(); // #4, we repay the debt of the last acquire (imposed by the old rate)
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Oct 21 14:28:19 UTC 2024 - 21.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
for (int i = 0; i < 8; i++) { limiter.acquire(); // // #1 } stopwatch.sleepMillis(4500); // #2: back to cold state (warmup period + repay last acquire) for (int i = 0; i < 3; i++) { // only three steps, we're somewhere in the warmup period limiter.acquire(); // #3 } limiter.setRate(4.0); // double the rate! limiter.acquire(); // #4, we repay the debt of the last acquire (imposed by the old rate)
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Oct 21 14:28:19 UTC 2024 - 21.8K bytes - Viewed (0) -
LICENSE
a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. In other cases, permission to use a particular library in non-free
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Mon Jan 18 20:25:38 UTC 2016 - 25.8K bytes - Viewed (0)