- Sort Score
- Result 10 results
- Languages All
Results 201 - 210 of 349 for Healing (0.1 sec)
-
src/main/java/jcifs/internal/smb2/lease/DirectoryChangeNotifier.java
import org.slf4j.Logger; import org.slf4j.LoggerFactory; import jcifs.internal.util.SMBUtil; import jcifs.smb.SmbFile; /** * Handles directory change notifications for SMB3 directory leasing */ public class DirectoryChangeNotifier { private static final Logger log = LoggerFactory.getLogger(DirectoryChangeNotifier.class); // Backoff and timing constants (in ms)
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 30 05:58:03 UTC 2025 - 13.7K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/DoubleMathRoundingBenchmark.java
private static final double[] doubleInLongRange = new double[ARRAY_SIZE]; private static final double[] positiveDoubles = new double[ARRAY_SIZE]; @Param({"DOWN", "UP", "FLOOR", "CEILING", "HALF_EVEN", "HALF_UP", "HALF_DOWN"}) RoundingMode mode; @BeforeExperiment void setUp() { for (int i = 0; i < ARRAY_SIZE; i++) { doubleInIntRange[i] = randomDouble(Integer.SIZE - 2);
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 2.7K bytes - Viewed (0) -
src/bootstrap.bash
# license that can be found in the LICENSE file. # When run as (for example) # # GOOS=linux GOARCH=ppc64 bootstrap.bash # # this script cross-compiles a toolchain for that GOOS/GOARCH # combination, leaving the resulting tree in ../../go-${GOOS}-${GOARCH}-bootstrap. # That tree can be copied to a machine of the given target type # and used as $GOROOT_BOOTSTRAP to bootstrap a local build. #
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Fri Jan 20 17:52:26 UTC 2023 - 2.3K bytes - Viewed (0) -
src/archive/tar/reader.go
// ensure that this error is sticky. err error } type fileReader interface { io.Reader fileState WriteTo(io.Writer) (int64, error) } // NewReader creates a new [Reader] reading from r. func NewReader(r io.Reader) *Reader { return &Reader{r: r, curr: ®FileReader{r, 0}} } // Next advances to the next entry in the tar archive.
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Fri Mar 08 01:59:14 UTC 2024 - 26.8K bytes - Viewed (0) -
src/main/java/jcifs/SmbConstants.java
*/ int TYPE_COMM = 0x40; /* open flags */ /** * Open for reading only. */ int O_RDONLY = 0x01; /** * Open for writing only. */ int O_WRONLY = 0x02; /** * Open for reading and writing. */ int O_RDWR = 0x03; /** * Open in append mode. */ int O_APPEND = 0x04;
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sun Aug 24 00:49:49 UTC 2025 - 12.8K bytes - Viewed (0) -
gradlew
# Attempt to set APP_HOME # Resolve links: $0 may be a link app_path=$0 # Need this for daisy-chained symlinks. while APP_HOME=${app_path%"${app_path##*/}"} # leaves a trailing /; empty if no leading path [ -h "$app_path" ] do ls=$( ls -ld "$app_path" ) link=${ls#*' -> '} case $link in #( /*) app_path=$link ;; #( *) app_path=$APP_HOME$link ;; esac done
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Fri Aug 01 08:06:31 UTC 2025 - 8.5K bytes - Viewed (0) -
docs/debugging/xattr/main.go
if err := setxattr(path, name, value); err != nil { log.Fatalln(fmt.Errorf("setting attribute %s failed with: %v", name, err)) } } else { if name == "" { log.Fatalln("you must specify an attribute name for reading") } var names []string if name == "." { attrs, err := listxattr(path) if err != nil { log.Fatalln(fmt.Errorf("listing attributes failed with: %v", err)) } names = append(names, attrs...)
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Dec 29 23:52:41 UTC 2023 - 3.2K bytes - Viewed (0) -
docs/security/README.md
#### Figure 2 - KMS key hierarchy ``` CMK (master key)
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Wed Feb 26 09:25:50 UTC 2025 - 13.8K bytes - Viewed (0) -
src/test/java/jcifs/internal/smb2/ioctl/ValidateNegotiateInfoResponseTest.java
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 10.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/TopKSelector.java
// The leftmost position at which the greatest of the k lower elements // -- the new value of threshold -- might be found. int iterations = 0; int maxIterations = IntMath.log2(right - left, RoundingMode.CEILING) * 3; while (left < right) { int pivotIndex = (left + right + 1) >>> 1; int pivotNewIndex = partition(left, right, pivotIndex); if (pivotNewIndex > k) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Aug 31 13:15:26 UTC 2025 - 11.4K bytes - Viewed (0)