- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 86 for Optimize (0.18 sec)
-
okhttp-idna-mapping-table/src/main/kotlin/okhttp3/internal/idn/SimpleIdnaMappingTable.kt
import okio.ByteString import okio.ByteString.Companion.encodeUtf8 import okio.Options /** * A decoded [mapping table] that can perform the [mapping step] of IDNA processing. * * This implementation is optimized for readability over efficiency. * * This implements non-transitional processing by preserving deviation characters. * * This implementation's STD3 rules are configured to `UseSTD3ASCIIRules=false`. This is
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 6.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardNetwork.java
this.allowsSelfLoops = builder.allowsSelfLoops; this.nodeOrder = builder.nodeOrder.cast(); this.edgeOrder = builder.edgeOrder.cast(); // Prefer the heavier "MapRetrievalCache" for nodes if lookup is expensive. This optimizes // methods that access the same node(s) repeatedly, such as Graphs.removeEdgesConnecting(). this.nodeConnections = (nodeConnections instanceof TreeMap)
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 6.9K bytes - Viewed (0) -
docs/compression/README.md
MinIO uses [`klauspost/compress/s2`](https://github.com/klauspost/compress/tree/master/s2) streaming compression due to its stability and performance. This algorithm is specifically optimized for machine generated content. Write throughput is typically at least 500MB/s per CPU core, and scales with the number of available CPU cores. Decompression speed is typically at least 1GB/s.
Plain Text - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Mon Mar 11 11:55:34 GMT 2024 - 5.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/DenseImmutableTable.java
import com.google.j2objc.annotations.WeakOuter; import java.util.Map; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** A {@code RegularImmutableTable} optimized for dense data. */ @GwtCompatible @Immutable(containerOf = {"R", "C", "V"}) @ElementTypesAreNonnullByDefault final class DenseImmutableTable<R, C, V> extends RegularImmutableTable<R, C, V> {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Nov 30 21:54:06 GMT 2023 - 10K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
} @Override public Set<EndpointPair<N>> edges() { if (allowsParallelEdges()) { return super.edges(); // Defer to AbstractGraph implementation. } // Optimized implementation assumes no parallel edges (1:1 edge to EndpointPair mapping). return new AbstractSet<EndpointPair<N>>() { @Override public Iterator<EndpointPair<N>> iterator() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Mar 13 18:17:09 GMT 2024 - 10.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/UnsignedLongsTest.java
assertThat(UnsignedLongs.remainder(0xfffffffffffffffeL, 2)).isEqualTo(0); assertThat(UnsignedLongs.remainder(0xfffffffffffffffeL, 5)).isEqualTo(4); } @GwtIncompatible // Too slow in GWT (~3min fully optimized) public void testDivideRemainderEuclideanProperty() { // Use a seed so that the test is deterministic: Random r = new Random(0L); for (int i = 0; i < 1000000; i++) { long dividend = r.nextLong();
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Fri Feb 09 15:36:17 GMT 2024 - 13.2K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/idn/IdnaMappingTable.kt
* See the License for the specific language governing permissions and * limitations under the License. */ package okhttp3.internal.idn import okio.BufferedSink /** * An IDNA mapping table optimized for small code and data size. * * Code Points in Sections * ======================= * * The full range of code points is 0..0x10fffe. We can represent any of these code points with 21 * bits. *
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Tue Apr 02 11:39:58 GMT 2024 - 9K bytes - Viewed (0) -
architecture/networking/pilot.md
#### Endpoints Endpoints have an optimized code path, as they are by far the most frequently updated resource - in a steady cluster, this will often be the *only* change, caused by scale up/down.
Plain Text - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Wed Feb 07 17:53:24 GMT 2024 - 19.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/DenseImmutableTable.java
import com.google.j2objc.annotations.WeakOuter; import java.util.Map; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** A {@code RegularImmutableTable} optimized for dense data. */ @GwtCompatible @Immutable(containerOf = {"R", "C", "V"}) @ElementTypesAreNonnullByDefault final class DenseImmutableTable<R, C, V> extends RegularImmutableTable<R, C, V> {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Nov 30 21:54:06 GMT 2023 - 10K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/primitives/UnsignedLongsTest.java
assertThat(UnsignedLongs.remainder(0xfffffffffffffffeL, 2)).isEqualTo(0); assertThat(UnsignedLongs.remainder(0xfffffffffffffffeL, 5)).isEqualTo(4); } @GwtIncompatible // Too slow in GWT (~3min fully optimized) public void testDivideRemainderEuclideanProperty() { // Use a seed so that the test is deterministic: Random r = new Random(0L); for (int i = 0; i < 1000000; i++) { long dividend = r.nextLong();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 09 15:36:17 GMT 2024 - 13.2K bytes - Viewed (0)