- Sort Score
- Result 10 results
- Languages All
Results 121 - 130 of 1,428 for Tree (0.02 sec)
-
src/main/java/jcifs/smb/NetServerEnumIterator.java
/* * © 2017 AgNO3 Gmbh & Co. KG * * 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, * but WITHOUT ANY WARRANTY; without even the implied warranty of
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 6.5K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/collect/BinaryTreeTraverserBenchmark.java
root = Optional.of(new BinaryNode(rng.nextInt(), Optional.<BinaryNode>absent(), root)); } return root; } }, RANDOM { /** * Generates a tree with topology selected uniformly at random from the topologies of binary * trees of the specified size. */ @Override Optional<BinaryNode> createTree(int size, Random rng) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 4.9K bytes - Viewed (0) -
src/main/java/jcifs/smb/SmbFileDirectoryLeasingExtension.java
/* * © 2025 CodeLibs, Inc. * * 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, * but WITHOUT ANY WARRANTY; without even the implied warranty of
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 23 02:21:31 UTC 2025 - 7.1K bytes - Viewed (0) -
README.md
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Jul 10 06:34:32 UTC 2025 - 7.2K bytes - Viewed (2) -
api/maven-api-core/src/main/java/org/apache/maven/api/Lifecycle.java
/** * A phase in the lifecycle. * * A phase is identified by its name. It also contains a list of plugins bound to that phase, * a list of {@link Link links}, and a list of sub-phases. This forms a tree of phases. */ interface Phase { // ====================== // Maven defined phases // ====================== String ALL = "all"; String EACH = "each";
Registered: Sun Sep 07 03:35:12 UTC 2025 - Last Modified: Fri Jun 06 14:28:57 UTC 2025 - 7.9K bytes - Viewed (0) -
README.md
[the Android flavor](https://github.com/google/guava/wiki/Android). You can find the Android Guava source in the [`android` directory]. [`android` directory]: https://github.com/google/guava/tree/master/android ## Adding Guava to your build Guava's Maven group ID is `com.google.guava`, and its artifact ID is `guava`. Guava provides two different "flavors": one for use on a (Java 8+) JRE and one
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Aug 05 15:30:14 UTC 2025 - 6.2K bytes - Viewed (0) -
docs/smb3-features/06-witness-protocol-design.md
if (witnessClient != null) { witnessClient.close(); } super.logoff(); } ``` ### 5.2 Tree Connection Integration ```java // In SmbTree.java public void connectWithWitnessSupport() throws IOException { // Perform normal tree connection super.connect(); // Register for witness notifications for this share if (session.isWitnessEnabled()) {
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 16 02:53:50 UTC 2025 - 42K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/app/web/admin/general/EditForm.java
*/ @Size(max = 1000) public String ldapAdminSecurityCredentials; /** * LDAP base DN (Distinguished Name) for user searches. * Defines the root of the LDAP directory tree for user lookups. */ @Size(max = 1000) public String ldapBaseDn; /** * LDAP filter for finding user accounts. * Defines the search filter used to locate user accounts in LDAP.
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Jul 17 08:28:31 UTC 2025 - 9.9K bytes - Viewed (0) -
docs/erasure/README.md
By default, MinIO shards the objects across N/2 data and N/2 parity drives. Though, you can use [storage classes](https://github.com/minio/minio/tree/master/docs/erasure/storage-class) to use a custom configuration. We recommend N/2 data and parity blocks, as it ensures the best protection from drive failures.
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 4.2K bytes - Viewed (0) -
cmd/main.go
// Copyright (c) 2015-2021 MinIO, Inc. // // This file is part of MinIO Object Storage stack // // This program is free software: you can redistribute it and/or modify // it under the terms of the GNU Affero General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // // This program is distributed in the hope that it will be useful
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Jul 30 22:59:48 UTC 2024 - 6.5K bytes - Viewed (0)