Searched refs:swaps (Results 1 - 8 of 8) sorted by relevance
| /third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/ |
| H A D | test_instance_tracker_test.cc | 34 EXPECT_EQ(0, tracker.swaps()); in TEST()
45 EXPECT_EQ(0, tracker.swaps()); in TEST()
54 EXPECT_EQ(2, tracker.swaps()); in TEST()
88 EXPECT_EQ(2, tracker.swaps()); in TEST()
114 EXPECT_EQ(2, tracker.swaps()); in TEST()
|
| H A D | test_instance_tracker.h | 28 // the type, as well as the number of copies, moves, swaps, and comparisons that
120 // Implementation of efficient swap() that counts swaps.
195 // Returns the number of swaps on BaseCountedInstance objects since
197 int swaps() const { return BaseCountedInstance::num_swaps_ - start_swaps_; } in swaps() function in absl::test_internal::InstanceTracker
205 // Resets the base values for moves, copies, comparisons, and swaps to the
207 // comparisons, and swaps will compare to the situation at the point of this
|
| /third_party/rust/crates/aho-corasick/src/ |
| H A D | dfa.rs | 530 let mut swaps: Vec<S> = vec![fail_id(); self.state_count]; in shuffle_match_states() variables
538 swaps[cur] = S::from_usize(first_non_match); in shuffle_match_states()
539 swaps[first_non_match] = S::from_usize(cur); in shuffle_match_states()
554 if swaps[next.to_usize()] != fail_id() { in shuffle_match_states()
555 *next = swaps[next.to_usize()]; in shuffle_match_states()
559 if swaps[self.start_id.to_usize()] != fail_id() { in shuffle_match_states()
560 self.start_id = swaps[self.start_id.to_usize()]; in shuffle_match_states()
|
| /third_party/python/Lib/test/ |
| H A D | test_peepholer.py | 639 swaps = {"*_, b, c", "a, *_, c", "a, b, *_"}
646 if pattern in swaps:
647 # If this fails... great! Remove this pattern from swaps
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/container/ |
| H A D | inlined_vector_test.cc | 890 EXPECT_EQ(tracker.swaps(), 0); // Allocations are swapped. in TYPED_TEST_P()
893 EXPECT_EQ(tracker.swaps(), min_len); in TYPED_TEST_P()
899 EXPECT_EQ(tracker.swaps(), 0); in TYPED_TEST_P()
1109 EXPECT_EQ(tracker.swaps(), 0); in TYPED_TEST_P()
1198 EXPECT_EQ(tracker.swaps(), 0); in TYPED_TEST_P()
|
| H A D | btree_test.cc | 1067 // Verify that swapping btrees swaps the key comparison functors and that we can
1425 EXPECT_EQ(tracker.swaps(), 0); in TEST()
1452 EXPECT_EQ(tracker->swaps(), 0); in ExpectOperationCounts()
|
| /third_party/node/deps/ada/ |
| H A D | ada.cpp | 11513 // Let swaps be pieceIndex - compress.
11514 int swaps = piece_index - *compress;
11519 // While pieceIndex is not 0 and swaps is greater than 0,
11520 // swap address[pieceIndex] with address[compress + swaps - 1], and then
11521 // decrease both pieceIndex and swaps by 1.
11522 while (piece_index != 0 && swaps > 0) {
11523 std::swap(address[piece_index], address[*compress + swaps - 1]);
11525 swaps--;
14322 // Let swaps be pieceIndex - compress.
14323 int swaps
[all...] |
| /third_party/ffmpeg/libavutil/x86/ |
| H A D | x86inc.asm | 1060 %macro SWAP 2+ ; swaps a single chain (sometimes more concise than pairs)
|
Completed in 34 milliseconds