| /third_party/rust/crates/syn/src/ |
| D | lookahead.rs | 65 comparisons: RefCell<Vec<&'static str>>, field
72 comparisons: RefCell::new(Vec::new()), in new()
84 lookahead.comparisons.borrow_mut().push(display()); in peek_impl()
113 let comparisons = self.comparisons.borrow(); in error() localVariable
114 match comparisons.len() { in error()
123 let message = format!("expected {}", comparisons[0]); in error()
127 let message = format!("expected {} or {}", comparisons[0], comparisons[1]); in error()
131 let join = comparisons.join(", "); in error()
|
| /third_party/rust/crates/syn/codegen/src/ |
| D | eq.rs | 35 let mut comparisons = Vec::new(); in expand_impl_body() localVariable
44 comparisons.push(match field { in expand_impl_body()
56 if comparisons.is_empty() { in expand_impl_body()
57 comparisons.push(quote!(true)); in expand_impl_body()
70 #(#comparisons)&&* in expand_impl_body()
83 let mut comparisons = Vec::new(); in expand_impl_body() localVariable
89 comparisons.push(match ty { in expand_impl_body()
96 if comparisons.is_empty() { in expand_impl_body()
99 quote!(#(#comparisons)&&*) in expand_impl_body()
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/ |
| D | test_instance_tracker_test.cc | 164 EXPECT_EQ(0, tracker.comparisons()); in TEST()
166 EXPECT_EQ(1, tracker.comparisons()); in TEST()
168 EXPECT_EQ(2, tracker.comparisons()); in TEST()
170 EXPECT_EQ(3, tracker.comparisons()); in TEST()
172 EXPECT_EQ(4, tracker.comparisons()); in TEST()
174 EXPECT_EQ(5, tracker.comparisons()); in TEST()
176 EXPECT_EQ(6, tracker.comparisons()); in TEST()
178 EXPECT_EQ(7, tracker.comparisons()); in TEST()
181 EXPECT_EQ(0, tracker.comparisons()); in TEST()
|
| /third_party/python/Objects/stringlib/ |
| D | stringlib_find_two_way_notes.txt | 33 * If the needle is periodic, don't re-do comparisons; maintain
145 time for the search: consider the forward-progress/comparisons ratio
149 len(needle)//2 positions for at most len(needle) comparisons,
151 bounded below by the constant "1 position per 2 comparisons", so we
219 - Jump forward a period, remembering the existing comparisons
294 forward by one period "defers" some of the comparisons to the next
296 one comparison per step forward. Even if left-half comparisons
298 comparisons, so the average rate is certainly at least 1 move forward
299 per 2 comparisons.
429 character comparisons are equal, and if that exceeds
|
| /third_party/freetype/builds/unix/ |
| D | ax_compare_version.m4 | 13 # comparisons are not compatible with numeric comparisons, this is not
15 # these comparisons easy.
17 # The six basic comparisons are available, as well as checking equality
|
| /third_party/skia/third_party/externals/freetype/builds/unix/ |
| D | ax_compare_version.m4 | 13 # comparisons are not compatible with numeric comparisons, this is not
15 # these comparisons easy.
17 # The six basic comparisons are available, as well as checking equality
|
| /third_party/cups-filters/m4/ |
| D | ax_compare_version.m4 | 13 # comparisons are not compatible with numeric comparisons, this is not
15 # these comparisons easy.
17 # The six basic comparisons are available, as well as checking equality
|
| /third_party/ltp/m4/ |
| D | ax_compare_version.m4 | 13 # comparisons are not compatible with numeric comparisons, this is not
15 # these comparisons easy.
17 # The six basic comparisons are available, as well as checking equality
|
| /third_party/python/Objects/ |
| D | listsort.txt | 5 kinds of partially ordered arrays (less than lg(N!) comparisons needed, and
33 under both methods, samplesort required about 1.5% more comparisons
38 comparisons on average, it can be expected to do better the more
171 However, despite that timsort does many more comparisons on ~sort, and
457 roughly lg(B) comparisons, and, unlike a straight binary search, favors
462 additional comparisons to nail it (see note REGION OF UNCERTAINTY). Then we
465 search finds it in no more than about 2*lg(B) comparisons.
468 ceiling(lg(B+1)) comparisons -- but straight binary search takes that many
469 comparisons no matter where A[0] belongs. Straight binary search thus loses
481 comparisons needed to find one from O(B) to O(log B) is a huge win.
[all …]
|
| /third_party/libabigail/autoconf-archive/ |
| D | ax_compare_version.m4 | 14 # comparisons are not compatible with numeric comparisons, this is not
16 # these comparisons easy.
18 # The six basic comparisons are available, as well as checking equality
|
| /third_party/rust/crates/memchr/bench/runs/ |
| D | README.md | 34 * Limits the benchmark comparisons to those corresponding to either this
37 * Only prints comparisons with a difference of 5% or more.
|
| /third_party/typescript/tests/baselines/reference/ |
| D | typeComparisonCaching.types | 2 // Check that we only cache results of type comparisons that are free of assumptions
|
| D | typeComparisonCaching.errors.txt | 10 // Check that we only cache results of type comparisons that are free of assumptions
|
| D | typeComparisonCaching.symbols | 2 // Check that we only cache results of type comparisons that are free of assumptions
|
| /third_party/mesa3d/docs/relnotes/ |
| D | 21.1.2.rst | 100 - nir/algebraic: Remove some optimizations of comparisons with fsat
101 - nir/algebraic: Invert comparisons less often
|
| /third_party/gstreamer/gstreamer/tests/check/gst/ |
| D | gstvalue.c | 3364 } comparisons[] = { in GST_START_TEST() local
3393 for (i = 0; i < G_N_ELEMENTS (comparisons); i++) { in GST_START_TEST()
3394 GstStructure *s1 = gst_structure_from_string (comparisons[i].str1, NULL); in GST_START_TEST()
3395 GstStructure *s2 = gst_structure_from_string (comparisons[i].str2, NULL); in GST_START_TEST()
3402 GST_PTR_FORMAT " is %d", comparisons[i].op, s1, s2, comparisons[i].ret); in GST_START_TEST()
3409 if (g_strcmp0 (comparisons[i].op, "compare") == 0) { in GST_START_TEST()
3410 fail_unless (gst_value_compare (&v1, &v2) == comparisons[i].ret); in GST_START_TEST()
3411 } else if (g_strcmp0 (comparisons[i].op, "is_subset") == 0) { in GST_START_TEST()
3412 fail_unless (gst_value_is_subset (&v1, &v2) == comparisons[i].ret); in GST_START_TEST()
3414 if (g_strcmp0 (comparisons[i].op, "intersect") == 0) { in GST_START_TEST()
[all …]
|
| /third_party/python/Doc/howto/ |
| D | sorting.rst | 53 comparisons.
240 comparisons and the :meth:`__cmp__` magic method).
243 comparisons. That function should take two arguments to be compared and then
328 * The sort routines are guaranteed to use :meth:`__lt__` when making comparisons
|
| /third_party/vk-gl-cts/doc/testspecs/GLES31/ |
| D | functional.tessellation.txt | 71 comparisons, and thus not all rules are exactly verified (such as
114 comparisons to pre-computed reference images; the gl_PatchVerticesIn and
153 transform feedback, and do appropriate comparisons or other validation.
|
| /third_party/node/doc/guides/ |
| D | cpp-style-guide.md | 24 * [Use explicit pointer comparisons](#use-explicit-pointer-comparisons)
205 ### Use explicit pointer comparisons
207 Use explicit comparisons to `nullptr` when testing pointers, i.e.
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/MSP430/ |
| D | README.txt | 38 10. Handle imm in comparisons in better way (see comment in MSP430InstrInfo.td)
|
| /third_party/python/Doc/library/ |
| D | operator.rst | 25 The functions fall into categories that perform object comparisons, logical
45 Perform "rich comparisons" between *a* and *b*. Specifically, ``lt(a, b)`` is
51 :ref:`comparisons` for more information about rich comparisons.
|
| /third_party/vk-gl-cts/doc/testspecs/GLES3/ |
| D | functional.texture.shadow.txt | 43 exactly 0 or 1. Reference is computed using executing comparisons
|
| /third_party/curl/ |
| D | backport-0003-CVE-2023-23914-CVE-2023-23915.patch | 27 comparisons are made.
|
| /third_party/protobuf/objectivec/Tests/ |
| D | GPBDescriptorTests.m | 326 // Pointer comparisons.
335 // Pointer comparisons.
358 // (pointer comparisons)
|
| /third_party/vk-gl-cts/external/vulkancts/data/vulkan/amber/spirv_assembly/instruction/spirv1p4/opptrnotequal/ |
| D | null_comparisons_ssbo_not_equal.amber | 8 ; The results are based of OpPtrNotEqual comparisons of
|