- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 29 for approach (0.17 seconds)
-
architecture/standards/README.md
For now we just have this global repository of ADRs. If we see fit, we can break these out to per-platform ones, or keep a hybrid approach to having global and platform-specific ADSs. Our aim is to keep the process lightweight and approachable.
Created: Wed Apr 01 11:36:16 GMT 2026 - Last Modified: Wed Feb 21 06:30:44 GMT 2024 - 546 bytes - Click Count (0) -
okcurl/build.gradle.kts
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Thu Feb 05 09:17:33 GMT 2026 - 2.4K bytes - Click Count (0) -
docs/kms/IAM.md
Now, MinIO encrypts IAM / configuration and S3 objects with a KMS, if present. This change unified the key-management aspect within MinIO. The unified KMS-based approach has several advantages: - Key management is now centralized. There is one way to change or rotate encryption keys. There used to be two different mechanisms - one for regular S3 objects and one for IAM data.
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Thu Jan 18 07:03:17 GMT 2024 - 5.3K bytes - Click Count (0) -
guava/src/com/google/common/base/CaseFormat.java
this.wordBoundary = wordBoundary; this.wordSeparator = wordSeparator; } /** * Converts the specified {@code String str} from this format to the specified {@code format}. A * "best effort" approach is taken; if {@code str} does not conform to the assumed format, then * the behavior of this method is undefined but we make a reasonable effort at converting anyway. */Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Dec 03 18:46:33 GMT 2025 - 6.5K bytes - Click Count (0) -
internal/handlers/proxy.go
// the 'for=', which we ignore, subsequently we proceed to look for // 'proto=' which should precede right after `for=` if not // we simply ignore the values and return empty. This is in line // with the approach we took for returning first ip from multiple // params. if match := forRegex.FindStringSubmatch(proto); len(match) > 1 { if match = protoRegex.FindStringSubmatch(match[2]); len(match) > 1 {
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Wed Feb 26 19:25:49 GMT 2025 - 5.4K bytes - Click Count (0) -
android/guava-testlib/src/com/google/common/collect/testing/google/BiMapTestSuiteBuilder.java
?, ? extends OneSizeTestContainerGenerator<BiMap<K, V>, Entry<K, V>>> parentBuilder) { List<TestSuite> derived = super.createDerivedSuites(parentBuilder); // TODO(cpovirk): consider using this approach (derived suites instead of extension) in // ListTestSuiteBuilder, etc.? derived.add( MapTestSuiteBuilder.using(new MapGenerator<K, V>(parentBuilder.getSubjectGenerator()))
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Oct 30 16:15:19 GMT 2024 - 6.8K bytes - Click Count (0) -
guava-testlib/src/com/google/common/collect/testing/IteratorTester.java
* variety of sequences of the {@link Iterator#next}, {@link Iterator#hasNext} and {@link * Iterator#remove} operations. This utility takes the brute-force approach of trying <i>all</i> * possible sequences of these operations, up to a given number of steps. So, if the caller * specifies to use <i>n</i> steps, a total of <i>3^n</i> tests are actually performed. *Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Feb 23 19:19:10 GMT 2026 - 4.3K bytes - Click Count (0) -
.github/ISSUE_TEMPLATE/feature_enhancement_request.yaml
real-world use case so the community can discuss and debate whether this feature is actually the *best* way to address the real use case, or whether or not a different approach might be more appropriate. It's okay if you can't provide complete context on a use case. We understand if you are not able to discuss the full details of what you're working on.Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Nov 17 18:47:47 GMT 2023 - 3.9K bytes - Click Count (0) -
android/guava-testlib/src/com/google/common/collect/testing/IteratorTester.java
* variety of sequences of the {@link Iterator#next}, {@link Iterator#hasNext} and {@link * Iterator#remove} operations. This utility takes the brute-force approach of trying <i>all</i> * possible sequences of these operations, up to a given number of steps. So, if the caller * specifies to use <i>n</i> steps, a total of <i>3^n</i> tests are actually performed. *Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Feb 23 19:19:10 GMT 2026 - 4.3K bytes - Click Count (0) -
android/guava-tests/benchmark/com/google/common/io/ByteSourceAsCharSourceReadBenchmark.java
// we called sizeIfKnown and when we started reading the file (or I guess if // maxCharsPerByte is wrong) // Fallback to an incremental approach StringBuilder builder = new StringBuilder(bufIndex + 32); builder.append(buffer, 0, bufIndex); buffer = null; // release for gc CharStreams.copy(reader, builder);
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue May 13 18:46:00 GMT 2025 - 5.2K bytes - Click Count (0)