Home
last modified time | relevance | path

Searched refs:less (Results 1 – 25 of 980) sorted by relevance

12345678910>>...40

/openbsd-src/gnu/usr.bin/perl/lib/
H A Dless.t13 package less::again;
19 is_deeply([less->of], [], 'more please');
20 use less;
21 is_deeply([less->of], ['please'],'less please');
22 is_deeply([less::again->of], ['please'], 'less::again please');
23 no less;
24 is_deeply([less->of],[],'more please');
25 is_deeply([less::again->of], [], 'no less::again please');
26 use less::again;
27 is_deeply([less->of], ['please'],'less please');
[all …]
/openbsd-src/gnu/llvm/libcxx/include/__compare/
H A Dordering.h67 static const partial_ordering less;
128 return __v < 0 ? partial_ordering::greater : (__v > 0 ? partial_ordering::less : __v);
134 inline constexpr partial_ordering partial_ordering::less(_OrdResult::__less);
146 static const weak_ordering less;
153 : (__value_ < 0 ? partial_ordering::less : partial_ordering::greater); in partial_ordering()
212 return __v < 0 ? weak_ordering::greater : (__v > 0 ? weak_ordering::less : __v);
219 inline constexpr weak_ordering weak_ordering::less(_OrdResult::__less);
230 static const strong_ordering less;
239 : (__value_ < 0 ? partial_ordering::less : partial_ordering::greater); in partial_ordering()
245 : (__value_ < 0 ? weak_ordering::less : weak_ordering::greater); in weak_ordering()
[all …]
H A Dweak_order.h48 if (__po == partial_ordering::less) { in __go()
49 return weak_ordering::less; in __go()
63 return __t_is_negative ? weak_ordering::less : weak_ordering::greater; in __go()
65 return __u_is_negative ? weak_ordering::greater : weak_ordering::less; in __go()
H A Dcompare_strong_order_fallback.h44 … _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? strong_ordering::less :
47 … _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? strong_ordering::less :
51 … _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? strong_ordering::less :
H A Dcompare_weak_order_fallback.h44 … _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? weak_ordering::less :
47 … _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? weak_ordering::less :
51 … _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? weak_ordering::less :
H A Dcompare_partial_order_fallback.h44 … _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? partial_ordering::less :
48 … _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? partial_ordering::less :
53 … _VSTD::forward<_Tp>(__t) < _VSTD::forward<_Up>(__u) ? partial_ordering::less :
/openbsd-src/gnu/llvm/libcxx/include/experimental/
H A Dset22 template <class Key, class T, class Compare = less<Key>>
26 template <class Key, class T, class Compare = less<Key>>
50 template <class _Value, class _Compare = less<_Value>>
54 template <class _Value, class _Compare = less<_Value>>
H A Dmap22 template <class Key, class T, class Compare = less<Key>>
26 template <class Key, class T, class Compare = less<Key>>
50 template <class _Key, class _Value, class _Compare = less<_Key>>
54 template <class _Key, class _Value, class _Compare = less<_Key>>
/openbsd-src/usr.bin/less/less/
H A DMakefile5 PROG= less
15 LINKS= ${BINDIR}/less ${BINDIR}/more
17 MAN= less.1 more.1
/openbsd-src/gnu/llvm/libcxx/include/
H A Dalgorithm46 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> // since C++20
50 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> // since C++20
54 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
58 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
103 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
107 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
111 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
117 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
121 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
125 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
[all …]
/openbsd-src/gnu/llvm/libcxx/include/__algorithm/
H A Dranges_min.h40 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
47 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
55 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
H A Dranges_max.h41 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
48 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
58 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
H A Dranges_is_sorted.h35 indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
43 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
H A Dranges_lower_bound.h39 indirect_strict_weak_order<const _Type*, projected<_Iter, _Proj>> _Comp = ranges::less>
46 …ndirect_strict_weak_order<const _Type*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
H A Dranges_max_element.h35 indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less>
43 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
H A Dranges_minmax.h47 indirect_strict_weak_order<projected<const _Type*, _Proj>> _Comp = ranges::less>
56 indirect_strict_weak_order<projected<const _Type*, _Proj>> _Comp = ranges::less>
65 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
H A Dranges_minmax_element.h44 indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less>
52 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
H A Dranges_binary_search.h35 indirect_strict_weak_order<const _Type*, projected<_Iter, _Proj>> _Comp = ranges::less>
43 …ndirect_strict_weak_order<const _Type*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
H A Dranges_upper_bound.h36 indirect_strict_weak_order<const _Type*, projected<_Iter, _Proj>> _Comp = ranges::less>
47 …ndirect_strict_weak_order<const _Type*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
H A Dranges_equal_range.h46 indirect_strict_weak_order<const _Tp*, projected<_Iter, _Proj>> _Comp = ranges::less>
58 … indirect_strict_weak_order<const _Tp*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
H A Dranges_prev_permutation.h45 class _Comp = ranges::less, class _Proj = identity>
55 class _Comp = ranges::less, class _Proj = identity>
H A Dranges_is_heap.h49 indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
56 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
H A Dranges_stable_sort.h53 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla…
60 template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
/openbsd-src/gnu/gcc/gcc/config/sh/
H A Dsh.opt57 Generate SH2a FPU-less code
93 Generate SH4 FPU-less code
97 Generate code for SH4 400 series (MMU/FPU-less)
102 Generate code for SH4 500 series (FPU-less).
135 Generate SH4a FPU-less code
155 Generate 32-bit FPU-less SHmedia code
163 Generate 64-bit FPU-less SHmedia code
171 Generate FPU-less SHcompact code
/openbsd-src/gnu/usr.bin/perl/t/op/
H A Dsmartmatch.t311 ! %fooormore sub { $_[0] =~ /^(foo|or|less)$/ }
313 ! \%fooormore sub { $_[0] =~ /^(foo|or|less)$/ }
315 ! +{%fooormore} sub { $_[0] =~ /^(foo|or|less)$/ }
317 ! @fooormore sub { $_[0] =~ /^(foo|or|less)$/ }
319 ! \@fooormore sub { $_[0] =~ /^(foo|or|less)$/ }
321 ! [@fooormore] sub { $_[0] =~ /^(foo|or|less)$/ }
325 ! "more" sub { $_[0] =~ /^(foo|or|less)$/ }

12345678910>>...40