- Sort Score
- Num 10 results
- Language All
Results 151 - 160 of 279 for Inline1 (0.05 seconds)
-
ci/official/containers/ml_build/builder.devtoolset/build_devtoolset.sh
ln -s "/usr/local/include/${v}" "/${TARGET}/usr/include/x86_64-linux-gnu/${v}" done # Patch glibc to be compatable with modern clang case "${VERSION}" in devtoolset-9) cd / patch -p0 < /glibc2.17-inline.patch ;;Created: Tue Dec 30 12:39:10 GMT 2025 - Last Modified: Tue Sep 24 20:45:58 GMT 2024 - 8K bytes - Click Count (0) -
cmd/erasure-heal_test.go
"testing" ) var erasureHealTests = []struct { dataBlocks, disks int // number of offline disks is also number of staleDisks for // erasure reconstruction in this test offDisks int // bad disks are online disks which return errors badDisks, badStaleDisks int blocksize, size int64 algorithm BitrotAlgorithm shouldFail bool }{
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 7.9K bytes - Click Count (0) -
src/main/java/jcifs/ACE.java
* is a basic description of the algorithm. For a more complete description * we recommend reading the section on Access Control in Keith Brown's * "The .NET Developer's Guide to Windows Security" (which is also * available online). * <p> * Direct ACEs are evaluated first in order. The SID of the user performing * the operation and the desired access bits are compared to the SID * and access mask of each ACE. If the SID matches, the allow/deny flags
Created: Sat Dec 20 13:44:44 GMT 2025 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 7.1K bytes - Click Count (0) -
cmd/bootstrap-peer-server.go
retries++ // after 20 retries start logging that servers are not reachable yet if retries >= 20 { logger.Info(fmt.Sprintf("Waiting for at least %d remote servers with valid configuration to be online", len(clnts)/2)) if len(offlineEndpoints) > 0 { logger.Info(fmt.Sprintf("Following servers are currently offline or unreachable %s", offlineEndpoints)) } if len(incorrectConfigs) > 0 {
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Tue Oct 01 22:13:18 GMT 2024 - 8.4K bytes - Click Count (0) -
futures/listenablefuture1/src/com/google/common/util/concurrent/ListenableFuture.java
* logged. * * <p>Note: If your listener is lightweight -- and will not cause stack overflow by completing * more futures or adding more {@code directExecutor()} listeners inline -- consider {@link * MoreExecutors#directExecutor}. Otherwise, avoid it: See the warnings on the docs for {@code * directExecutor}. *Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 8K bytes - Click Count (0) -
guava/src/com/google/common/util/concurrent/ListenableFuture.java
* logged. * * <p>Note: If your listener is lightweight -- and will not cause stack overflow by completing * more futures or adding more {@code directExecutor()} listeners inline -- consider {@link * MoreExecutors#directExecutor}. Otherwise, avoid it: See the warnings on the docs for {@code * directExecutor}. *Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 8K bytes - Click Count (0) -
api/maven-api-toolchain/src/main/mdo/toolchains.mdo
</description> </field> <field> <name>provides</name> <version>1.1.0+</version> <type>Properties</type> <association xml.mapStyle="inline"> <type>String</type> <multiplicity>*</multiplicity> </association> <!-- <identifier>true</identifier> --> <description>Created: Sun Dec 28 03:35:09 GMT 2025 - Last Modified: Sun May 18 09:15:56 GMT 2025 - 9.5K bytes - Click Count (0) -
src/main/java/jcifs/smb1/smb1/ACE.java
* is a basic description of the algorithm. For a more complete description * we recommend reading the section on Access Control in Keith Brown's * "The .NET Developer's Guide to Windows Security" (which is also * available online). * <p> * Direct ACEs are evaluated first in order. The SID of the user performing * the operation and the desired access bits are compared to the SID * and access mask of each ACE. If the SID matches, the allow/deny flags
Created: Sat Dec 20 13:44:44 GMT 2025 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 8.8K bytes - Click Count (0) -
callbacks/query.go
for idx, dbName := range stmt.Schema.DBNames { clauseSelect.Columns[idx] = clause.Column{Table: db.Statement.Table, Name: dbName} } } } } // inline joins fromClause := clause.From{} if v, ok := db.Statement.Clauses["FROM"].Expression.(clause.From); ok { fromClause = v } if len(db.Statement.Joins) != 0 || len(fromClause.Joins) != 0 {Created: Sun Dec 28 09:35:17 GMT 2025 - Last Modified: Sun May 25 07:40:40 GMT 2025 - 10.4K bytes - Click Count (3) -
docs/metrics/prometheus/grafana/node/minio-node.json
"hide": false, "instant": true, "legendFormat": ".", "range": false, "refId": "B" } ], "title": "Total Online/Offline Drives", "type": "gauge" }, { "datasource": { "type": "prometheus", "uid": "${DS_PROMETHEUS}" }, "description": "", "fieldConfig": {
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Mon Aug 04 01:46:49 GMT 2025 - 22.5K bytes - Click Count (0)