- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 194 for toves (0.09 sec)
-
src/cmd/compile/internal/ssa/_gen/MIPS.rules
(Store {t} ptr val mem) && t.Size() == 4 && t.IsFloat() => (MOVFstore ptr val mem) (Store {t} ptr val mem) && t.Size() == 8 && t.IsFloat() => (MOVDstore ptr val mem) // float <=> int register moves, with no conversion. // These come up when compiling math.{Float32bits, Float32frombits}. (MOVWload [off] {sym} ptr (MOVFstore [off] {sym} ptr val _)) => (MOVWfpgp val)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 24 14:43:03 UTC 2023 - 35.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/S390X.rules
(Store {t} ptr val mem) && t.Size() == 4 && !t.IsFloat() => (MOVWstore ptr val mem) (Store {t} ptr val mem) && t.Size() == 2 => (MOVHstore ptr val mem) (Store {t} ptr val mem) && t.Size() == 1 => (MOVBstore ptr val mem) // Lowering moves // Load and store for small copies. (Move [0] _ _ mem) => mem (Move [1] dst src mem) => (MOVBstore dst (MOVBZload src mem) mem) (Move [2] dst src mem) => (MOVHstore dst (MOVHZload src mem) mem)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 12 18:09:26 UTC 2023 - 74.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashSet.java
if (index == -1) { return false; } moveLastEntry(index, mask); size--; incrementModCount(); return true; } /** * Moves the last entry in the entry array into {@code dstIndex}, and nulls out its old position. */ void moveLastEntry(int dstIndex, int mask) { Object table = requireTable(); int[] entries = requireEntries();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 24K bytes - Viewed (0) -
src/sort/gen_sort_variants.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:27 UTC 2023 - 19.6K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/mod/sumdb/client.go
// with a detailed security error message and then // (only if c.ops.SecurityError does not exit the program) returns ErrSecurity. // If the Client's current latest tree head moves forward, // mergeLatest updates the underlying configuration file as well, // taking care to merge any independent updates to that configuration. func (c *Client) mergeLatest(msg []byte) error {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 08 17:50:49 UTC 2024 - 19.1K bytes - Viewed (0) -
src/image/color/palette/palette.go
// subcubes with 4 samples plus black) and a reasonable selection of colors // covering the rest of the color cube. The advantage is better representation // of continuous tones. // // This palette was used in the Plan 9 Operating System, described at // https://9p.io/magic/man2html/6/color var Plan9 = []color.Color{ color.RGBA{0x00, 0x00, 0x00, 0xff}, color.RGBA{0x00, 0x00, 0x44, 0xff},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:45 UTC 2023 - 18.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/internal/passes/tpu_sharding_identification_pass.cc
sharding = kReplicateSharding; } else { // Otherwise, default to maximal sharding core 0. sharding = logical_device_vec[0]; } } } } // Moves shardings from `optional_shardings` to `shardings`. absl::Status MoveSharding(OptionalOpShardingVector& optional_shardings, OpShardingVector& shardings) { shardings.clear();
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Apr 30 02:01:13 UTC 2024 - 28.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/MIPS64.rules
(Zero [s] {t} ptr mem) && (s > 8*128 || config.noDuffDevice) || t.Alignment()%8 != 0 => (LoweredZero [t.Alignment()] ptr (ADDVconst <ptr.Type> ptr [s-moveSize(t.Alignment(), config)]) mem) // moves (Move [0] _ _ mem) => mem (Move [1] dst src mem) => (MOVBstore dst (MOVBload src mem) mem) (Move [2] {t} dst src mem) && t.Alignment()%2 == 0 => (MOVHstore dst (MOVHload src mem) mem) (Move [2] dst src mem) =>
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jul 31 03:59:48 UTC 2023 - 41.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashSet.java
if (index == -1) { return false; } moveLastEntry(index, mask); size--; incrementModCount(); return true; } /** * Moves the last entry in the entry array into {@code dstIndex}, and nulls out its old position. */ void moveLastEntry(int dstIndex, int mask) { Object table = requireTable(); int[] entries = requireEntries();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 24.9K bytes - Viewed (0) -
src/main/resources/fess_indices/_aws/fess.json
}, "catalan_keywords": {
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Tue Mar 23 12:38:28 UTC 2021 - 117.3K bytes - Viewed (0)