- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 108 for shuffled (0.13 sec)
-
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
.inOrder(); } /** * Populates the graph with nodes and edges in a star shape with node `1` in the middle. * * <p>Note that the edges are added in a shuffled order to properly test the effect of the * insertion order. */ private void populateTShapedGraph() { putEdge(2, 1); putEdge(1, 4); putEdge(1, 3); putEdge(1, 2); // Duplicate
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 12.9K bytes - Viewed (0) -
src/compress/bzip2/bzip2.go
// first pass over the data. It's an argument here because we merge the first // pass with the Huffman decoding. // // This also implements the “single array” method from the bzip2 source code // which leaves the output, still shuffled, in the bottom 8 bits of tt with the // index of the next byte in the top 24-bits. The index of the first byte is // returned. func inverseBWT(tt []uint32, origPtr uint, c []uint) uint32 { sum := uint(0)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 13:32:40 UTC 2024 - 13K bytes - Viewed (0) -
src/cmd/internal/obj/sym.go
// symbols reliably. Sort by name but use a stable sort, so that // any original entries with the same name (all DWARFVAR symbols // have empty names but different relocation sets) are not shuffled. // TODO: Find a better place and optimize to only sort TOC symbols. sort.SliceStable(ctxt.Data, func(i, j int) bool { return ctxt.Data[i].Name < ctxt.Data[j].Name }) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 14:41:10 UTC 2024 - 14.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/transforms/legalize_tf.cc
return no_op(); // For vectors, shuffle values by sorting instead of the obvious // Fisher-Yates algorithm. Fisher-Yates is simple to implement and correct, // but not easily parallelizable. For a sufficiently parallel architecture, // it is faster to sort many times, than Fisher-Yates shuffle once. if (input_rank == 1) { // Shuffle values by assigning each value a random key and sorting the
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 11 20:00:43 UTC 2024 - 291.8K bytes - Viewed (0) -
platforms/native/platform-native/src/testFixtures/groovy/org/gradle/nativeplatform/fixtures/app/CppAppWithLibrariesWithApiDependencies.groovy
#define EXPORT_FUNC #endif class EXPORT_FUNC Deck { Card card; public: void shuffle(); Card& draw(); }; """)) final SourceFileElement source = ofFile(new SourceFile("cpp", "deck.cpp", """ #include "deck.h" #include "shuffle.h" void Deck::shuffle() { ShuffleAlgorithm shuffler; shuffler.shuffle(); } Card& Deck::draw() { return card; } """)) }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Nov 16 20:20:03 UTC 2023 - 3K bytes - Viewed (0) -
testing/performance/src/templates/native-dependents-resources/googleTest/libs/googleTest/1.7.0/include/gtest/gtest.h
static bool ShouldRunTest(const TestInfo* test_info) { return test_info->should_run(); } // Shuffles the tests in this test case. void ShuffleTests(internal::Random* random); // Restores the test order to before the first shuffle. void UnshuffleTests(); // Name of the test case. std::string name_; // Name of the parameter type, or NULL if this is not a typed or a
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 04 07:21:38 UTC 2024 - 86.4K bytes - Viewed (0) -
platforms/documentation/docs/src/snippets/native-binaries/google-test/groovy/libs/googleTest/1.7.0/include/gtest/gtest.h
static bool ShouldRunTest(const TestInfo* test_info) { return test_info->should_run(); } // Shuffles the tests in this test case. void ShuffleTests(internal::Random* random); // Restores the test order to before the first shuffle. void UnshuffleTests(); // Name of the test case. std::string name_; // Name of the parameter type, or NULL if this is not a typed or a
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - 86.4K bytes - Viewed (0) -
src/testing/fstest/testfs_test.go
t.Fatal(err) } } func TestDash(t *testing.T) { m := MapFS{ "a-b/a": {Data: []byte("a-b/a")}, } if err := TestFS(m, "a-b/a"); err != nil { t.Error(err) } } type shuffledFS MapFS func (fsys shuffledFS) Open(name string) (fs.File, error) { f, err := MapFS(fsys).Open(name) if err != nil { return nil, err } return &shuffledFile{File: f}, nil } type shuffledFile struct{ fs.File }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 2.9K bytes - Viewed (0) -
src/crypto/sha1/sha1block_386.s
MIX(a, b, c, d, e, 0x5A827999) #define ROUND1x(a, b, c, d, e, index) \ SHUFFLE(index, e); \ FUNC1(a, b, c, d, e); \ MIX(a, b, c, d, e, 0x5A827999) #define ROUND2(a, b, c, d, e, index) \ SHUFFLE(index, e); \ FUNC2(a, b, c, d, e); \ MIX(a, b, c, d, e, 0x6ED9EBA1) #define ROUND3(a, b, c, d, e, index) \ SHUFFLE(index, e); \ FUNC3(a, b, c, d, e); \ MIX(a, b, c, d, e, 0x8F1BBCDC)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 6K bytes - Viewed (0) -
src/crypto/sha1/sha1block_arm.s
MIX(Ra, Rb, Rc, Rd, Re) #define ROUND1x(Ra, Rb, Rc, Rd, Re) \ SHUFFLE(Re) ; \ FUNC1(Ra, Rb, Rc, Rd, Re) ; \ MIX(Ra, Rb, Rc, Rd, Re) #define ROUND2(Ra, Rb, Rc, Rd, Re) \ SHUFFLE(Re) ; \ FUNC2(Ra, Rb, Rc, Rd, Re) ; \ MIX(Ra, Rb, Rc, Rd, Re) #define ROUND3(Ra, Rb, Rc, Rd, Re) \ SHUFFLE(Re) ; \ FUNC3(Ra, Rb, Rc, Rd, Re) ; \ MIX(Ra, Rb, Rc, Rd, Re)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 5.6K bytes - Viewed (0)